Hi, I`m new for ANTLR, and have this trouble: I implemented a simple mathematical expression parser, similar to the example in the page, I need to work with the generated AST, so I added the option output=AST to the grammar. The Parser works fine, but its return is a flat tree, all tokens are childs of the root.
Is this the normal use? Can someone guess what I'm doing wrong, or tell me the way to get the complete tree? If the question is so basic, and large to respond, any reference will be welcome too... Thanks! Juan Manuel List: http://www.antlr.org/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address -- You received this message because you are subscribed to the Google Groups "il-antlr-interest" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
