X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=1e53bb83803c4c468679d4feecd2e18fc61b6032;hp=1ad1494793bab08b5e36d2b8df8a117d1a69aaa4;hb=f22d53e6ae3581e6c2dc096fd0cf93c18e2d2538;hpb=a22c5074e705e3ffcf03e9f9d174aed8ef79fc91 diff --git a/TODO b/TODO index 1ad1494..1e53bb8 100644 --- a/TODO +++ b/TODO @@ -1,32 +1,57 @@ _____________________________________________________________________________ Immediately - * pick back up cleaning up end of Parser.java (Reduction) +- 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 - - [more] sensible tree-printout +create( $c:{...}, class ) = + return create($c:{...}) - - revamp Tib.Block (do it all in the parser using indent/dedent?) +create( h:{...}, class ) = - - more natural phrasing of metagrammar? - - finalize metagrammar and rdp-op's +create( , String) + +create( _:{...}, String) = treat as char[] +create( _:{...}, c[] ) = { create(.,c), create(.,c), ... } + +create( $c:{...} ) = + + + - better ambiguity debugging tools / visualization + + - ParseFailed, GSS, Walk, Parser, Sequence, Forest - - decent/better error messages - - fix the location stuff, it's broken + - Fix the metagrammar (really?) + - evil problems with (x y? z /ws) + - 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 (?) + + - 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 @@ -36,12 +61,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