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

Hans-Peter Diettrich <DrDiettrich1@aol.com> writes:


>> Point 2 is incorrectly stated, at the least. You seem to have meant
>> not that the languages are ambiguous, but rather than particular
>> grammars that are commonly used for those languages are ambiguous.
>
> As already stated in a parallel answer, a language can allow for
> multiple different parse trees of the same (valid) input, what has been
> considered as "ambigous" by several contributors. Can you suggest a
> better wording?


A language in the technical sense is just a set of strings. There is
no notion of a parse tree until you provide a grammar. However, a
language can be "ambiguous" in the sense that there are no
non-ambiguous grammars for it (while there are ambiguous ones). Such
languages are called "inherently ambiguous".


Matthias

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