Control Flow Layout Algorithm for Higher Level Language Programs
Original Publication Date: 1989-Oct-01
Included in the Prior Art Database: 2005-Jan-29
A process is disclosed for producing the control flow graph of a program written in a higher level procedural language. This higher level language is assumed to contain structured statement types typical of most higher level procedural languages, such as IF, ELSE, CASE, FOR, etc. Contiguous assignment and call statements may be clustered together into basic blocks, and thus such statements need not be considered separately. In addition, the language may contain unstructured statements such as GOTO, BREAK, etc. It is assumed that a presentation paradigm exists whereby structured statements are presented in a well- defined manner and sub-structures are nested.