X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=2cec7771eceace09ce4de4ae750859038e9000c7;hp=78baf0190bfcc2c917c6ac3e0a612001155201a8;hb=2bee2b032b0422d212e17082cc4dcbf28cb897ac;hpb=ea5d0a5e3dffb5ba0143179fd28608c2de8046e0

diff --git a/TODO b/TODO
index 78baf01..2cec777 100644
--- a/TODO
+++ b/TODO
@@ -1,29 +1,42 @@
-
-______________________________________________________________________________
+_____________________________________________________________________________
 Immediately
 
-  - switch maximal to not-followed-by (~/~)
+- Migrate Demo.java -> MetaGrammar.java
+    - Figure out serialization
+
+- Clean up the prioritized-match garbage
+ - evil problems with      (x y? z /ws)
 
-  - should Union.add() be there?
-  - should Atom.top() be there?
 
-  - fix the location stuff, it's broken
-  - decent/better error messages
+  - better ambiguity debugging tools / visualization
+  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+  - copyright notices
+  - documentation
+
+______________________________________________________________________________
+v1.1
 
+  - finalize metagrammar and rdp-op's
   - write some grammars
       - Java grammar
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
-      - Wiki grammar
+  - clean up the whole Walk situation (?)
+
+  - what if Tree<> could unwrap itself?
+
 
 ______________________________________________________________________________
 Soon
 
-  - clean up the whole Walk situation
+  - serialization of parse tables
 
-  - cleaner solution to "maximal"?
+  - "ambiguity modulo dropped fragments"?
+       - can this be checked statically?
+       - eliminated statically?
 
+  - substring parsing for better error messages
   - "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
@@ -33,9 +46,18 @@ Soon
   - "Regular Right Part" grammars (NP Chapman, etc)
   - Attribute unification
 
+  - inference of rejections for literals
+  - "prefer whitespace higher up" (?)
+
+  - Labeled edges on trees (associate a label with each slot in the
+    child array in Forest.Body?  might make equality tough) --
+    equivalent to Feature Structures.  Colon-labeling.
+
 ______________________________________________________________________________
 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)
@@ -47,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
@@ -108,3 +125,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