Re: Bottom-up versus Top-down

"Rodney M. Bates" <rod.bates@wichita.boeing.com>
2 Dec 1997 12:07:05 -0500

          From comp.compilers

Related articles
Bottom-up versus Top-down jacko@post8.tele.dk (Jack Olsen) (1997-11-23)
Re: Bottom-up versus Top-down thetick@magelang.com (Scott Stanchfield) (1997-11-24)
Re: Bottom-up versus Top-down gnb@itga.com.au (Gregory Bond) (1997-11-28)
Re: Bottom-up versus Top-down gclind01@spd.louisville.edu (1997-11-29)
Re: Bottom-up versus Top-down mkgardne@cs.uiuc.edu (1997-11-30)
Re: Bottom-up versus Top-down henry@zoo.toronto.edu (Henry Spencer) (1997-11-30)
Re: Bottom-up versus Top-down rod.bates@wichita.boeing.com (Rodney M. Bates) (1997-12-02)
Re: Bottom-up versus Top-down henry@zoo.toronto.edu (Henry Spencer) (1997-12-02)
Re: Bottom-up versus Top-down thetick@magelang.com (Scott Stanchfield) (1997-12-02)
Re: Bottom-up versus Top-down dwight@pentasoft.com (1997-12-02)
Re: Bottom-up versus Top-down neitzel@gaertner.de (1997-12-05)
Re: Bottom-up versus Top-down jmccarty@sun1307.spd.dsccc.com (1997-12-05)
Re: Bottom-up versus Top-down sperber@informatik.uni-tuebingen.de (1997-12-07)
[5 later articles]
| List of all articles for this month |

From: "Rodney M. Bates" <rod.bates@wichita.boeing.com>
Newsgroups: comp.compilers
Date: 2 Dec 1997 12:07:05 -0500
Organization: The Boeing Company
References: 97-11-123 97-11-155 97-11-178
Keywords: parse, LALR

Mark K. Gardner wrote:
> One of the justifications often given is that bottom-up parsers are
> table-driven while top-down parsers are usually implemented as
> recursive-descent parsers. However (and as pointed out in the Dragon
> book), top-down parsers can also be table-driven.


LALR parsers can also be implemented in a recursive-descent-like
fashion. I saw this presented in a paper in the late 80's at one of
the SIGPLAN conferences by, as I recall, Penello and DeRemer. The
LALR Generator produced a set of hard coded, recursive routines each
of which was a little state machine.


Or maybe the stack was explicit and it was one hard coded stack
machine. I believe a good implementation required goto's.


Rodney Bates
--


Post a followup to this message

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