|
|||||||||||||||||||||||||
|
|||||||||||||||||||||||||
ABSTRACT
This paper suggests an extension of decision tables and finite automata to more general table-driven problem solvers. The basic idea is that when a problem description is changed, only the contents table directing the flow of control and actions taken by a program need be modified and not the actual code. Program actions may be changed easily and documentation and program reliability improved. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
|
|||||||||||||||||||||||||