Single-coloured flow graphs
Some simple data flow graphs:
return
((
1+1
)
*
(
1+1
));
let
x
:int =
1+1
;
let
y
:int =
1
;
return
(
x
*
x
);
let
x
:int =
y
+
y
;
return
(
x
*
x
);
These graphs all have the same tree unfolding, so they should be considered equal.