add test case illustrating indentation-based parsing

[sbp.git] / TODO

diff --git a/TODO b/TODO
index 29ca7f0..07e6c74 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,14 +1,21 @@
+
+- A new alternative (choice) operator that says "the compiler should
+  be able to statically determine that there is no ambiguity here"
+
+- Composable parsers (parser that generate output that is input to
+  future parsers).  Use trees?
+
 _____________________________________________________________________________
 Immediately
 
-  - clean up util package
+  - keywordification (ie globally reject from all productions?
+  - generalized follow-by?)
 
-  - serializable parse tables?
-     - all that is required now is to separate Pos and Position
+  - clean up util package
 
-  - 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?
@@ -36,6 +43,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