Is a contextfree Grammar ambiguous ?

Martin Meyer <mmeyer@rhso.de>
30 Oct 1998 13:37:55 -0500

          From comp.compilers
Related articles
Is a contextfree Grammar ambiguous ? mmeyer@rhso.de (Martin Meyer) (1998-10-30)
Re: Is a contextfree Grammar ambiguous ? clark@quarry.zk3.dec.com (Chris Clark USG) (1998-11-06)
Re: Is a contextfree Grammar ambiguous ? mickunas@cs.uiuc.edu (1998-11-07)
Re: Is a contextfree Grammar ambiguous ? mickunas@cs.uiuc.edu (1998-11-07)
Re: Is a contextfree Grammar ambiguous ? aycock@csc.uvic.ca (1998-11-07)
Re: Is a contextfree Grammar ambiguous ? dmr@plan9.bell-labs.com (1998-11-07)
Re: Is a contextfree Grammar ambiguous ? cfc@world.std.com (Chris F Clark) (1998-11-07)
[2 later articles]
| List of all articles for this month |
From: Martin Meyer <mmeyer@rhso.de>
Newsgroups: comp.compilers
Date: 30 Oct 1998 13:37:55 -0500
Organization: Rechenzentrum der Hessischen Sparkassenorganisation GmbH
Keywords: parse, theory, question

Hi all !


Does an algorithm to decide whether a context free grammar is
ambiguous exist ? If yes, can it state which productions lead the
grammar to be ambiguous ? If not, what is in case of epsilon-free
grammars or/and in case of operator-grammars (grammars which don't
have a non-terminal directly following another non-terminal on the
right hand side of a production [= each two non-terminals of a
productions right hand side are intersected by at least one terminal
symbol]) ?


Thanks,
Martin.

Post a followup to this message

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