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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 |
| Publisher | Association for Computing Machinery |
| Pages | 95-105 |
| Number of pages | 11 |
| ISBN (Print) | 0897910117 |
| DOIs | |
| State | Published - Jan 28 1980 |
| Externally published | Yes |
| Event | 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 - Las Vegas, United States Duration: Jan 28 1980 → Jan 30 1980 |
Publication series
| Name | Conference Record of the Annual ACM Symposium on Principles of Programming Languages |
|---|---|
| ISSN (Print) | 0730-8566 |
Other
| Other | 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 |
|---|---|
| Country | United States |
| City | Las Vegas |
| Period | 1/28/80 → 1/30/80 |
All Science Journal Classification (ASJC) codes
- Software
Fingerprint Dive into the research topics of 'Prime subprogram parsing of a program'. Together they form a unique fingerprint.
Cite this
Tarjan, R. E., & Valdes, J. (1980). Prime subprogram parsing of a program. In Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1980 (pp. 95-105). (Conference Record of the Annual ACM Symposium on Principles of Programming Languages). Association for Computing Machinery. https://doi.org/10.1145/567446.567456