X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=280f8755da14c15570630db831e30dc9eda1de33;hp=31d33a05c3af41cb55dcf54cddcab4ef1cf0134d;hb=df2dac17a58713dd1e3fba3101666bea7cb6f561;hpb=f33c05adc5aa3dd324c5352cdbd6f4b55359acad

diff --git a/TODO b/TODO
index 31d33a0..280f875 100644
--- a/TODO
+++ b/TODO
@@ -1,65 +1,83 @@
 _____________________________________________________________________________
 Immediately
 
-  - Performance
+  - foo.add(x)
+    foo.add(y.andnot(x)) ==> this is broken
 
-     - Forest: keep() and valid() -- can we do this with states
-       rather than subtrees?
+  - Annotation Tutorial
 
-     - hash Long->long: it's all bogus
+  - Get at least *some* sort of moderate improvement in the error messages
 
-  * pick back up cleaning up end of Parser.java (Reduction)
-  * some weird edge cases; check last regression test, 'make doc'
+  ..................................................
 
+  - evil problems with: (x y? z /ws)
+     - it gets even more evil than that
+     - basically, follow restrictions are not honored when the element
+       matches against the empty string
 
-  - Sensible tree-printout
-  - make Tib.Block extend Tree<>
+______________________________________________________________________________
+v1.1
 
-  - more natural phrasing of metagrammar?
+  - precedes restrictions ("<-")
 
-  - finalize metagrammar and rdp-op's
+  - MUST HAVE BETTER ERROR MESSAGES
+     - use for developing java15.g
+
+  - java15.g
+     - once this is ready, do big announcement
+
+  - topology no longer needed as an arg to parser?
+
+  - broader regression testing (for stuff like error messages, etc)
+
+  - More topology untangling [later]
+  - tib: use the lexer only for indentation increases/decreases
+  - grammar highlighting?
 
-  - Deal with the problem of zero-rep productions and whitespace insertion
+  - Forest needs a "manual access" API
+      - the unwrap bit in Forest makes it really hard to expose an API for forests
 
-  - should Union.add() be there?
-  - should Atom.top() be there?
 
-  - fix the location stuff, it's broken
-  - decent/better error messages
-      - substring parsing required
 
+______________________________________________________________________________
+v1.2
+
+  - finalize metagrammar and rdp-op's
   - 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)
@@ -133,3 +151,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