LR Parsing #3: Simulation of the Parsing DFA (Configuration / Shift-Reduce / Structure of Parsing Table)
1. Knuth’s Model of Configuration
1. Knuth’s Model of Configuration
Clue 1️⃣: Reduction to Root == Pruning off Handles
$LL(0)$ grammars cannot repeat
0. Vocabulary
1. “Recursive Descent” and “Predictive” are just 2 implementation mechanisims of top-down parsers
Serving Order
Why factor?