X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=d03ba8a14459ddacecd96609cc95531ec79c0947;hp=31d33a05c3af41cb55dcf54cddcab4ef1cf0134d;hb=c366dacc334fe2e35835164f5a37d3eebb2ca6d5;hpb=f33c05adc5aa3dd324c5352cdbd6f4b55359acad;ds=sidebyside

diff --git a/TODO b/TODO
index 31d33a0..d03ba8a 100644
--- a/TODO
+++ b/TODO
@@ -2,31 +2,19 @@ _____________________________________________________________________________
 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)
-  * some weird edge cases; check last regression test, 'make doc'
 
+  - [more] sensible tree-printout
 
-  - Sensible tree-printout
-  - make Tib.Block extend Tree<>
+  - revamp Tib.Block (do it all in the parser using indent/dedent?)
 
   - more natural phrasing of metagrammar?
-
   - finalize metagrammar and rdp-op's
 
-  - Deal with the problem of zero-rep productions and whitespace insertion
-
-  - should Union.add() be there?
-  - should Atom.top() be there?
-
-  - 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
@@ -34,11 +22,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:
@@ -60,6 +49,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)
@@ -133,3 +124,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