| 1. | Converting infix expression to a postfix expression
中缀表达式到后缀表达式的转换 |
| 2. | Parsing an infix expression
对中缀表达式进行语法分析 |
| 3. | Infix notation is the conventional notation for arithmetic expressions
中缀表示法是算术表达式的常规表示法。 |
| 4. | Read the infix expression from left to right , one character at a time
从左到右读入中缀表达式，每次一个字符。 |
| 5. | Overloaded infix operators , ,
重载中缀运算符 |
| 6. | Evaluating a postfix expression is simpler than directly evaluating an infix expression
对后缀表达式求值比直接对中缀表达式求值简单。 |
| 7. | Overloaded infix operators and do not work if both operands are class variables
如果两个操作数均为类变量，重载中缀运算符< <和> >无效： |
| 8. | The operands are in the same order that they would be in the equivalent infix expression
操作数的顺序与等价的中缀表达式中操作数的顺序一致 |
| 9. | Some of the cells might be empty , so that one could create words lacking a prefix , midfix or suffix
某些格子可能是空的，这样就可以造出没有前缀、中缀或后缀的字。 |
| 10. | The algorithm researches in this paper can be used for sequence mining or searching frequent sequences related to time
本文的中缀算法适用于序列挖掘，寻找和时间相关的频繁序列。 |
