Conversion of limited-entry decision tables to computer programs—a proposed modification to Pollack's algorithm

Authors:
Keith Shwayder
Affiliations:
Univ. of Chicago, IL
Venue:
Communications of the ACM
Year:
1971

Citing 8
Cited 15

Parsing of decision tables

Communications of the ACM
Use of decision tables in computer programming

Communications of the ACM
Conversion of decision tables to computer programs

Communications of the ACM
Data, documentation, and decision tables

Communications of the ACM
On storage space of decision tables

Communications of the ACM
Conversion of limited-entry decision tables to computer programs

Communications of the ACM
Conversion of decision tables to computer programs by rule mask techniques

Communications of the ACM
An engineering application of logic-structure tables

Communications of the ACM

Comments on 'Algorithmic State Machine Design and Automatic Theorem Proving: Dual Approaches to the Same Activity'

IEEE Transactions on Computers
Optimal Partitioning for Classification and Regression Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Translation of Decision Tables

ACM Computing Surveys (CSUR)
Conversion of decision tables to efficient sequential testing procedures

Communications of the ACM
The synthetic approach to decision table conversion

Communications of the ACM
Combining decision rules in a decision table

Communications of the ACM
Extending the infomation theory approach to converting limited-entry decision tables to computer programs

Communications of the ACM
Conversion of decision tables by rule mask method without rule mask

Communications of the ACM
The conversion of limited-entry decision tables to optimal and near-optimal flowcharts: two new algorithms

Communications of the ACM
Information theory applied to the conversion of decision tables to computer programs

Communications of the ACM
Application of Information Theory to Sequential Fault Diagnosis

IEEE Transactions on Computers
Compiling optimized code from decision tables

IBM Journal of Research and Development
Information theory-based code optimization of matrix elements for overall rotation angular momenta

BIOCOMPUCHEM'09 Proceedings of the 3rd WSEAS International Conference on Computational Chemistry
Evaluation and optimal computation of angular momentum matrix elements: an information theory approach

WSEAS Transactions on Information Science and Applications
Technology for automatic generation of application programs: a pragmatic view

MIS Quarterly

Quantified Score

Hi-index	48.33

Visualization

Abstract

Pollack has proposed an algorithm for converting decision tables into flowcharts which minimize subsequent execution time when compiled into a computer program. Two modifications o this algorithm are proposed. The first relies on Shannon's noiseless coding theorem and the communications concept of entropy but does not completely test the ELSE Rule. The second modification completely tests the ELSE Rule but results in more executions than the first modification. Both modifications result in lower execution time than Pollack's algorithm. However, neither modification guarantees a globally optimal solution.