Program structure tree

A program structure tree (PST) is a hierarchical diagram that displays the nesting relationship of single-entry single-exit (SESE) regions, showing the organization of a computer program. Nodes in this tree represent SESE regions of the program, while edges represent nesting regions. The PST is defined for all control flow graphs.

External links

• Java implementation of the Refined Process Structure Tree in the jBPT library (see RPST class in jbpt-deco module). The implementation follows the algorithm described in Polyvyanyy, A.; Vanhatalo, J.; Völzer, H. (2010), "Simplified Computation and Generalization of the Refined Process Structure Tree", Web Services and Formal Methods, Lecture Notes in Computer Science, vol. 6551, Springer Berlin Heidelberg, pp. 25–41, doi:10.1007/978-3-642-19589-1_2, ISBN 978-3-642-19588-4
• Johnson, Richard (1994). "The program structure tree: computing control regions in linear time": 171–185. doi:10.1145/178243.178258. ISBN 0-89791-662-X. {{cite journal}}: |chapter= ignored (help); Cite journal requires |journal= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)