[antlr-interest] AST generation: EXPRESSION TREE example.

[Monty Zukowski]

On Jun 2, 2004, at 2:35 PM, Bharath Sundararaman wrote:

> Yes, they do. In fact, if I don't use INTNode, PLUSNode and MULTNode 
> in my
> grammar and just use CalcAST in my "main" class which runs the parser 
> and
> the lex, it works fine. I can correctly resolve CalcAST and use it. 
> Should I
> qualify my usage of INTNode, PLUSNode and MULTNode? In my tokens 
> section, I
> have the line "PLUS<AST = PLUSNode>;". Also, all my class files exist 
> under
> one same package.

You probably have to qualify the node name.  Try PLUS<AST = 
mypkg.PLUSNode>

Monty Zukowski

ANTLR & Java Consultant -- http://www.codetransform.com
ANSI C/GCC transformation toolkit -- 
http://www.codetransform.com/gcc.html
Embrace the Decay -- http://www.codetransform.com/EmbraceDecay.html



 
Yahoo! Groups Links

<*> To visit your group on the web, go to:
     http://groups.yahoo.com/group/antlr-interest/

<*> To unsubscribe from this group, send an email to:
     antlr-interest-unsubscribe at yahoogroups.com

<*> Your use of Yahoo! Groups is subject to:
     http://docs.yahoo.com/info/terms/