Structured Programming with go to Statements

ACM Computing Surveys (CSUR)

Volumn 6, Issue 4, 1974, Pages 261-301

  Knuth, Donald E ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Boolean variables; efficiency; event indicators; go to statements; iteration; language design; optimization of programs; program manipulation systems searching; program transformations; Quieksort; recursion; structured programming

Indexed keywords

STRUCTURED PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 0016354647     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356635.356640     Document Type: Article

References (104)

1. Ashcroft, Edward, And Manna, Zohar. “The translation of ‘go to’ programs to ‘while’ programs,” Proc, IFIP Congress 1971 Vol. 1, North-Holland Publ. Co., Amsterdam, The Netherlands, 1972, 250-255.
2. Baker, Charles L. “Review of D. D. McCracken, Digital computer programming,” Math. Comput. 11 (1957), 298-305.
3. Baker, F. Terry, And Mills, Harlan D. “Chief programmer teams,”Datamation 19, 12 (December 1973), 58 61.
4. Barron, D. W. Recursive techniques in programming, American Elsevier, New York, 1968, 64 pp.
5. Bauer, F. L. “A philosophy of programming,” University of London Special Lectures in Computer Science (October 1973): Lecture notes published by Math. Inst., Tech. Univ. of Munich, Germany.
6. Berry, Daniel M. “Loops with normal and abnormal exits,” Modeling and Measurement Note 23, Computer Science Department, Univ. California, Los Angeles, Calif. 1974, 39 pp.
7. Bochmann, G. V. “Multiple exits from a loop without the GOTO,” Comm. ACM 16, 7 (July 1973), 443-444.
8. Böhm, Corrado And Jacopini, Guiseppe. “Flow-diagrams, Turing machines, and languages with only two formation rules,” Comm. ACM 9, 5 (May 1966), 366-371.
9. Brown, John R. “In memoriam.” un-published note, January 1974.
10. Bruno J., And Stieglitz, K. “The expression of algorithms by charts,” J. ACM 19, 3 (July 1972), 517-525.
11. Burkhard, W. A. “Nonrecursive tree traversal algorithms,” in Proc. 7th Annual Princeton Conf. on Information Sciences and Systems, Princeton Univ. Press, Princeton, N.J., 1973, 403-405.
12. Cheatham, T. E., Jr., And Wegbreit, Ben. “A laboratory for the study of automating programming” in Proc. AFIPS 1972 Spring Joint Computer Conf., Vol. 40, AFIPS Press, Montvale, N.J., 1972, 11-21.
13. Clark, R. Lawrence. “A linguistic contribution to COTO-less programming,” Datamation 19, 12 (December 1973), 62-63.
14. Clint, M., And Hoare, C. A. R. “Program proving: jumps and functions,” Acta Informatica 1, 3 (1972), 214-224.
15. Cooper, D. C. “The equivalence of certain computations,” Computer J. 9, 1 (May 1966), 45-52.
16. Cooper, D. C. “Böhm and Jacopini’s reduction of flow charts,” Comm. ACM 10, 8 (August 1967), 463, 473.
17. Dahl, O.-J., Dijkstra, E. W., And Hoare, C. A. R. Structured programming, Academic Press, London, England, 1972, 220 pp.
18. Darlington, J., and Burstall, R. M. “A system which automatically improves programs,” in Proc. 3rd Internll. Conf. on Artificial Intelligence, Stanford Univ., Stanford, Calif., 1973, 479-485.
19. De Marneffe, Pierre-Arnoul. “Holon Programming: A Survey,” Universite De Liege, Service Informatique, Liege, Belgium, 1973, 135 PP.
20. Dijkstra, E. W. “Recursive programming,” Numerische Mathematik 2, 5 (1960), 312-318.
21. Dijkstra, E. W. “Programming considered as a human activity,” in Proc. IFIP Congress 1965, North-Holi and Publ. Co., Amsterdam, The Netherlands, 1965, 213-217.
22. Dijkstra, E. W. “A constructive approach to the problem of program correctness,” BIT 8, 3 (1968), 174-186.
23. Dijkstra, E. W. “Go to statement considered harmful,” Comm. ACM 11, 3 (March 1968), 147-148, 538, 541.
24. Dijkstra, E. W. “Solution of a problem in concurrent programming control,” Comm. ACM 9, 9 (September 1968), 569.
25. Dijkstra, E. W. “Structured programming,” in Software engineering techniques, J. N. Buxton and B. Randell [Eds.] NATO Scientific Affairs Division, Brussels, Belgium, 1970, 84-88.
26. Dijkstra, E. W. “EWD316: A short introduction to the art of programming,” Technical University Eindhoven, The Netherlands, August 1971, 97 pp.
27. Dijkstra, E. W. “The humble programmer,” Comm. ACM 15, 10 (October 1972), 859-866.
28. Dijkstra, E. W. “Prospects for a better programming language,” in High level languages, C. Boon [Ed]., Infotech State of the Art Report 7, 1972, 217-232.
29. Dijkstra, E. W. personal communication, January 3, 1973.
30. Dijkstra, E. W. personal communication, November 19, 1973.
31. Dijkstra, E. W. personal communication, January 30, 1974.
32. Donaldson, James A. “Structured programming,” Datamation 19, 12 (December 1973), 52-54.
33. Dylan, Bob. Blonde on blonde, record album produced by Bob Johnston, Columbia Records, New York, March 1966, Columbia C2S 841.
34. Gill, Stanley. “Automatic computing: Its problems and prizes,” Computer J. 8, 3 (October 1965), 177-189.
35. Henderson, P. and Snowdon, R. “An experiment in structured programming,” BIT 12, 1 (1972), 38-53.
36. Hoare, C. A. R. “Quicksort,” Computer J. 5, 1 (1962), 10-15.
37. Hoare, C. A. R. “An axiomatic approach to computer programming,” Comm. ACM 12, 10 (October 1969). 576-580, 583.
38. Hoare, C. A. R. “Proof of a program: FIND,” Comm. ACM 14, 1 (January 1971), 39-45.
39. Hoare, C. A. R. “A note on the for statement,” BIT 12, 3 (1972), 334-341.
40. Hoare, C. A. R. ‘Prospects for a better programming language,’ In High level languages, C. Boon [Ed.], Infotech State of the Art Report 7, 1973, 337-343.
41. Hoare, C. A. R., And Wirth, N. “An axiomatic definition of the programming language PASCAL,” Acta Informatica 2, 4 (1973), 335-355.
42. Hoare, C. A. R. “Hints for programming language design,” Computer Science report STAN-CS-74-403, Stanford Univ., Stanford, Calif., January 1974, 29 pp.
43. Hopkins, Martin E. “Computer aided software design,” in Software engineering techniques, J. N. Buxton and B. Randell [Eds.] NATO Scientific Affairs Division, Brussels, Belgium, 1970, 99-101.
44. Hopkins, Martin E. “A ease for the GOTO,” Proc. ACM Annual Conference Boston, Mass., August 1972, 787-790.
45. Hull, T. E. “Would you believe structured FORTRAN” SIGNUM Newsletter 8, 4 (October 1973), 13-16.
46. Ingalls, Dan. “The execution time profile as a programming tool,” in Compiler optimization, 2d Courant Computer Science Symposium, Randall Rustin [Ed.], Prentice-Hall, Englewood Cliffs, N. J., 1972, 107-128.
47. Kelley, Robert A., And Walters, John R. “APLGOL-2, a structured programming system for APL,” IBM Palo Alto Scientific Center report 320-3318 (August 1973), 29 pp.
48. Kleene, S. C. “Representation of events in nerve nets,” in Automata Studies, C. E. Shannon and J. McCarthy [Eds.], Princeton University Press, Princeton, N.J., 1956, 340.
49. Knuth, Donald E. “Runcible—Algebraic translation on a limited computer,” Comm. ACM 2, 11 (November, 1959), 18-21.
50. Knuth, Donald E. Fundamental algorithms, The art of computer programming, Vol. 1, Addison-Wesley, Reading, Mass. 1968 2d ed., 1973, 634 pp.
51. Knuth, Donald E. “An empirical study of FORTRAN programs,” Software—Practice and Experience 1, 2 (April-June 1971), 105-133.
52. Knuth, Donald E., And Floyd, Robert W. “Notes on avoiding ‘go to’ statements,” Information Processing Letters 1, 1 (February 1971), 23-31, 177.
53. Knuth, Donald E. “George Forsythe and the development of Computer Science,” Comm. ACM 15, 8 (August 1972), 721-726.
54. Knuth, Donald E. Sorting and searching, The art of computer programming, Vol. 3, Addison-Wesley, Reading, Mass., 1973, 722.
55. Knuth, Donald E. “A review of ‘structured programming’,” Stanford Computer Science Department report STAN-CS-73-371, Stanford Univ., Stanford, Calif., June 1973, 25 pp.
56. Knuth, Donald E., And Szwarcfiter, Jayme L. “A structured program to generate all topological sorting arrangements,” Information Processing Letters 2, 6 (April 1974) 153-157.
57. Kosaraju, S. Rao. “Analysis of structured programs,” Proc. Fifth Annual ACM Symp. Theory of Computing, (May 1973), 240-252.
58. J. Computer and System Sciences, 9, 3 (December 1974).
59. Landin, P. J. “A correspondence between ALGOL 60 and Church’s lambda-notation: part 1,” Comm. ACM 8, 2 (February 1965), 89-101.
60. Landin, P. J. “The next 700 programming languages,#x201D; Comm. ACM 9, 3 (March 1966), 157-166.
61. Leavenworth, B. M. “Programming with(out) the GOTO,” Proc. ACM Annual Conference, Boston, Mass., August 1972, 782-786.
62. Manna, Zohar, And Waldinger, Richard J. “Towards automatic program synthesis,” in Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics 188, E. Engeler [Ed.], Springer-Verlag, New York, 1971, 270-310.
63. McCarthy, John. “Recursive functions of symbolic expressions and their computation by machine, part I,” Comm. ACM 3, 4 (April 1960), 184-195.
64. McCarthy, John. “Towards a mathematical science of computation,” in Proc. IFIP Congress 1962, Munich, Germany, North-Holland Publ. Co., Amsterdam, The Netherlands, 1963, 21-28.
65. McCracken, Daniel D. “Revolution in programming,” Datamation 19, 12 (December 1973), 50-52.
66. McKeeman, W. M.; Horning, J. J.; and Wortman, D. B. A compiler generator, Prentice-Hall, Englewood Cliffs, N. J., 1970, 527 pp.
67. Millay, Edna ST. Vincent. “Elaine” cf. Bartlett’s Familiar Quotations.
68. Miller, Edward F., Jr., And Lindamood, George E. “Structured programming: top-down approach,” Datamation 19, 12 (December 1973), 55-57.
69. Mills, H. D. “Top-down programming in large systems,” in Debugging techniques in large systems, Randall Rustin [Ed.], Prentice-Hall, Englewood Cliffs, N. J., 1971, 41-55.
70. Mills, H. D. “Mathematical foundations for structured programming,” report FSC 72-6012, IBM Federal Systems Division, Gaithersburg, Md. (February 1972), 62 pp.
71. Mills, H. D. “HOW to write correct programs and know it,” report FSC 73-5008, IBM Federal Systems Division, Gaithersburg, Md. (1973), 26 pp.
72. Nassr, I. R., And Akkoyunlu, E. A. “Verification techniques for a hierarchy of control structures,” Tech. report 26, Dept, of Computer Science, State Univ. of New York, Stony Brook, New York (January 1974), 48 pp.
73. Naur, Peter [Ed.] “Report on the algorithmic language ALGOL 60,” Comm. ACM 3, 5 (May 1960), 299-314.
74. Naur, Peter. “Go to statements and good Algol style,” BIT 3, 3 (1963), 204-208.
75. Naur, Peter. “Program translation viewed as a general data processing problem,” Comm. ACM 9, 3 (March 1966), 176-179.
76. Naur, Peter. “An experiment on program development,” BIT 1, 3 (1972), 347-365.
77. Pager, D. “Some notes on speeding up certain loops by software, firmware, and hardware means,” in Computers and automata, Jerome Fox [Ed.], John Wiley & Sons, New York 1972, 207-213.
78. Ieee Trans. Computers, C-21, 1 (January 1972) 97-100.
79. Peterson, W. W.; Kasami, T.; And Tokura, N. “On the capabilities of while, repeat, and exit statements,” Comm. ACM 16, 8 (August 1973), 503-512.
80. Peterson, W. Wesley, personal communication, April 2, 1974.
81. Rain, Mark And Holager, Per. “The present most recent final word about labels in MARY,” Machine Oriented Languages Bulletin 1, Trondheim, Norway (October 1972), 18-26.
82. Reid, Constance, Hilbert, Springer-Verlag, New York, 1970, 290 pp.
83. Reynolds, John. “Fundamentals of structured programming,” Systems and Info. Sci. 555 course notes, Syracuse Univ., Syracuse, N.Y., Spring 1973.
84. Satterthwaite, E. H. “Debugging tools for highlevel languages,” Software—Practice and Experience 2, 3 (July-September 1972), 197-217.
85. Schneck, P. B., And Angel, Ellinor. “A Fortran to Fortran optimizing compiler,” Computer J. 16, 4 (1973), 322-330.
86. Schorre, D. V. “META-II—a syntax-directed compiler writing language,” Proc. ACM National Conference, Philadelphia, Pa., 1964, paper D1.3.
87. Schorre, D. V. “Improved organization for procedural languages,” Tech, memo TM 3086/002/60, Systems Development Corp., Santa Monica, Calif., September 8, 1966, 8 pp.
88. Shigo, O.; Shimomura, T.; Fujidayashi S.; And Maejima, T. “SPOT: an experimental system for structured programming” (in Japanese), Conference Record, Information Processing Society of Japan, 1973.
89. Strachey, C. “Varieties of programming language,” in High level languages, C. Boon [Ed.], Infotech State of the Art Report 7, 1972, 345-362.
90. Strong, H. R. Jr. “Translating recursion equations into flowcharts,” J. Computer and System, Sciences 5, 3 (June 1971), 254-285.
91. Teitelman, W. “Toward a programming laboratory,” in Software Engineering Techniques, J. N. Buxton and B. Randall [Eds.], Nato Scientific Affairs Division, Brussels, Belgium, 1970, 137-149.
92. Teitelman, W. et-al. “INTERLISP reference manual,” Xerox Palo Alto Research Center, Palo Alto, Calif., and Bolt Beranek and Newman, Inc., 1974.
93. Walker, S. A., and Strong, H. R. “Characterizations of flowchartable recursions,” J. Computer and System Sciences 7, 4 (August 1973), 404-447.
94. Wegner, Eberhard. “Tree-structured programs,” Comm. ACM 16, 11 (November 1973), 704-705.
95. Weinberg, Gerald M. “The psychology of improved programming performance,” Datamation 17, 11 (November 1972), 82-85.
96. Wirth, N. “On certain basic concepts of programming languages,” Stanford Computer Science Report CS 65, Stanford, Calif. (May 1967), 30 pp.
97. Wirth, N. “PL 360,: a programming language for the 360 computers,” J. ACM 15, 1 (January 1968), 37-74.
98. Wirth, N. “Program development by stepwise refinement,” Comm. ACM 14, 4 (April 1971), 221-227.
99. Wirth, N. “The programming language Pascal,” Acta Informatica 1, 1 (1971), 35-63.
100. Wulf, W. A.; Russell, D. B.; and Habermann, A. N. “Bliss: A language for systems programming,” Comm. ACM 14, 12 (December 1971), 780-790.
101. Wulf, W. A. “Progamming without the goto,” Information Processing 71, Proc, IFIP Congress, Vol. 1, North-Holland Publ. Co., Amsterdam, The Netherlands, 1971, 408-413.
102. Wulf, W. A. “A case against the GOTO,” Proc. ACM 1972 Annual Conference, Boston, Mass. (August 1972), 791-797.
103. Wulf, W. A.; Johnson, Richard K.; Wein-Stock, Charles P.; and Hobbs, Steven O. “The design of an Optimizing compiler,” Computer Science Department report, Carnegie-Mellon Univ., Pittsburgh, Pa., (December 1973), 163 pp.
104. Zahn, Charles T. “A control statement for natural top-down structured programming,” presented at Symposium on Programming Languages, Paris, 1974.