add support for ghc6.5 and IntelMac

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 4931457..e3e7dfa 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,40 +1,80 @@
+_____________________________________________________________________________
+Immediately
+
+  - foo.add(x)
+    foo.add(y.andnot(x)) ==> this is broken
+
+  - Annotation Tutorial
+
+  ..................................................
+
+  - 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
 
 ______________________________________________________________________________
-pre-1.0
+v1.1
+
+  - precedes restrictions ("<-")
+
+  - MUST HAVE BETTER ERROR MESSAGES
+     - use for developing java15.g
 
-  - Javadoc comments
+  - java15.g
+     - once this is ready, do big announcement
 
-  - switch maximal to not-followed-by (~/~)
+  - topology no longer needed as an arg to parser?
 
-  - should Union.add() be there?
-  - should Atom.top() be there?
+  - broader regression testing (for stuff like error messages, etc)
 
-  - fix the location stuff, it's broken
-  - decent/better error messages
+  - More topology untangling [later]
+  - tib: use the lexer only for indentation increases/decreases
+  - grammar highlighting?
+
+  - Forest needs a "manual access" API
+      - the unwrap bit in Forest makes it really hard to expose an API for forests
+
+
+
+______________________________________________________________________________
+v1.2
 
-  - finalize metagrammar
+  - 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 (?)
 
-  - WIKI!!!  TEX!!!
 
 ______________________________________________________________________________
-Undecided
+Soon
 
-  - public API for hates/needs
+  - serialization of parse tables
 
-  - clean up the whole Walk situation
-  - cleaner solution to "maximal"?
-  - "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
+
+  - 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.
 
 ______________________________________________________________________________
-post-1.0
+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
@@ -47,11 +87,6 @@ post-1.0
     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 +143,23 @@ post-1.0
   - 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