Re: Why LL(1) Parsers do not support left recursion?

Max Hailperin <max@gustavus.edu> writes:


> You seem to be conceding too much here. The essential difference is
> in the parsers, not just the parser generators. Recall (as I
> explained in http://compilers.iecc.com/comparch/article/06-04-136 )
> that an LR parser is a shift/reduce parser whereas an LL parser is a
> confirm/expand parser.
...


Point well-taken and well-made. Moreover, anyone who wants to
understand LL and LR parsing would be well advised to read Max's
article that he has kindly pointed us to. To my mind, it was a clear
and lucid explanation of the principles behind how the parsing
algorithms work that can help one have an informed intuition.


<In fact, John, if it isn't referenced in the FAQ, I would recomend
adding a pointer to it in the FAQ.>


-Chris


*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
23 Bailey Rd voice : (508) 435-5016
Berlin, MA 01503 USA fax : (978) 838-0263 (24 hours)
------------------------------------------------------------------------------

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