&&
, , ,
, and ,
(the comma operator), there is a sequence point after the evaluation of the first operand.
C++ also contains the type conversion operators const_cast
, static_cast
, dynamic_cast
, and reinterpret_cast
. The formatting of these operators means that their precedence level is unimportant.
Most of the operators available in C and C++ are also available in other Table
For the purposes of these tables,a
, b
, and c
represent valid values (literals, values from variables, or return value), object names, or lvalues, as appropriate. R
, S
and T
stand for any type(s), and K
for a class type or enumerated type.
Arithmetic operators
All arithmetic operators exist in C and C++ and can be overloaded in C++.Comparison operators/relational operators
All comparison operators can be overloaded in C++.Logical operators
All logical operators exist in C and C++ and can be overloaded in C++, albeit the overloading of the logical AND and logical OR is discouraged, because as overloaded operators they behave as ordinary function calls, which means that ''both'' of their operands are evaluated, so they lose their well-used and expected short-circuit evaluation property.Bitwise operators
All bitwise operators exist in C and C++ and can be overloaded in C++.Assignment operators
All assignment expressions exist in C and C++ and can be overloaded in C++. For the given operators the semantic of the built-in combined assignment expressiona ⊚= b
is equivalent to a = a ⊚ b
, except that a
is evaluated only once.
Member and pointer operators
Other operators
Notes:Operator precedence
The following is a table that lists thea ? b, c : d
is interpreted as a ? (b, c) : d
, and not as the meaningless (a ? b), (c : d)
. So, the expression in the middle of the conditional operator (between ?
and :
) is parsed as if parenthesized. Also, note that the immediate, unparenthesized result of a C cast expression cannot be the operand of sizeof
. Therefore, sizeof (int) * x
is interpreted as (sizeof(int)) * x
and not sizeof ((int) * x)
.
Notes
The precedence table determines the order of binding in chained expressions, when it is not expressly specified by parentheses. * For example,++x*3
is ambiguous without some precedence rule(s). The precedence table tells us that: is 'bound' more tightly to than to , so that whatever does (now or later—see below), it does it ONLY to (and not to x*3
); it is equivalent to (++x
, x*3
).
* Similarly, with 3*x++
, where though the post-fix is designed to act AFTER the entire expression is evaluated, the precedence table makes it clear that ONLY gets incremented (and NOT 3*x
). In fact, the expression (tmp=x++
, 3*tmp
) is evaluated with being a temporary value. It is functionally equivalent to something like (tmp=3*x
, ++x
, tmp
).
* Abstracting the issue of precedence or binding, consider the diagram above for the expression 3+2*y +. The compiler's job is to resolve the diagram into an expression, one in which several unary operators (call them 3+( . ), 2*( . ), ( . )++ and ( . ) i are competing to bind to y. The order of precedence table resolves the final sub-expression they each act upon: ( . ) i acts only on y, ( . )++ acts only on y 2*( . ) acts only on y + and 3+( . ) acts 'only' on 2*((y ++). It is important to note that WHAT sub-expression gets acted on by each operator is clear from the precedence table but WHEN each operator acts is not resolved by the precedence table; in this example, the ( . )++ operator acts only on y by the precedence rules but binding levels alone do not indicate the timing of the postfix ++ (the ( . )++ operator acts only after y is evaluated in the expression).
Many of the operators containing multi-character sequences are given "names" built from the operator name of each character. For example, +=
and -=
are often called ''plus equal(s)'' and ''minus equal(s)'', instead of the more verbose "assignment by addition" and "assignment by subtraction".
The binding of operators in C and C++ is specified (in the corresponding Standards) by a factored language grammar, rather than a precedence table. This creates some subtle conflicts. For example, in C, the syntax for a conditional expression is:
Criticism of bitwise and equality operators precedence
The precedence of the bitwise logical operators has been criticized.. Conceptually, & and , are arithmetic operators like * and +. The expression is syntactically parsed as whereas the expression is parsed as . This requires parentheses to be used more often than they otherwise would. Historically, there was no syntactic distinction between the bitwise and logical operators. InC++ operator synonyms
C++ defines certain keywords to act as aliases for a number of operators: These can be used exactly the same way as the punctuation symbols they replace, as they are not the same operator under a different name, but rather simple token replacements for the ''name'' (character string) of the respective operator. This means that the expressions and have identical meanings. It also means that, for example, thebitand
keyword may be used to replace not only the ''bitwise-and'' operator but also the ''address-of'' operator, and it can even be used to specify reference types (e.g., ). The ISO C specification makes allowance for these keywords as preprocessor macros in the header file . For compatibility with C, C++ provides the header , the inclusion of which has no effect.
See also
*References
External links
* .