infix

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

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

Loop records should have child order set to infix .

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

In this paper , a rapid algorithm from infix expression to prefix one is proposed .

本文给出一种将中缀表达式转换成前缀表达式的有效算法。

A rapid algorithm for transforming infix expression into prefix expression

中缀表达式到前缀表达式的快速算法

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

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

The infix index would match substrings anywhere within the string .

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

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

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

Then why not say goodbye first before they infix the tomb ?

为什么不先分手就一头钻进坟墓呢？

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

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

A Algorithm to Convert Infix Expressions into Prefix Expressions

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

Infix an idea in someone 's mind

将观念灌输到某人脑中

Expressions use the same infix operators .

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

Alternatively , a delimiter type of Infix can be specified .

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

Infix notation is the conventional notation for arithmetic expressions .

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

The main study is divided into prefixes , infix , suffix , is the focus of this article .

主体研究分为前缀、中缀、后缀，是本文的重点。

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

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

A characterization of infix strong codes

关于双完备认证码的特征内缀强码的一个刻画

The child order is set to " Infix ", since the comma appears in between the fields in each record .

儿童顺序设置为“缀”，因为逗号之间的领域出现在每个记录。

Jack intended to find a chink to infix .

杰克想找个地缝钻进去。

Converting infix expression to a postfix expression

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

Requirements of the post-conversion infix expression in brackets should not be unnecessary .

要求转换后的中缀表达式中不应出现不必要的括号。

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

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

This note gives a survey of the algorithms which recreate infix forms of general arithmetic expressions from their corresponding reverse Polish forms .

本文综述了从算术表达式的逆波蓝形式重建为通常算术表达式中缀形式之算法。

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

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

This is the opposite of the infix to postfix translation algorithm , where operators were stored on the stack .

和中缀转换后缀的算法相反，那是把操作符存储在栈里。

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

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

It does not convert infix expressions to postfix notation ; rather , it evaluates the infix expression directly .

不是把中缀表达式转换为后缀表示法；恰恰相反，它对中缀表达式直接求值。

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，因此文件结尾不需要逗号。

Subtypes : prefix , suffix , and infix .

前缀，后缀，中缀。

To convert an expression in an infix expression to its equivalent in postfix notation , we must know the precedence and associativity of operators .

要把表达式从中缀表达式的形式转换成用后缀表示法表示的等价表达式，必须了解操作符的优先级和结合性。