X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=31d33a05c3af41cb55dcf54cddcab4ef1cf0134d;hp=1dc0b33d9a591d608834bd07382c5a13e254ad36;hb=1554add84875c4a9ea7cce33c70b5459cdab45fa;hpb=2f167f63aff4b6da4d82669faf2c7ada4c93be4b;ds=sidebyside

diff --git a/TODO b/TODO
index 1dc0b33..31d33a0 100644
--- a/TODO
+++ b/TODO
@@ -1,48 +1,46 @@
 _____________________________________________________________________________
 Immediately
 
-  - simplify metagrammar => go to top-down rewriting => finalize metagrammar and rdp-op's
+  - Performance
 
-  - What is our use model?
-    - Parse, attribute, unify       (ag)
-    - Parse, transform tree, walk   (rdp)
-    - Parse, walk
-    - cascading tree rewrites
+     - Forest: keep() and valid() -- can we do this with states
+       rather than subtrees?
 
-      ==> use the middle formalism "for now" and in meta.g; layer others
-          on top of it
+     - hash Long->long: it's all bogus
 
-  - Lay down the law on the different kinds of Sequence productions
-    and how they work.
+  * pick back up cleaning up end of Parser.java (Reduction)
+  * some weird edge cases; check last regression test, 'make doc'
 
-     => mydrop
-     => mylift
 
-  - whitespace-in-braces?
-  - Deal with the problem of zero-rep productions and whitespace insertion
+  - Sensible tree-printout
+  - make Tib.Block extend Tree<>
+
+  - more natural phrasing of metagrammar?
 
-  - switch maximal to not-followed-by (~/~)
+  - 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
 
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
-      - Wiki grammar
+
+  - PL-PATR?
 
 ______________________________________________________________________________
 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
@@ -73,11 +71,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
@@ -134,3 +127,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".