|request for simple example: parse tree generation firstname.lastname@example.org (1996-10-03)|
|Re: request for simple example: parse tree generation email@example.com (1996-10-06)|
|Re: request for simple example: parse tree generation firstname.lastname@example.org (1996-10-10)|
|Re: request for simple example: parse tree generation email@example.com (1996-10-10)|
|From:||firstname.lastname@example.org (kendra cooper)|
|Date:||3 Oct 1996 22:58:02 -0400|
|Organization:||University of BC, Dept. of Electrical Engineering|
|Keywords:||yacc, question, comment|
I'm looking for a *simple* example that shows how to generate
an explicit parse tree using yacc. Since the tool is used a lot,
I thought there would be some sort of "standard" way of doing this.
(what would be perfect is the example in the lex/yacc
book by Levine et al on pg 52 - it is the fred = 12 + 13
I have built the basic lex/yacc components. Next, I need to build a parse tree
for processing by another module. The tool is going to transform
one syntax to another syntax.
I have searched the compiler web site, but have not found what I was
[Yeah, I wanted to put some examples of that in the book, but ran out of
time and pages. It's pretty straightforward, generate subtrees each time
you reduce a rule and splice them together as you go, ending up with one
big tree when the parse is done. -John]
Return to the
Search the comp.compilers archives again.