Here, the derived tree T for an edge e is a tree combining edges to get from elements of s Ω I to e; and a state s Ω contains T if all edges in T are elements of s Ω .
e 0 is feasible if it forms part of a derived tree for a complete sentence.