X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=1ad1494793bab08b5e36d2b8df8a117d1a69aaa4;hp=5f5e1cf6546399a5c3e34f45890b9f2bae1024a4;hb=a22c5074e705e3ffcf03e9f9d174aed8ef79fc91;hpb=5252cc15c0d998517bf566229cd0c9d04dcff348

diff --git a/TODO b/TODO
index 5f5e1cf..1ad1494 100644
--- a/TODO
+++ b/TODO
@@ -1,21 +1,17 @@
 _____________________________________________________________________________
 Immediately
 
-  - Sensible tree-printout
-  - make Tib.Block extend Tree<>
+  * pick back up cleaning up end of Parser.java (Reduction)
 
-  - more natural phrasing of metagrammar?
-
-  - finalize metagrammar and rdp-op's
+  - [more] sensible tree-printout
 
-  - Deal with the problem of zero-rep productions and whitespace insertion
+  - revamp Tib.Block (do it all in the parser using indent/dedent?)
 
-  - should Union.add() be there?
-  - should Atom.top() be there?
+  - more natural phrasing of metagrammar?
+  - finalize metagrammar and rdp-op's
 
-  - fix the location stuff, it's broken
   - decent/better error messages
-      - substring parsing required
+      - fix the location stuff, it's broken
 
   - write some grammars
       - Java grammar
@@ -23,11 +19,12 @@ Immediately
       - URL (RFC)
       - RFC2822 (email message/headers)
 
-  - PL-PATR?
 
 ______________________________________________________________________________
 Soon
 
+  - substring parsing for better error messages
+
   - clean up the whole Walk situation
 
   - "lift" cases:
@@ -49,6 +46,8 @@ Soon
 ______________________________________________________________________________
 Later
 
+  - Partly-Linear-PATR? (O(n^6) unification grammar)
+
   - Implement a k-token peek buffer (for each state, see if it "dead
     ends" during the next k Phases based solely on state -- ignoring
     result SPPF)
@@ -122,3 +121,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