Re: Grammar with precedence rules

Michael Dyck <michaeldyck@shaw.ca>
31 Mar 2002 23:33:56 -0500

          From comp.compilers
Related articles
Grammar with precedence rules haberg@matematik.su.se (2002-03-09)
Re: Grammar with precedence rules joachim_d@gmx.de (Joachim Durchholz) (2002-03-11)
Re: Grammar with precedence rules haberg@matematik.su.se (2002-03-17)
Re: Grammar with precedence rules mickunas@cs.uiuc.edu (Dennis Mickunas) (2002-03-17)
Re: Grammar with precedence rules joachim_d@gmx.de (Joachim Durchholz) (2002-03-19)
Re: Grammar with precedence rules haberg@matematik.su.se (2002-03-21)
Re: Grammar with precedence rules michaeldyck@shaw.ca (Michael Dyck) (2002-03-31)
| List of all articles for this month |
From: Michael Dyck <michaeldyck@shaw.ca>
Newsgroups: comp.compilers
Date: 31 Mar 2002 23:33:56 -0500
Organization: intermittent
References: 02-03-043 02-03-068 02-03-077 02-03-110 02-03-136
Keywords: syntax
Posted-Date: 31 Mar 2002 23:33:56 EST

Hans Aberg wrote:
>
> To a grammar/precedence pair (G, P), find a definition language
> L(G, P). (Thus, independent of parsing algorithms.)


Eelco Visser does something like this in his paper "Scannerless
Generalized-LR Parsing" (section 4.1 "Disambiguation by Priorities"). He
also has references to similar work (section 10 "Other Work", second-last
paragraph).


http://www.cs.uu.nl/~visser/publications/
http://citeseer.nj.nec.com/visser97scannerles.html


-Michael Dyck

Post a followup to this message

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