A simple (?) question:
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.
Would a higher precedence lead to ambiguities, hence the
current rules are the only sensible ones, or are the Fortran rules
just one possible definition?
I could define my own operators but that wouldn't raise
the precedences, but rather the opposite.
Just as a reminder for those without a manual at hand:
Operator Precedence
def unary highest
** .
* or / .
unary + or - .
binary + or - .
// .
==, /=, <, etc. . <---
.not. .
.and. .
.or. .
.eqv., .neqv. . <----
def binary lowest
Cheers,
WWS
-----------------------------------------------------------------------
| Werner W Schulz |
| Dept of Chemistry email: [log in to unmask] |
| University of Cambridge Phone: (+44) (0)1223 336 502 |
| Lensfield Road Secretary: 1223 336 338 |
| Cambridge CB2 1EW Fax: 1223 336 536 |
| United Kingdom WWW: |
-----------------------------------------------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|