... Subsequently the p and n were shifted onto the stack and then reduced to a pp; then the np and pp on the stack were reduced to an np, followed by the shifting of v and n, their reduction to vp, and ... = n, and 0 otherwise. is the entire set of rules, P~ is (the left-half of) a par- ticular rule, and C is the parse context. Then 7~' is the subset of 7~, where if R~ 6 7~' then ... of the parse is constructed, dominated by the new symbol and placed on the stack. The input and the stack may both be arbitrarily long, but the parser need only consult the top elements of...