infix
英 [ˈɪnfɪks]
美 [ˈɪnfɪks]
n. 中缀; 中加成分
现在分词:infixing 过去式:infixed 第三人称单数:infixes 过去分词:infixed
牛津词典
noun
- 中缀;中加成分
a letter or group of letters added to the middle of a word to change its meaning
英英释义
noun
- an affix that is inserted inside the word
verb
- attach a morpheme into a stem word
- put or introduce into something
- insert a picture into the text
双语例句
- The infix index would match substrings anywhere within the string.
中缀索引将匹配在字符串内任意位置的子字符串。 - Evaluating a postfix expression is simpler than directly evaluating an infix expression.
对后缀表达式求值比直接对中缀表达式求值简单。 - The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm
转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号 - The child order is set to "Infix", since the comma appears in between the fields in each record.
儿童顺序设置为“缀”,因为逗号之间的领域出现在每个记录。 - When parsing expressions written in infix notation, you need parentheses and precedence rules to remove ambiguity.
对以中缀表示法书写的表达式进行语法分析时,需要用括号和优先规则排除多义性。 - This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
和中缀转换后缀的算法相反,那是把操作符存储在栈里。 - It does not convert infix expressions to postfix notation; rather, it evaluates the infix expression directly.
不是把中缀表达式转换为后缀表示法;恰恰相反,它对中缀表达式直接求值。 - The main study is divided into prefixes, infix, suffix, is the focus of this article.
主体研究分为前缀、中缀、后缀,是本文的重点。 - A Algorithm to Convert Infix Expressions into Prefix Expressions
一个将中缀表达式转换为前缀表达式的算法 - Loop records should have child order set to infix.
应将循环记录的子顺序设置为中缀。
