Java Reference
In-Depth Information
i
1
i
1
1
1
j
1
j
1
k
1
k
1
l
1
l
1
repeat
i ←φ
repeat
2
2
( i , i )
j ←φ
( j , j )
k ←φ
( k , k )
l ←φ
( l , l )
if p
then
if p
then
j i
if q
then
j i
if q
then
3
3
l
2
l
2
4
4
else
else
l
3
l
3
5
5
l ←φ
( l , l )
k k +
6
6
k k +
1
1
else
else
k k +
2
k k +
2
7
7
( j , j )
k ←φ
j ←φ
8
8
( k , k )
l ←φ
( l , l )
call
print
( i , j , k , l )
call
print
( i , j , k , l )
repeat
l ←φ
repeat
9
9
( l , l )
if r
then
if r
then
l l +
4
l l +
4
10
10
l ←φ
( l , l )
11
11
until s
until s
i i +
6
i i +
6
12
12
until
t
until
t
(a)
(b)
Figure 14.66: (a) Program and (b)
φ
placement.
Search WWH ::




Custom Search