remove stale logging code from Cartesian

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 7186baf..ed981e8 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,22 +1,40 @@
 _____________________________________________________________________________
 Immediately
 
-  - do Forest/Tree still need a Region?
+  - 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
+
+  ..................................................
+
+  - 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
 
-  - evil problems with      (x y? z /ws)
-  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
-  - copyright notices
-  - documentation
 
-  - grammar highlighting?
-  - comment indentation vs block indentation?
-  - { and } in <pre>
-  - recursive { { foo } }
 
 ______________________________________________________________________________
-v1.1
+v1.2
 
   - finalize metagrammar and rdp-op's
   - write some grammars
@@ -52,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