X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=cecd2d440811bf4c47f6bb548edf6fc6d49f9678;hb=f57e7386abbd8d301f46c0f68a32bffbb1c15253;hpb=75d0fa39d405292f4b831a6d1743f2aeea01ebd4 diff --git a/TODO b/TODO index cecd2d4..ed981e8 100644 --- a/TODO +++ b/TODO @@ -1,32 +1,40 @@ _____________________________________________________________________________ Immediately - - Sequence extends Element (?) -> then add Union.add(element) - - Parameterize Sequence/Union/Atom - - Make sure we never use raw types - - do Forest/Tree still need a Region? + - comparison test is probably chewing up most of the time - - More topology untangling + - 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 - - tib: use the lexer only for indentation increases/decreases + .................................................. - - grammar highlighting? - - - copyright notices - - - 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 - - evil problems with (x y? z /ws) ______________________________________________________________________________ -v1.1 +v1.2 - finalize metagrammar and rdp-op's - write some grammars @@ -62,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