Compiling optimized code from decision tables

Authors:
H. J. Myers
Affiliations:
IBM Systems Development Division Laboratory, San Jose, California
Venue:
IBM Journal of Research and Development
Year:
1972

Citing 11
Cited 0

Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time

Journal of the ACM (JACM)
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement

Journal of the ACM (JACM)
On the conversion of decision tables to computer programs

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

Communications of the ACM
Object code optimization

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
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
A procedure for converting logic table conditions into an efficient sequence of test instructions

Communications of the ACM
Some notes on processing limited-entry decision tables

ACM SIGPLAN Notices - Special issue on decision tables

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reviews the structure of decision tables and methods for converting them into procedural code. It describes new optimization methods, which are applied before, during, and after code generation. Some results from an experimental decision table processor arep rovided.