_____________________________________________________________________________
Immediately
- - make sure I'm achieving optimal sharing (zipping heads and tails)
-
- clean up util package
- - serializable parse tables?
- - all that is required now is to separate Pos and Position
-
- - currently we GC the doomed stack when the parent dies... but we
- should also GC the parent when the doomed stack dies if it was a
- positive conjunct.
+ - currently we GC the doomed stack when the parent dies... but
+ [ideally] we should also GC the parent when the doomed stack dies
+ if it was a positive conjunct.
- single-tree-return assumption
- have a way to let question marks not be tagged?
______________________________________________________________________________
v1.1
+- use regression/least-squares/trend-prof to look for reductions whose
+ behavior is O(n^2)? (ie performed a number of times proportional to
+ the input consumed so far).
+
+- Optimizations:
+ - (x &~ y) => (x & z)
+ - string lookahead
+ - don't form result forests for negated productions
+ - early kills: (a &~ ... b ...) -> once "... b" is seen, "a" is dead
+
- MUST HAVE BETTER ERROR MESSAGES
- use for developing java15.g
- better ambiguity reporting