| 词条 | Shunting-yard algorithm | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 释义 |
In computer science, the shunting-yard algorithm is a method for parsing mathematical expressions 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 report [https://repository.cwi.nl/noauth/search/fullrecord.php?publnr=9251 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 {{nowrap|"3 + 4"}} or {{nowrap|"3 + 4 × (2 − 1)"}}. 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) {{nowrap|"3 4 +"}} and {{nowrap|"3 4 2 1 − × +"}}, respectively. The shunting-yard algorithm was later generalized into operator-precedence parsing. A simple conversion
This already shows a couple of rules:
Graphical illustrationGraphical 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 less 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 detailImportant terms: Token, Function, Operator associativity, Precedence {{font color|blue|/* This implementation does not implement composite functions,functions with variable number of arguments, and unary operators. */}} '''while''' there are tokens to be '''read''': read a token. '''if''' the token is a number, '''then''': push it to the output queue. '''if''' the token is a function '''then''': push it onto the operator stack '''if''' the token is an operator, '''then''': '''while''' ((there is a function at the top of the operator stack) or (there is an operator at the top of the operator stack with greater precedence) or (the operator at the top of the operator stack has equal precedence and is left associative)) and (the operator at the top of the operator stack is not a left parenthesis): pop operators from the operator stack onto the output queue. push it onto the operator stack. '''if''' the token is a left paren (i.e. "("), '''then''': push it onto the operator stack. '''if''' the token is a right paren (i.e. ")"), '''then''': '''while''' the operator at the top of the operator stack is not a left paren: pop the operator from the operator stack onto the output queue. {{font color|blue|/* if the stack runs out without finding a left paren, then there are mismatched parentheses. */}} '''if''' there is a left paren at the top of the operator stack, '''then''': pop the operator from the operator stack and discard it '''if''' there are no more tokens to '''read''': '''while''' there are still operator tokens on the stack: {{font color|blue|/* if the operator token on the top of the stack is a paren, then there are mismatched parentheses. */}} pop the operator from the operator stack onto the output queue. exit.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 exampleInput: {{nowrap|3 + 4 × 2 ÷ ( 1 − 5 ) ^ 2 ^ 3}}
The symbol ^ represents the power operator.
Input: {{nowrap|sin ( max ( 2, 3 ) ÷ 3 × {{pi}} )}}
See also
External links
3 : Parsing algorithms|Dutch inventions|Edsger W. Dijkstra |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。