ACM Home Page
Please provide us with feedback. Feedback
On the capabilities of while, repeat, and exit statements
Full text PdfPdf (1.02 MB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 8  (August 1973) table of contents
Pages: 503 - 512  
Year of Publication: 1973
ISSN:0001-0782
Authors
W. W. Peterson  Univ. of Hawaii, Honolulu, HI
T. Kasami  Osaka Univ., Osaka, Japan
N. Tokura  Osaka Univ., Osaka, Japan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 48,   Citation Count: 45
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/355609.362337
What is a DOI?

ABSTRACT

A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition is given for a well-formed flowchart. It is shown that a program is well formed if and only if it can be written with if, repeat, and multi-level exit statements for sequence control. It is also shown that if, while, and repeat statements with single-level exit do not suffice. It is also shown that any flowchart can be converted to a well-formed flowchart by node splitting. Practical implications are discussed.


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
Knuth, D.E., and Floyd, R.W. Notes on avoiding'GO TO' statements, blf. Proc. Letters I (1971), 23-31.
 
2
 
3
Wulf, W.A. Programming without the GOTO. IFIP 71 TA-3-84.
 
4
Ianov, Y.I. The logical schemes of algorithms. In Problems of Cybernetics, Vol. 1, English ed., Pergamon Press, New York, 1960, pp. 82-140.
 
5
 
6
McKeeman, W.M., Homing, J.J., and Wortman, D.B. A Compiler Generator. Prentice-Hall, Englewood Cliffs, N.J., 1970.
 
7
Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1968.
 
8
Cocke, J., and Miller, R. Some analysis techniques for optimizing computer programs. Proc. 2nd Int. Conf. of Syst. Sci., Hawaii, Jan. 1969.
 
9
Elspas, B., Green, M.W., and Levitt, K.N. Software reliability. Computer 4 (Jan. 1971), 21-27.
10
 
11
Lyons, T., and Bruno, J. An interactive system for program verification. Tech. Rep. No. 91, Dept. of E.E., Princeton U., Princeton, N.J., 1971.

CITED BY  45

Collaborative Colleagues:
W. W. Peterson: colleagues
T. Kasami: colleagues
N. Tokura: colleagues