more refactoring into Node

[sbp.git] / TODO

diff --git a/TODO b/TODO
index d2d930d..f8746d0 100644 (file)
--- a/TODO
+++ b/TODO
@@ -33,6 +33,16 @@ Immediately
 ______________________________________________________________________________
 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