On the emulation of flowcharts by decision tables
- 1 December 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 25 (12) , 895-905
- https://doi.org/10.1145/358728.358739
Abstract
Any flowchart can be emulated by a decision table, whose complexity depends on that of the flowchart. It may be necessary, however, to introduce a new control variable with associated tests and sets or to permit changes in execution sequences provided action-test independence holds. Two measures of decision table complexity are discussed and interrelated. Finally, conditions and procedures for reducing complexity are presented.Keywords
This publication has 9 references indexed in Scilit:
- Detection of logical errors in decision table programsCommunications of the ACM, 1978
- Optimal conversion of extended-entry decision tables with general cost criteriaCommunications of the ACM, 1978
- A Complexity MeasureIEEE Transactions on Software Engineering, 1976
- A genealogy of control structuresCommunications of the ACM, 1975
- Structured Programming with go to StatementsACM Computing Surveys, 1974
- On the conversion of programs to decision tablesCommunications of the ACM, 1974
- Translation of Decision TablesACM Computing Surveys, 1974
- On the capabilities of while, repeat, and exit statementsCommunications of the ACM, 1973
- Böhm and Jacopini's reduction of flow chartsCommunications of the ACM, 1967