X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=TODO;h=f059a77b4fd96ab9c8abf7dd9e4c29df20cad354;hb=50fd2646f65c18357e0639ec0737d329f2072388;hp=b383c906e6bdf26d9821f16bffe21773a1da75ab;hpb=21b1b10a3ffb4b2021ad940f9cd722e3ed5300c4;p=sbp.git diff --git a/TODO b/TODO index b383c90..f059a77 100644 --- a/TODO +++ b/TODO @@ -1,38 +1,42 @@ _____________________________________________________________________________ Immediately - - Performance - - hash Long->long: it's all bogus + - I still don't like Atom.Infer and Atom.Invert... - * pick back up cleaning up end of Parser.java (Reduction) + - better ambiguity debugging tools - - [more] sensible tree-printout + - ParseFailed, GSS, Walk, Parser, Sequence, Forest - - revamp Tib.Block (do it all in the parser using indent/dedent?) + - Fix the metagrammar (really?) + - evil problems with (x y? z /ws) - - more natural phrasing of metagrammar? - - finalize metagrammar and rdp-op's - - - should Union.add() be there? - - should Atom.top() be there? + - copyright notices + - documentation - - 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 (?) + + - what if Tree<> could unwrap itself? ______________________________________________________________________________ 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? + - substring parsing for better error messages - "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 @@ -42,12 +46,12 @@ Soon - "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