Hi,
I have a parser grammar that generates code using ST.
One rule is
andExpression
:
c1=condintion (AND c2+=condition)* -> andExpressionTmpl(c1={c1.st};
c2={c2})
;
So the rule consumes a first condition, and afterwords it accumulates
all following conditions into c2.
For something like A AND B AND C where (A,B,C are conditions), it would
process A,B,C in one template call.
Is it possible to get working like (A AND) AND C? (w/o using tree grammar?)
Thanks for any hint,
Fridi
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.
