Parsing of decision tables

Authors:
Ned Chapin
Affiliations:
InfoSci Inc., Menlo Park, CA
Venue:
Communications of the ACM
Year:
1967

Citing 2
Cited 9

Data, documentation, and decision tables

Communications of the ACM
Programming decision tables in FORTRAN, COBOL or ALGOL

Communications of the ACM

Further Results on the Problem of Finding Minimal Length Programs for Decision Tables

Journal of the ACM (JACM)
Translation of Decision Tables

ACM Computing Surveys (CSUR)
Combining decision rules in a decision table

Communications of the ACM
On the conversion of programs to decision tables: method and objectives

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

Communications of the ACM
Programming by questionnaire: an effective way to use decision tables

Communications of the ACM
The development of decision tables via parsing of complex decision situations

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

Communications of the ACM
Technology for automatic generation of application programs: a pragmatic view

MIS Quarterly

Quantified Score

Hi-index	48.31

Visualization

Abstract

Reduction in the size of decision tables can be accomplished by several techniques. The techniques considered in this paper are on the parsing of decision tables with regard to horizontal and vertical data structures, job identity, hardware and job priorities, and context relationships. Such parsing rests upon some conventions for the linkage of decision tables.