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) |
From: | Ralf Laemmel <Ralf.Laemmel@cwi.nl> |
Newsgroups: | comp.compilers |
Date: | 10 Aug 2003 10:49:55 -0400 |
Organization: | Compilers Central |
References: | 03-08-016 |
Keywords: | parse |
Posted-Date: | 10 Aug 2003 10:49:54 EDT |
Buddy wrote:
>
> 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]
Yet another answer to this is: Don't.
Say, maybe you don't want to get an nonambiguous grammar because the
problems are of a nature that you better use semantic predicates or
other means to disambiguate at a level above purely context-free
expressiveness.
Ralf
Return to the
comp.compilers page.
Search the
comp.compilers archives again.