Re: Parsing Expression Grammar

"Oliver Wong" <owong@castortech.com>
3 Sep 2005 15:23:51 -0400

          From comp.compilers

Related articles
Parsing Expression Grammar skjaero@gmail.com (2005-08-31)
Re: Parsing Expression Grammar lfinsto1@gwdg.de (Laurence Finston) (2005-09-02)
Re: Parsing Expression Grammar rsc@swtch.com (Russ Cox) (2005-09-02)
Re: Parsing Expression Grammar cfc@shell01.TheWorld.com (Chris F Clark) (2005-09-02)
Re: Parsing Expression Grammar pohjalai@cc.helsinki.fi (A Pietu Pohjalainen) (2005-09-02)
Re: Parsing Expression Grammar owong@castortech.com (Oliver Wong) (2005-09-03)
Re: Parsing Expression Grammar pohjalai@cc.helsinki.fi (A Pietu Pohjalainen) (2005-09-07)
Re: Parsing Expression Grammar paul@highpersoft.com (Paul Mann) (2005-09-07)
Re: Parsing Expression Grammar wclodius@lanl.gov (2005-09-10)
Re: Parsing Expression Grammar cfc@shell01.TheWorld.com (Chris F Clark) (2005-09-10)
Re: Parsing Expression Grammar gneuner2@comcast.net (George Neuner) (2005-09-10)
Re: Parsing Expression Grammar DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2005-09-10)
[22 later articles]
| List of all articles for this month |

From: "Oliver Wong" <owong@castortech.com>
Newsgroups: comp.compilers
Date: 3 Sep 2005 15:23:51 -0400
Organization: GlobeTrotter
References: 05-08-115 05-09-013
Keywords: parse
Posted-Date: 03 Sep 2005 15:23:51 EDT

"A Pietu Pohjalainen" <pohjalai@cc.helsinki.fi> wrote in message
> Uhm, using context free languages, it is always possible to write
> ambiguous grammars, and actually there are context free languages that
> are inherently ambiguous. So, you either have to deal with the
> ambiguousity in the CFG's (e.g. precedence, associativity), or not use
> context free languages.


        Sorry, I only know a bit about theory of computation, but I
thought ambiguity was a property of grammars, and not of
languages. Since a language is just a set of strings, how can a
language itself be ambiguous? I understand that perhaps there exists a
language which cannot be expressed by an unambiguous context free
grammar, but might there not exist another way (i.e. not using CFGs)
to express the language which is unambiguous?


        - Oliver


Post a followup to this message

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