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) |
From: | Joachim Durchholz <joachim_d@gmx.de> |
Newsgroups: | comp.compilers |
Date: | 15 Apr 2003 00:15:25 -0400 |
Organization: | Compilers Central |
References: | 03-04-039 |
Keywords: | parse |
Posted-Date: | 15 Apr 2003 00:15:24 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 tree is the same if the grammar is the same. In practice,
this means that you will indeed get different parse trees: in most
cases, the language grammar must be adapted to be useful for a given
parser generator, so every parser uses a different grammar (hopefully
denoting the same language).
HTH
Joachim
--
Currently looking for a new job.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.