It does not convert infix expressions to postfix notation ; rather , it evaluates the infix expression directly 不是把中缀表达式转换为后缀表示法；恰恰相反，它对中缀表达式直接求值。
When parsing expressions written in infix notation , you need parentheses and precedence rules to remove ambiguity 对以中缀表示法书写的表达式进行语法分析时，需要用括号和优先规则排除多义性。
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 中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。
At the last part of this paper , an example of time series - based stock mining is taken to assessing the middle matching algorithm 本文最后使用了证券时间序列挖掘来验证中缀序列挖掘算法，充分说明了具有一定的理论和实用价值。
A wave function for laser dressed atom is derived as a perturbative solution of the time - dependent schr ? dinger equation in the velocity gauge 摘要作为含时薛定谔方程的微扰近似解，在速度规范下给出了激光场中缀饰原子的一个波函数。
This paper compares difference of the candidate sets between two algorithms . the experiment proves that the middle matching algorithm is more efficient than spade 本文对spade算法和中缀序列挖掘算法的候选集产生情况做了比较，通过大量的实验数据证明了中缀序列挖掘算法的效率明显高于spade算法。
To make up the deficiencies above , this paper put forward the middle matching algorithm , whose main idea is to produce candidate sets through matching two sequences in the middle place to reach the aim of reducing the number of candidate sets , meanwhile processing in that way can avoid the second disadvantage above to expand the domain in which the algorithm can be used 以spade算法作为中缀序列挖掘算法的主要思路，在产生候选集时，结合gsp产生候选集的算法，通过对两个序列进行中间匹配来产生候选集，达到减少冗余候选集数量的目的，提高算法的效率，同时在产生的频繁序列中可以重复出现相同的商品项目，使算法具有更加广阔的适应性。
