Comparing Control Flow Graphs (Amr Sabry)
Mon, 7 Dec 1992 15:43:41 GMT

          From comp.compilers

Related articles
Comparing Control Flow Graphs (1992-12-07)
Re: Comparing Control Flow Graphs (1992-12-07)
| List of all articles for this month |

Newsgroups: comp.compilers
From: (Amr Sabry)
Organization: Rice University
Date: Mon, 7 Dec 1992 15:43:41 GMT
Keywords: optimize, question

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.

Main program:

procedure Z
if (x = y) then A else B;

Control Flow Graphs:

x = y x = y
/\ /\
/ \ / \
\ / \ /
\/ \/
| |
C |
| |
end end

Amr Sabry

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.