Re: Grammar with precedence rules

"Hans Aberg" <haberg@matematik.su.se> 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 <haberg@member.ams.org>
> * 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
(1973).

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