2.12 Precedence and Order of Evaluation 运算符优先级与求值次序

Table 2.1 summarizes the rules for precedence and associativity of all operators, including those that we have not yet discussed. Operators on the same line have the same precedence; rows are in order of decreasing precedence, so, for example, *, /, and % all have the same precedence, which is higher than that of binary + and -. The "operator" () refers to function call. The operators -> and . are used to access members of structures; they will be covered in Chapter 6, along with sizeof (size of an object). Chapter 5 discusses * (indirection through a pointer) and & (address of an object), and Chapter 3 discusses the comma operator.


Operators       Associativity
() [] -> .       left to right
! ~ ++ -- + - * (type) sizeof    right to left
* / %    left to right
+ -      left to right
<<  >>   left to right
< <= > >=        left to right
== !=    left to right
&        left to right
^        left to right
|        left to right
&&       left to right
||       left to right
?:       right to left
= += -= *= /= %= &= ^= |= <<= >>=        right to left
,        left to right

Unary & +, -, and * have higher precedence than the binary forms.

Table 2.1: Precedence and Associativity of Operators

运算符     结合性
() [] -> .       从左至右
! ~ ++ -- + - * (type) sizeof    从右至左
* / %    从左至右
+ -      从左至右
<<  >>   从左至右
< <= > >=        从左至右
== !=    从左至右
&        从左至右
^        从左至右
|        从左至右
&&       从左至右
||       从左至右
?:       从右至左
= += -= *= /= %= &= ^= |= <<= >>=        从右至左
,        从左至右


表2.1: 运算符的优先级与结合性

Note that the precedence of the bitwise operators &, ^, and | falls below == and !=. This implies that bit-testing expressions like

   if ((x & MASK) == 0) ...

must be fully parenthesized to give proper results.


   if ((x & MASK) == 0) ...


C, like most languages, does not specify the order in which the operands of an operator are evaluated. (The exceptions are &&, ||, ?:, and `,'.) For example, in a statement like

   x = f() + g();

f may be evaluated before g or vice versa; thus if either f or g alters a variable on which the other depends, x can depend on the order of evaluation. Intermediate results can be stored in temporary variables to ensure a particular sequence.


   x = f() + g();


Similarly, the order in which function arguments are evaluated is not specified, so the statement

   printf("%d %d\n", ++n, power(2, n));   /* WRONG */

can produce different results with different compilers, depending on whether n is incremented before power is called. The solution, of course, is to write

   printf("%d %d\n", n, power(2, n));


   printf("%d %d\n", ++n, power(2, n));   /* WRONG */


   printf("%d %d\n", n, power(2, n));

Function calls, nested assignment statements, and increment and decrement operators cause "side effects" - some variable is changed as a by-product of the evaluation of an expression. In any expression involving side effects, there can be subtle dependencies on the order in which variables taking part in the expression are updated. One unhappy situation is typified by the statement

   a[i] = i++;

The question is whether the subscript is the old value of i or the new. Compilers can interpret this in different ways, and generate different answers depending on their interpretation. The standard intentionally leaves most such matters unspecified. When side effects (assignment to variables) take place within an expression is left to the discretion of the compiler, since the best order depends strongly on machine architecture. (The standard does specify that all side effects on arguments take effect before a function is called, but that would not help in the call to printf above.)


   a[i] = i++;

问题是:数组下标i是引用旧值还是引用新值?对这种情况编译器的解释可能不同,并因此产生不同的结果。C语言标准对大多数这类问题有意未作具体规定。表达式何时会产生这种副作用(对变量赋值),将由编译器决定,因为最佳的求值顺序同机器结构有很大关系。(ANSI C标准明确规定了所有对参数的副作用都必须在函数调用之前生效,但这对前面介绍的printf函数调用没有什么帮助。)

The moral is that writing code that depends on order of evaluation is a bad programming practice in any language. Naturally, it is necessary to know what things to avoid, but if you don't know how they are done on various machines, you won't be tempted to take advantage of a particular implementation.


TCPL/2.12_Precedence_and_Order_of_Evaluation (last edited 2008-02-23 15:35:53 by localhost)

ch3n2k.com | Copyright (c) 2004-2022 czk.