Java Reference
In-Depth Information
foreach
Y
∈N
eg
do
Soln
(
Y
)
←
84
repeat
change
←
85
false
foreach
Y
∈N
eg
do
OldSoln
←
Soln
(
Y
)
86
IN
Y
←
(
Soln
(
X
))
87
X
∈
Preds
(
Y
)
Soln
(
Y
)
←
f
Y
(
IN
Y
)
88
if
Soln
(
Y
)
OldSoln
89
then
change
←
true
90
until
change
=
false
Figure 14.48: Simple iterative evaluation. Inputs are a data flow
framework
G
eg
. The algorithm
computes
Soln
(
Y
) for the solution at the output of each
node
Y
.
D
and an evaluation flow graph
1
f(x) =
f(x) =
3
f(x) =
4
2
f(x) = x
f(x) = x
5
Figure 14.49: Example for iterative evaluation. Each node's transfer
function and depth-first numbering are shown inside and
adjacent to the node, respectively.
