... CS(N), for each N; • (N, L) • CS(N), for each N such that N <~* l, and each L • Af*; • N • CS(N), for each N such that -~(N<~*l); and • for each N, children(N) = MI""Mm and ... needed for construction of parse trees (or "derived trees" as they are often called for TAGs) and the computation of features are al- most identical to the corresponding extensions for ... initial trees, al and a2, and one auxiliary tree fL For each node N, Adjunct(N) has been indicated to the right of that node, unless Adjunct(N) = {nil}, in which case that information is omitted...