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).[1] The algorithm was invented by Edsger Dijkstra, first published in November 1961[2], and named the "shunting yard" algorithm because its operation resembles that of a railroad shunting yard
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.
In this case there is only one, "+".
This already shows a couple of rules:
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).
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 o1: while (there is an operator o2 at the top of the operator stack which is not a left parenthesis, and (o2 has greater precedence than o1 or (o1 and o2 have the same precedence and o1 is left-associative))): pop o2 from the operator stack into the output queue push o1 onto the operator stack - a ",": 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 - 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.
Input:
| Operator | Precedence | Associativity | |
|---|---|---|---|
| ^ | 4 | Right | |
| × | 3 | Left | |
| ÷ | 3 | Left | |
| + | 2 | Left | |
| − | 2 | Left |
| Token | Action | Output (in RPN) | Operator stack | Notes | |
|---|---|---|---|---|---|
| 3 | Add token to output | 3 | |||
| + | Push token to stack | 3 | + | ||
| 4 | Add token to output | 3 4 | + | ||
| × | Push token to stack | 3 4 | × + | × has higher precedence than + | |
| 2 | Add token to output | 3 4 2 | × + | ||
| ÷ | Pop stack to output | 3 4 2 × | + | ÷ and × have same precedence | |
| Push token to stack | 3 4 2 × | ÷ + | ÷ has higher precedence than + | ||
| ( | Push token to stack | 3 4 2 × | (÷ + | ||
| 1 | Add token to output | 3 4 2 × 1 | (÷ + | ||
| − | Push token to stack | 3 4 2 × 1 | − (÷ + | ||
| 5 | Add token to output | 3 4 2 × 1 5 | − (÷ + | ||
| ) | Pop stack to output | 3 4 2 × 1 5 − | (÷ + | Repeated until "(" found | |
| Pop stack | 3 4 2 × 1 5 − | ÷ + | Discard matching parenthesis | ||
| ^ | Push token to stack | 3 4 2 × 1 5 − | ^ ÷ + | ^ has higher precedence than ÷ | |
| 2 | Add token to output | 3 4 2 × 1 5 − 2 | ^ ÷ + | ||
| ^ | Push token to stack | 3 4 2 × 1 5 − 2 | ^ ^ ÷ + | ^ is evaluated right-to-left | |
| 3 | Add token to output | 3 4 2 × 1 5 − 2 3 | ^ ^ ÷ + | ||
| end | Pop entire stack to output | 3 4 2 × 1 5 − 2 3 ^ ^ ÷ + |
Input:
| Token | Action | Output (in RPN) | Operator stack | Notes | |
|---|---|---|---|---|---|
| sin | Push token to stack | sin | |||
| ( | Push token to stack | (sin | |||
| max | Push token to stack | max (sin | |||
| ( | Push token to stack | (max (sin | |||
| 2 | Add token to output | 2 | (max (sin | ||
| , | Ignore | 2 | (max (sin | The operator at the top of the stack is a left parenthesis | |
| 3 | Add token to output | 2 3 | (max (sin | ||
| ) | Pop stack to output | 2 3 | (max (sin | Repeated until "(" is at the top of the stack | |
| Pop stack | 2 3 | max (sin | Discarding matching parentheses | ||
| Pop stack to output | 2 3 max | (sin | Function at top of the stack | ||
| ÷ | Push token to stack | 2 3 max | ÷ (sin | ||
| 3 | Add token to output | 2 3 max 3 | ÷ (sin | ||
| × | Pop stack to output | 2 3 max 3 ÷ | (sin | ||
| Push token to stack | 2 3 max 3 ÷ | × (sin | |||
| Add token to output | 2 3 max 3 ÷ | × (sin | |||
| ) | Pop stack to output | 2 3 max 3 ÷ × | (sin | Repeated until "(" is at the top of the stack | |
| Pop stack | 2 3 max 3 ÷ × | sin | Discarding matching parentheses | ||
| Pop stack to output | 2 3 max 3 ÷ × sin | Function at top of the stack | |||
| end | Pop entire stack to output | 2 3 max 3 ÷ × sin |