Related articles |
---|
how to deal with left recursive? vincent.feng@yahoo.com (vincent Feng) (2009-11-05) |
RE:how to deal with left recursive? Jatin_Bhateja@mentor.com (Bhateja, Jatin) (2009-11-09) |
From: | "Bhateja, Jatin" <Jatin_Bhateja@mentor.com> |
Newsgroups: | comp.compilers |
Date: | Mon, 9 Nov 2009 14:22:33 +0530 |
Organization: | Compilers Central |
References: | 09-11-018 |
Keywords: | LL(1) |
Posted-Date: | 11 Nov 2009 01:00:16 EST |
LL(K) parsers generators like ANTLR and TXL are the once which strictly
needs grammar to be non-left recursive and left factored (this is less
stringent as if look ahead is more)
However ANTLR3 provide some support for automatic left recursion removal
http://www.antlr.org/wiki/display/ANTLR3/Left-Recursion+Removal
Thanks and Regards
Jatin Bhateja
Return to the
comp.compilers page.
Search the
comp.compilers archives again.