It can create indexes of word prefixes of arbitrary length and indexes of infix substrings of varying lengths.
它可以创建任意长度的单词前缀索引和可变长度的中缀子字符串的索引。
The three most common forms of notation in arithmetic expressions are infix, prefix, and postfix notations.
算术表达式中最常见的表示法形式有中缀、前缀和后缀表示法。
The operands are in the same order that they would be in the equivalent infix expression.
操作数的顺序与等价的中缀表达式中操作数的顺序一致。
Expressions use the same infix operators.
表达式使用同样的中缀运算符。
The infix index would match substrings anywhere within the string.
中缀索引将匹配在字符串内任意位置的子字符串。
Converting infix notation to postfix notation.
中缀表达式到后缀表达式的转换。
The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm.
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号。
Read the infix expression from left to right, one character at a time.
从左到右读入中缀表达式，每次一个字符。
Evaluating a postfix expression is simpler than directly evaluating an infix expression.
对后缀表达式求值比直接对中缀表达式求值简单。
Infix notation is a common way of writing expressions, while prefix and postfix notations are primarily used in computer science.
中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。
Infix notation is the conventional notation for arithmetic expressions.
中缀表示法是算术表达式的常规表示法。
Converting infix expression to a postfix expression.
中缀表达式到后缀表达式的转换。
Any method may be used as an infix or postfix operator, and.
任何方式可以被用作中缀(infix)或后缀(postfix)操作符。
Some of the cells might be empty, so that one could create words lacking a prefix, infix or suffix.
某些格子可能是空的，这样就可以造出没有前缀、中缀或后缀的字。
Derivational affix modifies the word lexically which can be divided into prefix, infix and suffix.
词缀是一种附加语素，表示词汇意义。可分为前缀、中缀和后缀。
This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
和中缀转换后缀的算法相反，那是把操作符存储在栈里。
Infix work shift hand over first to check the blade rotation, fixed installation, safe installation and the button can be normal.
中缀工在交接班时首先要检查锯片的固定、转动安装、平安安装及各按钮能否正常。
Requirements of the post-conversion infix expression in brackets should not be unnecessary.
要求转换后的中缀表达式中不应出现不必要的括号。
Read the infix expression from left to right , one character at a time.
从左到右读入中缀表达式，每次一个字符。
However, these predicates are normally used in infix notations.
然而，这些谓词通常按中缀表示法使用。
In this paper, a rapid algorithm from infix expression to prefix one is proposed.
本文给出一种将中缀表达式转换成前缀表达式的有效算法。
In this paper, a rapid algorithm from infix expression to prefix one is proposed.
本文给出一种将中缀表达式转换成前缀表达式的有效算法。
应用推荐