... Sakellariou1
Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, U.K.; email: rizos@cs.man.ac.uk
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
... loop 2
 This implies that the $j_2$ and/or $j_3$ loops may be surrounded by DO $\dots$ ENDDO loops which perform the same number of iterations regardless of the value of $i$; such loops may also exist in any of the five mentioned sets of statements.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
...$ non-zero~$3
 This restriction guarantees that the number of iterations of each inner loop depends on the value of the index of at least one of the surrounding loops.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.