Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED!nerds-end
From: George Neuner <gneuner2@comcast.net>
Newsgroups: comp.compilers
Subject: Re: LR(1) Parsing : Error Handling & Recovery
Date: Sun, 20 Jul 2014 01:19:09 -0400
Organization: A noiseless patient Spider
Lines: 14
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <14-07-041@comp.compilers>
References: <14-07-023@comp.compilers> <14-07-024@comp.compilers> <14-07-030@comp.compilers> <14-07-031@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 8bit
X-Trace: miucha.iecc.com 1405895176 56832 2001:470:1f07:1126:0:676f:7373:6970 (20 Jul 2014 22:26:16 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Sun, 20 Jul 2014 22:26:16 +0000 (UTC)
Keywords: parse, theory
Posted-Date: 20 Jul 2014 18:26:16 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1331

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