Quote: linear algorithm to decompose program into primes; e.g., sequence, ifthen, whiledo

Quotation Skeleton

An m-graph M is said to be prime … assignment node or all the nodes of M … The prime program is then an ideal definition … than the syntax of the language. A "statement" … We propose to decompose m-graphs into a hierarchy … the hierarchy is formed by finding subprogram cutsets … assignment node that is termed a call node … . A linear algorithm for finding the prime … [Tarjan RE, Valdes J, 1980 ACM POPL] … [p. 6] It should be noted that the six … form a special group. These six form the … [called: sequence, ifthen, ifthenelse, whiledo, dountil, and dowhiledo.   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: code optimization by flow analysis (45 items)
Topic: structured flow diagram (36 items)