Re: LR(1) Parsing : Error Handling & Recovery

George Neuner <gneuner2@comcast.net>
Sun, 20 Jul 2014 01:19:09 -0400

          From comp.compilers
Related articles
[8 earlier articles]
Re: LR(1) Parsing : Error Handling & Recovery wclodius@earthlink.net (2014-07-18)
Re: LR(1) Parsing : Error Handling & Recovery monnier@iro.umontreal.ca (Stefan Monnier) (2014-07-18)
Re: LR(1) Parsing : Error Handling & Recovery DrDiettrich1@aol.com (Hans-Peter Diettrich) (2014-07-19)
Re: LR(1) Parsing : Error Handling & Recovery haberg-news@telia.com (Hans Aberg) (2014-07-19)
Re: LR(1) Parsing : Error Handling & Recovery drikosev@otenet.gr (Evangelos Drikos) (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery haberg-news@telia.com (Hans Aberg) (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery gneuner2@comcast.net (George Neuner) (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery arnold@skeeve.com (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery monnier@iro.umontreal.ca (Stefan Monnier) (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery wclodius@earthlink.net (2014-07-20)
Re: LR(1) Parsing : Error Handling & Recovery cdodd@acm.org (Chris Dodd) (2014-07-21)
Re: LR(1) Parsing : Error Handling & Recovery DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2014-07-21)
Re: LR(1) Parsing : Error Handling & Recovery drikosev@otenet.gr (Evangelos Drikos) (2014-07-21)
[10 later articles]
| List of all articles for this month |
From: George Neuner <gneuner2@comcast.net>
Newsgroups: comp.compilers
Date: Sun, 20 Jul 2014 01:19:09 -0400
Organization: A noiseless patient Spider
References: 14-07-023 14-07-024 14-07-030 14-07-031
Keywords: parse, theory
Posted-Date: 20 Jul 2014 18:26:16 EDT

On Fri, 18 Jul 2014 13:41:53 -0600, wclodius@earthlink.net (William
Clodius) wrote:


>I have memories that an LR(k) grammar can in principle be refactored
>to LR(1), but that in general an LL(k) grammar cannot be refactored to
>LL(1).


LL(k) always can be refactored to single token lookahead, but it
causes an explosion of grammar states. E.g., given a single LL(3)
rule, an equivalent set of LL(1) rules must match every valid
combination of tokens at +1, +2 and +3.


George


Post a followup to this message

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