LR-Parser
•
Let
G
= (
N
,
T
,
P
,
S
) be a CFG,
where
N
= {
A
1
,
A
2
, … ,
A
n
},
T
= {
a
1
,
a
2
, … ,
a
m
}
•
LR-parser is a
E
PDA,
M
, with states
Q
= {
q
0
,
q
1
, …,
q
k
}, where
q
0
is the start state.
•
M
is based on LR table that has these two parts
1)
Action part
2)
Go-to part
1
3
/42