|Convert to LL(1) firstname.lastname@example.org (Andre) (1998-11-06)|
|Re: Convert to LL(1) email@example.com (1998-11-07)|
|Re: Convert to LL(1) firstname.lastname@example.org (Ziemowit Laski) (1998-11-08)|
|Re: Convert to LL(1) email@example.com (Beeblebrox) (1998-11-12)|
|Date:||6 Nov 1998 16:30:26 -0500|
I have a BNF of a grammar for ANSI C, but I think it isn't in the LL(1)
form. So I want to write a program which transforms it to an LL(1)
grammar using it with a recursive-descent parser.
So, my question is, can anybody send me an algorithm for transforming
it. I don't exactly know what to do.
I know only to eliminate recursion, but what about non-immidiatly
A -> B e
B -> A c
Thanks in advance.
Return to the
Search the comp.compilers archives again.