X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=bed7ed84443844e07f7e4ab8d7ccb39da684cd35;hp=3e67a2ea84ad521ccecfe58a5b03f8e7641fb70a;hb=c8d1c3a25e2bfa9645c4b91d3dde9c4857f636f2;hpb=c4431d19cc5ddaae29d22c8c56366b53b0bad352

diff --git a/TODO b/TODO
index 3e67a2e..bed7ed8 100644
--- a/TODO
+++ b/TODO
@@ -1,68 +1,57 @@
 _____________________________________________________________________________
 Immediately
 
-  - Performance
+  - do Forest/Tree still need a Region?
 
-     - Next target: TopologicalBag (make it wickedfast: preoptimize)
+  - evil problems with      (x y? z /ws)
+  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+  - copyright notices
+  - documentation
 
-     - Forest: keep() and valid() -- can we do this with states
-       rather than subtrees?
+  - grammar highlighting?
+  - comment indentation vs block indentation?
+  - { and } in <pre>
+  - recursive { { foo } }
 
-     - hash Long->long: it's all bogus
-
-  * huge performance improvement (try for more)
-  * pick back up cleaning up end of Parser.java (Reduction)
-  * some weird edge cases; check last regression test, 'make doc'
-
-
-  - Sensible tree-printout
-  - make Tib.Block extend Tree<>
-
-  - more natural phrasing of metagrammar?
+______________________________________________________________________________
+v1.1
 
   - 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)
+  - clean up the whole Walk situation (?)
 
-  - PL-PATR?
 
 ______________________________________________________________________________
 Soon
 
-  - clean up the whole Walk situation
+  - serialization of parse tables
 
-  - "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.
+  - "ambiguity modulo dropped fragments"?
+       - can this be checked statically?
+       - eliminated statically?
+
+  - substring parsing for better error messages
 
   - 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?
+
+  - 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)
@@ -136,3 +125,17 @@ 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