parseman 0.61.5 → 0.61.7

package/dist/plugin/entry-supercompiler.d.ts

@@ -36,6 +36,21 @@ export type EntrySupercompileResult = EmitResult & {
  * externally-addressable scan roots passed to the canonical emitter.
  */
 export declare function supercompileEntryAssembly(prog: TableProgram, cfg: EntrySupercompileCfg, extraIps?: readonly number[]): EntrySupercompileResult;
+/**
+ * Functions that read the same are one function: `optional(x)` written in 25 places
+ * is 25 rows and one body, and a trivia skip can be pooled under two labels that
+ * lower alike. This runs after the join, so a site with one caller has
+ * already gone into it, the selection is untouched and every call a parse makes is
+ * still made. Each pass can make the callers of a merged function read alike, so it
+ * repeats until nothing merges.
+ *
+ * Only identifiers are compared or renamed: a grammar's own text reaches this source
+ * as strings and regexes, and they count as written. A temporary is local by the
+ * emitter's contract and is numbered per assembly, so one this function binds is
+ * compared in order of use. A site name that's also bound somewhere, or abbreviated
+ * in `{_pf1}`, can't be renamed by name, so that source stays as it is.
+ */
+export declare function mergeSameBodies(source: string): string;
 /**
  * Plugin-only final splice for an ordinary macro replacement. The table
  * compiler emits its canonical callback-free public artifact first; this pass

package/dist/plugin/entry-supercompiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"entry-supercompiler.d.ts","sourceRoot":"","sources":["../../src/plugin/entry-supercompiler.ts"],"names":[],"mappings":"AAYA,OAAO,EAAsB,KAAK,UAAU,EAAE,MAAM,2BAA2B,CAAA;AAE/E,OAAO,EAAkC,KAAK,YAAY,EAAE,MAAM,qBAAqB,CAAA;AAKvF,MAAM,MAAM,oBAAoB,GAAG;IACjC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,iBAAiB,CAAC,EAAE,OAAO,CAAA;IACpC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;IACpE,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAA;IAC5B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAA;IAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAA;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;IAChC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAA;IACpC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAA;IACjC,QAAQ,CAAC,eAAe,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACvF,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CACpD,CAAA;AAED,MAAM,MAAM,uBAAuB,GAAG,UAAU,GAAG;IAAE,QAAQ,CAAC,YAAY,EAAE,sBAAsB,CAAA;CAAE,CAAA;AAyKpG;;;GAGG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,YAAY,EAClB,GAAG,EAAE,oBAAoB,EACzB,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,uBAAuB,CAGzB;AAED;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,IAAI,EAAE,YAAY,EAClB,WAAW,EAAE,MAAM,EACnB,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC3B,MAAM,CA0CR;AAED,8EAA8E;AAC9E,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,YAAY,EAClB,IAAI,EAAE,oBAAoB,EAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,OAAO,EAAE,UAAU,GAClB,uBAAuB,CAwRzB"}
+{"version":3,"file":"entry-supercompiler.d.ts","sourceRoot":"","sources":["../../src/plugin/entry-supercompiler.ts"],"names":[],"mappings":"AAYA,OAAO,EAAsB,KAAK,UAAU,EAAE,MAAM,2BAA2B,CAAA;AAE/E,OAAO,EAAkC,KAAK,YAAY,EAAE,MAAM,qBAAqB,CAAA;AAKvF,MAAM,MAAM,oBAAoB,GAAG;IACjC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IACzB,QAAQ,CAAC,iBAAiB,CAAC,EAAE,OAAO,CAAA;IACpC,QAAQ,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,GAAG,SAAS,CAAA;IACpE,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAA;IAC5B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,sBAAsB,GAAG;IACnC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAA;IAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;IAChC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAA;IACjC,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAA;IAChC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAA;IACpC,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAA;IACjC,QAAQ,CAAC,eAAe,EAAE,QAAQ,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IACvF,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CACpD,CAAA;AAED,MAAM,MAAM,uBAAuB,GAAG,UAAU,GAAG;IAAE,QAAQ,CAAC,YAAY,EAAE,sBAAsB,CAAA;CAAE,CAAA;AA2KpG;;;GAGG;AACH,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,YAAY,EAClB,GAAG,EAAE,oBAAoB,EACzB,QAAQ,GAAE,SAAS,MAAM,EAAO,GAC/B,uBAAuB,CAGzB;AAgCD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CA6DtD;AAED;;;;;GAKG;AACH,wBAAgB,8BAA8B,CAC5C,IAAI,EAAE,YAAY,EAClB,WAAW,EAAE,MAAM,EACnB,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC3B,MAAM,CA0CR;AAED,8EAA8E;AAC9E,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,YAAY,EAClB,IAAI,EAAE,oBAAoB,EAC1B,QAAQ,EAAE,SAAS,MAAM,EAAE,EAC3B,OAAO,EAAE,UAAU,GAClB,uBAAuB,CAwRzB"}

package/dist/plugin/index.js

@@ -206,8 +206,9 @@ function matchesEmptyBody(p, seen, resolve3) {
     case "optional":
     case "not":
     case "peek":
+    case "expect":
       return true;
-    // zero repetitions / absent / lookahead
+    // zero repetitions / absent / lookahead / recovered
     // Default `sepBy` is `(item (sep item)*)?` — it MATCHES THE EMPTY STRING.
     // Any `min >= 1` requires that many ITEMS, so it is nullable only when the
     // item is. (Keying this off `min === 1` reported every `{ min: 2 }` list as
@@ -228,7 +229,6 @@ function matchesEmptyBody(p, seen, resolve3) {
     case "trivia":
     case "token":
     case "leaf":
-    case "expect":
     case "withCtx":
     case "node":
     case "grammar":
@@ -298,17 +298,17 @@ function sequenceSet(parsers, fs3, empties, trivia2, consuming = true) {
 function sequenceFirstSet(parsers) {
   return sequenceSet(parsers, (p) => p._meta.firstSet, matchesEmpty, void 0, false);
 }
-function firstSetOf(p, seen = /* @__PURE__ */ new Set(), resolve3, activeTrivia, consuming = true) {
+function firstSetOf(p, seen = /* @__PURE__ */ new Set(), resolve3, activeTrivia, consuming = true, follow = false) {
   if (seen.has(p)) return any();
   seen.add(p);
   try {
-    return firstSetBody(p, seen, resolve3, activeTrivia, consuming);
+    return firstSetBody(p, seen, resolve3, activeTrivia, consuming, follow);
   } finally {
     seen.delete(p);
   }
 }
-function firstSetBody(p, seen, resolve3, activeTrivia, consuming) {
-  const fs3 = (c) => firstSetOf(c, seen, resolve3, activeTrivia, consuming);
+function firstSetBody(p, seen, resolve3, activeTrivia, consuming, follow) {
+  const fs3 = (c) => firstSetOf(c, seen, resolve3, activeTrivia, consuming, follow);
   const empties = (c) => matchesEmpty(c, /* @__PURE__ */ new Set(), resolve3);
   const d = p._def;
   switch (d.tag) {
@@ -329,7 +329,7 @@ function firstSetBody(p, seen, resolve3, activeTrivia, consuming) {
         }
       }
       const through = activeTrivia === null && resolve3 !== void 0;
-      return firstSetOf(target, seen, resolve3, through ? triviaThroughRef(p, target, null) : activeTrivia, consuming);
+      return firstSetOf(target, seen, resolve3, through ? triviaThroughRef(p, target, null) : activeTrivia, consuming, follow);
     }
     case "choice": {
       let out = empty();
@@ -339,6 +339,10 @@ function firstSetBody(p, seen, resolve3, activeTrivia, consuming) {
     case "sequence": {
       return sequenceSet(d.parsers, fs3, empties, activeTrivia, consuming);
     }
+    // Runs on any character: on one its child can't start, it reports the error. A
+    // resync sentinel still stops where the child could start.
+    case "expect":
+      return follow ? fs3(d.parser) : any();
     case "peek": {
       const inner = d.parser;
       return empties(inner) ? any() : fs3(inner);
@@ -352,7 +356,6 @@ function firstSetBody(p, seen, resolve3, activeTrivia, consuming) {
     case "leaf":
     case "node":
     case "sepBy":
-    case "expect":
     // A transaction accepts exactly what its inner accepts. Its own `_meta` is
     // the inner's construction-time set, which reads `any` when the inner opens
     // with a rule reference — resolve through it like any other wrapper.
@@ -360,14 +363,15 @@ function firstSetBody(p, seen, resolve3, activeTrivia, consuming) {
       return fs3(d.parser);
     // A token runs its body with trivia cleared (`token.ts`).
     case "token":
-      return firstSetOf(d.parser, seen, resolve3, activeTrivia === void 0 ? void 0 : null, consuming);
+      return firstSetOf(d.parser, seen, resolve3, activeTrivia === void 0 ? void 0 : null, consuming, follow);
     case "grammar":
       return firstSetOf(
         d.parser,
         seen,
         resolve3,
         d.clearTrivia ? null : d.triviaParser ?? activeTrivia,
-        consuming
+        consuming,
+        follow
       );
     // A run starts with its first line's prefix; a nullable prefix starts with anything.
     case "lines": {
@@ -3650,7 +3654,7 @@ function sequence(...parsers) {
       if (tolerant) {
         followSentinels ??= parsers.map((_, i) => firstSetSentinel(
           parsers.slice(i + 1).reduce(
-            (set, parser2) => union(set, firstSetOf(parser2, /* @__PURE__ */ new Set(), void 0, void 0, false)),
+            (set, parser2) => union(set, firstSetOf(parser2, /* @__PURE__ */ new Set(), void 0, void 0, false, true)),
             { kind: "empty" }
           )
         ));
@@ -3800,7 +3804,8 @@ function derive(c, seen) {
 function expect(combinator, label2) {
   const expected = label2 !== void 0 ? [label2] : deriveExpected(combinator);
   const meta = {
-    firstSet: combinator._meta.firstSet,
+    // It runs on any character: on one its child can't start, it reports the error.
+    firstSet: any(),
     canMatchNewline: combinator._meta.canMatchNewline,
     isTrivia: false
   };
@@ -5630,7 +5635,7 @@ function sourceLeaf(root, fn) {
 }
 
 // src/version.ts
-var PARSEMAN_VERSION = "0.61.5";
+var PARSEMAN_VERSION = "0.61.7";
 
 // src/table/lex-body.ts
 function buildLexBodyRecognizer(spec, constants) {
@@ -8562,7 +8567,7 @@ var Encoder = class {
     let fs3 = { kind: "empty" };
     const rr = this.refResolver();
     for (let j = i + 1; j < parsers.length; j++) {
-      fs3 = union(fs3, firstSetOf(parsers[j], /* @__PURE__ */ new Set(), rr, void 0, false));
+      fs3 = union(fs3, firstSetOf(parsers[j], /* @__PURE__ */ new Set(), rr, void 0, false, true));
     }
     return this.charClass(fs3);
   }
@@ -11057,17 +11062,17 @@ var WRAPPERS = /* @__PURE__ */ new Set([
   OP_SCOPE_PLAIN,
   OP_FIELD,
   OP_LABEL,
-  OP_EXPECT,
   OP_WITHCTX,
   OP_RULE,
   OP_ATTEMPT,
   OP_COV,
   OP_GAPGATE
 ]);
-function rowNullable(code, k, ip, memo) {
-  const hit = memo.get(ip);
+function rowNullable(code, k, ip, memo, recovers = true) {
+  const key = recovers ? ip : ~ip;
+  const hit = memo.get(key);
   if (hit !== void 0) return hit;
-  memo.set(ip, true);
+  memo.set(key, true);
   const op = code[ip];
   const kids = [];
   let out = true;
@@ -11078,20 +11083,20 @@ function rowNullable(code, k, ip, memo) {
     out = !(re instanceof RegExp) || regexCanMatchEmpty(re.source);
   } else if (op === OP_SEQ || op === OP_SEQV || op === OP_SEQX) {
     childSlots(code, ip, kids);
-    out = kids.every((c) => rowNullable(code, k, c, memo));
+    out = kids.every((c) => rowNullable(code, k, c, memo, recovers));
   } else if (op === OP_CHOICE) {
     childSlots(code, ip, kids);
-    out = kids.length === 0 || kids.some((c) => rowNullable(code, k, c, memo));
+    out = kids.length === 0 || kids.some((c) => rowNullable(code, k, c, memo, recovers));
   } else if (op === OP_REP || op === OP_REPV) {
-    out = code[ip + 2] === 0 || rowNullable(code, k, code[ip + 1], memo);
+    out = code[ip + 2] === 0 || rowNullable(code, k, code[ip + 1], memo, recovers);
   } else if (op === OP_SEED) {
-    out = rowNullable(code, k, code[ip + 1], memo);
+    out = rowNullable(code, k, code[ip + 1], memo, recovers);
   } else if (op === OP_CONT) {
-    out = rowNullable(code, k, code[ip + 1], memo) && rowNullable(code, k, code[ip + 3], memo);
-  } else if (WRAPPERS.has(op)) {
-    if (childSlots(code, ip, kids) && kids.length === 1) out = rowNullable(code, k, kids[0], memo);
+    out = rowNullable(code, k, code[ip + 1], memo, recovers) && rowNullable(code, k, code[ip + 3], memo, recovers);
+  } else if (WRAPPERS.has(op) || op === OP_EXPECT && !recovers) {
+    if (childSlots(code, ip, kids) && kids.length === 1) out = rowNullable(code, k, kids[0], memo, recovers);
   }
-  memo.set(ip, out);
+  memo.set(key, out);
   return out;
 }
 function holdsGap(code, k, base, n, i, memo) {
@@ -11100,7 +11105,7 @@ function holdsGap(code, k, base, n, i, memo) {
   if (code[term] !== OP_NOT && code[term] !== OP_PEEK) return false;
   const next = code[base + i + 1];
   if (code[next] === OP_ADJ || leadingTriviaFieldAt(code, k, next)) return false;
-  return !rowNullable(code, k, next, memo);
+  return !rowNullable(code, k, next, memo, false);
 }
 
 // src/table/gap-gate.ts
@@ -11422,11 +11427,35 @@ ${fast}
 ${scanned}
 }`;
 }
-function emitHoldTerm(callee, dst, t, l, skip) {
+var TRIVIA_LOG_LENGTH = "ctx._cstBuf!==undefined?(ctx._cstBuf.tl!==undefined?ctx._cstBuf.tl.length:0):(ctx._cstTriviaLog!==undefined?ctx._cstTriviaLog.length:0)";
+function emitHoldTerm(callee, dst, t, l, skip, recovers) {
   const fast = `const ${t}v=${callee}(input,cur,ctx)
 if(${t}v===FAIL)return FAIL
 ${dst}=${t}v
 cur=EC.e`;
+  if (recovers) {
+    const marked = `let ${t}c=cur,${t}s=cur,${t}tl=0,${t}stl=0,${t}lg=0,${t}slg=0,${t}rt=0,${t}srt=0`;
+    if (l.tri === TRI_NONE) return `${marked}
+${fast}`;
+    const held2 = `${t}tl=${TRIVIA_LOG_LENGTH}
+${t}lg=ctx._triviaLog!==undefined?ctx._triviaLog.length:0
+${t}rt=ctx._rootTriviaLog!==undefined?ctx._rootTriviaLog.length:0
+${t}s=${skip}(input,cur,ctx)
+${t}stl=${TRIVIA_LOG_LENGTH}
+${t}slg=ctx._triviaLog!==undefined?ctx._triviaLog.length:0
+${t}srt=ctx._rootTriviaLog!==undefined?ctx._rootTriviaLog.length:0
+const ${t}v=${callee}(input,${t}s,ctx)
+if(${t}v===FAIL)return FAIL
+${dst}=${t}v
+cur=${t}s`;
+    return l.tri !== TRI_UNKNOWN ? `${marked}
+${held2}` : `${marked}
+if(ctx.trivia===undefined){
+${fast}
+}else{
+${held2}
+}`;
+  }
   if (l.tri === TRI_NONE) return fast;
   const held = `const ${t}s=${skip}(input,cur,ctx)
 const ${t}v=${callee}(input,${t}s,ctx)
@@ -11440,6 +11469,9 @@ ${fast}
 ${held}
 }`;
 }
+function emitHeldGapUndo(t) {
+  return `if(cur===${t}s&&${t}s!==${t}c){rollbackScannedTriviaAt(ctx,${t}tl,${t}stl,${t}lg,${t}slg,${t}rt,${t}srt);cur=${t}c}`;
+}
 function leadSkip(hasTrivia, leadTrivia, skip) {
   if (hasTrivia === "false") return "{}";
   const call = `itemStart=${skip}(input,itemStart,ctx)`;
@@ -12448,6 +12480,7 @@ return v
         }
         parts.push("let cur=EC.e");
         const names = ["v0"];
+        let heldUndo;
         for (let i = 1; i < n; i++) {
           const vn = `v${i}`;
           parts.push(`let ${vn}`);
@@ -12464,7 +12497,16 @@ return v
             );
           } else {
             const callee = leadingTriviaFieldAt(code, k, childIp) ? `(LEAD.at=cur,${kids[i]})` : kids[i];
-            parts.push(holdsGap(code, k, base, n, i, nullable2) ? emitHoldTerm(callee, vn, tmp(), L, skipFor(L)) : emitTerm(callee, vn, tmp(), L, skipFor(L), L.tri >= 0 ? triviaMiss(L.tri) : void 0));
+            if (holdsGap(code, k, base, n, i, nullable2)) {
+              const t2 = tmp();
+              const recovers = rowNullable(code, k, code[base + i + 1], nullable2);
+              parts.push(emitHoldTerm(callee, vn, t2, L, skipFor(L), recovers));
+              heldUndo = recovers ? t2 : void 0;
+            } else {
+              parts.push(emitTerm(callee, vn, tmp(), L, skipFor(L), L.tri >= 0 ? triviaMiss(L.tri) : void 0));
+              if (heldUndo !== void 0) parts.push(emitHeldGapUndo(heldUndo));
+              heldUndo = void 0;
+            }
           }
           names.push(vn);
         }
@@ -15965,8 +16007,46 @@ function assemble(t, prog, cfg) {
         }
         if (hasAdj) {
           const first2 = linkFirst();
+          let heldFrom = 0, heldTl = 0, heldScanTl = 0, heldLog = 0, heldScanLog = 0, heldRoot = 0, heldScanRoot = 0;
           const runnerAt = (i) => {
             const kidIp = code[base + i];
+            if (i > 1 && holdsGap(code, k, base, n, i - 1, NULLABLE) && rowNullable(code, k, kidIp, NULLABLE)) {
+              const kid = link(kidIp);
+              return (input, cur, ctx) => {
+                const from = heldFrom, tl = heldTl, scanTl = heldScanTl, log = heldLog;
+                const scanLog = heldScanLog, root = heldRoot, scanRoot = heldScanRoot;
+                const next = step(kid, input, cur, ctx);
+                if (next !== cur || from === cur) return next;
+                rollbackScannedTriviaAt(ctx, tl, scanTl, log, scanLog, root, scanRoot);
+                return from;
+              };
+            }
+            if (holdsGap(code, k, base, n, i, NULLABLE) && rowNullable(code, k, code[base + i + 1], NULLABLE)) {
+              const kid = link(kidIp);
+              return (input, cur, ctx) => {
+                if (ctx.trivia === void 0) {
+                  const v2 = kid(input, cur, ctx);
+                  if (v2 === FAIL) return -1;
+                  TERMV = v2;
+                  heldFrom = cur;
+                  return EC.e;
+                }
+                const tl = cstTlLen(ctx), log = ctx._triviaLog?.length ?? 0, root = ctx._rootTriviaLog?.length ?? 0;
+                const scanEnd = skipTrivia(input, cur, ctx);
+                const scanTl = cstTlLen(ctx), scanLog = ctx._triviaLog?.length ?? 0, scanRoot = ctx._rootTriviaLog?.length ?? 0;
+                const v = kid(input, scanEnd, ctx);
+                if (v === FAIL) return -1;
+                TERMV = v;
+                heldFrom = cur;
+                heldTl = tl;
+                heldScanTl = scanTl;
+                heldLog = log;
+                heldScanLog = scanLog;
+                heldRoot = root;
+                heldScanRoot = scanRoot;
+                return scanEnd;
+              };
+            }
             if (holdsGap(code, k, base, n, i, NULLABLE)) {
               const kid = link(kidIp);
               return (input, cur, ctx) => {
@@ -19464,21 +19544,70 @@ function runDuplicationDiagnosticRules(ruleMap, opt) {
 var LOOP = 8;
 var ROUNDS = 60;
 var CAP = 1e12;
+var CROSSING_WEIGHT = 4;
+var TAKEN = -1;
 function selectHotSites(code, entries, siteBytes, budget, profile) {
   const selected = /* @__PURE__ */ new Set();
   if (budget <= 0) return selected;
-  const weight = profile === void 0 ? staticWeights(code, entries) : void 0;
-  const w = (ip) => (weight !== void 0 ? weight.get(ip) : profile[ip]) ?? 0;
-  const ranked = [...siteBytes.keys()].sort((a, b) => w(b) / siteBytes.get(b) - w(a) / siteBytes.get(a) || a - b);
   let spent = 0;
-  for (const ip of ranked) {
-    if (w(ip) === 0) break;
+  for (const ip of profile === void 0 ? staticRanking(code, entries, siteBytes) : connectedRanking(code, siteBytes, profile)) {
     spent += siteBytes.get(ip);
     if (spent > budget) break;
     selected.add(ip);
   }
   return selected;
 }
+function edgesAsLowered(code, siteBytes, ip, out) {
+  out.length = 0;
+  if (code[ip] !== OP_CONT) childSlots(code, ip, out);
+  else if (siteBytes.has(ip)) out.push(code[ip + 1], code[ip + 3]);
+  else out.push(code[ip + 2]);
+  for (let i = 0; i < out.length; i++) {
+    let row = out[i];
+    for (; ; ) {
+      const op = code[row];
+      if (op === OP_GAPGATE || op === OP_SEED) row = code[row + 1];
+      else if (op === OP_CONT && !siteBytes.has(row)) row = code[row + 2];
+      else break;
+    }
+    out[i] = row;
+  }
+}
+function staticRanking(code, entries, siteBytes) {
+  const weight = staticWeights(code, entries, siteBytes);
+  const w = (ip) => weight.get(ip) ?? 0;
+  return [...siteBytes.keys()].filter((ip) => w(ip) > 0).sort((a, b) => w(b) / siteBytes.get(b) - w(a) / siteBytes.get(a) || a - b);
+}
+function* connectedRanking(code, siteBytes, calls) {
+  const ran = [...siteBytes.keys()].filter((ip) => calls[ip] > 0).sort((a, b) => a - b);
+  const slot = new Map(ran.map((ip, i) => [ip, i]));
+  const bytes = ran.map((ip) => siteBytes.get(ip));
+  const worth = ran.map((ip) => calls[ip]);
+  const score = worth.map((value, i) => value / bytes[i]);
+  const crossings = ran.map(() => []);
+  const kids = [];
+  ran.forEach((ip, from) => {
+    edgesAsLowered(code, siteBytes, ip, kids);
+    for (const callee of kids) {
+      const to = slot.get(callee);
+      if (to === void 0) continue;
+      const gain = CROSSING_WEIGHT * calls[callee];
+      crossings[from].push([to, gain]);
+      crossings[to].push([from, gain]);
+    }
+  });
+  for (let left = ran.length; left > 0; left--) {
+    let best = 0;
+    for (let i = 1; i < score.length; i++) if (score[i] > score[best]) best = i;
+    score[best] = TAKEN;
+    yield ran[best];
+    for (const [neighbour, gain] of crossings[best]) {
+      if (score[neighbour] === TAKEN) continue;
+      worth[neighbour] = worth[neighbour] + gain;
+      score[neighbour] = worth[neighbour] / bytes[neighbour];
+    }
+  }
+}
 function fitHotSites(code, entries, siteBytes, fixed, ceiling, sourceBytes, profile) {
   const ranked = [...selectHotSites(code, entries, siteBytes, ceiling - fixed, profile)];
   for (; ranked.length > 0; ranked.pop()) {
@@ -19488,25 +19617,17 @@ function fitHotSites(code, entries, siteBytes, fixed, ceiling, sourceBytes, prof
   }
   return void 0;
 }
-function staticWeights(code, entries) {
+function staticWeights(code, entries, siteBytes) {
   let weight = /* @__PURE__ */ new Map();
   const kids = [];
   for (let round = 0; round < ROUNDS; round++) {
     const next = /* @__PURE__ */ new Map();
     for (const ip of entries) next.set(ip, 1);
     for (const [ip, w] of weight) {
-      kids.length = 0;
-      childSlots(code, ip, kids);
+      edgesAsLowered(code, siteBytes, ip, kids);
       const op = code[ip];
-      if (op === OP_CONT && continuationGate(code, code[ip + 3]) !== void 0) {
-        kids.length = 0;
-        kids.push(code[ip + 1], code[ip + 3]);
-      }
       const scale = op === OP_REP || op === OP_REPV ? LOOP : op === OP_CHOICE || op === OP_DISPATCH ? 1 / Math.max(1, kids.length) : 1;
-      for (const k of kids) {
-        const kid = code[k] === OP_GAPGATE ? code[k + 1] : k;
-        next.set(kid, Math.min(CAP, (next.get(kid) ?? 0) + w * scale));
-      }
+      for (const kid of kids) next.set(kid, Math.min(CAP, (next.get(kid) ?? 0) + w * scale));
     }
     weight = next;
   }
@@ -22732,6 +22853,8 @@ function findFreeIdentifiers(code, filename) {
 // src/plugin/entry-supercompiler.ts
 import { parseSync as parseSync5 } from "oxc-parser";
 var PIECE = /^_pf(\d+)$/;
+var MERGEABLE = /^_(?:pf|sk)\d+$/;
+var TEMP = /^_t\d+_/;
 var WRAP = "function __parseman_supercompile__(){\n";
 var SUFFIX = "\n}";
 function ast(value) {
@@ -22865,6 +22988,93 @@ function fallback(emitted, reason, before) {
     }
   };
 }
+function namesUnder(root, uses, bound) {
+  let plain = true;
+  const bind = (id) => {
+    const name = nameOf2(id);
+    if (name !== void 0) bound.add(name);
+  };
+  const walk = (node2, parent) => {
+    if (node2.type === "VariableDeclarator") bind(ast(node2.id));
+    else if (node2.type === "LabeledStatement") bind(ast(node2.label));
+    else if (isFunction(node2)) {
+      if (node2 !== root) bind(ast(node2.id));
+      nodes(node2.params).forEach(bind);
+    }
+    const name = nameOf2(node2);
+    if (name !== void 0 && (MERGEABLE.test(name) || TEMP.test(name))) {
+      const isKey = parent?.type === "Property" && parent.key === node2 && parent.computed !== true;
+      const isProperty = parent?.type === "MemberExpression" && parent.property === node2 && parent.computed !== true;
+      if (parent?.type === "Property" && parent.shorthand === true) plain = false;
+      if (!isKey && !isProperty) uses.push({ ...range(node2), name });
+    }
+    for (const child of children2(node2)) walk(child, node2);
+  };
+  walk(root, void 0);
+  return plain;
+}
+function mergeSameBodies(source) {
+  const parsed = parseSync5("parseman-merge-same-bodies.js", WRAP + source + SUFFIX);
+  if (parsed.errors.length > 0) return source;
+  const statements = nodes(ast(nodes(parsed.program.body)[0]?.body)?.body);
+  const bodies = [];
+  const others = [];
+  const declared = /* @__PURE__ */ new Set();
+  for (const statement of statements) {
+    const name = statement.type === "FunctionDeclaration" ? nameOf2(ast(statement.id)) : void 0;
+    const uses = [];
+    const bound = /* @__PURE__ */ new Set();
+    if (!namesUnder(statement, uses, bound)) return source;
+    for (const local of bound) declared.add(local);
+    if (name === void 0 || !MERGEABLE.test(name)) others.push(...uses);
+    else bodies.push({ ...range(statement), name, uses: uses.sort((a, b) => a.start - b.start), local: bound });
+  }
+  for (const local of declared) if (MERGEABLE.test(local)) return source;
+  const merged = /* @__PURE__ */ new Map();
+  const current = (name) => {
+    let at = name;
+    for (let next = merged.get(at); next !== void 0; next = merged.get(at)) at = next;
+    return at;
+  };
+  let live = bodies;
+  for (let more = true; more; ) {
+    more = false;
+    const first = /* @__PURE__ */ new Map();
+    live = live.filter((body) => {
+      const temps = /* @__PURE__ */ new Map();
+      const edits2 = body.uses.map((use) => {
+        if (MERGEABLE.test(use.name)) {
+          const site = current(use.name);
+          return { ...use, text: site === body.name ? "#self" : site };
+        }
+        if (!body.local.has(use.name)) return { ...use, text: use.name };
+        const seen = temps.get(use.name) ?? temps.size;
+        temps.set(use.name, seen);
+        return { ...use, text: `#t${seen}` };
+      });
+      const key = render2(source, body.start, body.end, edits2);
+      const kept = first.get(key);
+      if (kept === void 0) {
+        first.set(key, body.name);
+        return true;
+      }
+      merged.set(body.name, kept);
+      more = true;
+      return false;
+    });
+  }
+  if (merged.size === 0) return source;
+  const edits = [];
+  const rename = (use) => {
+    if (MERGEABLE.test(use.name) && merged.has(use.name)) edits.push({ ...use, text: current(use.name) });
+  };
+  others.forEach(rename);
+  for (const body of bodies) {
+    if (merged.has(body.name)) edits.push({ start: body.start, end: body.end, text: "" });
+    else body.uses.forEach(rename);
+  }
+  return render2(source, 0, source.length, edits);
+}
 function supercompileRuleMapReplacement(prog, replacement, select) {
   const cfg = defaultAssemblyCfgs(prog)[0];
   if (cfg === void 0) return replacement;
@@ -22899,7 +23109,7 @@ function supercompileRuleMapReplacement(prog, replacement, select) {
   const start = body.start - prefix.length + 1;
   const end = body.end - prefix.length - 1;
   if (replacement.slice(start, end) !== FACTORY_ARITY_GUARD + canonical2.source + "\n") return replacement;
-  const transformed = replacement.slice(0, start) + FACTORY_ARITY_GUARD + candidate.source + "\n" + replacement.slice(end);
+  const transformed = replacement.slice(0, start) + FACTORY_ARITY_GUARD + mergeSameBodies(candidate.source) + "\n" + replacement.slice(end);
   const checked = parseSync5("parseman-entry-supercompile-replacement-result.js", prefix + transformed);
   return checked.errors.length === 0 ? transformed : replacement;
 }