The Expression of Algorithms by Charts
Journal of the ACM (JACM)
On the capabilities of while, repeat, and exit statements
Communications of the ACM
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Structured programming
Applications of Boolean matrices to the analysis of flow diagrams
IRE-AIEE-ACM '59 (Eastern) Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference
| Hi-index | 0.00 |
A method is described that allows the translation of a traditionally written (unstructured) program into a set of top-down structured, semantically founded, GoTo-free modules. The method reveals noont ly the logic of a given program in a most natural way, but it also reduces code duplication to a minimum. It is further shown how the obtained structured program can be mapped back into a GOTO program in such a way that all GOTOS are backwards branches and their number is minimal. The connection between recursively and iteratively structured programs is demonstrated using the WHILE, DO FOREVER, and multilevel EXIT statements. Extensions of the method show the structuring of source programs containingb lock structures and subroutines.