A parser state s ∈ S is defined as a tuple s = (σ, β), where σ is a stack which is maintained to hold partial subtrees that are already constructed, and β is a queue which is used for storing word-POS pairs that remain unprocessed.
the initial state has an B0,3   c2,3   w2   A0,2   b1,2   w1   a0,1   w0 sh,sh,rr-A,sh,rl-B (a)   B0,3   F2,3   c2,3   w2   E0,2   A0,2   D1,2   b1,2   w1   C0,1   a0,1   w0 sh,ru-C,sh,ru-D,rr-A, ru-E,sh,ru-F,rl-B (b) Figure 1: Two constituent trees for an example sentence w 0 w 1 w 2 with POS tags abc.