|ambiguity firstname.lastname@example.org (Stefan Kauer) (1997-05-22)|
|Re: ambiguity email@example.com (1997-05-25)|
|From:||Stefan Kauer <firstname.lastname@example.org>|
|Date:||22 May 1997 22:41:09 -0400|
|Keywords:||parse, theory, question|
I have a rather theoretical question, for which I found no answer in
several standard books on compiler writing.
I have a context free, unambigious grammar, which contains left
recursion. When the left recursion is removed (by any well known
standard algorithm), is always the case, that the new grammar is also
If not, I'd like to see an example. If yes, I'd like to see the proof
(or a reference to a book or paper).
Return to the
Search the comp.compilers archives again.