Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/conversion-of-limited-entry-decision-tables-to-computer-programs-TyWt0YgGVR
References (1)
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1965 by ACM Inc.
- ISSN
- 0001-0782
- DOI
- 10.1145/365660.365681
- Publisher site
- See Article on Publisher Site
Abstract
D. T E I C H R O E W , Editor l version of Linfited-Entrv d " a ¢s m n T a bl e s t o C o m p u t e r t grams " t- dON L. POLLACK :~ IAND Corporation, Sar~ta Monica, Calijbrnia ision tables are useful for describing a set of complex ,n rules based on given sets of conditions. Algorithms that Ticiently convert the tables into computer programs will I the usefulness of decision tables to computer users. Two gorithms, based on work done by M. S. Montalbano, a r e ~ed and extended here to handle dashes and ELSEm rules. The first algorithm minimizes the computer storage required for the resultant program, the second minimizes ter running time. During the conversion process, both nt any contradictions or redundancies among the rules in The a wfilabilily of these algorithms gives the computer programmer a choice between the two for each of his decision tables. For example, the programmer might speei:fy the first algorithm :for those tables executed only a :few times, thus possibly sacrificing some computer running time to reduce the amount of memory storage required for his program.
Journal
Communications of the ACM – Association for Computing Machinery
Published: Nov 1, 1965