X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=58123e72018bb927d83e210ef213a99a89761ec2;hp=d03ba8a14459ddacecd96609cc95531ec79c0947;hb=2a11d8ca5ae3af89ac2bdea58f71e463b6e4affe;hpb=c366dacc334fe2e35835164f5a37d3eebb2ca6d5 diff --git a/TODO b/TODO index d03ba8a..58123e7 100644 --- a/TODO +++ b/TODO @@ -1,35 +1,38 @@ _____________________________________________________________________________ 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) - - - [more] sensible tree-printout - - - revamp Tib.Block (do it all in the parser using indent/dedent?) - - - more natural phrasing of metagrammar? - - finalize metagrammar and rdp-op's + - Fix the metagrammar (really?) - decent/better error messages - fix the location stuff, it's broken + - copyright notices + - documentation + +______________________________________________________________________________ +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? + - 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 @@ -39,12 +42,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