Information Technology Reference
In-Depth Information
(
p
,
A
)
≡
(
q
,
B
)
1
0
0
a
\
a
/
ab
(
p
,
A
)
≡
b
(
q
,
B
2
)
2
1
0
ba
\
a
/
ab
(
p
,
A
2
)
≡
b
(
q
,
B
3
)
3
1
0
ba
\
a
/
ab
ba
\
b
/
ε
(
p
,
A
3
)
≡
b
(
q
,
B
4
)
a
(
p
,
A
)
≡
(
q
,
B
2
)
8
4
1
0
2
1
ε
\
ε
/
a
2
ba
\
a
/
ab
ba
\
b
/
ε
(
p
,
A
)
≡
a
(
q
,
B
)
5
2
2
(
p
,
A
4
)
≡
b
(
q
,
B
5
)
a
(
p
,
A
2
)
≡
(
q
,
B
3
)
15
9
1
0
2
1
a
\
c
/
ε
ε
\
ε
/
a
2
(
p
,
A
)
≡
(
q
,
ε
)
6
3
3
2
2
(
p
,
A
)
≡
a
(
q
,
B
)
10
2
2
ε
\
ε
/
ε
ε
\
b
/
ε
a
\
c
/
ε
(
p
,
ε
)
≡
(
q
,
ε
)
7
3
3
(
p
,
A
)
≡
a
(
q
,
B
)
2
(
p
,
A
)
≡
(
q
,
B
)
11
12
2
2
3
3
(= )
5
ε
\
ε
/
ε
(
p
,
A
)
≡
(
q
,
B
)
13
3
3
ε
\
ε
/
ε
(
p
,
ε
)
≡
(
q
,
B
)
14
3
3
(a)
ba
\
a
/
ab
4
5
(
p
,
A
)
≡
b
(
q
,
B
)
15
1
0
ba
\
b
/
ε
unchecked
skipping
s-checked
22
a
(
p
,
A
3
)
≡
(
q
,
B
4
)
26
16
2
1
ba
\
a
/
ab
ε
\
ε
/
a
2
The skipping
node
(
p
,
A
3
)
≡
a
(
q
,
B
3
)
17
2
2
5
6
(
p
,
A
)
≡
b
(
q
,
B
)
22
26
1
0
ε
\
b
/
ε
a
\
c
/
ε
(
w.r. t .
)
15
(
p
,
A
2
)
≡
a
(
q
,
B
2
)
(
p
,
A
3
)
≡
(
q
,
B
2
)
18
19
2
2
3
3
(= )
10
Stack
Reduction
ε
\
λ
/
ε
ba
2
\
b
3
c
/
a
2
Skipping
ba
2
\
b
2
c
/
a
2
3
(
p
,
A
)
≡
(
q
,
B
)
20
3
3
ε
\
ε
/
ε
(
p
,
A
2
)
≡
(
q
,
B
)
(
p
,
A
)
≡
(
q
,
B
2
)
23
24
3
3
3
3
2
(
p
,
A
)
≡
(
q
,
B
)
(= )
12
Stack
Reduction
21
3
3
ε
\
λ
/
ε
(= )
12
(
p
,
A
)
≡
(
q
,
B
)
25
3
3
(= )
13
"
T
≡
T
"
1
2
(b)
Fig. 2
The comparison tree for Example 1
Search WWH ::
Custom Search