ACM Home Page
Please provide us with feedback. Feedback
Table-driven problem solvers
Full text PdfPdf (267 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 18th annual Southeast regional conference table of contents
Tallahassee, Florida
SESSION: General topics in computer science I - GCS I table of contents
Pages: 32 - 36  
Year of Publication: 1980
ISBN:0-89791-014-1
Authors
David S. Burris  Sam Houston State University, Huntsville, TX
Kurt Schember  University of Texas Arlington, Arlington, TX
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/503838.503852
What is a DOI?

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.

1
2

Collaborative Colleagues:
David S. Burris: colleagues
Kurt Schember: colleagues