Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [12 earlier articles] |
| Re: detecting ambiguous grammars cfc@world.std.com (Chris F Clark) (2001-03-27) |
| Re: detecting ambiguous grammars genew@shuswap.net (2001-03-27) |
| Re: detecting ambiguous grammars genew@shuswap.net (2001-03-27) |
| Re: detecting ambiguous grammars thant@acm.org (Thant Tessman) (2001-03-31) |
| Re: detecting ambiguous grammars cfc@world.std.com (Chris F Clark) (2001-03-31) |
| Re: detecting ambiguous grammars kenarose@earthlink.net (Ken Rose) (2001-03-31) |
| Re: detecting ambiguous grammars vbdis@aol.com (2001-03-31) |
| Re: detecting ambiguous grammars joachim_d@gmx.de (Joachim Durchholz) (2001-04-04) |
| Re: detecting ambiguous grammars world!bobduff@uunet.uu.net (Robert A Duff) (2001-04-10) |
| Re: detecting ambiguous grammars ki3084lx@ecs.cmc.osaka-u.ac.jp (Le Harusada) (2005-12-15) |
| From: | vbdis@aol.com (VBDis) |
| Newsgroups: | comp.compilers |
| Date: | 31 Mar 2001 02:52:36 -0500 |
| Organization: | AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com |
| References: | 01-03-126 |
| Keywords: | parse |
| Posted-Date: | 31 Mar 2001 02:52:36 EST |
"Joachim Durchholz" <joachim_d@gmx.de> schreibt:
>I'm using a language with an ambiguous grammar, Eiffel. The rule is
>simple: The language is defined by the grammar, minus those constructs
>that are ambiguous.
And how are those ambiguous constructs detected?
Usually a "default assumption" is used, which follows one of the
possible rules, and only when that rule fails, an error is
reported. Everything else IMO would mean that the parser knows, which
constructs /are/ ambiguous, what in turn would mean that the parser
was built from a final (unambiguous) grammar?
DoDi
Return to the
comp.compilers page.
Search the
comp.compilers archives again.