Jump to content

Program structure tree

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot 1 (talk | contribs) at 00:59, 12 October 2011 ([Pu408]Add: chapter, isbn. You can use this bot yourself. Report bugs here.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A program structure tree is hierarchical a 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 single-entry single-exit (SESE) regions of the program, while edges represent nesting regions. The PST is defined for all control flow graphs.

  • Johnson, Richard (1994). "The program structure tree: computing control regions in linear time": 171–185. doi:10.1145/178243.178258. ISBN 089791662X. {{cite journal}}: |chapter= ignored (help); Cite journal requires |journal= (help); Unknown parameter |coauthors= ignored (|author= suggested) (help)
Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Program_structure_tree&oldid=455132475"