We run our generic tabular algorithm for the grammar in Table 4, for input p k+1 s m , to obtain σ 1 = W .
the scores are obtained by translating indices of the shift, which pushes an element on top of a k , implies that a k will obtain right children before it can obtain left children.