As noted in Figure 6.1, Fortran and Pascal give unary and binary minus the same level of precedence. Is this likely to lead to nonintuitive evaluations of certain expressions? Why or why not?

Figure 6.1:

Transcribed Image Text:

Fortran Pascal Ada ++, -- (post-inc., dec.) abs (absolute value), ++, -- (pre-inc., dec.), +, - (unary), &, * (address, contents of), !, - (logical, bit-wise not) * (binary), /, % (modulo division) not not, ** *, /, 7, mod, rem div, mod, and +, - (unary and binary) +, - (unary and binary), or +, - (binary) +, - (unary) -(bìnary), & (concatenation) くく,>> (left and right bit shift) =, /= , <, <=, >, >= .eq., .ne., .lt., .le., gt., - ge. (comparisons) く, <=, >, >=, く,く=, >, >= =, <>, IN (inequality tests) ==, != (equality tests) .not. & (bit-wise and) * (bit-wise exclusive or) | (bit-wise inclusive or) . and. &k (logical and) and, or, xor (logical operators) II (logical or) ?: (if... then...else) .or. .eqv., .neqv. (logical comparisons) =, +=, -=, *=, /=, %-, >>=, <<=, &=, =, 1= (assignment) , (sequencing)