_____________________________________________________________________________
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
______________________________________________________________________________
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