Hi Alex, Alex Storkey wrote: > Hi, it's my first time posting in a mailing list like this so go easy on me > if I'm breaking some etiquette or anything :) > > I'm trying to construct an expression in my tree grammar to recognize an AST > of simple mathematical expressions like 1+(-(a-b)) in tree format of (+ 1 (- > (- a b))) that is generated by my parser grammar. > > I've tried a couple of different approaches and I can't figure out where I'm > going wrong. Could someone explain what's wrong with the following two > expressions: > expression > : (MINUS^)? term;
If I understand you correctly, you are asking about writing tree parser grammar. Does Antlr even compile the grammar (i.e., generate a tree parser) with the above rule? I think the rule must be of the form of rewrite rules. J 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.
