|top-down and bottom-up email@example.com (Rob) (2003-04-13)|
|Re: top-down and bottom-up firstname.lastname@example.org (Joachim Durchholz) (2003-04-15)|
|Re: top-down and bottom-up email@example.com (2003-04-20)|
|Re: top-down and bottom-up JeffKenton@attbi.com (Jeff Kenton) (2003-04-20)|
|Re: top-down and bottom-up firstname.lastname@example.org (2003-05-06)|
|From:||Jeff Kenton <JeffKenton@attbi.com>|
|Date:||20 Apr 2003 17:52:07 -0400|
|Posted-Date:||20 Apr 2003 17:52:06 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 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 Kenton Consulting and software development =
= http://home.attbi.com/~jeffkenton =
Return to the
Search the comp.compilers archives again.