if the stack top is N, and the lookahead token is T, then entry
[N, T] in the table is the production rule to use
Parsing Table Construction
- add A à ⍺ to the entry [A, a] for each token a in First(⍺)
- if ε ∈ First(⍺), add A à ⍺ to entry [A, a] for each a in Follow(A)