Affiliation:
1. Univ. of Massachusetts, Amherst
Abstract
The issue of program control structures has had a history of heated controversy. To put this issue on a solid footing, this paper reviews numerous theoretical results on control structures and explores their practical implications.
The classic result of Böhm and Jacopini on the theoretical completeness of if-then-else and while-do is discussed. Several recent ideas on control structures are then explored. These include a review of various other control structures, results on time/space limitations, and theorems relating the relative power of control structures under several notions of equivalence.
In conclusion, the impact of theoretical results on the practicing programmer and the importance of one-in, one-out control structures as operational abstractions are discussed. It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Allen F.E. and Cocke J. A catalogue of optimizing transformations. In Randall Rustin (Ed.) Compiler Optimization. 5tb Courant Computer Science Symposium Prentice-Hall Englewood Cliffs N.J. 1972 (pp. 1-30).]] Allen F.E. and Cocke J. A catalogue of optimizing transformations. In Randall Rustin (Ed.) Compiler Optimization. 5tb Courant Computer Science Symposium Prentice-Hall Englewood Cliffs N.J. 1972 (pp. 1-30).]]
2. Multiple exits from a loop without the GOTO
3. Flow diagrams, turing machines and languages with only two formation rules
4. The Expression of Algorithms by Charts
Cited by
67 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献