Java Reference
In-Depth Information
i
←
1
1
j
←
1
Start
1
k
←
1
l
←
1
repeat
if
p
then
2
2
3
7
j
←
i
if
q
then
3
4
5
l
←
2
4
else
6
l
←
3
5
k
←
k
+
1
6
else
8
k
←
k
+
2
7
call
print
(
i
,
j
,
k
,
l
)
8
9
repeat
if
r
then
9
10
l
←
l
+
4
10
11
11
until
s
i
←
i
+
6
12
Stop
12
until
t
(a)
(b)
Figure 14.62: (a) Program and (b) its control flow graph. The node's
numbers correspond to the program's markers, not to a
depth-first numbering. This example is from [CFR
+
91].
