它将使用一系列的规范，其中包括优先级编号以及一个通配字符表达式，以便与加载名称进行匹配。
It will have a series of specs that include a priority number and a wild card expression to match a load name or names.
如果松绑定(looser - binding)运算符使用紧绑定(tighter - binding)运算符作为操作数表达式，那么优先级是自动处理的。
If looser-binding operators take as operands expressions using tighter-binding operators, precedence is handled automatically.
在后缀表达式中，不需要括号，而且操作符的优先级也不再起作用了。
In postfix notation, the need for parentheses is eliminated and the priority of the operators is no longer relevant. You can use the following algorithm to evaluate postfix expressions.
表达式可能会包含不止一个运算符，这些不同的运算先后次序就是运算符的优先级。
When an expression contains more than one operator, the order of evaluation depends on the order of operations.
括号内的内容最优先，大家可以用括号来强制某系表达式有限计算。
Parentheses have the highest precedence and can be used to force an expression to evaluate in the order you want.
算符优先文法是处理算术表达式的有力工具。
Operator precedence grammar is a powerful tool for handling arithmetic expressions.
使用目前常用的算符优先法，对通用表达式计算过程进行了介绍，并对其中的关键问题——运算符优先矩阵的设计和实现进行了研究。
Using the current commonly used operator priority method, introduces a common expression of the calculation process, and one of the key issues, operator precedence matrix design and implementation.
简单地说，优先级决定了有多个操作符的表达式如何对操作数分组。
Simply put, precedence stipulates how operands are grouped in expressions with multiple operators.
本文采用算符优先分析和堆栈的方法给出了算术表达式的计算过程。
This article used the operator first to analyze and the storehouse method has given the arithmetic expression computation process.
就如你可能猜想的那样，整数转换优先级用于定义表达式求值的规则。这些规则叫做整型提升和常用算术转换。
As you probably suspect, the integer conversion rank is used to define the rules for expression evaluation. Those rules are named the integer promotions and the usual arithmetic conversions.
也就是说，优先级和结合性决定了表达式的哪个部分用作哪个操作符的操作数。
That is, precedence and associativity determine which part of the expression is the operand for each of the operators in the expression.
通常比加法或乘法具有更高优先级的求幂在此示例中最后计算，因为其他表达式都放在括号中。
Exponentiation, which normally has higher precedence than addition or multiplication, is evaluated last in this example because the other expressions are enclosed in parentheses.
有一种书写表达式的方法叫做“完全括号”，这种表达式把每一个操作符都加了括号，表达完全精确，也不必记忆优先级规则。
This type of expression uses one pair of parentheses for each operator. Theparentheses dictate the order of operations; there is no ambiguity. There isalso no need to remember any precedence rules.
本文分析了多优先级DQDB城域网的性能，得到了采用不同优先级时，报文平均停留时间的表达式。
The performances of DQDB man with multiple priorities are analyzed. The expressions of mean message sojourn time in the buffer are derived.
可以将表达式嵌套到多层括号中，以进一步重写优先级。
You can nest expressions in multiple levels of parentheses to override precedence even further.
创建前面示例中这样的复杂表达式要求彻底理解运算符优先级的规则。
Creating complex expressions such as the one in the preceding example requires a thorough understanding of the rules of operator precedence.
创建前面示例中这样的复杂表达式要求彻底理解运算符优先级的规则。
Creating complex expressions such as the one in the preceding example requires a thorough understanding of the rules of operator precedence.
应用推荐