LR-Parser
• Let G = (N, T, P, S) be a CFG,
  where N = {A1, A2, … , An}, T = {a1, a2, … , am}
• LR-parser is a EPDA, M, with states
  Q = {q0, q1, …,qk}, where q0 is the start state.
• M is based on LR table that has these two parts
1) Action part
2) Go-to part
13/42