Re: detecting ambiguous grammars

"Joachim Durchholz" <joachim_d@gmx.de>
4 Apr 2001 00:17:42 -0400

          From comp.compilers
Related articles
[13 earlier articles]
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)
| List of all articles for this month |
From: "Joachim Durchholz" <joachim_d@gmx.de>
Newsgroups: comp.compilers
Date: 4 Apr 2001 00:17:42 -0400
Organization: Compilers Central
References: 01-03-126 01-03-185
Keywords: parse
Posted-Date: 04 Apr 2001 00:17:42 EDT

VBDis <vbdis@aol.com> wrote:
> "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?


Most Eiffel compilers use an Earley parser, which will detect
ambiguities automatically. The Earleys in these compilers are set up
to report an error instead of returning all parse trees, that's the
only difference to the standard algorithm.


Regards,
Joachim

Post a followup to this message

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