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

"SLK Parsers" <parsersinc@earthlink.net> wrote:
# >As already mentioned with regards to the Java grammar, I think that a
# >grammar with unrolled implied rules is a maintenance nightmare. How
# >should any new kind of statement be added correctly, if the reason and
# >the criteria for the splitting into open and closed statements is not
# >documented explicitly, but instead is only built into an existing grammar?


# This grammar solution is just an exercise of theoretical
# interest. Yacc and most other tools can handle the ambiguous grammar
# correctly.


Of course. Throw garbage at the parser generator and hope you
get a edible meal out of it.


# the reduce. SLK does this by using the first production of the two
# alternates as the parse table entry.


How would I guess which one is that?


--
SM Ryan http://www.rawbw.com/~wyrmwif/
God's a skeeball fanatic.

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