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

diff --git a/TODO b/TODO
index 972a801..d03ba8a 100644
--- a/TODO
+++ b/TODO
@@ -1,27 +1,34 @@
-______________________________________________________________________________
+_____________________________________________________________________________
 Immediately
 
-  - switch maximal to not-followed-by (~/~)
+  - Performance
+     - 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?)
 
-  - should Union.add() be there?
-  - should Atom.top() be there?
+  - more natural phrasing of metagrammar?
+  - finalize metagrammar and rdp-op's
 
-  - 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 +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)
@@ -53,11 +62,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 +118,23 @@ 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".
+
+
+______________________________________________________________________________
+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