In addition, we make the ∪ operator noncommutative: α ∪ β tries to match α first, and β only if it does not match α, as in Perl.
furthermore, it is not at all apparent that tree-transforming heuristics that are useful for one parsing model will be useful for another.