|LL1 grammar conversion Algorithms email@example.com (1997-02-11)|
|Re: Fischer and Leblanc software, was LL1 grammar conversion Algorithm firstname.lastname@example.org (1997-02-22)|
|Date:||22 Feb 1997 23:04:53 -0500|
|Organization:||Allen-Bradley Company, Inc.|
> Does anyone know of any implementation of an algorithm which will
> convert an LALR grammar to LL1.
> Particularly elimination of common prefix and left recursion ( as in
> Fischer and LeBlanc's "Crafting a Compiler in C )
[Our moderator added]
> [It's not possible in general, since many LALR grammars are not LL, of
> course, but it's certainly possible in many cases. See article 92-02-060
> to get a copy of their code. -John]
I could no longer access the site mentioned in the above article so I asked
Charles Fischer and received the following reply:
Date: Thu, 20 Feb 1997 15:02:45 -0600 (CST)
From: Charles Fischer <email@example.com>
Subject: Availability of code for Crafting a Compiler
We have moved distribution from an ftp site to a web site.
It's all at
Return to the
Search the comp.compilers archives again.