Smooth Programs and Languages.

Saved in:
Bibliographic Details
Title: Smooth Programs and Languages.
Authors: Foulk, Clinton R., Juelich, Otto C., Ohio State Univ., Columbus. Computer and Information Science Research Center.
Peer Reviewed: N
Page Count: 19
Publication Date: 1972
Sponsoring Agency: National Science Foundation, Washington, DC.
Report Number: OSU-CISRC-TR-72-13
Descriptors: Computer Programs, Computer Science, Flow Charts, Information Science, Programing Languages
Abstract: A smooth program is defined to be one which is "go to"-free in the sense that it can be represented by a flowchart consisting only of concatenation, alternation, and interation elements. Three methods of eliminating the "go to" statement from a program have been proposed: (1) the introduction of additional Boolean variables or the equivalent recomputation of certain quantities in the program, (2) the use of recursive procedure calls, and (3) replacement of the "go to" statement by a restricted form of the "go to" such as the "exit" or "leave" statement. We show that only the first of these is capable of transforming a non-smooth program into a smooth one, since strict application of the recursive procedure method requires the use of a so-called "null procedure" which is in fact also a restricted form of the "go to." (Author)
Notes: (10 References)
Journal Code: RIEMAY1973
Entry Date: 1973
Accession Number: ED071683
Database: ERIC
Description
Abstract:A smooth program is defined to be one which is "go to"-free in the sense that it can be represented by a flowchart consisting only of concatenation, alternation, and interation elements. Three methods of eliminating the "go to" statement from a program have been proposed: (1) the introduction of additional Boolean variables or the equivalent recomputation of certain quantities in the program, (2) the use of recursive procedure calls, and (3) replacement of the "go to" statement by a restricted form of the "go to" such as the "exit" or "leave" statement. We show that only the first of these is capable of transforming a non-smooth program into a smooth one, since strict application of the recursive procedure method requires the use of a so-called "null procedure" which is in fact also a restricted form of the "go to." (Author)