Infix英文翻译_含义_读音_Infix例句

词性释义

n.

中缀；中加成分

v.

把……植入；插入（中缀）；用力插入

adj.

中缀的

例句

全部
中缀

Make sure that your program is extensible to be used to evaluate any other infix expressions.

确定你的程序时可扩展的，被用于其他插入公式。

Infix notation is a common way of writing expressions, while prefix and postfix notations are primarily used in computer science.

中缀表示法是书写表达式的常见方式，而前缀和后缀表示法主要用于计算机科学领域。

Because the value of the Delimiter type property is Infix, there does not need to be a comma at the end of the file.

由于Delimitertype属性的值为Infix，因此文件结尾不需要逗号。

The operands are in the same order that they would be in the equivalent infix expression.

操作数的顺序与等价的中缀表达式中操作数的顺序一致

Read the infix expression from left to right, one character at a time.

从左到右读入中缀表达式，每次一个字符。

When parsing expressions written in infix notation, you need parentheses and precedence rules to remove ambiguity.

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

Combining with engineering practice, the author briefly states infix methods in gravel at the same area.

本文作者结合工程实践，简单明确的对在不同地区、砾石层中的钻进方法进行了论述。

Evaluating a postfix expression is simpler than directly evaluating an infix expression.

对后缀表达式求值比直接对中缀表达式求值简单。

Infix notation is the conventional notation for arithmetic expressions.

中缀表示法是算术表达式的常规表示法。

Alternatively, a delimiter type of Infix can be specified.

或者，可以指定Infix（中缀）类型的分隔符。

The three most common forms of notation in arithmetic expressions are infix, prefix, and postfix notations.

算术表达式中最常见的表示法形式有中缀、前缀和后缀表示法。

The infix index would match substrings anywhere within the string.

中缀索引将匹配在字符串内任意位置的子字符串。

Expressions use the same infix operators.

表达式使用同样的中缀运算符。

Loop records should have child order set to infix.

应将循环记录的子顺序设置为中缀。

There are three types of affix: prefix, suffix, and infix.

有三种类型：前缀、后缀，加盖，诗词。

Jack intended to find a chink to infix.

杰克想找个地缝钻进去。

Converting infix expression to a postfix expression

中缀表达式到后缀表达式的转换

The conversion process involves reading the operands, operators, and parentheses of the infix expression using the following algorithm

转换过程包括用下面的算法读入中缀表达式的操作数、操作符和括号

A Algorithm to Convert Infix Expressions into Prefix Expressions

一个将中缀表达式转换为前缀表达式的算法

any method may be used as an infix or postfix operator, and

任何方式可以被用作中缀（infix）或后缀（postfix）操作符

1·It can create indexes of word prefixes of arbitrary length and indexes of infix substrings of varying lengths.

它可以创建任意长度的单词前缀索引和可变长度的中缀子字符串的索引。

2·The three most common forms of notation in arithmetic expressions are infix, prefix, and postfix notations.

算术表达式中最常见的表示法形式有中缀、前缀和后缀表示法。

3·The operands are in the same order that they would be in the equivalent infix expression.

操作数的顺序与等价的中缀表达式中操作数的顺序一致。

4·Expressions use the same infix operators.

表达式使用同样的中缀运算符。

5·Converting infix notation to postfix notation.

中缀表达式到后缀表达式的转换。