Please help us improve the quality of example sentences! Edit on Github

杰克想找个地缝钻进去。Jack intended to find a chink to infix.

中缀表达式到后缀表达式的转换Converting infix notation to postfix notation

Other words in sentence

中缀表达式到后缀表达式的转换Converting infix expression to a postfix expression

为什么不先分手就一头钻进坟墓呢？Then why not say goodbye first before they infix the tomb?

到仁顺发表意见的时分，由于超时节目被中缀。To RenShun comments from the sky, because timeout program infix.

中缀索引将匹配在字符串内任意位置的子字符串。The infix index would match substrings anywhere within the string.

从左到右读入中缀表达式，每次一个字符。Read the infix expression from left to right, one character at a time.

Other words in sentence

中缀表示法是算术表达式的常规表示法。Infix notation is the conventional notation for arithmetic expressions.

对后缀表达式求值比直接对中缀表达式求值简单。Evaluating a postfix expression is simpler than directly evaluating an infix expression.

操作数的顺序与等价的中缀表达式中操作数的顺序一致The operands are in the same order that they would be in the equivalent infix expression.

要求转换后的中缀表达式中不应出现不必要的括号。Requirements of the post-conversion infix expression in brackets should not be unnecessary.

儿童顺序设置为“缀”，因为逗号之间的领域出现在每个记录。The child order is set to "Infix", since the comma appears in between the fields in each record.

Other words in sentence

词缀是一种附加语素，表示词汇意义。可分为前缀、。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.

它可以创建任意长度的单词前缀索引和可变长度的中缀子字符串的索引。It can create indexes of word prefixes of arbitrary length and indexes of infix substrings of varying lengths.

对以中缀表示法书写的表达式进行语法分析时，需要用括号和优先规则排除多义性。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

Other words in sentence

要把表达式从中缀表达式的形式转换成用后缀表示法表示的等价表达式，必须了解操作符的优先级和结合性。To convert an expression in an infix expression to its equivalent in postfix notation, we must know the precedence and associativity of operators.

本文综述了从算术表达式的逆波蓝形式重建为通常算术表达式中缀形式之算法。This note gives a survey of the algorithms which recreate infix forms of general arithmetic expressions from their corresponding reverse Polish forms.

在自由幺半群上引进模糊化内缀码和模糊化外缀码的概念，并进一步讨论它们的基本代数性质。In this paper, we introduce the concepts of fuzzifying infix codes and fuzzifying outfix codes on free monoid and discuss their elementary algebraic properties.