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.
- 1 Arnold, H. O., "Utilization of a Decision Table Translator for Basic Program Creation," SIGPLAN NOTICES 61,8(Sept. 1971), 12-19. Google Scholar
Digital Library
- 2 Devine, D. J., "Decision Tables as a Basis of a Programming Language," DPMA Quarterly 7 (1965), 461-466.Google Scholar
- 3 Dahl, O. J., Dijkstra, E. W. Hoare, C.A.R., Structured Programming, Academic Press, 1972. Google Scholar
Digital Library
- 4 Gries, D., "What Should we Teach in an Introductory Programming Course?", Fourth Symposium on Computer Science Education 0,1(Feb. 1974), 81-89. Google Scholar
Digital Library
- 5 Knuth, D. E., "Structured Programming with go to statements," Computing Surveys 6,4(Dec. 1974) 261-301. Google Scholar
Digital Library
- 6 Wirth, N. "On the Composition of Well-Structured Programs", Computing Surveys 6,4(Dec. 1974) 247-259. Google Scholar
Digital Library
- 7 Yohe, J. M. "An Overview of Programming Practices", Computing Surveys 6,4(Dec. 1974) 221-245. Google Scholar
Digital Library
Index Terms
A tool designed to facilitate structured programming
Recommendations
A tool designed to facilitate structured programming
SIGCSE '77: Proceedings of the seventh SIGCSE technical symposium on Computer science educationAn 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 ...
Language Design for Program Manipulation
The design of procedural and object-oriented programming languages is considered with respect to how easily programs written in those languages can be formally manipulated. Current procedural languages such as Pascal, Modula-2 and Ada; generally support ...
Comments on "Language Design for Program Manipulation"
The paper by E.A.T. Merks et al. "Language design for program manipulation" identifies design principles for a procedural or object-oriented language whose programs will be easier to manipulate. However, it neglects to relate these design principles to ...






Comments