X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=b383c906e6bdf26d9821f16bffe21773a1da75ab;hp=fd55d0bac1fccf1994c5540ab188f4b6e2caa203;hb=90500a338733b6ba0d5b9c0cdc5a7afea38173ae;hpb=03dd839af8e8d1a6c2f69c5410da6d19fbbe3931

diff --git a/TODO b/TODO
index fd55d0b..b383c90 100644
--- a/TODO
+++ b/TODO
@@ -2,10 +2,6 @@ _____________________________________________________________________________
 Immediately
 
   - Performance
-
-     - Forest: keep() and valid() -- can we do this with states
-       rather than subtrees?
-
      - hash Long->long: it's all bogus
 
   * pick back up cleaning up end of Parser.java (Reduction)
@@ -131,3 +127,17 @@ Neat Ideas
 
   - Rekers & Koorn note that GLR Substring Parsing can be used to do
     really elegant and generalized "autocompletion".
+
+
+______________________________________________________________________________
+Ideas for the Future
+
+- Incremental parse table construction
+- "lazy GLR" and "lazy trees" -> language with first-class CF matching
+    - perhaps linear boolean grammars instead? (linear time, quad space)
+- Forest parsing => chained parsers
+- unification parsing, attributes, etc
+- RRP grammars?
+- Take another stab at maximal-match?  Nonterminal not-followed-by is
+  too strong.
+- Error recovery based on substring parsing