Tree-structured programs

ABSTRACT

With this note I hope to bridge the gap between the adherents of structured programming and the devotees of the unrestricted goto. I describe a style of programming which combines the advantages of structured programming with nearly all the power of the jump.

REFERENCES

• 1: Dijkstra, E.W. Notes on structured programming. In: Structured Programming, Academic Press, London, 1972, pp. 1-82.
• 2: Knuth, D.E., and Floyd, R.W. Notes on avoiding goto statements. Information Processing Letters 1 (Feb. 1971), 23-31 and 177.
• 3: Ashcroft, E., and Manna, Z The translation of goto programs to while programs. IFIP Congress, Ljubljana, August 1971, preprint TA-2, pp. 147-152.
• 4: Clint, N., and Hoare, C.A.R. Program proving: jumps and functions, Acta Informatica 1 (1972), 214-224.
• 5: Zohar Manna , Jean Vuillemin, Fixpoint approach to the theory of computation, Communications of the ACM, v.15 n.7, p.528-536, July 1972 [doi>10.1145/361454.361460]
• 6: Hecht, M.S., and Ullman, J.D. Flow graph reducibility. SIAM J. Comput. 1 (June 1972), 188-202.
• 7: W. A. Wulf , D. B. Russell , A. N. Habermann, BLISS: a language for systems programming, Communications of the ACM, v.14 n.12, p.780-790, Dec. 1971 [doi>10.1145/362919.362936]

INDEX TERMS

Keywords:
control structures, flowcharts, goto statements, inductive assertion, least fixpoints, optimization in compilers, program documentation, program flow graphs, programming language design, proof of programs, semantics of programming languages, structured programming