|LL1 grammar conversion Algorithms firstname.lastname@example.org (1997-02-11)|
|Re: LL1 grammar conversion Algorithms email@example.com (John Lilley) (1997-02-16)|
|Re: LL1 grammar conversion Algorithms firstname.lastname@example.org (Scott Stanchfield) (1997-02-16)|
|Re: Fischer and Leblanc software, was LL1 grammar conversion Algorithm email@example.com (1997-02-22)|
|Date:||11 Feb 1997 22:28:22 -0500|
|Keywords:||parse, LR(1), LL(1)|
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 )
[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]
Return to the
Search the comp.compilers archives again.