TY - GEN
T1 - Prime subprogram parsing of a program
AU - Tarjan, Robert E.
AU - Valdes, Jacobo
N1 - Funding Information:
t Work supported by NSF grant MCS75-22870 grant NOO014-76-C-0688. $ Work partially supported by NSF gran[ MCS79-05524.
Funding Information:
Work supported by NSF grant MCS75-22870 and ONR grant N00014-76-C-0688. Work partially supported by NSF grant MCS79-05524.
PY - 1980/1/28
Y1 - 1980/1/28
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0019093232&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0019093232&partnerID=8YFLogxK
U2 - 10.1145/567446.567456
DO - 10.1145/567446.567456
M3 - Conference contribution
AN - SCOPUS:0019093232
SN - 0897910117
T3 - Conference Record of the Annual ACM Symposium on Principles of Programming Languages
SP - 95
EP - 105
BT - Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980
PB - Association for Computing Machinery
T2 - 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980
Y2 - 28 January 1980 through 30 January 1980
ER -