从左到右读入中缀表达式，每次一个字符。
Read the infix expression from left to right, one character at a time.
中缀表达式到后缀表达式的转换。
中缀表达式到后缀表达式的转换。
从左到右读入中缀表达式，每次一个字符。
Read the infix expression from left to right , one character at a time.
操作数的顺序与等价的中缀表达式中操作数的顺序一致。
The operands are in the same order that they would be in the equivalent infix expression.
对后缀表达式求值比直接对中缀表达式求值简单。
Evaluating a postfix expression is simpler than directly evaluating an infix expression.
要求转换后的中缀表达式中不应出现不必要的括号。
Requirements of the post-conversion infix expression in brackets should not be unnecessary.
本文给出一种将中缀表达式转换成前缀表达式的有效算法。
In this paper, a rapid algorithm from infix expression to prefix one is proposed.
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号。
The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm.
中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。
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.
中缀表示法是算术表达式的常规表示法。
Infix notation is the conventional notation for arithmetic expressions.
表达式使用同样的中缀运算符。
表达式使用同样的中缀运算符。
应用推荐