X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=b720e81803213196ce68018c1bd08a467a74b755;hp=321a8dcd89e21578978ab256b3d41db9361b7970;hb=c2f1ce888172342cfd428355ee01326dd37c36eb;hpb=3ee451bce342d4bb61ad6235ba57bdf817bfdd1a

diff --git a/TODO b/TODO
index 321a8dc..b720e81 100644
--- a/TODO
+++ b/TODO
@@ -1,33 +1,45 @@
 _____________________________________________________________________________
 Immediately
+// use 'a'-'z' or 'a-z' instead of [a-z]?
+// EOF token?
+// #include (with renaming?)
 
-  - evil problems with: (x y? z /ws)
-     - it gets even more evil than that
+  - de-genericize?
 
+  - better toString() methods all around...
+
+  - cleanup: Forest, ParseFailed, Parser, Union, (just a bit: GSS,Node)
+
+  - 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
-  - topology no longer needed as an arg to parser?
-
+     - once this is ready, do big announcement
   - 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
 
 
 
 ______________________________________________________________________________
-v1.1
+v1.2
 
   - finalize metagrammar and rdp-op's
   - write some grammars
@@ -63,6 +75,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