An algorithmic language interpreter is presented which provides users of various technical backgrounds a convenient way to describe algorithms and simultaneously focus on problem-solving concepts: problem analysis, algorithm development, and the computer implementation of the algorithm. The interpreter permits the use of decision tables as a means of expressing complex logic.
In view of the significance of structured programming in today's environment (and that of the future), the language processor allows three logical constructs: sequential, IF... THEN...ELSE..., and the DO WHILE construct. The use of GO TOs is only allowed to transfer control from one table to another. Hence, several tables/subtables (each may contain 1 decision table) may be required for the description of an algorithm. Examples are presented to illustrate how the language interpreter enhances programming organization and thereby facilitates structured programming.
[1]
David Gries,et al.
What should we teach in an introductory programming course?
,
1974,
SIGCSE '74.
[2]
J. M. Yohe.
An Overview of Programming Practices
,
1974,
CSUR.
[3]
Niklaus Wirth,et al.
On the Composition of Well-Structured Programs
,
1974,
CSUR.
[4]
Donald E. Knuth,et al.
Structured Programming with go to Statements
,
1974,
CSUR.
[5]
Edsger W. Dijkstra,et al.
Structured programming
,
1972,
A.P.I.C. Studies in data processing.
[6]
Henry O. Arnold.
Utilization of a decision table translator for basic program creation
,
1971,
SIGP.