X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=TODO;h=ed981e83321eb371782d03abf3cd29196827e34e;hp=93624048c6626dcab0820c84d8083997eec18c88;hb=f57e7386abbd8d301f46c0f68a32bffbb1c15253;hpb=2c1c0293545f3d12c23220fd05c663e6aa3f3de1 diff --git a/TODO b/TODO index 9362404..ed981e8 100644 --- a/TODO +++ b/TODO @@ -1,37 +1,40 @@ _____________________________________________________________________________ Immediately - - evil problems with: (x y? z /ws) - - it gets even more evil than that - + - 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 - - MUST HAVE BETTER ERROR MESSAGES - - use for developing java15.g - - - java15.g - - - topology no longer needed as an arg to parser - - expose parser's protected method? - - - do Forest/Tree still need a Region? - - copyright notices + .................................................. + - 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] - - 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.1 +v1.2 - finalize metagrammar and rdp-op's - write some grammars @@ -67,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