|Comparing Control Flow Graphs email@example.com (1992-12-07)|
|Re: Comparing Control Flow Graphs firstname.lastname@example.org (1992-12-07)|
|From:||email@example.com (Amr Sabry)|
|Date:||Mon, 7 Dec 1992 15:43:41 GMT|
Is there any formal notion that captures the "precision" of a control flow
graph. For example, assume we have a source program M and two intermediate
representations M_a and M_b. The control flow graphs for M_a is C_a and
the control flow graph for M_b is C_b. Do people have a formal way of
saying that C_a is "better" than C_b or vice-versa. The notion of "better"
should imply better solutions to some class of dataflow problems. Here is
a contrived example.
if (x = y) then A else B;
Control Flow Graphs:
x = y x = y
/ \ / \
A B A;C B;C
\ / \ /
Amr Sabry firstname.lastname@example.org
Return to the
Search the comp.compilers archives again.