prime subprogram parsing of a program
A parsing method based on the triconnected decomposition of a biconnected graph is presented. The parsing algorithm runs in linear time and handles a large class of flow graphs. The applications of this algorithm to flow analysis and to the automatic structuring of programs are discussed.
program parsing method decomposition graph algorithm timing class flow applications flow analysis structure