X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=280f8755da14c15570630db831e30dc9eda1de33;hb=29aee2e9657292a3c188865e396e714eface6ff6;hpb=2c05c84a714f54b3bc026f51416492ddb13f33b1

diff --git a/TODO b/TODO
index 280f875..ed981e8 100644
--- a/TODO
+++ b/TODO
@@ -1,39 +1,33 @@
 _____________________________________________________________________________
 Immediately
 
+  - comparison test is probably chewing up most of the time
+
+  - Check if the only remaining stack is lame (hopeful/nothopeful)
+    - write a testcase for this
+  - circular gramars
+      s = A
+      A = A | "b"
   - foo.add(x)
     foo.add(y.andnot(x)) ==> this is broken
-
   - Annotation Tutorial
 
-  - Get at least *some* sort of moderate improvement in the error messages
-
   ..................................................
 
-  - evil problems with: (x y? z /ws)
-     - it gets even more evil than that
-     - basically, follow restrictions are not honored when the element
-       matches against the empty string
+  - serializable parse tables?
+  - Treewalker code compiler?
 
 ______________________________________________________________________________
 v1.1
 
   - precedes restrictions ("<-")
-
   - MUST HAVE BETTER ERROR MESSAGES
      - use for developing java15.g
-
   - java15.g
      - once this is ready, do big announcement
-
-  - topology no longer needed as an arg to parser?
-
   - broader regression testing (for stuff like error messages, etc)
-
   - More topology untangling [later]
-  - tib: use the lexer only for indentation increases/decreases
   - grammar highlighting?
-
   - Forest needs a "manual access" API
       - the unwrap bit in Forest makes it really hard to expose an API for forests
 
@@ -76,6 +70,9 @@ Soon
 ______________________________________________________________________________
 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