Structured Programming With and Without go to Statements

Author

Elgot, Calvin C.

Author_Institution

Department of Mathematical Sciences, IBM Thomas J. Watson Research Center

Issue

1

fYear

1976

fDate

3/1/1976 12:00:00 AM

Firstpage

41

Lastpage

54

Abstract

While "Dijkstra flow-chart schemes" (built out of assignment statement schemes by means of composition, IF—THEN and WHILEDO) are simple and perspicuous, they lack the descriptive power of flow-chart schemes (provided additional "variables" are not permitted). On the other hand, the analogous multiexit composition binary alternation-conditional iteration (CACI) schemes introduced below, which are virtually as simple and perspicuous as Dijkstra schemes, describe exactly the same computational processes as flow-chart schemes (without the aid of additional variables).

Keywords

Algebra of flow-chart schemes; Böhm–Jacoppini theorem; Dijkstra program; composition; conditional iteration; flow-chart scheme; multientry; multiexit; structured programming; Algorithm design and analysis; Computer languages; Flowcharts; Merging; Terminology; Variable speed drives; Algebra of flow-chart schemes; Böhm–Jacoppini theorem; Dijkstra program; composition; conditional iteration; flow-chart scheme; multientry; multiexit; structured programming;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1976.233800

Filename

1702335