this note gives a survey of the algorithms which recreate infix forms of general arithmetic expressions from their corresponding reverse polish forms.
本文综述了从算术表达式的逆波蓝形式重建为通常算术表达式中缀形式之算法。
the operands are in the same order that they would be in the equivalent infix expression.
操作数的顺序与等价的中缀表达式中操作数的顺序一致
to illustrate these techniques, i use a sample program called ccalc, which implements an enhanced calculator based on the infix calculator from the bison handbook.
为了展示这些技术,我使用了一个示例程序ccalc,它基于bison手册中的计算机实现了一个增强的计算器。
evaluating a postfix expression is simpler than directly evaluating an infix expression.
对后缀表达式求值比直接对中缀表达式求值简单。
this is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
和中缀转换后缀的算法相反,那是把操作符存储在栈里。
infix notation is a common way of writing expressions , while prefix and postfix notations are primarily used in computer science.
中缀表示法是书写表达式的常见方式,而前缀和后缀表示法主要用于计算机科学领域。
the infix index would match substrings anywhere within the string.
中缀索引将匹配在字符串内任意位置的子字符串。
the conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号
requirements of the post-conversion infix expression in brackets should not be unnecessary.
要求转换后的中缀表达式中不应出现不必要的括号。
alternatively, a delimiter type of infix can be specified.
或者,可以指定infix类型的分隔符。
convert infix to postfix source code integrity, and can be used directly.
转换缀以后缀的源代码完整,并可以直接使用。
derivational affix modifies the word lexically which can be divided into prefix, infix and suffix.
词缀是一种附加语素,表示词汇意义。可分为前缀、中缀和后缀。
note that the use of infix as the delimiter type means that there is no comma added after the last record is written, so the delimiter is only inserted between any two adjacent records.
请注意,使用infix作为分隔符类型意味着,写入的最后一个记录后面没有添加逗号,因此分隔符仅插入任何两个相邻记录之间。
infix notation is the conventional notation for arithmetic expressions.
中缀表示法是算术表达式的常规表示法。
converting infix notation to postfix notation
中缀表达式到后缀表达式的转换
it can create indexes of word prefixes of arbitrary length and indexes of infix substrings of varying lengths.
它可以创建任意长度的单词前缀索引和可变长度的中缀子字符串的索引。
converting infix expression to a postfix expression
中缀表达式到后缀表达式的转换
expressions use the same infix operators.
表达式使用同样的中缀运算符。
any method may be used as an infix or postfix operator, and
任何方式可以被用作中缀(infix)或后缀(postfix)操作符