Communications of the ACM
Multiple exits from a loop without the GOTO
Communications of the ACM
On the capabilities of while, repeat, and exit statements
Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
LINUS: A structured language for instructional use
SIGCSE '74 Proceedings of the fourth SIGCSE technical symposium on Computer science education
Extensions to FORTRAN to support structured programming (ITRAN)
ACM SIGPLAN Notices - Abstracts in programming language-related research
Programming with(out) the GOTO
ACM SIGPLAN Notices - Special issue on control structures in programming languages
ACM SIGPLAN Notices - Special issue on control structures in programming languages
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Would you believe structured Fortran?
ACM SIGNUM Newsletter
Educator's view of structured concepts
ACM '80 Proceedings of the ACM 1980 annual conference
B4Tran: A structured mini-language approach to the teaching of Fortran
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
On extending Fortran control structures to facilitate structured programming
ACM SIGPLAN Notices
| Hi-index | 0.00 |
Program structure is inherent in program design; therefore special keywords such as "if... then ... else” or "do ... while” are useful only to the extent that they reveal that structure. A simple listing of Fortran program statements is ineffective for revealing program structure. Proposals have been made for manually inserting keywords, comments, indentations, etc., either during a separate preprocessing stage or during the normal coding process. We show how the flow graph can provide independent structural information. Although the flow graph may be said to exist as soon as a program has been designed, it is most readily generated from the program statements. “Bad” structure can be detected objectively, and “good” programs can be reconstituted to reveal their block structure more clearly. Our implementation is based on an algorithm suggested by Peterson et al (CACM, August 1973). We have extended this algorithm to automatically detect block exits.