for example a rule like this in my grammar file :
relational_expression : additive_expression ((ST|GT|STEQ|GTEQ)^ additive_expression)* ;
How will the tree grammar version look like ?
Thanks for your reply Sam, that solves the problem there. Please can you answer my theoretical question about the implementation of tree grammars ? I have noticed that rules with syntactic predicates get rejected.