unrolling forests without recursion

[sbp.git] / TODO

diff --git a/TODO b/TODO
index fb89b52..1e53bb8 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,11 +1,32 @@
 _____________________________________________________________________________
 Immediately
 
-  - clean up the whole Walk situation (?)
+- If a top-level rule has labels but no head-tag, like this
+    Foo = a:Bar b:Baz
+  then infer the name of the rule it belongs to
+
+create( $c:{...}, class ) =
+  return create($c:{...})
+
+create( h:{...}, class ) = 
+
+create( , String)
+
+create( _:{...}, String) = treat as char[]
+create( _:{...}, c[] )   = { create(.,c), create(.,c), ... }
+
+create( $c:{...} ) =
 
-  - decent/better error messages
-      - fix the location stuff, it's broken
 
+  - better ambiguity debugging tools / visualization
+
+  - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+
+  - Fix the metagrammar (really?)
+      - evil problems with      (x y? z /ws)
+
+  - copyright notices
+  - documentation
 
 ______________________________________________________________________________
 v1.1
@@ -16,6 +37,9 @@ v1.1
       - TeX (math?)
       - URL (RFC)
       - RFC2822 (email message/headers)
+  - clean up the whole Walk situation (?)
+
+  - what if Tree<> could unwrap itself?
 
 
 ______________________________________________________________________________
@@ -40,6 +64,9 @@ Soon
   - 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