X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=f3b6476162e3bb3715b1cf0a1bacdb1cd7c9e87a;hb=987a3f1d9ae796bb8db1294654125b07255128a5;hpb=f1dba2b015c3da04fc2fab45604da2e6c9ae0a1d diff --git a/TODO b/TODO index f3b6476..ed981e8 100644 --- a/TODO +++ b/TODO @@ -1,22 +1,41 @@ _____________________________________________________________________________ Immediately - - do Forest/Tree still need a Region? - - the unwrap bit in Forest makes it really hard to expose an API for forests + - comparison test is probably chewing up most of the time - - evil problems with (x y? z /ws) - - ParseFailed, GSS, Walk, Parser, Sequence, Forest - - copyright notices - - documentation + - 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 - - grammar highlighting? - - comment indentation vs block indentation? - - { and } in
-  - recursive { { foo } }
+  ..................................................
+
+  - 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
@@ -51,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