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 remaining unprocessed words.
the initial state has an empty stack σ and a queue β containing the entire input sentence, and the terminal states have an empty queue β and a stack σ containing only one complete parse tree.