Journal of the ACM (JACM)
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Bounded context syntactic analysis
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Operations on sparse relations
Communications of the ACM
A improvement to Martin's algorithm for computation of linear precedence functions
Communications of the ACM
A Boolean matrix method for the computation of linear precedence functions
Communications of the ACM
A heuristic teleprocessing network design technique
ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
Efficient On-Line Proofs of Equalities and Inequalities of Formulas
IEEE Transactions on Computers
| Hi-index | 48.27 |
The use of decision tables as a tool in systems analysis and for program specification is now becoming accepted. Rules on redundancy, contradiction, and completeness for limited entry tables were published in 1963. These are usually used for checking, preceded if necessary by a conversion from extended to limited entry form. Processors which automatically translate tables to more conventional program usually base their diagnostic facilities on these rules. In this paper it is suggested that these rules are unsatisfactory and that the important aspect of checking is to eliminate ambiguity from tables. Ambiguity is defined and discussed, and a procedure for producing checked-out decision tables is proposed. The theoretical basis of the algorithm used is established. The importance of well-designed diagnostic facilities in decision table processors is emphasized.