| 1. | Converting infix expression to a postfix expression
中缀表达式到后缀表达式的转换 |
| 2. | The second form is a postfix decrement operation
第二种形式是后缀减量操作。 |
| 3. | The second form is a postfix increment operation
第二种形式是后缀增量操作。 |
| 4. | Read the postfix expression from left to right
从左到右读入后缀表达式 |
| 5. | Prefix and postfix notation have three common features
前缀和后缀表示法有三项公共特征： |
| 6. | In postfix notation , the operator comes after its operands
在后缀表示法中，操作符位于操作数后面。 |
| 7. | You can use the following algorithm to evaluate postfix expressions
您可以用如下算法对后缀表达式求值： |
| 8. | At the end of the postfix expression , pop a result from the stack
到后缀表达式末尾，从堆栈中弹出结果。 |
| 9. | Evaluating the postfix expression
对后缀表达式求值 |
| 10. | Postfix notation is also known as
后缀表示法也称 |
