Making an AST node the lowest descendent of a recursive rule
I am trying to make a parser rule which allows for zero or more of a token before a second rule and for which each successive token - of those which were part of the closure - is, in the AST, a child of the previous token, and the second rule is also a child of the last symbol. easier to explain by example... expression11 : ((NOT | COM...