|LL(1) and Ambiguity email@example.com (1998-06-28)|
|Re: LL(1) and Ambiguity firstname.lastname@example.org (Matt Timmermans) (1998-07-01)|
|From:||"Matt Timmermans" <email@example.com>|
|Date:||1 Jul 1998 22:52:21 -0400|
|Organization:||IGS - Information Gateway Services|
MANASFI hassan wrote in message 98-06-167...
>An ambiguous grammar can not be LL(1). Having a grammar that we
>suspect to be LL(1) is there an algorithm to decide whether ambiguous
>or not? or is ambiguity an undecidable problem?
>[You can certainly test if it's LL(1). That might do the trick. -John]
As the moderator noted, LL(1) ambiguity is easy to test for. Ambiguity in
general is undecidable.
Return to the
Search the comp.compilers archives again.