X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=78b4ecdffe4f91312b1488b605ee7f0ce60f36c4;hb=a2008a0c57702f49ed7f8be682e4e29484fded38;hpb=4b5b35b9dbcf29da663c72d12aaf6ac3d2083d27

diff --git a/TODO b/TODO
index 78b4ecd..ed981e8 100644
--- a/TODO
+++ b/TODO
@@ -1,19 +1,41 @@
 _____________________________________________________________________________
 Immediately
 
-  - evil problems with      (x y? z /ws)
-  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
-  - copyright notices
-  - documentation
+  - comparison test is probably chewing up most of the time
 
-  - grammar highlighting?
-  - comment indentation vs block indentation?
-  - { and } in <pre>
-  - recursive { { foo } }
+  - 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
+
+  ..................................................
+
+  - 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
+  - broader regression testing (for stuff like error messages, etc)
+  - More topology untangling [later]
+  - grammar highlighting?
+  - Forest needs a "manual access" API
+      - the unwrap bit in Forest makes it really hard to expose an API for forests
+
+
+
+______________________________________________________________________________
+v1.2
+
   - finalize metagrammar and rdp-op's
   - write some grammars
       - Java grammar
@@ -48,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