Paper Info
Title
On the conversion of decision tables to computer programs
Abstract
The use of execution time diagnostics in pinpointing ambiguities in decision tables is discussed. It is pointed out that any attempt at resolving ambiguities at compile time will, in general, be impossible. It is shown that, as a consequence, tree methods of converting decision tables to programs are inadequate in regard to ambiguity detection. Two algorithms for programming decision tables whose merits are simplicity of implementation and detection of ambiguities at execution time are presented. The first algorithm is for limited entry decision tables and clarifies the importance of proper coding of the information in the decision table. The second algorithm programs a mixed entry decision table directly without going through the intermediate step of conversion to a limited entry form, thereby resulting in storage economy. A comparison of the algorithms and others proposed in the literature is made. Some features of a decision table to FORTRAN IV translator for the IBM 7044 developed by the authors are given.
Year
DOI
Venue
1970
10.1145/362384.362390
Commun. ACM
Keywords
Field
DocType
ambiguity detection,decision table,execution time,system analysis,limited entry form,programming decision table,limited entry decision table,mixed entry decision table,diagnostic aids,algorithm program,computer program,execution time diagnostics,fortran iv translator,business applications
Decision tree,IBM,Programming language,Decision table,Compile time,Computer science,Fortran,Coding (social sciences),Theoretical computer science,Ambiguity,Decision engineering
Journal
Volume
Issue
ISSN
13
6
0001-0782
Citations 
PageRank 
References 
14
10.27
6
Authors
2
Name
Order
Citations
PageRank
C. R. Muthukrishnan12813.90
V. Rajaraman21410.27