中缀

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

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

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

The infix index would match substrings anywhere within the string .

你说起话来，怎么这么多中缀

Why do you use so many prefixes while talking ?

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

Alternatively , a delimiter type of Infix can be specified .

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

Infix notation is the conventional notation for arithmetic expressions .

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

A rapid algorithm for transforming infix expression into prefix expression

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

Loop records should have child order set to infix .

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

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

前缀，后缀，中缀。

Subtypes : prefix , suffix , and infix .

中缀及后缀算术表达式在运算中的应用研究

A Study of Index and Suffix Arithmetic Expression in the Operation Applied Research

中缀的音位制约体现在它有其内部韵律结构。

Infixes have their inner prosodic structure which well illustrates their phonological constraint .

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

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

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

A Algorithm to Convert Infix Expressions into Prefix Expressions

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

Expressions use the same infix operators .

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

Converting infix expression to a postfix expression

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

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

天空中缀满了星星。

The sky was studded with stars .

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

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

例如：假如一个特别的中缀发作，你能够用一个示波器去检测它。

For example , you might use an oscilloscope to determine if a particular interrupt is currently asserted .

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

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

量子化驻波腔场中缀饰态原子的演化态矢

The state vetors of the whole system on the dressed state atom in a quantized standing-wave cavity field

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

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

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

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

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

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

本文的中缀算法适用于序列挖掘，寻找和时间相关的频繁序列。

The algorithm researches in this paper can be used for sequence mining or searching frequent sequences related to time .

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

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

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

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

按照位置，绩溪方言词缀分为前缀、中缀、后缀。

According to the position of affixes , affixes in Jixi dialect can be divided into prefixes , infixes and suffixes .

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

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

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

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