Formally, each state in the sequence is denoted by a tuple 〈S, Q〉, where S is a stack containing partial parses and Q is a queue of word-POS pairs that remain unprocessed.
the initial state is 〈φ, w 1 .