ACM Home Page
Please provide us with feedback. Feedback
Multiple exits from a loop without the GOTO
Full text PdfPdf (189 KB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 7  (July 1973) table of contents
Pages: 443 - 444  
Year of Publication: 1973
ISSN:0001-0782
Author
G. V. Bochmann  Univ. of Montreal, P. Q., Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 32,   Citation Count: 18
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/362280.362300
What is a DOI?

ABSTRACT

For several years, there has been discussion about the use of the goto statement in programming languages [1, 2]. It has been pointed out that goto free programs tend to be easier to understand, allow better optimization by the compiler, and are better suited for an eventual proof of correctness. On the other hand, the goto statement is a flexible tool for many programmers. Most programming languages have constructs which allow the programmer to write control flows that occur frequently without the use of a goto. In particular, the language Pascal [3] contains, besides the goto, the following control structures: if-then-else, case, while-do, repeat-until, stepping loop. Wulf [4] has described the use of the construct “leave &lpargt;label⦔” in the language Bliss, where &lpargt;label⦔ is the name of a program section which is exited when the statement is executed. It is important to note that these constructs are invented to describe control flows that occur frequently in programs. They describe the flow on a higher level [5] than an equivalent construction using a goto would do.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
SIGPLAN 4. The go to controversy. Proc. ACM Ann. Conf., 1972, ACM, New York.
 
3
Wirth, N. The programming language Pascal. Acta Informatica 1 (1971), 35-63.
 
4
Wulf, W.A. Programming without the go to. Proc. 1971 IFIP Congress, Ljubljana, Yugovlania, Aug. 1971.
 
5
Dijkstra, E.W. Notes on structured programming, EWD 249, Technical U., Eindhoven, Netherlands, 1969.
 
6
Knuth, D.E., and Floyd, R.W. Notes on avoiding "goto" statements. In Information Processing Letters 1. North-Holland Pub. Co., Amsterdam, 1971, pp. 23-31.
 
7
Clint, M., and Hoare, C.A.R. Program proving: jumps and functions. Acta Informatica I (1972), 214.

CITED BY  18