checkpoint

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 1d62802..0861440 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,16 +1,52 @@
 _____________________________________________________________________________
 Immediately
 
-  - decent/better error messages
-      - fix the location stuff, it's broken
+  - Check if the only remaining stack is lame
+    - write a testcase for this
 
-  - copyright notices
+  - circular gramars
+      s = A
+      A = A | "b"
 
-  - documentation
+  - 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
 
 ______________________________________________________________________________
 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
+
+
+
+______________________________________________________________________________
+v1.2
+
   - finalize metagrammar and rdp-op's
   - write some grammars
       - Java grammar
@@ -30,10 +66,6 @@ Soon
        - eliminated statically?
 
   - substring parsing for better error messages
-  - "lift" cases:
-      - right now I can only lift the last child in a forest...  begs
-        the question of what the right representation for Forests is
-        if we need to be able to do lift operations on it.
 
   - Parameterized LR
   - "Regular Right Part" grammars (NP Chapman, etc)
@@ -42,10 +74,16 @@ Soon
   - inference of rejections for literals
   - "prefer whitespace higher up" (?)
 
+  - Labeled edges on trees (associate a label with each slot in the
+    child array in Forest.Body?  might make equality tough) --
+    equivalent to Feature Structures.  Colon-labeling.
 
 ______________________________________________________________________________
 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