Consider an initially empty stack of English words. Let us consider the following operations (separated by semicolons) on the stack.

top; push if; top; push she; push puts; top; push it; pop; push it; top; push in; push her; pop; push her; top; push batter; push it; top; push will; pop; top; push will; top; push make; push her; top; push batter; top; push bitter;

From this point on, if we continue executing only the operation pop on the stack, we will get the output

"bitterbatterhermakewillitbatterherinitputssheif"

after which the stack will be empty. This would end the first phase of operations on the stack.

In the second phase, the following operations are executed on the stack.

top; push how; top; push can; top; pop; push is; top; push he; push she; top; pop; push ten; top; push hours; push days; push years; top; pop; top; pop; push straight; top; push he; top; push they; pop; push is; top; push are; pop; push a; push some; pop; push machine; top;

What will be the output henceforth, if we continue executing only the operation pop on the stack?

(Please ignore all outputs until this point. In your answer, please exclude all spaces, quotation marks or any additional character other than the words from the stack.)