Related articles |
---|
grammars prerna_sethi@lycos.com (2003-08-04) |
Re: grammars Ralf.Laemmel@cwi.nl (Ralf Laemmel) (2003-08-10) |
Re: grammars cdc25@it.canterbury.ac.nz (Carl Cerecke) (2003-08-10) |
Re: grammars rda@lemma-one.com (Rob Arthan) (2003-08-10) |
Re: [Compilers] grammars Ralf.Laemmel@cwi.nl (Ralf Laemmel) (2003-08-10) |
From: | prerna_sethi@lycos.com (Buddy) |
Newsgroups: | comp.compilers |
Date: | 4 Aug 2003 00:12:45 -0400 |
Organization: | http://groups.google.com/ |
Keywords: | parse, question |
Posted-Date: | 04 Aug 2003 00:12:45 EDT |
Can all ambiguous grammars be changed into unambiguous grammars?
[Well, sure, you can delete stuff until it's not ambiguous any more.
But I presume the question you're asking is whether there's always an
unambiguous grammar that recognizes the same language as an ambigous
one. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.