Derivation tree:
S
EPDAs
as Models of Bottom-Up Parsers 2/2
#
S
s
®
f
Î
R
x
y
z
start pushdown symbol
B
C
#
s
x
y
z
#
s
x
y
z
#
s
x
y
z
B
#
s
x
z
f
R
ule:
B
®
y
R
ule:
C
®
z
Rule:
S
®
x
BC
C
B
#
s
x
B
#
s
x
z
S
#
s
Bottom-up construction of a derivation tree:
41/50