Algorithms and Data Structures

More documents

Recommendations

Info

N.Wirth. Algorithms and Data Structures. Oberon version 210 Appendix C. The Dijkstra loop E.W. Dijkstra [C.1] (see also [C.2]) introduced and justified a multibranch generalization of the conventional WHILE loop in his theory of systematic derivation of imperative programs. This loop proves convenient for expression and — most importantly — for verification of the algorithms which are usually expressed in terms of embedded loops, thus significantly reducing the effort of debugging. In the language Oberon-07 presented in [C.3], the syntax of this loop is defined as follows: WhileStatement = WHILE logical expression DO operator sequence {ELSIF logical expression DO operator sequence} END. If any of the logical expressions (guards) is evaluated to TRUE then the corresponding operator sequence is executed. The evaluation of the guards and the execution of the corresponding operator sequences is repeated until all guards evaluate to FALSE. So, the postcondition for this loop is the conjunction of negations of all guards. Example: WHILE m > n DO m := m - n ELSIF n > m DO n := n - m END Postcondition: ~(m > n) & ~(n > m), which is equivalent to n = m. The loop invariant must hold at the beginning and at the end of each branch. Roughly speaking, an n-branch Dijkstra loop corresponds to constructions with n usual loops that are somehow embedded one into another. The advantage of the Dijkstra loop is due to the fact that all the logic of an arbitrarily complex loop is expressed at the same level and is radically clarified, so that algorithms with various cases of embedded interacting ("braided") loops receive a completely uniform treatement. An efficient way to construct such a loop consists in enumerating all possible situations that can emerge, describing them by the corresponding guards, and for each guard — independently of the others — constructing operations that advance the algorithm towards its goal, togethers with the operations that restore the invariant. The enumeration of the guards is stopped when the disjunction (OR) of all guards covers the assumed precondition of the loop. It is useful to remember that the task of construction of a correct loop is simplified if one postpones worrying about the order of evaluation of the guards and execution of the branches, optimizations of evaluation of the guards etc., until the loop is correctly constructed. Such lower-level optimizations are rarely significant, and their implementation is greatly simplified when the correctness of a complicated loop has already been ensured. Although in Dijkstra's theory the order of guard evaluations is undefined, in this book the guards are assumed to be evaluated (and branches selected for execution) in their textual order. In most programming languages the Dijkstra loop has to be modelled. In the older versions of Oberon (including Component Pascal) it is sufficient to use the LOOP construct, with the body consisting of a multibranch IF operator that contains the single loop EXIT operator in the ELSE branch:
N.Wirth. Algorithms and Data Structures. Oberon version 211 LOOP IF logical expression THEN operator sequence {ELSIF logical expression THEN operator sequence} ELSE EXIT END END. In other languages the construct may be more cumbersome, but that is offset by the simplification of construction and debugging of complicated loops. References [C.1] E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976. [C.2] D. Gries. The Science of Programming. Springer-Verlag, 1981. [C.3] N. Wirth. The Programming Language Oberon. Revision 1.9.2007.
Page 1 and 2:
Algorithms and Data Structures © N
Page 3 and 4:
N.Wirth. Algorithms and Data Struct
Page 5 and 6:
Page 7 and 8:
Page 9 and 10:
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160: N.Wirth. Algorithms and Data Struct
Page 209: N.Wirth. Algorithms and Data Struct
show all

Algorithms and Data Structures

Create successful ePaper yourself

Delete template?

Save as template?