Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!news.misty.com!news.iecc.com!.POSTED!nerds-end
From: wclodius@earthlink.net (William Clodius)
Newsgroups: comp.compilers
Subject: Re: LR(1) Parsing : Error Handling & Recovery
Date: Fri, 18 Jul 2014 13:41:53 -0600
Organization: Compilers Central
Lines: 15
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <14-07-031@comp.compilers>
References: <14-07-023@comp.compilers> <14-07-024@comp.compilers> <14-07-030@comp.compilers>
NNTP-Posting-Host: news.iecc.com
X-Trace: miucha.iecc.com 1405713831 90339 2001:470:1f07:1126:0:676f:7373:6970 (18 Jul 2014 20:03:51 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Fri, 18 Jul 2014 20:03:51 +0000 (UTC)
Keywords: parse, LR(1)
Posted-Date: 18 Jul 2014 16:03:51 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:1321

George Neuner <gneuner2@comcast.net> wrote:

> On Wed, 16 Jul 2014 16:39:09 -0400 (EDT), Ivan Godard
> <ivan@ootbcomp.com> wrote:
> <snip>
> In theory, any LL(k) language can be refactored to be LL(1), but
> refactoring a "greater than small k" language is usually impractical
> due to explosive growth of the resulting LL(1) grammar.
>
> George

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