Re: top-down and bottom-up

Jeff Kenton <JeffKenton@attbi.com>
20 Apr 2003 17:52:07 -0400

          From comp.compilers
Related articles
top-down and bottom-up rjdepauw@xs4all.nl (Rob) (2003-04-13)
Re: top-down and bottom-up joachim_d@gmx.de (Joachim Durchholz) (2003-04-15)
Re: top-down and bottom-up haberg@matematik.su.se (2003-04-20)
Re: top-down and bottom-up JeffKenton@attbi.com (Jeff Kenton) (2003-04-20)
Re: top-down and bottom-up thp@cs.ucr.edu (2003-05-06)
| List of all articles for this month |
From: Jeff Kenton <JeffKenton@attbi.com>
Newsgroups: comp.compilers
Date: 20 Apr 2003 17:52:07 -0400
Organization: AT&T Broadband
References: 03-04-039
Keywords: parse
Posted-Date: 20 Apr 2003 17:52:06 EDT

Rob wrote:
> I would like to know if a parse tree created by a top-down parser
> differs from a parse tree created by a bottom-up parser given that the
> grammar is the same.


The parse trees should be "equivalent", by definition, but not
necessarily identical. Even two different top-down parsers can
produce different (equivalent) trees for simple expressions.


jeff


--
= Jeff Kenton Consulting and software development =
= http://home.attbi.com/~jeffkenton =

Post a followup to this message

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