diff --git a/AstGenerator.cs b/AstGenerator.cs
index 916e3d9..c65a314 100644
--- a/AstGenerator.cs
+++ b/AstGenerator.cs
@@ -13,11 +13,10 @@ public static class AstGenerator {
           Case("int", "Int"),
           Case("string", "String")),
         Variant("ParserResult",
-          Case("MixFix.Annotation", "Annotated"),
-          Case("Lexer.Lexeme", "Terminal"),
-          Case("IEnumerable<ParserResult>", "Productions")),
+          Case("(MixFix.Annotation, IEnumerable<ParserResult>)", "Annotated"),
+          Case("Lexer.Lexeme", "Terminal")),
         Variant("AstNode",
-          Case("Expr", "Terminal"),
+          Case("Lexer.Lexeme", "Terminal"),
           Case("IEnumerable<AstNode>", "Operator"))));
   }
 }
\ No newline at end of file
diff --git a/MixFix.cs b/MixFix.cs
index 45b3fce..cc80704 100644
--- a/MixFix.cs
+++ b/MixFix.cs
@@ -478,13 +478,8 @@ public static partial class MixFix {
       RepeatOnePlus: g => Grammar2.RepeatOnePlus(recur(g, labeled))
     );
 
-  public static Grammar2 ToGrammar2(this EquatableDictionary<string, Grammar1> labeled) {
-    foreach (var kvp in labeled) {
-      Log($"{kvp.Key} -> {kvp.Value.ToString()}");
-    }
-    Log("");
-    return Func.YMemoize<Grammar1, EquatableDictionary<string, Grammar1>, Grammar2>(Recur)(Grammar1.Rule("program"), labeled);
-  }
+  public static Grammar2 ToGrammar2(this EquatableDictionary<string, Grammar1> labeled)
+    => Func.YMemoize<Grammar1, EquatableDictionary<string, Grammar1>, Grammar2>(Recur)(Grammar1.Rule("program"), labeled);
 
   public static Grammar2 ToGrammar2(this PrecedenceDAG precedenceDAG)
     => precedenceDAG.ToGrammar1().ToGrammar2();
diff --git a/Parser.cs b/Parser.cs
index 0863b18..b465e3a 100644
--- a/Parser.cs
+++ b/Parser.cs
@@ -32,9 +32,7 @@ public static partial class Parser {
           l.First(g => Parse3(tokens, g)),
         Sequence: l =>
           l.BindFoldMap(tokens, (restI, g) => Parse3(restI, g))
-            .IfSome((restN, nodes) =>
-              Log($"{nodes.Count()}/{l.Count()}", () =>
-                (restN, ParserResult.Productions(nodes)))),
+            .IfSome((restN, nodes) => (restN, ParserResult.Productions(nodes))),
         Terminal: t =>
         // TODO: move the FirstAndRest here!
           tokens
@@ -44,11 +42,139 @@ public static partial class Parser {
             .IfSome((first, rest) => (rest, ParserResult.Terminal(first))),
         Annotated: a =>
           // TODO: use the annotation to give some shape to these lists
-          Parse3(tokens, a.Item2));
+          Parse3(tokens, a.Item2).IfSome((rest, g) =>
+            (rest, ParserResult.Annotated((a.Item1, g)))));
       // TODO: at the top-level, check that the lexemes
       // are empty if the parser won't accept anything else.
 
-  public static Option<ValueTuple<IImmutableEnumerator<Lexeme>, ParserResult>> Parse2(string source) {
+
+
+
+
+
+
+
+
+
+
+
+    // Variant("ParserResult",
+    //   Case("(Annotation, IEnumerable<ParserResult>)", "Annotated"),
+    //   Case("Lexer.Lexeme", "Terminal"))
+
+    // ParserResult = A(SamePrecedence, *) | A(Operator, *) | A(Hole, *)
+
+    // Annotated(Hole, lsucc);
+    // Annotated(Operator, closed, nonAssoc, prefix, postfix, infixl, infixr)
+
+    // return
+    //     // TODO: we can normally remove the ?: checks, as the constructors for grammars
+    //     // now coalesce Impossible cases in the correct way.
+    //     (closed ? N(closed) : Impossible)
+    //   | (nonAssoc ? N( (lsucc, nonAssoc, rsucc) ) : Impossible)
+    //   | ((prefix || infixr) ? R( ((prefix | (lsucc, infixr))["+"], rsucc) ) : Impossible)
+    //   | ((postfix || infixl) ? L( (lsucc, (postfix || (infixl, rsucc))["+"]) ) : Impossible);
+
+  public static AstNode PostProcess(this ParserResult parserResult) {
+    parserResult.Match(
+      Annotated: 
+    )
+    throw new ParserErrorException("TODO:" + parserResult.ToString());
+  }
+
+  /*
+  public static IEnumerable<ParserResult.Cases.Annotated> FlattenUntilAnnotation(this IEnumerable<ParserResult> parserResults)
+    // TODO: SelectMany is probably not very efficient…
+    => parserResults.SelectMany(parserResult =>
+      parserResult.Match(
+        Terminal: t => throw new ParserErrorException($"Internal error: expected Annotated or Productions but got Terminal({t})"),
+        Annotated: a => new ParserResult.Cases.Annotated(a).Singleton(),
+        Productions: p => p.FlattenUntilAnnotation()));
+
+  // Code quality of this method: Low.
+  public static AstNode PostProcess2(ParserResult parserResult)
+    => parserResult.Match(
+      Annotated: a => {
+        if (a.Item1.IsOperator || a.Item1.IsSamePrecedence) {
+          return a.Item2.Match(
+            Annotated: p => parserResult.PostProcess(),
+            Terminal: t => AstNode.Terminal(t),
+            Productions: p => parserResult.PostProcess() // This will fail.
+          );
+        } else {
+          throw new ParserErrorException(
+            $"Internal error: unexpected annotation {a}, expected Operator(…) inside a part");
+        }
+      },
+      Terminal: t => throw new ParserErrorException($"Internal error: expected Annotated but got {parserResult}"),
+      Productions: p =>  throw new ParserErrorException($"Internal error: expected Annotated but got {parserResult}"));
+
+  // Code quality of this method: Low.
+  public static AstNode PostProcess(this ParserResult parserResult) {
+    var annotated = parserResult
+      .AsAnnotated
+      .ElseThrow(() => new ParserErrorException($"Internal error: expected Annotated but got {parserResult}"));
+
+    var annotation = annotated.Item1;
+    var production = annotated.Item2;
+
+    var associativity = annotation
+      .AsSamePrecedence
+      .ElseThrow(() => new ParserErrorException($"Internal error: unexpected annotation {annotation}, expected SamePrecedence(…)"));
+
+    return associativity.Match<AstNode>(
+      NonAssociative: () => {
+        if (production.IsAnnotated) {
+          return AstNode.Terminal(production.AsAnnotated.ElseThrow(new Exception("impossible")));
+        }
+
+        var prods = production
+          .AsProductions
+          .ElseThrow(new ParserErrorException($"Internal error: unexpected node {production}, expected a Productions node inside a NonAssociative annotation."))
+          .FlattenUntilAnnotation();
+
+        var stk = ImmutableStack<IEnumerable<ParserResult>>.Empty
+          .Push(Enumerable.Empty<ParserResult>());
+
+        var fld =
+          prods
+            .Aggregate(stk, (pending, prod) =>
+              prod.value.Item1.Match(
+                Hole: () =>
+                  pending.Pop().Push(pending.Peek().Concat(prod.value.Item2)),
+                Operator: op =>
+                  pending.Pop().Push(pending.Peek().Concat(prod.value.Item2))
+                    .Push(Enumerable.Empty<ParserResult>()),
+                SamePrecedence: p =>
+                  throw new ParserErrorException($"Internal error: unexpected annotation {annotation}, expected Hole() or Operator(…)")));
+        
+        var www = fld.Pop().Pop().Aggregate(
+          AstNode.Operator(fld.Pop().Peek().Concat(fld.Peek()).Select(PostProcess2)),
+          (right, left) => AstNode.Operator(left.Select(PostProcess2).Concat(right)));
+        Log("\n"+www.ToString());
+
+        return www;
+
+        // var sm = prods.SelectMany(prod =>
+        //   prod.value.Item1.Match(
+        //     Hole: () => Log("Hole", () => new []{42}),
+        //     Operator: op => Log("Operator" + op.ToString(), () => new []{42}),
+        //     SamePrecedence: p => throw new ParserErrorException($"Internal error: unexpected annotation {annotation}, expected Hole() or Operator(…)")
+        //   )
+        // ).ToList();
+        
+        //Log("\n"+op1.ToString());
+        //Log("\n"+prods.Select(prod => prod.value.Item1).JoinToStringWith(",\n"));
+        //Log("\n"+prods.Select(prod => prod.value.Item2).JoinToStringWith(",\n"));
+        //throw new ParserErrorException($"TODO SamePrecedence({associativity})");
+      },
+      LeftAssociative: () => throw new ParserErrorException($"Internal error: unexpected annotation SamePrecedence({associativity})"),
+      RightAssociative: () => throw new ParserErrorException($"Internal error: unexpected annotation SamePrecedence({associativity})")
+    );
+  }
+  */
+
+  public static Option<ValueTuple<IImmutableEnumerator<Lexeme>, AstNode>> Parse2(string source) {
     Grammar2 grammar =
       DefaultGrammar.DefaultPrecedenceDAG.ToGrammar2();
     //Log(grammar.Str());
@@ -60,13 +186,15 @@ public static partial class Parser {
       Parse3
     );
 
-    return P(Lexer.Lex(source), grammar);
+    return P(Lexer.Lex(source), grammar)
+      .IfSome((rest, result) => (rest, PostProcess(result)));
   }
 
   public static Ast.Expr Parse(string source) {
-    Log("");
-    Log("" + Parse2(source).ToString());
-    Log("");
+    Parse2(source).ToString();
+    //Log("");
+    //Log("" + Parse2(source).ToString());
+    //Log("");
     Environment.Exit(0);
 
     return Lexer.Lex(source)
@@ -110,4 +238,6 @@ public static partial class Parser {
 
 // relaxed unicity: the symbols must not appear in other operators of the same namespace nor as the closing bracket symbols which delimit the uses of this namespace in closed operators. Rationale: once the closing bracket is known, if the entire sub-expression doesn't include that bracket then the parser can fast-forward until the closing bracket, only caring about matching open and close symbols which may delimit sub-expressions with different namespaces, and know that whatever's inside is unambiguous.
 
-// Future: lex one by one to allow extending the grammar & lexer; when a new symbol is bound, re-start parsing from the start of the binding form and check that the parsing does find the same new binding at the same position. E.g. (a op b where "op" x y = x * y) is okay, but (a op b where "where" str = stuff) is not, because during the second pass, the unquoted where token does not produce a binding form anymore. E.g (a op b w/ "op" x y = x * y where "w/" = where) is okay, because during the first pass the w/ is treated as garbage, during the second pass it is treated as a binding form, but the where token which retroactively extended the grammar still parsed as the same grammar extension. In other words, re-parsing can rewrite part of the AST below the binding node, but the binding node itself should be at the same position (this includes the fact that it shouldn't be moved with respect to its ancestor AST nodes).
\ No newline at end of file
+// Future: lex one by one to allow extending the grammar & lexer; when a new symbol is bound, re-start parsing from the start of the binding form and check that the parsing does find the same new binding at the same position. E.g. (a op b where "op" x y = x * y) is okay, but (a op b where "where" str = stuff) is not, because during the second pass, the unquoted where token does not produce a binding form anymore. E.g (a op b w/ "op" x y = x * y where "w/" = where) is okay, because during the first pass the w/ is treated as garbage, during the second pass it is treated as a binding form, but the where token which retroactively extended the grammar still parsed as the same grammar extension. In other words, re-parsing can rewrite part of the AST below the binding node, but the binding node itself should be at the same position (this includes the fact that it shouldn't be moved with respect to its ancestor AST nodes).
+
+// Random note: why don't we have named return values, i.e. C#'s "out" with a sane syntax for functional programming? Tuples are a way to do that, but unpacking / repacking them is cumbersome.
\ No newline at end of file
diff --git a/Utils/Enumerable.cs b/Utils/Enumerable.cs
index 7a71b69..78e5f96 100644
--- a/Utils/Enumerable.cs
+++ b/Utils/Enumerable.cs
@@ -176,6 +176,9 @@ public static class Collection {
     }
   }
 
+  public static Option<U> Single<T, U>(this IEnumerable<T> ie, Func<T, Option<U>> f)
+    => ie.Select(f).Single(x => x.IsSome);
+
   public static Option<V> GetValue<K, V>(this ImmutableDictionary<K, V> d, K key) {
     V result = default(V);
     if (d.TryGetValue(key, out result)) {