Conversion of limited-entry decision tables to computer programs—a proposed modification to Pollack's algorithm
Author:
Open Access
- 1 February 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 14 (2) , 69-73
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.Keywords
This publication has 8 references indexed in Scilit:
- Parsing of decision tablesCommunications of the ACM, 1967
- Conversion of decision tables to computer programs by rule mask techniquesCommunications of the ACM, 1966
- On storage space of decision tablesCommunications of the ACM, 1966
- Data, documentation, and decision tablesCommunications of the ACM, 1966
- Conversion of limited-entry decision tables to computer programsCommunications of the ACM, 1965
- Conversion of decision tables to computer programsCommunications of the ACM, 1965
- Use of decision tables in computer programmingCommunications of the ACM, 1965
- An engineering application of logic-structure tablesCommunications of the ACM, 1961