|Grammar with precedence rules firstname.lastname@example.org (2002-03-09)|
|Re: Grammar with precedence rules email@example.com (Joachim Durchholz) (2002-03-11)|
|Re: Grammar with precedence rules firstname.lastname@example.org (2002-03-17)|
|Re: Grammar with precedence rules email@example.com (Dennis Mickunas) (2002-03-17)|
|Re: Grammar with precedence rules firstname.lastname@example.org (Joachim Durchholz) (2002-03-19)|
|Re: Grammar with precedence rules email@example.com (2002-03-21)|
|Re: Grammar with precedence rules firstname.lastname@example.org (Michael Dyck) (2002-03-31)|
|From:||"Dennis Mickunas" <email@example.com>|
|Date:||17 Mar 2002 22:37:24 -0500|
|Organization:||University of Illinois at Urbana-Champaign|
|Posted-Date:||17 Mar 2002 22:37:24 EST|
"Hans Aberg" <firstname.lastname@example.org> wrote in message
> One problem with the descriptions of grammars plus precedence rules
> (as used like in say Bison) is that they are algorithm specific (i.e.,
> one uses the precedences to resolve shift/reduce conflicts).
> When dealing with different parsing algorithms, one would like to have
> a language specified by a pair (G, P), where G is a traditional
> grammar, and P is a suitably defined set of precedence rules. Then
> from that, one should be able to define the language L(G, P), without
> any dependency on a specific parsing algorithm.
> Has this been done (if so, ref's, please)?
> Hans Aberg * Email: Hans Aberg <email@example.com>
> * Home Page: <http://www.matematik.su.se/~haberg/>
> * AMS member listing: <http://www.ams.org/cml/>
Here are some starters on generalized precedence parsing:
Colmerauer, A., "Total Precedence Relations," JACM 17 (1970).
Graham, S., "Precedence Languages and Bounded Right Context Languages,"
PhD Dissertation, Stanford (1971).
Harrison, M. and J. Gray, "Canonical Precedence Schemes,'' JACM 20
Return to the
Search the comp.compilers archives again.