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

diff --git a/TODO b/TODO
index 972a801..fd55d0b 100644
--- a/TODO
+++ b/TODO
@@ -1,27 +1,41 @@
-______________________________________________________________________________
+_____________________________________________________________________________
 Immediately
 
-  - switch maximal to not-followed-by (~/~)
+  - 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)
+
+  - [more] sensible tree-printout
+
+  - revamp Tib.Block (do it all in the parser using indent/dedent?)
+
+  - more natural phrasing of metagrammar?
+  - finalize metagrammar and rdp-op's
 
   - should Union.add() be there?
   - should Atom.top() be there?
 
-  - fix the location stuff, it's broken
   - decent/better error messages
+      - fix the location stuff, it's broken
 
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
-      - Wiki grammar
+
 
 ______________________________________________________________________________
 Soon
 
-  - clean up the whole Walk situation
+  - substring parsing for better error messages
 
-  - cleaner solution to "maximal"?
+  - clean up the whole Walk situation
 
   - "lift" cases:
       - right now I can only lift the last child in a forest...  begs
@@ -42,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)
@@ -53,11 +69,6 @@ Later
     nodes which are transient in the sense that they have only one
     eligible reduction?
 
-  - Implement "GLR syntactic predicates" -- the ability to do
-    arbitrary lookahead (ie "followed-by" and "not-followed-by" for
-    arbitrary patterns).  This enables generalized longest-match and
-    lets us drop the Maximal hack.
-
   - Re-read Rekers, particularly the stuff on optimal sharing
 
   - Isolate the Element objects from Parse.Table/GSS so we can move
@@ -114,3 +125,9 @@ Later
   - implement Johnstone's algorithm for "reduced, resolved LR
     tables" to eliminate superfluous reductions on
     epsilon-transitions.
+
+______________________________________________________________________________
+Neat Ideas
+
+  - Rekers & Koorn note that GLR Substring Parsing can be used to do
+    really elegant and generalized "autocompletion".