Re: Fischer and Leblanc software, was LL1 grammar conversion Algorithms

schmidtg@beast.cle.ab.com
22 Feb 1997 23:04:53 -0500

          From comp.compilers

Related articles
LL1 grammar conversion Algorithms gholness@bu.edu (1997-02-11)
Re: Fischer and Leblanc software, was LL1 grammar conversion Algorithm schmidtg@beast.cle.ab.com (1997-02-22)
| List of all articles for this month |

From: schmidtg@beast.cle.ab.com
Newsgroups: comp.compilers
Date: 22 Feb 1997 23:04:53 -0500
Organization: Allen-Bradley Company, Inc.
References: 97-02-075
Keywords: books, WWW

gholness@bu.edu writes:
> 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 <fischer@cs.wisc.edu>
Subject: Availability of code for Crafting a Compiler


We have moved distribution from an ftp site to a web site.
It's all at
http://www.cs.wisc.edu/~fischer/ftp/tools/
--


Post a followup to this message

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