X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=f3b5856f23f3494e4cf114320223f47822182ba7;hp=493145738ef91c6d56618ee8c84216e2b3f14efd;hb=8633a1ff957ac9ccbafa5e897bc8b9f17eadab02;hpb=0a0227b9180534d2a431f3d6e08a398bde2244c4

diff --git a/TODO b/TODO
index 4931457..f3b5856 100644
--- a/TODO
+++ b/TODO
@@ -1,8 +1,22 @@
+_____________________________________________________________________________
+Immediately
 
-______________________________________________________________________________
-pre-1.0
+  - Sensible tree-printout
+  - make Tib.Block extend Tree<>
+  - refine TIB
+      - documentation markup
+
+  - more natural phrasing of metagrammar?
+
+  - finalize metagrammar and rdp-op's
+
+  - Lay down the law on the different kinds of Sequence productions
+    and how they work.
 
-  - Javadoc comments
+     => mydrop
+     => mylift
+
+  - Deal with the problem of zero-rep productions and whitespace insertion
 
   - switch maximal to not-followed-by (~/~)
 
@@ -12,29 +26,38 @@ pre-1.0
   - fix the location stuff, it's broken
   - decent/better error messages
 
-  - finalize metagrammar
+  - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
-
-  - WIKI!!!  TEX!!!
+      - Wiki grammar
 
 ______________________________________________________________________________
-Undecided
-
-  - public API for hates/needs
+Soon
 
   - clean up the whole Walk situation
+
   - cleaner solution to "maximal"?
+
   - "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.
 
+  - 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?
 
 ______________________________________________________________________________
-post-1.0
+Later
 
   - Implement a k-token peek buffer (for each state, see if it "dead
     ends" during the next k Phases based solely on state -- ignoring
@@ -108,3 +131,9 @@ post-1.0
   - 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".