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

diff --git a/TODO b/TODO
index fd55d0b..c7ad150 100644
--- a/TODO
+++ b/TODO
@@ -131,3 +131,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