|[Q] Grammars and LL(1) Parsing firstname.lastname@example.org (2000-10-15)|
|Re: [Q] Grammars and LL(1) Parsing Sid-Ahmed-Ali.TOUATI@inria.fr (Sid Ahmed Ali TOUATI) (2000-10-18)|
|Re: [Q] Grammars and LL(1) Parsing LLkParsing@aol.com (2000-10-19)|
|From:||Sid Ahmed Ali TOUATI <Sid-Ahmed-Ali.TOUATI@inria.fr>|
|Date:||18 Oct 2000 23:54:14 -0400|
Nitzan Shaked wrote:
> detailed in the book. Specifically, LL(1) Grammers, LL(1) Parsing
> Tables and Ambigiouty.
I think that these LL(k) gramars are sufficiently detailed in that book.
Just repace k by 1 ! LL(k) gramars are much more simpler than others
(LR(k) for instance). Parsing can be done by automatas, tables or
recursive calls. Ambiguity can be resolved by extendeding the look ahead
i.e. by incrementing k.
Return to the
Search the comp.compilers archives again.