Tree-structured programs

1 November 1973

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 16 (11) , 704-705
https://doi.org/10.1145/355611.362547

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.

Keywords

UNRESTRICTED GOTO
PROGRAM DOCUMENTATION
SEMANTICS OF PROGRAMMING LANGUAGES
STRUCTURED PROGRAMMING
INDUCTIVE ASSERTION
<U>GOTO</U> STATEMENTS
TREE-STRUCTURED PROGRAM
PROGRAMMING LANGUAGE DESIGN
GOTO STATEMENTS
OPTIMIZATION IN COMPILERS
LEAST FIXPOINTS
PROGRAM FLOW GRAPHS
CONTROL STRUCTURES
FLOWCHARTS
PROOFS OF PROGRAMS
PROOF OF PROGRAMS
CONTROL STRUCTURE
TREE STRUCTURE

This publication has 5 references indexed in Scilit:

Fixpoint approach to the theory of computation
Communications of the ACM, 1972
Flow Graph Reducibility
SIAM Journal on Computing, 1972
Program proving: Jumps and functions
Acta Informatica, 1972
BLISS
Communications of the ACM, 1971
Notes on avoiding “go to” statements
Information Processing Letters, 1971