Maybe implement SLR(1)

[SamyaDaleh]

... if it differs from my LR(1).

Init, Closure, Shift like #196.

Reduce:
[A -> alpha dot B beta, h, i], [B -> gamma dot, i, j], [a, j, j+1]
__________________ a in Follow(B)
[A -> alpha B dot beta, h, j]

Source: Sikkel, Parsing Schemata p. 286.

[SamyaDaleh]

For reduced acyclic grammars without indirect left recursion.

[SamyaDaleh]

This is interesting. It's like Earley with lookahead. Maybe I can even implement SLR(k).