到后缀表达式末尾，从堆栈中弹出结果。
At the end of the postfix expression, pop a result from the stack.
从左到右读入后缀表达式
若后缀表达式格式正确，那么堆栈应该为空。
If the postfix expression was correctly formed, the stack should be empty.
中缀表达式到后缀表达式的转换。
中缀表达式到后缀表达式的转换。
对后缀表达式求值比直接对中缀表达式求值简单。
Evaluating a postfix expression is simpler than directly evaluating an infix expression.
如果您不能够弹出两个操作数，后缀表达式的语法就不正确。
If you could not pop two operators, the syntax of the postfix expression was not correct.
在后缀表达式中，不需要括号，而且操作符的优先级也不再起作用了。
In postfix notation, the need for parentheses is eliminated and the priority of the operators is no longer relevant. You can use the following algorithm to evaluate postfix expressions.
中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。
Infix notation is a common way of writing expressions, while prefix and postfix notations are primarily used in computer science.
算术表达式中最常见的表示法形式有中缀、前缀和后缀表示法。
The three most common forms of notation in arithmetic expressions are infix, prefix, and postfix notations.
后缀表示法也称逆波兰表示法(reverse Polish notation,RPN)，因其使表达式求值变得轻松，所以被普遍使用。
Postfix notation is also known as reverse Polish notation (RPN) and is commonly used because it enables easy evaluation of expressions.
后缀和前缀增量运算符表达式中的评价如何？
How is the postfix and prefix increment operator evaluated in an expression?
后缀和前缀增量运算符表达式中的评价如何？
How is the postfix and prefix increment operator evaluated in an expression?
应用推荐