A Comparison of Multilevel break and next Statements

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Comparison of Multilevel break and next Statements

Full text

Pdf (736 KB)

Source

Journal of the ACM (JACM) archive
Volume 26 , Issue 3 (July 1979) table of contents

Pages: 555 - 566

Year of Publication: 1979

ISSN:0004-5411

Authors

Brenda S. Baker	Department of Computer and Communication Sciences, 2076 Frieze Building, University of Michigan, Ann Arbor, MI and Bell Laboratories, Murray Hill, New Jersey
S. Rao Kosaraju	Department of Electrical Engineering, Johns Hopkins University, Baltimore, MD

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 25, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322139.322151 What is a DOI?

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	ASHCROFT, E, AND MANNA, Z Translating program schemas to while-schemas SIAM J Comptg. 4, 2 (1975), 125-146
	2	Brenda S. Baker, An Algorithm for Structuring Flowgraphs, Journal of the ACM (JACM), v.24 n.1, p.98-120, Jan. 1977 [doi>10.1145/321992.321999]
	3	Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966 [doi>10.1145/355592.365646]
	4	J. Bruno , K. Steiglitz, The Expression of Algorithms by Charts, Journal of the ACM (JACM), v.19 n.3, p.517-525, July 1972 [doi>10.1145/321707.321720]
	5	David C. Cooper, Böhm and Jacopini's reduction of flow charts, Communications of the ACM, v.10 n.8, p.463, Aug. 1967 [doi>10.1145/363534.363539]
	6	Edsger W. Dijkstra, Letters to the editor: go to statement considered harmful, Communications of the ACM, v.11 n.3, p.147-148, March 1968 [doi>10.1145/362929.362947]
	7	KNUTH, D E., AND FLOYD, R W Notes on avoiding "go to" statements Inform Proc Letters 1 (1971), 23- 31
	8	KOSARA.IU, S R Analysis of structured programs J Comptr Syst Sct 9, 3 (1974), 232-254
	9	Henry F. Ledgard , Michael Marcotty, A genealogy of control structures, Communications of the ACM, v.18 n.11, p.629-639, Nov. 1975 [doi>10.1145/361219.361222]
	10	MANNA, A. Program schemas. In Aho, A V, Ed, Currents m the Theory of Computing, Prenace-HaU, Englewood Chffs, N J, 1973, pp. 90-142.
	11	W. W. Peterson , T. Kasami , N. Tokura, On the capabilities of while, repeat, and exit statements, Communications of the ACM, v.16 n.8, p.503-512, Aug. 1973 [doi>10.1145/355609.362337]

CITED BY 4

	David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980
	Lyle Ramshaw, Eliminating go to's while preserving program structure, Journal of the ACM (JACM), v.35 n.4, p.893-920, Oct. 1988
	J. L. Wagener, Loop constructs - a design for Fortran, Proceedings of the 1979 annual conference, p.170-174, January 1979
	Thuy Duong Vu, Goto elimination in program algebra, Science of Computer Programming, v.73 n.2-3, p.95-128, October, 2008