In a projective dependency tree, the yield of every subtree is a contiguous substring of the sentence.
more precisely, if the next node in the projective order is the kth node in the buffer, we perform k SHIFT transitions, to get this node onto the stack, followed by k−1 SWAP transitions, to move the preceding k − 1 nodes back to the buffer.