Shunting Yard Algorithm

In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix notation. It can produce either a postfix notation string, also known as Reverse Polish notation (RPN), or an abstract syntax tree (AST). The algorithm was invented by Edsger Dijkstra and named the "shunting yard" algorithm because its operation resembles that of a railroad shunting yard. Dijkstra first described the shunting yard algorithm in the Mathematisch Centrum repor
MR 34/61

Like the evaluation of RPN, the shunting yard algorithm is stack-based. Infix expressions are the form of mathematical notation most people are used to, for instance or . For the conversion there are two text variables (strings), the input and the output. There is also a stack that holds operators not yet added to the output queue. To convert, the program reads each symbol in order and does something based on that symbol. The result for the above examples would be (in Reverse Polish notation) and , respectively.

The shunting yard algorithm will correctly parse all valid infix expressions, but does not reject all invalid expressions. For example, is not a valid infix expression, but would be parsed as . The algorithm can however reject expressions with mismatched parentheses.

The shunting yard algorithm was later generalized into operator-precedence parsing.

A simple conversion

#Input:
#Push 3 to the output queue (whenever a number is read it is pushed to the output)
#Push + (or its ID) onto the operator stack
#Push 4 to the output queue
#After reading the expression, pop the operators off the stack and add them to the output.
#:In this case there is only one, "+".
#Output:

This already shows a couple of rules:
* All numbers are pushed to the output when they are read.
* At the end of reading the expression, pop all operators off the stack and onto the output.

Graphical illustration

Graphical illustration of algorithm, using a three-way railroad junction. The input is processed one symbol at a time: if a variable or number is found, it is copied directly to the output a), c), e), h). If the symbol is an operator, it is pushed onto the operator stack b), d), f). If the operator's precedence is lower than that of the operators at the top of the stack or the precedences are equal and the operator is left associative, then that operator is popped off the stack and added to the output g). Finally, any remaining operators are popped off the stack and added to the output i).

The algorithm in detail

while there are tokens to be read:
read a token
if the token is:
- a ''number'':
put it into the output queue
- a ''function'':
push it onto the operator stack
- an ''operator'' ''o''₁:
while (
there is an operator ''o''₂ at the top of the operator stack which is not a left parenthesis,
and (''o''₂ has greater precedence than ''o''₁ or (''o''₁ and ''o''₂ have the same precedence and ''o''₁ is left-associative))
):
pop ''o''₂ from the operator stack into the output queue
push ''o''₁ onto the operator stack
- a ''left parenthesis'' (i.e. "("):
push it onto the operator stack
- a ''right parenthesis'' (i.e. ")"):
while the operator at the top of the operator stack is not a left parenthesis:

pop the operator from the operator stack into the output queue

pop the left parenthesis from the operator stack and discard it
if there is a function token at the top of the operator stack, then:
pop the function from the operator stack into the output queue

while there are tokens on the operator stack:

pop the operator from the operator stack onto the output queue

To analyze the running time complexity of this algorithm, one has only to note that each token will be read once, each number, function, or operator will be printed once, and each function, operator, or parenthesis will be pushed onto the stack and popped off the stack once—therefore, there are at most a constant number of operations executed per token, and the running time is thus O(''n'') — linear in the size of the input.

The shunting yard algorithm can also be applied to produce prefix notation (also known as Polish notation). To do this one would simply start from the end of a string of tokens to be parsed and work backwards, reverse the output queue (therefore making the output queue an output stack), and flip the left and right parenthesis behavior (remembering that the now-left parenthesis behavior should pop until it finds a now-right parenthesis). And changing the associativity condition to right.

Detailed examples

Input:

:
The symbol ^ represents the power operator.
:

Input:

:

See also

*Operator-precedence parser
*Stack-sortable permutation

References

External links

Dijkstra's original description of the Shunting yard algorithmLiterate Programs implementation in CDemonstration of Shunting yard algorithm in RustJava Applet demonstrating the Shunting yard algorithmSilverlight widget demonstrating the Shunting yard algorithm and evaluation of arithmetic expressions
Theodore Norvell © 1999–2001. Access date September 14, 2006.
Matlab code, evaluation of arithmetic expressions using the shunting yard algorithm

{{Parsers

Parsing algorithms
Dutch inventions