Re: LL(1) and Ambiguity

"Matt Timmermans" <mtimmerm@microstar.no-spam.com>
1 Jul 1998 22:52:21 -0400

          From comp.compilers
Related articles
LL(1) and Ambiguity manasfi@cs.concordia.ca (1998-06-28)
Re: LL(1) and Ambiguity mtimmerm@microstar.no-spam.com (Matt Timmermans) (1998-07-01)
| List of all articles for this month |
From: "Matt Timmermans" <mtimmerm@microstar.no-spam.com>
Newsgroups: comp.compilers
Date: 1 Jul 1998 22:52:21 -0400
Organization: IGS - Information Gateway Services
References: 98-06-167
Keywords: parse, theory

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.
--

Post a followup to this message

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