An Algorithm for Structuring Flowgraphs
Brenda S. Baker · Journal of the ACM · 1977
This paper describes an algorithm which transforms a flowgraph into a program containing control constructs such as if then else statements, repeat (do forever) statements, multilevel break statements (causing jumps out of enclosing repeats), and multilevel next statements (causing jumps to iterations of enclosing repeats). The algorithm can be extended to create other types of control constructs, such as while or until. The program appears natural because the constructs are used according to common programming practices. The algorithm does not copy code, create subroutines, or add new variables. Instead, goto statements are generated when no other available control construct describes the flow of control. The algorithm has been implemented in a program called STRUCT which rewrites Fortran programs using constructs such as while, repeat, and if then else statements. The resulting programs are substantially more readable than their Fortran counterparts.
Cited by 109 works. doi:10.1145/321992.321999 Open-access PDF
Authors
References
- The UNIX time-sharing system
- The UNIX time-sharing system
- structured programming
- Flow diagrams, turing machines and languages with only two formation rules
- Letters to the editor: go to statement considered harmful
- Structured Programming with go to Statements
- A system for typesetting mathematics
- Analysis of structured programs
- Characterizations of Reducible Flow Graphs
- Notes on avoiding “go to” statements