... 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 ... stack. This can be used for computation of derived trees or derivation trees, and for computation of features. Since this technique is almost identical to that for the context-free case, it suffices ... will (exactly) one of the Xj be of the form (M, L), some M. and set X = N if L [] and X = (N,L) otherwise) The shift step is identical to that for context- free LR parsing. There are two...