C# Класс QUT.Gplex.Parser.RuleDesc

This is the place to perform any semantic checks on the trees corresponding to a rule of the LEX grammar, during a recursive traversal of the tree. It is hard to do these on the fly during AST construction, because of the tree-grafting that happens for lexical categories. First check is that '^' and '$' can only appear (logically) at the ends of the pattern. Later need to check ban on multiple right contexts ...