Re: Precedence based parsing

Rob Thorpe <robert.thorpe@antenova.com>
13 Dec 2003 21:07:00 -0500

          From comp.compilers

Related articles
Precedence based parsing Jeffrey.Kenton@comcast.net (Jeff Kenton) (2003-12-03)
Re: Precedence based parsing torbenm@diku.dk (2003-12-08)
Re: Precedence based parsing jmcenerney@austin.rr.com (John McEnerney) (2003-12-08)
Re: Precedence based parsing haberg@matematik.su.se (2003-12-08)
Re: Precedence based parsing freitag@alancoxonachip.com (Andi Kleen) (2003-12-08)
Re: Precedence based parsing toby@telegraphics.com.au (2003-12-13)
Re: Precedence based parsing robert.thorpe@antenova.com (Rob Thorpe) (2003-12-13)
Re: Precedence based parsing clint@0lsen.net (Clint Olsen) (2003-12-20)
Re: Precedence based parsing sjmeyer@www.tdl.com (Steve Meyer) (2003-12-23)
Re: Precedence based parsing joachim.durchholz@web.de (Joachim Durchholz) (2003-12-27)
Re: Precedence based parsing haberg@matematik.su.se (2003-12-27)
Re: Precedence based parsing derkgwen@HotPOP.com (Derk Gwen) (2004-01-02)
| List of all articles for this month |

From: Rob Thorpe <robert.thorpe@antenova.com>
Newsgroups: comp.compilers
Date: 13 Dec 2003 21:07:00 -0500
Organization: Compilers Central
References: 03-12-035 03-12-056
Keywords: parse
Posted-Date: 13 Dec 2003 21:07:00 EST

> Some reasons operator precedence parsing has disappeared from modern
> textbooks (it went away between the Aho & Ullman and the Aho, Sethi &
> Ullman versions of "The Dragon Book") are:


No, it's mentioned in Aho, Sethi and Ullman. I'm sure thats where I
learnt it.


Also, as I understand it, in the past precedence parsers were used to
deal with the mathematical expressions in larger parsers. Especially
where the larger parser was top-down. This was done to make the
parser faster, but today a top-down parser is normally fast enough
anyway when you can use one.


Post a followup to this message

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