Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Structured Programming with go to Statements

Structured Programming with go to Statements S t r u c t u r e d P r o g r a m m i n g w i t h go to S t a t e m e n t s DONALD E. KNUTH Stanford University, Stanford, California 9~S05 A consideration of several different examples sheds new light on the problem of ereating reliable, well-structured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs clearly and efficiently without g o t o statements; (b) a methodology of program design, beginning with readable and correct, but possibly inefficient programs that are systematically transformed if necessary into efficient and correct, but possibly less readable code. The discussion brings out opposing points of view about whether or not g o t o statements should be abolished; some merit is found on both sides of this question. Fina!ly, an attempt is made to define the true nature of structured programming, and to recommend fruitful directions for further study. Keywords and phrases: structured programming, g o t o statements, language design, event indicators, recursion, Boolean variables, iteration, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Computing Surveys (CSUR) Association for Computing Machinery

Structured Programming with go to Statements

ACM Computing Surveys (CSUR) , Volume 6 (4) – Dec 1, 1974

Loading next page...
 
/lp/association-for-computing-machinery/structured-programming-with-go-to-statements-IglwqWBt5K

References (101)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1974 by ACM Inc.
ISSN
0360-0300
DOI
10.1145/356635.356640
Publisher site
See Article on Publisher Site

Abstract

S t r u c t u r e d P r o g r a m m i n g w i t h go to S t a t e m e n t s DONALD E. KNUTH Stanford University, Stanford, California 9~S05 A consideration of several different examples sheds new light on the problem of ereating reliable, well-structured programs that behave efficiently. This study focuses largely on two issues: (a) improved syntax for iterations and error exits, making it possible to write a larger class of programs clearly and efficiently without g o t o statements; (b) a methodology of program design, beginning with readable and correct, but possibly inefficient programs that are systematically transformed if necessary into efficient and correct, but possibly less readable code. The discussion brings out opposing points of view about whether or not g o t o statements should be abolished; some merit is found on both sides of this question. Fina!ly, an attempt is made to define the true nature of structured programming, and to recommend fruitful directions for further study. Keywords and phrases: structured programming, g o t o statements, language design, event indicators, recursion, Boolean variables, iteration,

Journal

ACM Computing Surveys (CSUR)Association for Computing Machinery

Published: Dec 1, 1974

There are no references for this article.