This can be accomplished by performing a first-pass grammar transformation in which a copy of each elementary tree set is added to the grammar for each distinct, maximal, nonconflicting set of links appearing in the tree set.
in spite of the provable difficulty of the recognition problem, we offer several algorithms that can substantially improve processing efficiency.