checkpoint harmony

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 9c1b408..d03ba8a 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,36 +1,34 @@
 _____________________________________________________________________________
 Immediately
 
 _____________________________________________________________________________
 Immediately
 

-  - Lay down the law on the different kinds of Sequence productions
-    and how they work.
+  - Performance
+     - hash Long->long: it's all bogus

 
 

-     => mydrop
-     => mylift
+  * pick back up cleaning up end of Parser.java (Reduction)

 
 

-  - whitespace-in-braces?
-  - Deal with the problem of zero-rep productions and whitespace insertion
+  - [more] sensible tree-printout

 
 

-  - switch maximal to not-followed-by (~/~)
+  - 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
   - decent/better error messages

+      - fix the location stuff, it's broken

 
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
 
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)

-      - Wiki grammar
+

 
 ______________________________________________________________________________
 Soon
 
 
 ______________________________________________________________________________
 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
 
   - "lift" cases:
       - right now I can only lift the last child in a forest...  begs

@@ -51,6 +49,8 @@ Soon
 ______________________________________________________________________________
 Later
 
 ______________________________________________________________________________
 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)
   - 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)

@@ -62,11 +62,6 @@ Later
     nodes which are transient in the sense that they have only one
     eligible reduction?
 
     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
   - Re-read Rekers, particularly the stuff on optimal sharing
 
   - Isolate the Element objects from Parse.Table/GSS so we can move

@@ -123,3 +118,23 @@ Later
   - implement Johnstone's algorithm for "reduced, resolved LR
     tables" to eliminate superfluous reductions on
     epsilon-transitions.
   - 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