X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=26130f63407135d76a84d14509c2b681b061b2cc;hb=9e202722669e70d83e3e09d926bfb40f80a1e9cb;hpb=2e1363821e64a4295ab237e5e610fc9fe0e4efe7 diff --git a/TODO b/TODO index 26130f6..ed981e8 100644 --- a/TODO +++ b/TODO @@ -1,41 +1,33 @@ _____________________________________________________________________________ Immediately + - comparison test is probably chewing up most of the time + + - Check if the only remaining stack is lame (hopeful/nothopeful) + - write a testcase for this - circular gramars s = A A = A | "b" - - foo.add(x) foo.add(y.andnot(x)) ==> this is broken - - 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 + - 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 - - - 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 @@ -78,6 +70,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