LL(1) and Ambiguity

manasfi@cs.concordia.ca (MANASFI hassan)
28 Jun 1998 21:34:25 -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: manasfi@cs.concordia.ca (MANASFI hassan)
Newsgroups: comp.compilers
Date: 28 Jun 1998 21:34:25 -0400
Organization: Dept. of Computer Science, Concordia University
Keywords: parse, LL(1)

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?


Thanks,
Hassan <manasfi@cs.concordia.ca>
[You can certainly test if it's LL(1). That might do the trick. -John]




--

Post a followup to this message

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