X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=31dbd1d1590926d988667c4c42442289326ec8aa;hp=d03ba8a14459ddacecd96609cc95531ec79c0947;hb=189d68c64f7aaec90b7cdef0fb2c358fe4f0dd21;hpb=c366dacc334fe2e35835164f5a37d3eebb2ca6d5 diff --git a/TODO b/TODO index d03ba8a..31dbd1d 100644 --- a/TODO +++ b/TODO @@ -1,50 +1,58 @@ _____________________________________________________________________________ Immediately - - Performance - - hash Long->long: it's all bogus + * we can nuke Atom.toAtom() now! + - Topology crap is kinda messed up - * pick back up cleaning up end of Parser.java (Reduction) + - do Forest/Tree still need a Region? + - reconsider the degree of genericization + - GraphViz stuff pollutes the API... + - Forest needs a "manual access" API + - the unwrap bit in Forest makes it really hard to expose an API for forests - - [more] sensible tree-printout + - evil problems with (x y? z /ws) + - ParseFailed, GSS, Walk, Parser, Sequence, Forest + - copyright notices + - documentation - - revamp Tib.Block (do it all in the parser using indent/dedent?) + - grammar highlighting? + - comment indentation vs block indentation? + - { and } in
+  - recursive { { foo } }
 
-  - more natural phrasing of metagrammar?
-  - finalize metagrammar and rdp-op's
-
-  - decent/better error messages
-      - fix the location stuff, it's broken
+______________________________________________________________________________
+v1.1
 
+  - 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 (?)
 
 
 ______________________________________________________________________________
 Soon
 
-  - substring parsing for better error messages
+  - serialization of parse tables
 
-  - clean up the whole Walk situation
+  - "ambiguity modulo dropped fragments"?
+       - can this be checked statically?
+       - eliminated statically?
 
-  - "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.
+  - 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