LL1 grammar conversion Algorithms

gholness@bu.edu
11 Feb 1997 22:28:22 -0500

          From comp.compilers
Related articles
LL1 grammar conversion Algorithms gholness@bu.edu (1997-02-11)
Re: LL1 grammar conversion Algorithms jlilley@empathy.com (John Lilley) (1997-02-16)
Re: LL1 grammar conversion Algorithms thetick@scruz.net (Scott Stanchfield) (1997-02-16)
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: gholness@bu.edu
Newsgroups: comp.compilers
Date: 11 Feb 1997 22:28:22 -0500
Organization: Boston University
Keywords: parse, LR(1), LL(1)

Hello,


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 )


Thanks,
G
[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]


--

Post a followup to this message

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