X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=b720e81803213196ce68018c1bd08a467a74b755;hp=fb89b5213e015b7fc5f814f9f3f413a2d26e8634;hb=bf51becde116f08ec503a4a83e709277aaa98e36;hpb=e5d6a50df43fa50f217b30b0959a1d39f65b621c diff --git a/TODO b/TODO index fb89b52..b720e81 100644 --- a/TODO +++ b/TODO @@ -1,21 +1,53 @@ _____________________________________________________________________________ Immediately +// use 'a'-'z' or 'a-z' instead of [a-z]? +// EOF token? +// #include (with renaming?) - - clean up the whole Walk situation (?) + - de-genericize? + + - better toString() methods all around... + + - cleanup: Forest, ParseFailed, Parser, Union, (just a bit: GSS,Node) - - decent/better error messages - - fix the location stuff, it's broken + - circular gramars? + s = A + A = A | "b" + - foo.add(x) + foo.add(y.andnot(x)) ==> this is broken + - Annotation Tutorial + .................................................. + + - serializable parse tables? + - Treewalker code compiler? ______________________________________________________________________________ v1.1 + - precedes restrictions ("<-") + - MUST HAVE BETTER ERROR MESSAGES + - use for developing java15.g + - java15.g + - once this is ready, do big announcement + - broader regression testing (for stuff like error messages, etc) + - More topology untangling [later] + - grammar highlighting? + - Forest needs a "manual access" API + - the unwrap bit in Forest makes it really hard to expose an API for forests + + + +______________________________________________________________________________ +v1.2 + - 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 (?) ______________________________________________________________________________ @@ -28,10 +60,6 @@ Soon - 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 - if we need to be able to do lift operations on it. - Parameterized LR - "Regular Right Part" grammars (NP Chapman, etc) @@ -40,10 +68,16 @@ 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 + - understand and implement the RNGLR "kernel state" optimization. + The _Practical Early Parsing_ paper may help. + - Partly-Linear-PATR? (O(n^6) unification grammar) - Implement a k-token peek buffer (for each state, see if it "dead