全部

1·Converting infix expression to a postfix expression.

中缀表达式到后缀表达式的转换。

2·Read the infix expression from left to right, one character at a time.

从左到右读入中缀表达式，每次一个字符。

3·Read the infix expression from left to right , one character at a time.

从左到右读入中缀表达式，每次一个字符。

4·In this paper, a rapid algorithm from infix expression to prefix one is proposed.

本文给出一种将中缀表达式转换成前缀表达式的有效算法。

5·The operands are in the same order that they would be in the equivalent infix expression.

操作数的顺序与等价的中缀表达式中操作数的顺序一致。

6·Evaluating a postfix expression is simpler than directly evaluating an infix expression.

对后缀表达式求值比直接对中缀表达式求值简单。

7·Requirements of the post-conversion infix expression in brackets should not be unnecessary.

要求转换后的中缀表达式中不应出现不必要的括号。

8·The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm.

转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号。