Re: detecting ambiguous grammars

"David Pereira" <davidpereira@home.com>
8 Mar 2001 13:15:15 -0500

          From comp.compilers
Related articles
detecting ambiguous grammars thant@acm.org (Thant Tessman) (2001-02-15)
Re: detecting ambiguous grammars davidpereira@home.com (David Pereira) (2001-02-17)
Re: detecting ambiguous grammars cfc@world.std.com (Chris F Clark) (2001-02-23)
Re: detecting ambiguous grammars joachim_d@gmx.de (Joachim Durchholz) (2001-03-01)
Re: detecting ambiguous grammars henry@spsystems.net (2001-03-04)
Re: detecting ambiguous grammars thant@acm.org (Thant Tessman) (2001-03-04)
Re: detecting ambiguous grammars davidpereira@home.com (David Pereira) (2001-03-08)
Re: detecting ambiguous grammars dlester@cs.man.ac.uk (2001-03-10)
Re: detecting ambiguous grammars thant@acm.org (Thant Tessman) (2001-03-12)
Re: detecting ambiguous grammars christian.bau@isltd.insignia.com (2001-03-22)
Re: detecting ambiguous grammars thant@acm.org (Thant Tessman) (2001-03-26)
Re: detecting ambiguous grammars joachim_d@gmx.de (Joachim Durchholz) (2001-03-26)
Re: detecting ambiguous grammars cfc@world.std.com (Chris F Clark) (2001-03-27)
[9 later articles]
| List of all articles for this month |
From: "David Pereira" <davidpereira@home.com>
Newsgroups: comp.compilers
Date: 8 Mar 2001 13:15:15 -0500
Organization: Excite@Home - The Leader in Broadband http://home.com/faster
References: 01-02-080 01-03-020
Keywords: parse, theory
Posted-Date: 08 Mar 2001 13:15:15 EST



> 2) "undecidable" means: you can write an algorithm that checks whether a
> given grammar is ambiguous. However, this algorithm may take an
> arbitrarily long time to terminate, and for some grammars it will never
> reach a conclusion and continue to run forever.


        However, by definition, if an "algorithm" runs forever, it is not
an algorithm.

Post a followup to this message

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