X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=b720e81803213196ce68018c1bd08a467a74b755;hp=e3e7dfa9c9b6d098e980522e73bb90ec4d136e07;hb=b910ad546f02d07664d32a70ce9acf6f049a64b1;hpb=cfa62077ae26cc704390719af1063fcc3dcc21d2

diff --git a/TODO b/TODO
index e3e7dfa..b720e81 100644
--- a/TODO
+++ b/TODO
@@ -1,37 +1,38 @@
 _____________________________________________________________________________
 Immediately
+// use 'a'-'z' or 'a-z' instead of [a-z]?
+// EOF token?
+// #include (with renaming?)
 
+  - 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
 
   ..................................................
 
-  - 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
 
@@ -74,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