To address this issue, we introduce the concepts of virtual node and virtual hyperedge to convert a complete parse forest to a non-complete forest which is designed to encode all the tree sequences that we want.
by doing so, the tree sequence rules can be extracted from a forest in the following two steps: 1) Convert the complete parse forest into a non-complete forest in order to cover those tree sequences that cannot be covered by a single tree node.