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) |
From: | Clint Olsen <clint@0lsen.net> |
Newsgroups: | comp.compilers |
Date: | 20 Dec 2003 11:49:33 -0500 |
Organization: | Comcast Online |
References: | 03-12-035 03-12-056 03-12-097 |
Keywords: | parse, comment |
Posted-Date: | 20 Dec 2003 11:49:33 EST |
On 2003-12-14, Rob Thorpe <robert.thorpe@antenova.com> wrote:
> 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.
Perhaps I'm missing something obvious, but you can do efficient
precedence-based top-down parsing, so I don't quite know what's so
great about this method. Using a precedence table, you can decide
whether or not a recursive call is necessary to parse a higher
precedence operator. Hanson and Fraser cover this in their book, "A
Retargetable C Compiler : Design and Implementation."
-Clint
[It probably made more difference when the whole compiler had to fit
into 24K bytes. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.