Information Processing Letters 25 (3): 189-193 (1987)

On the Detection of Unstructuredness in Flowgraphs 1

T.H. Tse 2

[paper from ScienceDirect | postprint]

 ABSTRACT

We define the concepts of skeleton, module, branch, entry and iteration exit in a flowgraph. We show that two simple conditions are sufficient for the detection of unstructuredness.

1. 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.
2. Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong.
Email:

 EVERY VISITOR COUNTS:

  Cumulative visitor count