Related articles |
---|
[4 earlier articles] |
Re: if then else shift/reduce Syndrome theo@engr.mun.ca (1996-02-16) |
Re: if then else shift/reduce Syndrome meissner@cygnus.com (Michael Meissner) (1996-02-16) |
Re: if then else shift/reduce Syndrome solution@gate.net (1996-02-16) |
Re: if then else shift/reduce Syndrome tarnwb@holly.colostate.edu (Tarn Burton) (1996-02-16) |
Re: if then else shift/reduce Syndrome meissner@cygnus.com (Michael Meissner) (1996-02-21) |
Re: if then else shift/reduce Syndrome henry@zoo.toronto.edu (Henry Spencer) (1996-02-27) |
Re: if then else shift/reduce Syndrome neitzel@gaertner.de (1996-03-01) |
Re: if then else shift/reduce Syndrome bakul@netcom.com (1996-03-03) |
From: | neitzel@gaertner.de (Martin Neitzel) |
Newsgroups: | comp.compilers |
Date: | 1 Mar 1996 13:50:53 -0500 |
Organization: | Gaertner Datensysteme, Braunschweig, Germany |
References: | 96-02-139 96-02-243 96-02-309 |
Keywords: | yacc, parse |
> This trick has actually been around as folklore for some time. I
> don't recall ever seeing it published, ...
If I understand Herny Spencer right, the point is flatten the
precedence levels in the grammar and to handle them "out-of-band". At
any rate, Fraser&Hanson have a good description about handling
precedences with a precedence table in lcc, which is generally
recursive descendent (lcc, not the description :-) in their book "A
retargetable C compiler" which is beautiful (the compiler, the book,
and the description :-).
Martin Neitzel
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.