As each word must be pushed to the stack once and popped off once, the number of actions needed to parse a sentence is always 2n, where n is the length of the sentence.
transitionbased parsing has a linear complexity with the length of input and naturally it can be extended to process the stream of words.