> Why is the precedence of .EQV. the second lowest and not the same
> as ==? Naively I would consider A.eqv.B a relational expression
> with logical result.
Seems entirely consistent to me...
> Just as a reminder for those without a manual at hand:
> Operator Precedence
> def unary highest
> ** . |
> * or / . |
> unary + or - . | A
> binary + or - . |
> // . |
> ==, /=, <, etc. . <--- v
> .not. . |
> .and. . | B
> .or. . |
> .eqv., .neqv. . <---- v
> def binary lowest
>
The sequences A and B are what I want.
a + b == c - d
l .and. m .equiv. n .or. o
If I had == as part of a subexpression of a logical expression I am sure
that I would want it to have higher precedence than .equiv..
Harvey
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|