added code to check for created-by-empty-reduction

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 31d33a0..fd55d0b 100644 (file)
--- a/TODO
+++ b/TODO
@@ -9,24 +9,19 @@ Immediately
      - 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 +29,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 +56,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)