_____________________________________________________________________________
Immediately
+ - Check if the only remaining stack is lame
+ - write a testcase for this
+
- circular gramars
s = A
A = A | "b"
______________________________________________________________________________
Later
+ - understand and implement the RNGLR "kernel state" optimization.
+ The _Practical Early Parsing_ paper may help.
+
- Partly-Linear-PATR? (O(n^6) unification grammar)
- Implement a k-token peek buffer (for each state, see if it "dead