Re: [Q] Grammars and LL(1) Parsing

Sid Ahmed Ali TOUATI <Sid-Ahmed-Ali.TOUATI@inria.fr>
18 Oct 2000 23:54:14 -0400

          From comp.compilers
Related articles
[Q] Grammars and LL(1) Parsing calius@netvision.net.il (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)
| List of all articles for this month |
From: Sid Ahmed Ali TOUATI <Sid-Ahmed-Ali.TOUATI@inria.fr>
Newsgroups: comp.compilers
Date: 18 Oct 2000 23:54:14 -0400
Organization: INRIA
References: 00-10-107
Keywords: parse, LL(1)

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.


SAAT

Post a followup to this message

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