On program control structure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On program control structure

Full text

Pdf (459 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the annual conference table of contents

Atlanta, Georgia, United States

Pages: 119 - 125

Year of Publication: 1973

Author

Peter M. Neely

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references cited by index terms

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/800192.805692 What is a DOI?

ABSTRACT

The syntax of the DO-WHILE is revised so as to distinguish the semantics of logical control of iteration from those of site of test within the scope of the DO. The corresponding control graph (flowchart subdiagram) is shown to be a combination of previously used alternative forms. An indentation scheme is proposed in which the indentation rules are identical for both iterative and conditional statements. Furthermore the rules as given are identical for any programming language, whether it is a lower level language which requires hand coded book-keeping statements or some ideal language in which all loop control is provided for in the syntactic forms. The minimal sufficient set of program control structures is augmented with forms for the convenience of human program writers and readers. These forms all share common indentation rules corresponding to those used for the DO-WHILE and IF-THEN-ELSE. Last a form is provided for handling error conditions, POSIT-QUIT-ADMIT in which multiple QUITs are permitted. The indentation rules are compatible with the preceding rules.

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	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]
	2	Jackson, M. (1972). Advanced Program Design Techniques - Modular Programming Workshop. Student Handout for ACM Professional Development Seminar.
	3	Mills, H. D. (1972). Mathematical Foundations for Structured Programming. Chief Programmer Team Operations, Technical Report FSC 72-6012. IBM Federal Systems Division, Gaithersberg, Maryland.
	4	Neely, P. M. (1973). Fundamentals of Programming: elementary concepts. The Computation Center, University of Kansas, Lawrence, Kansas.
	5	Niklaus Wirth , C. A. R. Hoare, A contribution to the development of ALGOL, Communications of the ACM, v.9 n.6, p.413-432, June 1966 [doi>10.1145/365696.365702]

CITED BY 5

	John F. Schrage, Educator's view of structured concepts, Proceedings of the ACM 1980 annual conference, p.327-341, January 1980
	Henry F. Ledgard , Michael Marcotty, A genealogy of control structures, Communications of the ACM, v.18 n.11, p.629-639, Nov. 1975
	David Harel, On folk theorems, Communications of the ACM, v.23 n.7, p.379-389, July 1980
	David Harel, On folk theorems, ACM SIGACT News, v.12 n.3, Fall 1980
	Peter M. Neely, On the need for a scientific programming language, Proceedings of the 1974 annual ACM conference, January 01-01, 1974