|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)|
|Date:||13 Apr 2003 12:41:24 -0400|
|Posted-Date:||13 Apr 2003 12:41: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.
Furthermore, if I was using a top-down parser generator (LLgen for
example) and I was writing a rule set for a grammar that had a rule
expression -> term rest_expression
Where would I construct the expression node? If I understand correctly
the expression node would be constructed in the expression rule, after
that the term node would be constructed in the term rule and after
that the rest_expression node would be constructed.
If this is the case, what to do when it's only possible due to the
tree/node construction functions to construct a node AFTER the child nodes
are constructed. For example, with a function like this:
Thanks in advance,
Robert-Jan de Pauw
Return to the
Search the comp.compilers archives again.