Abstract
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.
Cite
CITATION STYLE
APA
Tarjan, R. E., & Valdes, J. (1980). Prime subprogram parsing of a program. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages (pp. 95–105). Association for Computing Machinery. https://doi.org/10.1145/567446.567456
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free