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

diff --git a/TODO b/TODO
index fd55d0b..f3b6476 100644
--- a/TODO
+++ b/TODO
@@ -1,57 +1,52 @@
 _____________________________________________________________________________
 Immediately
 
-  - Performance
+  - do Forest/Tree still need a Region?
+  - the unwrap bit in Forest makes it really hard to expose an API for forests
 
-     - Forest: keep() and valid() -- can we do this with states
-       rather than subtrees?
+  - evil problems with      (x y? z /ws)
+  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+  - copyright notices
+  - documentation
 
-     - hash Long->long: it's all bogus
+  - grammar highlighting?
+  - comment indentation vs block indentation?
+  - { and } in <pre>
+  - recursive { { foo } }
 
-  * pick back up cleaning up end of Parser.java (Reduction)
-
-  - [more] sensible tree-printout
-
-  - revamp Tib.Block (do it all in the parser using indent/dedent?)
+______________________________________________________________________________
+v1.1
 
-  - more natural phrasing of metagrammar?
   - finalize metagrammar and rdp-op's
-
-  - should Union.add() be there?
-  - should Atom.top() be there?
-
-  - decent/better error messages
-      - fix the location stuff, it's broken
-
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
+  - clean up the whole Walk situation (?)
 
 
 ______________________________________________________________________________
 Soon
 
-  - substring parsing for better error messages
+  - serialization of parse tables
 
-  - clean up the whole Walk situation
+  - "ambiguity modulo dropped fragments"?
+       - can this be checked statically?
+       - eliminated statically?
 
-  - "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.
+  - substring parsing for better error messages
 
   - Parameterized LR
   - "Regular Right Part" grammars (NP Chapman, etc)
   - Attribute unification
 
-  - serialization of parse tables
   - inference of rejections for literals
   - "prefer whitespace higher up" (?)
-  - "ambiguity modulo dropped fragments"?
-       - can this be checked statically?
-       - eliminated statically?
+
+  - 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
@@ -131,3 +126,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