_____________________________________________________________________________
Immediately
-- If a top-level rule has labels but no head-tag, like this
- Foo = a:Bar b:Baz
- then infer the name of the rule it belongs to
+ - comparison test is probably chewing up most of the time
-create( $c:{...}, class ) =
- return create($c:{...})
+ - 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
-create( h:{...}, class ) =
+ ..................................................
-create( , String)
+ - serializable parse tables?
+ - Treewalker code compiler?
-create( _:{...}, String) = treat as char[]
-create( _:{...}, c[] ) = { create(.,c), create(.,c), ... }
-
-create( $c:{...} ) =
-
-
- - clean up the visualization (?)
-
- - I still don't like Atom.Infer and Atom.Invert...
-
- - better ambiguity debugging tools
+______________________________________________________________________________
+v1.1
- - ParseFailed, GSS, Walk, Parser, Sequence, Forest
+ - 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
- - Fix the metagrammar (really?)
- - evil problems with (x y? z /ws)
- - copyright notices
- - documentation
______________________________________________________________________________
-v1.1
+v1.2
- finalize metagrammar and rdp-op's
- write some grammars
- RFC2822 (email message/headers)
- clean up the whole Walk situation (?)
- - what if Tree<> could unwrap itself?
-
______________________________________________________________________________
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)
______________________________________________________________________________
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