questionable hack to reduce maximum stack depth

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 4495d30..0861440 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,26 +1,37 @@
 _____________________________________________________________________________
 Immediately
 
+  - Check if the only remaining stack is lame
+    - 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
+
+  ..................................................
+
   - 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
 
-  - Annotation Tutorial
+______________________________________________________________________________
+v1.1
+
+  - precedes restrictions ("<-")
 
   - MUST HAVE BETTER ERROR MESSAGES
-     - when ambiguity encountered, show text region (where-to-where)
      - use for developing java15.g
 
   - java15.g
+     - once this is ready, do big announcement
 
-  - topology no longer needed as an arg to parser
-  - expose parser's protected method?
-
-  - do Forest/Tree still need a Region?
-  - copyright notices
-
-
-______________________________________________________________________________
-v1.1
+  - topology no longer needed as an arg to parser?
 
   - broader regression testing (for stuff like error messages, etc)
 
@@ -34,7 +45,7 @@ v1.1
 
 
 ______________________________________________________________________________
-v1.1
+v1.2
 
   - finalize metagrammar and rdp-op's
   - write some grammars
@@ -70,6 +81,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