Affiliation:
1. Michigan State University
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference7 articles.
1. Utilization of a decision table translator for basic program creation
2. Decision Tables as a Basis of a Programming Language;Devine D. J.;DPMA Quarterly,1965
3. Dahl O. J. Dijkstra E. W. Hoare C.A.R. Structured Programming Academic Press 1972. Dahl O. J. Dijkstra E. W. Hoare C.A.R. Structured Programming Academic Press 1972.
4. What should we teach in an introductory programming course?
5. Structured Programming with
go to
Statements
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献