Re: Efficient construction of LALR Parsing Tables

> " 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)

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