© 1987 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Short Notes
Towards a Single Criterion for Identifying Program Unstructuredness*
Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong
We introduce the concepts of fully embedded skeletons and partially overlapping skeletons in program flowgraphs. We show that only one simple criterion is necessary and sufficient for the identification of program unstructuredness. Namely, a program flowgraph is unstructured if and only if it contains partially overlapping skeletons.
Received September 1986. revised December 1986.
* Part of this research was done at the London School of Economics, University of London under a Commonwealth Academic Staff Scholarship. It was also supported in part by a University of Hong Kong Research Grant.
Centre of Computer Studies and Applications, University of Hong Kong, Pokfulam Road, Hong Kong