Expressions use the same infix operators.
表达式使用同样的中缀运算符。
The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm.
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号。
This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
和中缀转换后缀的算法相反，那是把操作符存储在栈里。
This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
和中缀转换后缀的算法相反，那是把操作符存储在栈里。
应用推荐