Re: Efficient construction of LALR Parsing Tables

"Yasmina" <yasmina.andreu@gmail.com>
19 Aug 2006 01:32:30 -0400

          From comp.compilers

Related articles
Efficient construction of LALR Parsing Tables yasmina.andreu@gmail.com (Yasmina) (2006-08-14)
Re: Efficient construction of LALR Parsing Tables boldyrev+nospam@cgitftp.uiggm.nsc.ru (Ivan Boldyrev) (2006-08-15)
Re: Efficient construction of LALR Parsing Tables yasmina.andreu@gmail.com (Yasmina) (2006-08-19)
| List of all articles for this month |

From: "Yasmina" <yasmina.andreu@gmail.com>
Newsgroups: comp.compilers
Date: 19 Aug 2006 01:32:30 -0400
Organization: Compilers Central
References: 06-08-074
Keywords: LALR
Posted-Date: 19 Aug 2006 01:32:30 EDT

> " Reduction by A -> e is called for on input a if and only if there is
> a kernel item [B -> g Cd, b] such that C => An for some n, and a is
> in FIRST(ndb). The set of nonterminals A such that C => An can be
> precomputed for each nonterminal C."
>
> "We shift on input a if there is a kernel item [B -> g Cd, b] where
> C => ax in a derivation in which the last step does not use an
> e-production. The set of such a's can also be precomputed for each C"
>
> (Note. "e" means the empty string and "=>" means a rightmost derives in
> zero or more steps,)


Is the set of nonterminals A such that C => An equal if '=>' means a
rightmost derives in zero or more steps or if '=>' means a leftmost
derives in zero or more steps??


(sorry, my english is very bad)


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.