table-driven problem solvers
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.
table-driven problem solvers decision tables finite automata