In the C99 standard, the expressions allow for precedence and associativity.
Precedence is documented quite well since the order in which the operators appear in the document are of reducing precedence, so function calls come before multiplicative operators which, in turn, come before additive operators.
However, I can't find a definitive description of the associativity, whether it's left or right. This is important since 35/5*2
would be 14
for one variant (35/5)*2
and 3
for the other variant 35/(5*2)
.
Section 6.5 Expressions /3, footnote 74
state:
The syntax specifies the precedence of operators in the evaluation of an expression, which is the same as the order of the major subclauses of this subclause, highest precedence first.
Within each major subclause, the operators have the same precedence. Left- or right-associativity is indicated in each subclause by the syntax for the expressions discussed therein.
However, taking the multiplicative case, for example:
6.5.5 Multiplicative operators
Syntax
multiplicative-expression:
cast-expression
multiplicative-expression * cast-expression
multiplicative-expression / cast-expression
multiplicative-expression % cast-expression
Constraints
Each of the operands shall have arithmetic type. The operands of the%
operator shall have integer type.
Semantics
The usual arithmetic conversions are performed on the operands.
The result of the binary*
operator is the product of the operands.
The result of the/
operator is the quotient from the division of the first operand by the second; the result of the%
operator is the remainder. In both operations, if the value of the second operand is zero, the behavior is undefined.
When integers are divided, the result of the/
operator is the algebraic quotient with any fractional part discarded. If the quotienta/b
is representable, the expression(a/b)*b + a%b
shall equala
.
I can see nothing in there that mentions the associativity, nor does there seem to be any default setting elsewhere in the standard.
Am I missing something here?
Operator associativity isn't specified explicitly as “right-associative” or “left-associative”. You deduce it from the grammar. In your example, the multiplicative-expression
term refers to itself recursively, and the recursion is on the left-hand side of the operator. That means that a parser encountering a * b * c
must parse a * b * c
like (a * b) * c
, which is left-associative.
The assignment-expression
term (6.5.16) has this grammar:
assignment-expression:
conditional-expression
unary-expression assignment-operator assignment-expression
So a parser encountering a = b = c
has to parse it like a = (b = c)
, which is right-associative.
The grammar itself specifies associativity, by the productions used:
multiplicative-expression:
cast-expression
multiplicative-expression * cast-expression
This means that in a * b * c
, c
must be parsed as a cast-expression
, and a * b
as one multiplicative-expression
, before further parsing of a * b
itself. Thus the left-associativity of multiplication is forced into the syntax-tree by the parsing rules.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With