X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=086144069099564c006e464e145809ec426ecd78;hp=3f7ca1050604ceeba76a06713cecf0d935212991;hb=1d6f5a5f585a993cb780ea454fa1bd26d440c4ce;hpb=6ba9ea820f9626a7504da6cf442e2cef1601914f diff --git a/TODO b/TODO index 3f7ca10..0861440 100644 --- a/TODO +++ b/TODO @@ -1,20 +1,52 @@ _____________________________________________________________________________ Immediately - - Fix the metagrammar (really?) + - Check if the only remaining stack is lame + - write a testcase for this - - Repeat, Sequence, Tree - - simplify Forest (considerably) + - circular gramars + s = A + A = A | "b" - - decent/better error messages - - fix the location stuff, it's broken + - foo.add(x) + foo.add(y.andnot(x)) ==> this is broken - - copyright notices - - documentation + - Annotation Tutorial + + .................................................. + + - evil problems with: (x y? z /ws) + - it gets even more evil than that + - basically, follow restrictions are not honored when the element + matches against the empty string ______________________________________________________________________________ v1.1 + - precedes restrictions ("<-") + + - MUST HAVE BETTER ERROR MESSAGES + - use for developing java15.g + + - java15.g + - once this is ready, do big announcement + + - topology no longer needed as an arg to parser? + + - broader regression testing (for stuff like error messages, etc) + + - More topology untangling [later] + - tib: use the lexer only for indentation increases/decreases + - 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 @@ -34,10 +66,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) @@ -53,6 +81,9 @@ Soon ______________________________________________________________________________ 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