|top-down and bottom-up firstname.lastname@example.org (Rob) (2003-04-13)|
|Re: top-down and bottom-up email@example.com (Joachim Durchholz) (2003-04-15)|
|Re: top-down and bottom-up firstname.lastname@example.org (2003-04-20)|
|Re: top-down and bottom-up JeffKenton@attbi.com (Jeff Kenton) (2003-04-20)|
|Re: top-down and bottom-up email@example.com (2003-05-06)|
|From:||Joachim Durchholz <firstname.lastname@example.org>|
|Date:||15 Apr 2003 00:15:25 -0400|
|Posted-Date:||15 Apr 2003 00:15:24 EDT|
> 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).
Currently looking for a new job.
Return to the
Search the comp.compilers archives again.