parseman 0.58.2 → 0.59.0

package/dist/table/index.js

@@ -1,3 +1,32 @@
+// src/lead-ranges.ts
+function rangesHaveLead(ranges, code) {
+  for (const r of ranges) if (code >= r.lo && code <= r.hi) return true;
+  if (code <= 65535) return false;
+  const high = 55296 + (code - 65536 >> 10);
+  for (const r of ranges) if (high >= r.lo && high <= r.hi) return true;
+  return false;
+}
+function leadRanges(ranges) {
+  let out;
+  for (const r of ranges) {
+    const lo = Math.max(r.lo, 55296), hi = Math.min(r.hi, 56319);
+    if (lo <= hi) (out ??= [...ranges]).push({ lo: 65536 + (lo - 55296 << 10), hi: 65536 + (hi - 55296 << 10) + 1023 });
+  }
+  return out ?? ranges;
+}
+function implicitLeadsDropped(ranges) {
+  const implied = leadRanges(ranges.filter((r) => r.lo <= 65535)).filter((r) => r.lo > 65535);
+  const out = [];
+  for (const r of ranges) {
+    let pieces = [{ lo: r.lo, hi: r.hi }];
+    if (r.hi > 65535) for (const c of implied) {
+      pieces = pieces.flatMap((q2) => q2.hi < c.lo || q2.lo > c.hi ? [q2] : [...q2.lo < c.lo ? [{ lo: q2.lo, hi: c.lo - 1 }] : [], ...q2.hi > c.hi ? [{ lo: c.hi + 1, hi: q2.hi }] : []]);
+    }
+    out.push(...pieces);
+  }
+  return out;
+}
+
 // src/combinators/first-set.ts
 function classifyFinalChoice(arms, resolve, activeTrivia) {
   const firstSets = [];
@@ -59,8 +88,9 @@ function union(a, b) {
 function intersects(a, b) {
   if (a.kind === "any" || b.kind === "any") return true;
   if (a.kind === "empty" || b.kind === "empty") return false;
-  for (const ra of a.ranges) {
-    for (const rb of b.ranges) {
+  const bs = leadRanges(b.ranges);
+  for (const ra of leadRanges(a.ranges)) {
+    for (const rb of bs) {
       if (ra.lo <= rb.hi && rb.lo <= ra.hi) return true;
     }
   }
@@ -76,6 +106,9 @@ function startsFirstSet(combinator, input, pos) {
   const code = input.codePointAt(pos);
   if (code === void 0) return false;
   for (const r of fs.ranges) if (code >= r.lo && code <= r.hi) return true;
+  if (code <= 65535) return false;
+  const high = 55296 + (code - 65536 >> 10);
+  for (const r of fs.ranges) if (high >= r.lo && high <= r.hi) return true;
   return false;
 }
 function fromRange(lo, hi) {
@@ -176,12 +209,13 @@ function narrowBy(acc, constraint) {
   if (acc.kind === "any") return constraint;
   if (acc.kind === "empty" || constraint.kind === "empty") return { kind: "empty" };
   const ranges = [];
-  for (const a of acc.ranges) for (const b of constraint.ranges) {
+  const bs = leadRanges(constraint.ranges);
+  for (const a of leadRanges(acc.ranges)) for (const b of bs) {
     const lo = Math.max(a.lo, b.lo);
     const hi = Math.min(a.hi, b.hi);
     if (lo <= hi) ranges.push({ lo, hi });
   }
-  return ranges.length === 0 ? { kind: "empty" } : { kind: "ranges", ranges };
+  return ranges.length === 0 ? { kind: "empty" } : { kind: "ranges", ranges: implicitLeadsDropped(ranges) };
 }
 function applyAssertion(fs, assertion) {
   return assertion === null ? fs : fs.kind === "empty" ? assertion : narrowBy(fs, assertion);
@@ -349,6 +383,7 @@ function createDetachedParseContext(trackLines, state) {
 }
 
 // src/line-index.ts
+import { PlainLineSpan, PlainSpan } from "../cst/plain.js";
 function createLineIndex() {
   return { lineStarts: [0] };
 }
@@ -401,6 +436,14 @@ function annotateSpan(span, index) {
     endColumn: e.col
   };
 }
+function lineSpanFromContext(span, ctx) {
+  if (!ctx.trackLines) return span;
+  const index = ctx._lineIndex ?? (ctx._lineStarts ? { lineStarts: ctx._lineStarts } : void 0);
+  if (!index) return span;
+  const s = offsetToLineCol(index, span.start);
+  const e = offsetToLineCol(index, span.end);
+  return new PlainLineSpan(span.start, span.end, s.line, s.col, e.line, e.col);
+}
 function annotateSpanFromLineContext(span, ctx) {
   if (!ctx.trackLines) return span;
   const index = ctx._lineIndex ?? (ctx._lineStarts ? { lineStarts: ctx._lineStarts } : void 0);
@@ -605,15 +648,19 @@ function rebuildLineScan(s, subtree) {
 }
 
 // src/cst/capture-buffer.ts
+import { PlainBuf, PlainLeaf } from "../cst/plain.js";
 function cstCaptureActive(ctx) {
   return ctx._cstBuf !== void 0 || ctx._cstLeaves !== void 0;
 }
+function isLeaf(v) {
+  return typeof v === "object" && v !== null && v._tag === "leaf";
+}
 function pushCstLeaf(ctx, leaf2) {
   if (!ctx.trackLines) {
     pushCstChild(ctx, leaf2, leaf2);
     return;
   }
-  const annotated = leaf2 && typeof leaf2 === "object" && leaf2.span ? { ...leaf2, span: annotateSpanFromLineContext(leaf2.span, ctx) } : leaf2;
+  const annotated = isLeaf(leaf2) ? new PlainLeaf(leaf2.value, lineSpanFromContext(leaf2.span, ctx)) : leaf2 && typeof leaf2 === "object" && leaf2.span ? { ...leaf2, span: annotateSpanFromLineContext(leaf2.span, ctx) } : leaf2;
   pushCstChild(ctx, annotated, annotated);
 }
 function pushCstChild(ctx, built, rawEntry2) {
@@ -806,11 +853,17 @@ function shorthandRanges(ch2) {
   if (ch2 === "s") return SPACE_RANGES;
   return [[48, 57], [65, 90], [97, 122], [95, 95]];
 }
-function readUnicodeEscape(body, i) {
+function readUnicodeEscape(body, i, unicode = false) {
   if (body[i] !== "\\" || body[i + 1] !== "u") return null;
   const hex = body.slice(i + 2, i + 6);
   if (!/^[0-9a-fA-F]{4}$/.test(hex)) return null;
-  return { cp: Number.parseInt(hex, 16), next: i + 6 };
+  const cp = Number.parseInt(hex, 16);
+  if (unicode && cp >= 55296 && cp <= 56319 && body[i + 6] === "\\" && body[i + 7] === "u") {
+    const lowHex = body.slice(i + 8, i + 12);
+    const low = /^[0-9a-fA-F]{4}$/.test(lowHex) ? Number.parseInt(lowHex, 16) : -1;
+    if (low >= 56320 && low <= 57343) return { cp: 65536 + (cp - 55296 << 10) + (low - 56320), next: i + 12 };
+  }
+  return { cp, next: i + 6 };
 }
 var META = new Set("()[]{}*+?|^$.".split(""));
 function literalCodePoints(frag) {
@@ -822,6 +875,7 @@ function literalCodePoints(frag) {
       const e = frag[i + 1];
       if (e === void 0) return null;
       if (!(e in CLASS_ESCAPES) && /\w/.test(e)) return null;
+      if (e === "0" && frag[i + 2] !== void 0 && frag[i + 2] >= "0" && frag[i + 2] <= "9") return null;
       out.push(e in CLASS_ESCAPES ? CLASS_ESCAPES[e] : e.codePointAt(0));
       i += 2;
       continue;
@@ -862,14 +916,14 @@ function parseClassOperand(body) {
   if (cps && cps.length === 1) return { ranges: [[cps[0], cps[0]]], negated: false };
   return null;
 }
-function parseClassRanges(body) {
+function parseClassRanges(body, unicode = false) {
   const ranges = [];
   let i = 0;
   const readAtom = () => {
     const ch2 = body[i];
     if (ch2 === void 0) return null;
     if (ch2 === "\\") {
-      const uni = readUnicodeEscape(body, i);
+      const uni = readUnicodeEscape(body, i, unicode);
       if (uni) {
         i = uni.next;
         return { cp: uni.cp };
@@ -877,13 +931,15 @@ function parseClassRanges(body) {
       const e = body[i + 1];
       if (e === void 0) return null;
       i += 2;
+      if (e === "0" && body[i] !== void 0 && body[i] >= "0" && body[i] <= "9" || e >= "1" && e <= "9") return null;
       if (e in CLASS_ESCAPES) return { cp: CLASS_ESCAPES[e] };
       if (e === "d" || e === "w" || e === "s") return { set: shorthandRanges(e) };
       if (e >= "a" && e <= "z" || e >= "A" && e <= "Z") return null;
       return { cp: e.codePointAt(0) };
     }
-    i += ch2.length;
-    return { cp: ch2.codePointAt(0) };
+    const cp = unicode ? body.codePointAt(i) : body.charCodeAt(i);
+    i += cp > 65535 ? 2 : 1;
+    return { cp };
   };
   while (i < body.length) {
     const lo = readAtom();
@@ -1519,6 +1575,7 @@ function triviaKindMask(labels, keep) {
 }
 
 // src/recovery/scan.ts
+import { PlainSpan as PlainSpan2 } from "../cst/plain.js";
 function probeAt(sentinel, input, pos, ctx) {
   const s = {
     _probe: ctx._probe,
@@ -1586,9 +1643,7 @@ function firstSetSentinel(fs) {
     parse(input, pos) {
       const code = pos < input.length ? input.codePointAt(pos) : void 0;
       if (code !== void 0) {
-        for (const r of ranges) {
-          if (code >= r.lo && code <= r.hi) return { ok: true, value: null, span: { start: pos, end: pos } };
-        }
+        if (rangesHaveLead(ranges, code)) return { ok: true, value: null, span: { start: pos, end: pos } };
       }
       return { ok: false, expected: [], span: { start: pos, end: pos } };
     }
@@ -1597,7 +1652,7 @@ function firstSetSentinel(fs) {
 function recoverScan(input, from, ctx, sync, expected) {
   let scanPos = from;
   while (scanPos < input.length && !probeAt(sync, input, scanPos, ctx)) scanPos++;
-  const span = { start: from, end: scanPos };
+  const span = new PlainSpan2(from, scanPos);
   if (ctx.trackLines) recordLineRangeFromContext(ctx, input, from, scanPos);
   const error = { _tag: "parseError", span: ctx.trackLines ? annotateSpanFromLineContext(span, ctx) : span, expected };
   ctx._errors?.push(error);
@@ -2673,6 +2728,9 @@ function inFirstSet(code, fs) {
   if (fs.kind === "any") return true;
   if (fs.kind === "empty") return false;
   for (const r of fs.ranges) if (code >= r.lo && code <= r.hi) return true;
+  if (code <= 65535) return false;
+  const high = 55296 + (code - 65536 >> 10);
+  for (const r of fs.ranges) if (high >= r.lo && high <= r.hi) return true;
   return false;
 }
 function areDisjoint(sets) {
@@ -2697,17 +2755,18 @@ function buildAsciiDispatch(parsers) {
 }
 
 // src/combinators/field-trivia.ts
+import { PlainSpan as PlainSpan3, PlainTriviaField } from "../cst/plain.js";
 var LEAD = { at: -1 };
 var FIELD_LEADING_TRIVIA = 1;
 var FIELD_TRAILING_TRIVIA = 2;
 function triviaFieldCapture(name, value, input, start, end, leadFrom, trailEnd) {
-  return {
+  return new PlainTriviaField(
     name,
     value,
-    span: { start, end },
-    leading: leadFrom >= 0 && leadFrom < start ? input.slice(leadFrom, start) : "",
-    trailing: trailEnd > end ? input.slice(end, trailEnd) : ""
-  };
+    new PlainSpan3(start, end),
+    leadFrom >= 0 && leadFrom < start ? input.slice(leadFrom, start) : "",
+    trailEnd > end ? input.slice(end, trailEnd) : ""
+  );
 }
 function leadsTrivia(p) {
   return p._def.tag === "field" && p._def.leadingTrivia === true;
@@ -3016,7 +3075,7 @@ function rangesHaveNewline(ranges) {
   return ranges.some(([lo, hi]) => lo <= 10 && 10 <= hi);
 }
 var BAIL = /* @__PURE__ */ Symbol("regex-bail");
-function parseRegex(src) {
+function parseRegex(src, unicode = false, sets = false) {
   let i = 0;
   const parseAlt = () => {
     const arms = [parseSeq()];
@@ -3086,9 +3145,11 @@ function parseRegex(src) {
         i++;
         return charNode(fromRange(123, 123), false);
       // a `{` with nothing to quantify is a literal brace
-      default:
-        i += ch2.length;
-        return charNode(fromRange(ch2.codePointAt(0), ch2.codePointAt(0)), ch2 === "\n");
+      default: {
+        const cp = unicode ? src.codePointAt(i) : src.charCodeAt(i);
+        i += cp > 65535 ? 2 : 1;
+        return charNode(fromRange(cp, cp), ch2 === "\n");
+      }
     }
   };
   const parseGroup = () => {
@@ -3121,6 +3182,32 @@ function parseRegex(src) {
     let k = i + 1;
     const negated = src[k] === "^";
     if (negated) k++;
+    if (sets) {
+      let depth = 1;
+      let nested = false;
+      while (k < src.length && depth > 0) {
+        const c = src[k];
+        if (c === "\\") {
+          if (src[k + 1] === "q") nested = true;
+          k += 2;
+          continue;
+        }
+        if (c === "[") {
+          depth++;
+          nested = true;
+        } else if (c === "]") {
+          depth--;
+          if (depth === 0) break;
+        } else if ((c === "-" || c === "&") && src[k + 1] === c) nested = true;
+        k++;
+      }
+      if (src[k] !== "]") throw BAIL;
+      if (nested) {
+        i = k + 1;
+        return charNode(any(), true);
+      }
+      k = i + 1 + (negated ? 1 : 0);
+    }
     let body = "";
     while (k < src.length && src[k] !== "]") {
       if (src[k] === "\\") {
@@ -3133,7 +3220,7 @@ function parseRegex(src) {
     }
     if (src[k] !== "]") throw BAIL;
     i = k + 1;
-    const ranges = parseClassRanges(body);
+    const ranges = parseClassRanges(body, unicode);
     if (negated) return charNode(any(), !ranges || !rangesHaveNewline(ranges));
     if (!ranges) return charNode(any(), true);
     return charNode(rangesToSet(ranges), rangesHaveNewline(ranges));
@@ -3141,9 +3228,20 @@ function parseRegex(src) {
   const parseEscape = () => {
     const e = src[i + 1];
     if (e === void 0) throw BAIL;
-    if (e === "u" && /^[0-9a-fA-F]{4}$/.test(src.slice(i + 2, i + 6))) {
-      const cp = Number.parseInt(src.slice(i + 2, i + 6), 16);
-      i += 6;
+    const uni = readUnicodeEscape(src, i, unicode);
+    if (uni !== null) {
+      i = uni.next;
+      return charNode(fromRange(uni.cp, uni.cp), uni.cp === 10);
+    }
+    if (e === "u" && src[i + 2] === "{") {
+      const close = src.indexOf("}", i + 3);
+      const hex = close < 0 ? "" : src.slice(i + 3, close);
+      if (!unicode || !/^[0-9a-fA-F]{1,6}$/.test(hex)) {
+        i += 2;
+        return ANY;
+      }
+      const cp = Number.parseInt(hex, 16);
+      i = close + 1;
       return charNode(fromRange(cp, cp), cp === 10);
     }
     if (e === "x" && /^[0-9a-fA-F]{2}$/.test(src.slice(i + 2, i + 4))) {
@@ -3151,6 +3249,16 @@ function parseRegex(src) {
       i += 4;
       return charNode(fromRange(cp, cp), cp === 10);
     }
+    if (e === "c") {
+      const x = src[i + 2];
+      if (x !== void 0 && /^[A-Za-z]$/.test(x)) {
+        const cp = x.charCodeAt(0) % 32;
+        i += 3;
+        return charNode(fromRange(cp, cp), cp === 10);
+      }
+      i += 2;
+      return ANY;
+    }
     i += 2;
     switch (e) {
       case "d":
@@ -3178,8 +3286,16 @@ function parseRegex(src) {
         return charNode(fromRange(12, 12), false);
       case "v":
         return charNode(fromRange(11, 11), false);
+      // `\0` then a digit is a legacy octal escape (`\012` is a newline), not NUL.
       case "0":
-        return charNode(fromRange(0, 0), false);
+        return src[i] !== void 0 && src[i] >= "0" && src[i] <= "9" ? ANY : charNode(fromRange(0, 0), false);
+      // A property escape (`\p{…}`/`\P{…}`) matches one character of a class this
+      // analyzer does not enumerate; `\k<name>` is a backreference, which may match empty.
+      case "p":
+      case "P":
+        return charNode(any(), true);
+      case "k":
+        return ANY;
       default:
         if (e >= "1" && e <= "9") return ANY;
         return charNode(fromRange(e.codePointAt(0), e.codePointAt(0)), e === "\n");
@@ -3253,10 +3369,10 @@ function regexCanMatchEmpty(source) {
     return true;
   }
 }
-function firstSetFromRegex(source) {
+function firstSetFromRegex(source, flags = "") {
   let ast;
   try {
-    ast = parseRegex(source);
+    ast = parseRegex(source, flags.includes("u") || flags.includes("v"), flags.includes("v"));
   } catch {
     return { firstSet: any(), canMatchNewline: true };
   }
@@ -3265,6 +3381,7 @@ function firstSetFromRegex(source) {
 }
 
 // src/combinators/regex.ts
+import { PlainLeaf as PlainLeaf2, PlainSpan as PlainSpan4 } from "../cst/plain.js";
 var SCAN_BAIL_AT = 64;
 function inRanges3(cp, ranges) {
   for (let i = 0; i < ranges.length; i++) {
@@ -3305,8 +3422,18 @@ function shortScanner(source, flags) {
     return minOne && end === pos ? null : end;
   };
 }
+function coversNonAscii(ranges) {
+  let next = 128;
+  for (const r of [...ranges].sort((a, b) => a.lo - b.lo)) {
+    if (r.lo > next) return false;
+    if (r.hi >= next) next = r.hi + 1;
+    if (next > 65535) return true;
+  }
+  return false;
+}
 function asciiCaseFold(fs) {
   if (fs.kind !== "ranges") return fs;
+  if (fs.ranges.some((r) => r.hi >= 128) && !coversNonAscii(fs.ranges)) return any();
   const ranges = fs.ranges.map((r) => ({ lo: r.lo, hi: r.hi }));
   const add = (lo, hi) => {
     if (lo <= hi) ranges.push({ lo, hi });
@@ -3331,7 +3458,7 @@ function regex(pattern, flags = "") {
   const resolvedFlags = typeof pattern === "string" ? flags : pattern.flags;
   const anchored = new RegExp(source, "y" + resolvedFlags.replace(/[gy]/g, ""));
   const scan = shortScanner(source, resolvedFlags);
-  const raw = firstSetFromRegex(source);
+  const raw = firstSetFromRegex(source, resolvedFlags);
   const firstSet2 = !resolvedFlags.includes("i") ? raw.firstSet : resolvedFlags.includes("u") || resolvedFlags.includes("v") ? any() : asciiCaseFold(raw.firstSet);
   const canMatchNewline = raw.canMatchNewline;
   const meta = { firstSet: firstSet2, canMatchNewline, isTrivia: false };
@@ -3367,9 +3494,9 @@ function regex(pattern, flags = "") {
       if (scanEnd !== void 0) {
         if (scanEnd === null) return failAt(ctx, directTerminalFailureExpected(def), pos);
         const value = input.slice(pos, scanEnd);
-        const span2 = { start: pos, end: scanEnd };
+        const span2 = new PlainSpan4(pos, scanEnd);
         if (canMatchNewline && ctx.trackLines) recordLineRangeFromContext(ctx, input, pos, scanEnd);
-        if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value, span: span2 });
+        if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf2(value, span2));
         return { ok: true, value, span: span2 };
       }
       anchored.lastIndex = pos;
@@ -3377,9 +3504,9 @@ function regex(pattern, flags = "") {
       if (m === null) {
         return failAt(ctx, directTerminalFailureExpected(def), pos);
       }
-      const span = { start: pos, end: pos + m[0].length };
+      const span = new PlainSpan4(pos, pos + m[0].length);
       if (canMatchNewline && ctx.trackLines) recordLineRangeFromContext(ctx, input, pos, span.end);
-      if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value: m[0], span });
+      if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf2(m[0], span));
       return { ok: true, value: m[0], span };
     }
   };
@@ -3406,6 +3533,7 @@ function buildLexBodyRecognizer(spec, constants) {
 }
 
 // src/table/run-support.ts
+import { PlainLeaf as PlainLeaf3, PlainLineSpan as PlainLineSpan2, PlainSpan as PlainSpan5 } from "../cst/plain.js";
 function lineCol(ctx, offset) {
   const starts = ctx._lineStarts ?? [0];
   let lo = 0, hi = starts.length - 1;
@@ -3418,18 +3546,14 @@ function lineCol(ctx, offset) {
 }
 function spanLines(ctx, start, end) {
   const s = lineCol(ctx, start), e = lineCol(ctx, end);
-  return { start, end, startLine: s[0], startColumn: s[1], endLine: e[0], endColumn: e[1] };
+  return new PlainLineSpan2(start, end, s[0], s[1], e[0], e[1]);
 }
 function rawEntry(v, input, s, e) {
   if (typeof v === "object" && v !== null) {
     const tg = v._tag;
     if (tg === "node" || tg === "leaf" || tg === "parseError") return v;
   }
-  return {
-    _tag: "leaf",
-    value: typeof v === "string" ? v : typeof v === "object" && v !== null ? input.slice(s, e) : "",
-    span: { start: s, end: e }
-  };
+  return new PlainLeaf3(typeof v === "string" ? v : typeof v === "object" && v !== null ? input.slice(s, e) : "", new PlainSpan5(s, e));
 }
 function lead(input, pos) {
   if (pos >= input.length) return -1;
@@ -3443,7 +3567,7 @@ function collapseEmpty(ctx, build, input, pos, end, readsRaw) {
   const collected = ctx._cstBuf !== void 0 || ctx._cstChildren !== void 0;
   if (collected) popCstChild(ctx);
   const raw = readsRaw ? [rawEntry(void 0, input, pos, end)] : EMPTY_KIDS;
-  const nd = build(EMPTY_KIDS, void 0, { start: pos, end }, raw, EMPTY_TRIVIA, void 0);
+  const nd = build(EMPTY_KIDS, void 0, new PlainSpan5(pos, end), raw, EMPTY_TRIVIA, void 0);
   if (collected) pushCstChild(ctx, nd, ctx._cstBuf?.noRaw === true ? void 0 : rawEntry(nd, input, pos, end));
   return nd;
 }
@@ -4113,7 +4237,7 @@ function decodeClassSpec(spec) {
 function resolveClass(spec) {
   const ascii = new Uint8Array(128);
   const hi = [];
-  for (const { lo, hi: up } of decodeClassSpec(spec)) {
+  for (const { lo, hi: up } of leadRanges(decodeClassSpec(spec))) {
     if (lo < 128) for (let c = lo; c <= Math.min(up, 127); c++) ascii[c] = 1;
     if (up >= 128) hi.push(Math.max(lo, 128), up);
   }
@@ -4324,6 +4448,7 @@ function expandCompactFolded(f) {
 }
 
 // src/combinators/literal.ts
+import { PlainLeaf as PlainLeaf4, PlainSpan as PlainSpan6 } from "../cst/plain.js";
 function asciiFoldEq(a, b) {
   if (a.length !== b.length) return false;
   for (let i = 0; i < a.length; i++) {
@@ -4381,9 +4506,9 @@ function literal(value, opts = {}) {
     const code = value.charCodeAt(0);
     return function parse2(input, pos, ctx) {
       if (input.charCodeAt(pos) === code) {
-        const span = { start: pos, end: pos + 1 };
+        const span = new PlainSpan6(pos, pos + 1);
         if (canMatchNewline && ctx.trackLines) recordLineRangeFromContext(ctx, input, pos, span.end);
-        if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value, span });
+        if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf4(value, span));
         return { ok: true, value, span };
       }
       return failAt(ctx, expected, pos);
@@ -4395,9 +4520,9 @@ function literal(value, opts = {}) {
     }
     const matchedValue = caseInsensitive ? input.slice(pos, end) : value;
     if (caseInsensitive ? asciiFoldEq(matchedValue, value) : input.startsWith(value, pos)) {
-      const span = { start: pos, end };
+      const span = new PlainSpan6(pos, end);
       if (canMatchNewline && ctx.trackLines) recordLineRangeFromContext(ctx, input, pos, end);
-      if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value: matchedValue, span });
+      if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf4(matchedValue, span));
       return { ok: true, value: matchedValue, span };
     }
     return failAt(ctx, expected, pos);
@@ -4938,6 +5063,7 @@ function buildReadsState(def) {
 }
 
 // src/combinators/token.ts
+import { PlainLeaf as PlainLeaf5 } from "../cst/plain.js";
 function semanticLeafValue(_ctx, _input, _start, _end, value) {
   return value;
 }
@@ -4991,7 +5117,7 @@ function token(root) {
       if (!result.ok) return result;
       const span = result.span;
       const value = input.slice(pos, span.end);
-      if (wasCapturing) pushCstLeaf(ctx, { _tag: "leaf", value, span });
+      if (wasCapturing) pushCstLeaf(ctx, new PlainLeaf5(value, span));
       return { ok: true, value, span };
     }
   };
@@ -5039,11 +5165,7 @@ function makeLeaf(root, fn, sourceCstValue) {
       }
       if (!result.ok) return result;
       const value = fn(result.value, result.span);
-      if (wasCapturing) pushCstLeaf(ctx, {
-        _tag: "leaf",
-        value: cstValue(ctx, input, pos, result.span.end, value),
-        span: result.span
-      });
+      if (wasCapturing) pushCstLeaf(ctx, new PlainLeaf5(cstValue(ctx, input, pos, result.span.end, value), result.span));
       return { ok: true, value, span: result.span };
     }
   };
@@ -5056,6 +5178,7 @@ function sourceLeaf(root, fn) {
 }
 
 // src/combinators/scanTo.ts
+import { PlainLeaf as PlainLeaf6, PlainSpan as PlainSpan7 } from "../cst/plain.js";
 function resolveScanSkip(explicitSkip, raw, ctx) {
   if (raw) return [];
   const trivia2 = ctx.trivia;
@@ -5093,7 +5216,7 @@ function scanTo(sentinel, { skip, raw = false, orEOF = false, recoverAt, stopAt
       probeCtx._errors = ctx._errors;
       const emit = (end) => {
         if (end > pos && cstCaptureActive(ctx)) {
-          const leaf2 = { _tag: "leaf", value: input.slice(pos, end), span: { start: pos, end } };
+          const leaf2 = new PlainLeaf6(input.slice(pos, end), new PlainSpan7(pos, end));
           pushCstLeaf(ctx, leaf2);
         }
       };
@@ -5386,6 +5509,15 @@ function skipDeferredTrivia(input, cur, ctx) {
   if (plain) remember(cur, scan, ctx, input, triviaP);
   return scan;
 }
+function triviaLeadTable(triviaP) {
+  const fs = triviaP._meta.firstSet;
+  if (fs.kind === "any") return null;
+  const table = new Uint8Array(128);
+  if (fs.kind === "ranges") {
+    for (const r of fs.ranges) for (let c = Math.max(0, r.lo); c <= Math.min(127, r.hi); c++) table[c] = 1;
+  }
+  return table;
+}
 function clearRunEnd(input, cur, ctx, triviaP, plain) {
   const rootKinds = ctx._rootTriviaKindIndex;
   const spec = triviaP?._meta.labeledTriviaSpec;
@@ -5435,6 +5567,7 @@ function clearOf(ranges, input, from, to) {
 }
 
 // src/combinators/dispatch.ts
+import { PlainLeaf as PlainLeaf7 } from "../cst/plain.js";
 function parserUsesRouted(parser2, seen = /* @__PURE__ */ new Set()) {
   if (seen.has(parser2)) return false;
   seen.add(parser2);
@@ -5503,6 +5636,7 @@ function asciiFoldKey(key) {
 }
 
 // src/combinators/node.ts
+import { PlainNode, PlainSpan as PlainSpan8 } from "../cst/plain.js";
 function unwrapChild(child) {
   return child !== null && typeof child === "object" && child._tag === "leaf" ? child.value : child;
 }
@@ -5516,6 +5650,9 @@ function projectChild(children2, project, type) {
   return unwrapChild(children2[project]);
 }
 
+// src/table/assemble.ts
+import { PlainBuf as PlainBuf2, PlainField, PlainLeaf as PlainLeaf8, PlainNode as PlainNode2, PlainSpan as PlainSpan9 } from "../cst/plain.js";
+
 // src/table/ops.ts
 var OP_LIT = 1;
 var OP_RX = 2;
@@ -5737,6 +5874,7 @@ function parseSeqParts(source) {
         cp2 = uni.cp;
         i = uni.next;
       } else if (e === void 0) return null;
+      else if (e >= "0" && e <= "9" && (e !== "0" || source[i + 2] !== void 0 && source[i + 2] >= "0" && source[i + 2] <= "9")) return null;
       else if (e in CLASS_ESCAPES) {
         cp2 = CLASS_ESCAPES[e];
         i += 2;
@@ -6286,7 +6424,7 @@ function parseScanShapeCore(source) {
   return null;
 }
 function scanShapeFromRegex(source, flags) {
-  if (/[msu]/.test(flags)) return null;
+  if (/[msuv]/.test(flags)) return null;
   if (/i/.test(flags)) return caseFoldShape(source);
   return parseScanShape(source);
 }
@@ -6891,7 +7029,7 @@ function triviaLeadRanges(tri, trivia2) {
   const fs = trivia2[tri]?._meta.firstSet;
   if (fs === void 0) return void 0;
   if (fs.kind === "empty") return [];
-  return fs.kind === "ranges" && fs.ranges !== void 0 ? fs.ranges : void 0;
+  return fs.kind === "ranges" && fs.ranges !== void 0 ? leadRanges(fs.ranges) : void 0;
 }
 
 // src/table/scalar-terminal.ts
@@ -7249,7 +7387,14 @@ var EMITTED_PARAMS = [
   "skipDeferredTrivia",
   // Appended for the pass-through collapse (`run-support.ts`); old factories
   // ignore it.
-  "collapseEmpty"
+  "collapseEmpty",
+  // Appended for constructor-built tree objects (`cst/plain.d.ts`): a `new` call has
+  // no allocation site, so V8 cannot pretenure them. Old factories ignore them.
+  "_SP",
+  "_LF",
+  "_ND",
+  "_FC",
+  "_BUF"
 ];
 var RUNTIME_PRELUDE = `
 let _pfScan=null
@@ -7273,9 +7418,9 @@ if(s!==null)return skipTriviaScanned(s,input,cur,ctx)
 if(needsDeferredTriviaCommit(ctx))return skipDeferredTrivia(input,cur,ctx)
 return advanceTrivia(input,cur,ctx)
 }
-function _pushLeaf(ctx,value,s,e){pushCstLeaf(ctx,{_tag:'leaf',value,span:{start:s,end:e}})}
+function _pushLeaf(ctx,value,s,e){pushCstLeaf(ctx,new _LF(value,new _SP(s,e)))}
 function _pushLeafBuf(ctx,value,s,e){
-const l={_tag:'leaf',value,span:{start:s,end:e}}
+const l=new _LF(value,new _SP(s,e))
 const b=ctx._cstBuf
 if(b.ch!==undefined)b.ch.push(l)
 else if(b.single!==undefined){b.ch=[b.single,l];b.single=undefined}
@@ -7333,7 +7478,7 @@ if(ctx._rootTriviaLog!==undefined&&ctx._rootTriviaLog.length!==rt)ctx._rootTrivi
 `;
 var NO_RAW_RUNTIME_PRELUDE = `
 function _pushLeafNoRawBuf(ctx,value,s,e){
-const l={_tag:'leaf',value,span:{start:s,end:e}}
+const l=new _LF(value,new _SP(s,e))
 const b=ctx._cstBuf
 if(b.ch!==undefined)b.ch.push(l)
 else if(b.single!==undefined){b.ch=[b.single,l];b.single=undefined}
@@ -7421,7 +7566,7 @@ if(ctx._errors!==undefined&&ctx._errors.length!==${t}er)ctx._errors.length=${t}e
   if (!s.fd && !s.er) return `if(${t}n)rollbackTriviaAt(ctx,${t}raw,${t}tl,${t}lv,undefined,undefined,${t}lg,${t}rt)`;
   return `if(${t}n){rollbackTriviaAt(ctx,${t}raw,${t}tl,${t}lv,${s.fd ? `${t}fd` : "undefined"},${s.er ? `${t}er` : "undefined"},${t}lg,${t}rt)}`;
 }
-function emitTerm(callee, dst, t, l, skip) {
+function emitTerm(callee, dst, t, l, skip, miss) {
   const fast = `const ${t}v=${callee}(input,cur,ctx)
 if(${t}v===FAIL)return FAIL
 ${dst}=${t}v
@@ -7439,7 +7584,12 @@ if(${t}v===FAIL)return FAIL
 ${dst}=${t}v
 if(EC.e>${t}s)cur=EC.e
 else{rollbackScannedTriviaAt(ctx,${t}tl,${t}stl,${t}lg,${t}slg,${t}rt,${t}srt)}`;
-  if (l.tri !== TRI_UNKNOWN) return scanned;
+  if (l.tri !== TRI_UNKNOWN) return miss === void 0 ? scanned : `const ${t}c=input.charCodeAt(cur)
+if(${miss(`${t}c`)}){
+${fast}
+}else{
+${scanned}
+}`;
   return `if(ctx.trivia===undefined){
 ${fast}
 }else{
@@ -7495,7 +7645,7 @@ function rebuildPools(cc, fx, disp, plan) {
     })
   };
 }
-function emitAssemblySource(t, prog, cfg, extraIps = [], staticBuild = false, select) {
+function emitAssemblySource(t, prog, cfg, extraIps = [], staticBuild = false, select, scanSinkNeutral = false) {
   const { code, k, fx, disp, dsp, triviaLabelled } = t;
   const swapLegal = !cfg.trackLines;
   const hostCst = cfg.hostCst;
@@ -7571,7 +7721,7 @@ function emitAssemblySource(t, prog, cfg, extraIps = [], staticBuild = false, se
     const op = code[ip];
     sinkBits.set(
       ip,
-      op === OP_SCAN ? 3 : (op === OP_FIELD ? 1 : 0) | (op === OP_EXPECT || REC && (op === OP_REP || op === OP_REPV) ? 2 : 0)
+      op === OP_SCAN || !scanSinkNeutral && op === OP_LEX_PROGRAM && t.lexPrograms[code[ip + 1]].scan !== void 0 ? 3 : (op === OP_FIELD ? 1 : 0) | (op === OP_EXPECT || REC && (op === OP_REP || op === OP_REPV) ? 2 : 0)
     );
   }
   const sinkKids = [];
@@ -7744,6 +7894,12 @@ return 1
     return `if(${gateMissTest(child)}){${miss}}
 `;
   }
+  function triviaMiss(ki) {
+    const leads = triviaLeadRanges(ki, t.trivia);
+    if (leads === void 0 || leads.length > 16) return void 0;
+    if (leads.length === 0) return (c) => `${c}<55296`;
+    return (c) => `${c}<55296&&!(${leads.map((r) => r.lo === r.hi ? `${c}===${r.lo}` : `(${c}>=${r.lo}&&${c}<=${r.hi})`).join("||")})`;
+  }
   function skipFor(l) {
     if (l.tri < 0) return "_skipTrivia";
     const ki = l.tri;
@@ -7754,8 +7910,13 @@ return 1
     const nm = `_sk${skipPool.size}`;
     skipPool.set(key, nm);
     if (!hasScan) {
-      skipDefs.push(l.buf ? `function ${nm}(input,cur,ctx){return skipDeferredTrivia(input,cur,ctx)}` : `function ${nm}(input,cur,ctx){
-if(needsDeferredTriviaCommit(ctx))return skipDeferredTrivia(input,cur,ctx)
+      const miss = triviaMiss(ki);
+      const pre = miss === void 0 ? "" : `const c=input.charCodeAt(cur)
+if(${miss("c")})return cur
+`;
+      skipDefs.push(l.buf ? `function ${nm}(input,cur,ctx){${pre === "" ? "" : `
+${pre}`}return skipDeferredTrivia(input,cur,ctx)}` : `function ${nm}(input,cur,ctx){
+${pre}if(needsDeferredTriviaCommit(ctx))return skipDeferredTrivia(input,cur,ctx)
 return advanceTrivia(input,cur,ctx)}`);
       return nm;
     }
@@ -7994,7 +8155,7 @@ try{return ${child}(input,pos,ctx)}finally{ctx.state=saved}
         return `${head}
 const v=${child}(input,pos,ctx)
 if(v===FAIL)return FAIL
-return ${fn}(v,{start:pos,end:EC.e})
+return ${fn}(v,new _SP(pos,EC.e))
 }`;
       }
       case OP_LABEL: {
@@ -8015,7 +8176,7 @@ return v
 const v=${child}(input,pos,ctx)
 if(v===FAIL)return FAIL
 const f=ctx._fields
-if(f!==undefined)f.push({name:${name},value:v,span:{start:pos,end:EC.e}})
+if(f!==undefined)f.push(new _FC(${name},v,new _SP(pos,EC.e)))
 return v
 }`;
         }
@@ -8040,7 +8201,7 @@ return v
         return `${head}
 const v=${child}(input,pos,ctx)
 if(v!==FAIL)return v
-const err={_tag:'parseError',span:${prog.lines === 1 ? "spanLines(ctx,pos,pos)" : "{start:pos,end:pos}"},expected:${xf}}
+const err={_tag:'parseError',span:${prog.lines === 1 ? "spanLines(ctx,pos,pos)" : "new _SP(pos,pos)"},expected:${xf}}
 const es=ctx._errors
 if(es!==undefined)es.push(err)
 ${REC ? "if(ctx._tolerant===true)captureError(ctx,err)\n" : ""}ctx._fc=false
@@ -8051,7 +8212,7 @@ return err
       case OP_ROUTED: {
         const fb = code[ip + 1];
         const fallback = fb >= 0 ? link(fb) : void 0;
-        const push = `pushCstLeaf(ctx,{_tag:'leaf',value:it.value,span:it.span})`;
+        const push = `pushCstLeaf(ctx,new _LF(it.value,it.span))`;
         return `${head}
 const it=ctx._routed
 if(it===undefined||pos!==it.span.start){
@@ -8132,8 +8293,8 @@ ctx._triviaLog=sOtl
 }
 if(v===FAIL)return FAIL
 const e=EC.e
-const out=${isToken ? "input.slice(pos,e)" : `${fn}(v,{start:pos,end:e})`}
-if(wasCap)pushCstLeaf(ctx,{_tag:'leaf',value:${capturesSource ? "input.slice(pos,e)" : "out"},span:{start:pos,end:e}})
+const out=${isToken ? "input.slice(pos,e)" : `${fn}(v,new _SP(pos,e))`}
+if(wasCap)pushCstLeaf(ctx,new _LF(${capturesSource ? "input.slice(pos,e)" : "out"},new _SP(pos,e)))
 EC.e=e
 return out
 }`;
@@ -8157,7 +8318,7 @@ ${hasSuffix && (lineFlags & 2) !== 0 ? "if(sm)_trackLines(ctx,input,e)" : ""}
 ${hasSuffix ? `if(!sm){ctx._fe=e;ctx._fx=${suffixExpected};if(ctx._probe!==undefined)failAt(ctx,${suffixExpected},e)}` : ""}
 const v=${pending ? "tp?_pfTokValue:" : ""}input.slice(pos,e)
 ${pending ? "if(tp){_pfTokBody=-1;_pfTokValue=undefined}" : ""}
-if(ctx._cstBuf!==undefined||ctx._cstLeaves!==undefined)pushCstLeaf(ctx,{_tag:'leaf',value:v,span:{start:pos,end:e}})
+if(ctx._cstBuf!==undefined||ctx._cstLeaves!==undefined)pushCstLeaf(ctx,new _LF(v,new _SP(pos,e)))
 EC.e=e
 return v
 }`;
@@ -8196,7 +8357,7 @@ ctx._rootTriviaLog=sRtl
 }
 if(e<0)return FAIL
 const v=input.slice(pos,e)
-if(wasCap)pushCstLeaf(ctx,{_tag:'leaf',value:v,span:{start:pos,end:e}})
+if(wasCap)pushCstLeaf(ctx,new _LF(v,new _SP(pos,e)))
 EC.e=e
 return v
 }`;
@@ -8204,7 +8365,7 @@ return v
 const e=${run}(input,pos,ctx)
 if(e<0)return FAIL
 const v=input.slice(pos,e)
-if(ctx._cstBuf!==undefined||ctx._cstLeaves!==undefined)pushCstLeaf(ctx,{_tag:'leaf',value:v,span:{start:pos,end:e}})
+if(ctx._cstBuf!==undefined||ctx._cstLeaves!==undefined)pushCstLeaf(ctx,new _LF(v,new _SP(pos,e)))
 EC.e=e
 return v
 }`;
@@ -8318,7 +8479,7 @@ return v
 }` : `${parts.join("\n")}
 }`;
         if (n === 1) {
-          parts.push(fused ? projection === 0 ? "return v0" : `return ${fn}([v0],{start:pos,end:EC.e})` : wantValues ? "return [v0]" : "return undefined");
+          parts.push(fused ? projection === 0 ? "return v0" : `return ${fn}([v0],new _SP(pos,EC.e))` : wantValues ? "return [v0]" : "return undefined");
           return close();
         }
         parts.push("let cur=EC.e");
@@ -8339,12 +8500,12 @@ 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)));
+            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));
           }
           names.push(vn);
         }
         parts.push("EC.e=cur");
-        parts.push(fused ? projection >= 0 ? `return ${names[projection]}` : `return ${fn}([${names.join(",")}],{start:pos,end:cur})` : wantValues ? `return [${names.join(",")}]` : "return undefined");
+        parts.push(fused ? projection >= 0 ? `return ${names[projection]}` : `return ${fn}([${names.join(",")}],new _SP(pos,cur))` : wantValues ? `return [${names.join(",")}]` : "return undefined");
         return close();
       }
       case OP_CHOICE: {
@@ -8603,7 +8764,7 @@ ${spec.match.map((m, i) => `${i === 0 ? "" : "else "}if(${dispatchClaim(m)})arm=
         const routedCall = (target) => `{const savedRouted=ctx._routed
 ${emitRollback(m1, L.buf, L.raw, sinks)}
 ${emitMark(m2, L.buf, L.raw, sinks, false)}
-ctx._routed={value:key,span:{start:pos,end:selEnd}}
+ctx._routed={value:key,span:new _SP(pos,selEnd)}
 try{v=${target}(input,pos,ctx)}finally{ctx._routed=savedRouted}
 break}`;
         const plainCall = (target) => `v=${target}(input,selEnd,ctx);break`;
@@ -8798,8 +8959,8 @@ return out
 const end=${recognize}(input,pos)
 if(end<0){ctx._fe=pos;ctx._fx=${xf};return FAIL}
 const value=${value2}
-const leaf={_tag:'leaf',value,span:{start:pos,end}}
-const kids=[leaf],rawKids=[leaf],span={start:pos,end}
+const leaf=new _LF(value,new _SP(pos,end))
+const kids=[leaf],rawKids=[leaf],span=new _SP(pos,end)
 EC.e=end
 const nd=${build2}(kids,undefined,span,rawKids,EMPTY_TL,undefined)
 ${L.buf && L.raw === RAW_OMIT ? "_pushNodeNoRawBuf(ctx,nd)" : L.buf && L.raw === RAW_CAPTURE ? "pushCstChild(ctx,nd,rawEntry(nd,input,pos,end))" : staticBuild ? "if(ctx._cstBuf!==undefined||ctx._cstChildren!==undefined)pushCstChild(ctx,nd,ctx._cstBuf!==undefined&&ctx._cstBuf.noRaw===true?undefined:ctx._cstBuf!==undefined||ctx._cstRawChildren!==undefined?rawEntry(nd,input,pos,end):undefined)" : "if(ctx._cstBuf!==undefined||ctx._cstChildren!==undefined)pushCstChild(ctx,nd,rawEntry(nd,input,pos,end))"}
@@ -8898,7 +9059,7 @@ ctx._cstTriviaLog=sTl
 ctx.captureTrivia=sCap
 if(v===FAIL)return FAIL
 const end=EC.e
-${collapseChildren ? `const nd=captured.length===1?captured[0]:${build}(captured,undefined,{start:pos,end},EMPTY_CH,EMPTY_TL,undefined)` : `const nd=${build}(captured,${fields ? "fieldMap" : "undefined"},{start:pos,end},EMPTY_CH,EMPTY_TL,undefined)`}
+${collapseChildren ? `const nd=captured.length===1?captured[0]:${build}(captured,undefined,new _SP(pos,end),EMPTY_CH,EMPTY_TL,undefined)` : `const nd=${build}(captured,${fields ? "fieldMap" : "undefined"},new _SP(pos,end),EMPTY_CH,EMPTY_TL,undefined)`}
 ${publish}
 EC.e=end
 return nd
@@ -8921,20 +9082,20 @@ return nd
           const direct = `${build}(kids,fieldMap,span,rawKids,${captureWide ? "tlog" : "EMPTY_TL"},st)`;
           value = hostCst ? `nd=_pfHost!==undefined?${hostCall}:${direct}` : `nd=${direct}`;
         } else {
-          value = `nd=_pfHost!==undefined?_pfHost(${ty},hostKids,fieldMap,span,rawKids,tlog,st,${tags}):{_tag:'node',type:${ty},span,state:st??null,children:kids}`;
+          value = `nd=_pfHost!==undefined?_pfHost(${ty},hostKids,fieldMap,span,rawKids,tlog,st,${tags}):new _ND(${ty},span,st??null,kids===EMPTY_CH?kids:[...kids])`;
         }
         const collapsible = keepChildren && (hostCst || build === void 0 && proj < 0);
-        const openCapture = omitsRaw ? `const buf={noRaw:true,rawLen:0}
+        const openCapture = omitsRaw ? `const buf=new _BUF(undefined,true,0)
 ctx._cstBuf=buf
 ctx._cstChildren=undefined
 ctx._cstLeaves=undefined
 ctx._cstRawChildren=undefined
-ctx._cstTriviaLog=undefined` : keepChildren ? `const buf={}
+ctx._cstTriviaLog=undefined` : keepChildren ? `const buf=new _BUF(undefined,undefined,0)
 ctx._cstBuf=buf
 ctx._cstChildren=undefined
 ctx._cstLeaves=undefined
 ctx._cstRawChildren=undefined
-ctx._cstTriviaLog=undefined` : `const buf={rawOnly:true}
+ctx._cstTriviaLog=undefined` : `const buf=new _BUF(true,undefined,0)
 ctx._cstBuf=buf
 ctx._cstChildren=undefined
 ctx._cstLeaves=undefined
@@ -8972,7 +9133,7 @@ ctx._cstTriviaLog=sTl
 ctx.captureTrivia=sCap
 if(v===FAIL)return FAIL
 const end=EC.e
-const span=${tracked ? "spanLines(ctx,pos,end)" : "{start:pos,end}"}
+const span=${tracked ? "spanLines(ctx,pos,end)" : "new _SP(pos,end)"}
 const st=${readsState ? "ctx.state" : "undefined"}
 let nd
 ${unwrap ? "if(kids.length===1)nd=unwrapChild(kids[0])\nelse " : ""}${collapse ? "if(kids.length===1)nd=kids[0]\nelse " : ""}${collapsible ? `if(_pfHost!==undefined&&_pfHost._parsemanCstCollapse!==undefined&&kids.length===1&&rawKids.length===1&&_pfHost._parsemanCstCollapse(${ty},kids[0],kids,rawKids))nd=kids[0]
@@ -9410,7 +9571,7 @@ function assemble(t, prog, cfg) {
   const NULLABLE = /* @__PURE__ */ new Map();
   const CLEAN = REC ? () => false : failCleanAnalysis(code);
   function pushLeaf(ctx, value, s, e) {
-    const lf = { _tag: "leaf", value, span: { start: s, end: e } };
+    const lf = new PlainLeaf8(value, new PlainSpan9(s, e));
     pushCstLeaf(ctx, lf);
   }
   function plainBuildNode(child, build, trailing) {
@@ -9443,7 +9604,7 @@ function assemble(t, prog, cfg) {
       ctx.captureTrivia = sCap;
       if (value === FAIL) return FAIL;
       const end = EC.e;
-      const span = { start: pos, end };
+      const span = new PlainSpan9(pos, end);
       const node = build(kids, void 0, span, rawKids, EMPTY_TL, void 0);
       if (sBuf !== void 0 || sCh !== void 0) {
         pushCstChild(ctx, node, rawEntry(node, input, pos, end));
@@ -9488,7 +9649,7 @@ function assemble(t, prog, cfg) {
       ctx.captureTrivia = sCap;
       if (value === FAIL) return FAIL;
       const end = EC.e;
-      const node = build(captured, void 0, { start: pos, end }, EMPTY_CH, EMPTY_TL, void 0);
+      const node = build(captured, void 0, new PlainSpan9(pos, end), EMPTY_CH, EMPTY_TL, void 0);
       if (sBuf !== void 0 || sCh !== void 0) {
         pushCstChild(ctx, node, sBuf !== void 0 || sRaw !== void 0 ? rawEntry(node, input, pos, end) : void 0);
       }
@@ -9525,7 +9686,7 @@ function assemble(t, prog, cfg) {
       ctx.captureTrivia = sCap;
       if (value === FAIL) return FAIL;
       const end = EC.e;
-      const node = build(captured, fieldMap, { start: pos, end }, EMPTY_CH, EMPTY_TL, void 0);
+      const node = build(captured, fieldMap, new PlainSpan9(pos, end), EMPTY_CH, EMPTY_TL, void 0);
       if (sBuf !== void 0 || sCh !== void 0) {
         pushCstChild(ctx, node, sBuf !== void 0 || sRaw !== void 0 ? rawEntry(node, input, pos, end) : void 0);
       }
@@ -9562,7 +9723,7 @@ function assemble(t, prog, cfg) {
       ctx.captureTrivia = sCap;
       if (value === FAIL) return FAIL;
       const end = EC.e;
-      const span = { start: pos, end };
+      const span = new PlainSpan9(pos, end);
       const node = kids.length === 1 ? kids[0] : build(kids, void 0, span, rawKids, EMPTY_TL, void 0);
       if (sBuf !== void 0 || sCh !== void 0) {
         pushCstChild(ctx, node, rawEntry(node, input, pos, end));
@@ -9599,7 +9760,7 @@ function assemble(t, prog, cfg) {
       ctx.captureTrivia = sCap;
       if (value === FAIL) return FAIL;
       const end = EC.e;
-      const node = captured.length === 1 ? captured[0] : build(captured, void 0, { start: pos, end }, EMPTY_CH, EMPTY_TL, void 0);
+      const node = captured.length === 1 ? captured[0] : build(captured, void 0, new PlainSpan9(pos, end), EMPTY_CH, EMPTY_TL, void 0);
       if (sBuf !== void 0 || sCh !== void 0) {
         pushCstChild(ctx, node, sBuf !== void 0 || sRaw !== void 0 ? rawEntry(node, input, pos, end) : void 0);
       }
@@ -9708,7 +9869,23 @@ function assemble(t, prog, cfg) {
     }
     return out;
   }
+  const LEAD_TABLES = trivia2.map((tp) => tp === void 0 ? null : triviaLeadTable(tp));
+  let LEAD_OF;
+  let LEAD_TABLE = null;
+  function cannotStartTrivia(input, cur, triviaP) {
+    if (triviaP !== LEAD_OF) {
+      LEAD_OF = triviaP;
+      const slot = trivia2.indexOf(triviaP);
+      LEAD_TABLE = slot >= 0 ? LEAD_TABLES[slot] : triviaLeadTable(triviaP);
+    }
+    const table = LEAD_TABLE;
+    if (table === null) return false;
+    const c = input.charCodeAt(cur);
+    return c < 128 && table[c] === 0;
+  }
   function skipTrivia(input, cur, ctx) {
+    const t2 = ctx.trivia;
+    if (t2 !== void 0 && cannotStartTrivia(input, cur, t2)) return cur;
     const s = SCAN;
     if (s !== null && ctx._triviaLog === void 0 && !(ctx.captureTrivia === true && (ctx._cstBuf !== void 0 || ctx._cstTriviaLog !== void 0))) {
       return s(input, cur);
@@ -9723,7 +9900,8 @@ function assemble(t, prog, cfg) {
   const frames = [];
   let depth = 0;
   function nextTerm(child, input, cur, ctx) {
-    if (ctx.trivia === void 0) {
+    const t2 = ctx.trivia;
+    if (t2 === void 0 || cannotStartTrivia(input, cur, t2)) {
       const v2 = child(input, cur, ctx);
       if (v2 === FAIL) return -1;
       TERMV = v2;
@@ -9752,7 +9930,8 @@ function assemble(t, prog, cfg) {
     return cur;
   }
   function nextTermBuffered(child, input, cur, ctx) {
-    if (ctx.trivia === void 0) {
+    const t2 = ctx.trivia;
+    if (t2 === void 0 || cannotStartTrivia(input, cur, t2)) {
       const v2 = child(input, cur, ctx);
       if (v2 === FAIL) return -1;
       TERMV = v2;
@@ -10014,7 +10193,7 @@ function assemble(t, prog, cfg) {
     return (input, pos, selEnd, key, ctx, need, mRaw, mTl, mLv, mFl, mEr, mLog, mRoot) => {
       const savedRouted = ctx._routed;
       if (need) rollbackTriviaAt(ctx, mRaw, mTl, mLv, mFl, mEr, mLog, mRoot);
-      ctx._routed = { value: key, span: { start: pos, end: selEnd } };
+      ctx._routed = { value: key, span: new PlainSpan9(pos, selEnd) };
       let v;
       try {
         v = child(input, pos, ctx);
@@ -10447,7 +10626,7 @@ function assemble(t, prog, cfg) {
       case OP_EXPECT: {
         const child = link(code[ip + 1]);
         const xf = fx[code[ip + 2]];
-        const expectSpan = (ctx, pos) => prog.lines === 1 ? spanLines(ctx, pos, pos) : { start: pos, end: pos };
+        const expectSpan = (ctx, pos) => prog.lines === 1 ? spanLines(ctx, pos, pos) : new PlainSpan9(pos, pos);
         if (REC) {
           return (input, pos, ctx) => {
             const v = child(input, pos, ctx);
@@ -10479,7 +10658,7 @@ function assemble(t, prog, cfg) {
           return (input, pos, ctx) => {
             const v = child(input, pos, ctx);
             if (v === FAIL) return FAIL;
-            ctx._fields?.push({ name, value: v, span: { start: pos, end: EC.e } });
+            ctx._fields?.push(new PlainField(name, v, new PlainSpan9(pos, EC.e)));
             return v;
           };
         }
@@ -10503,7 +10682,7 @@ function assemble(t, prog, cfg) {
         return (input, pos, ctx) => {
           const v = child(input, pos, ctx);
           if (v === FAIL) return FAIL;
-          return fn(v, { start: pos, end: EC.e });
+          return fn(v, new PlainSpan9(pos, EC.e));
         };
       }
       case OP_SCAN: {
@@ -10554,6 +10733,7 @@ function assemble(t, prog, cfg) {
         const scopeTrivia = ki < 0 ? void 0 : trivia2[ki];
         const scopeLabels = scopeTrivia?._meta.triviaKindLabels;
         const scanFor = swapLegal && ki >= 0 && !triviaLabelled[ki] ? triviaScan[ki] : null;
+        const scopeLead = ki < 0 ? null : LEAD_TABLES[ki];
         const child = link(code[ip + 2]);
         const scopePiece = code[ip] === OP_SCOPE_CAP ? (input, pos, ctx) => {
           const saved = ctx.trivia;
@@ -10561,6 +10741,9 @@ function assemble(t, prog, cfg) {
           const savedScan = SCAN;
           const savedCap = ctx.captureTrivia;
           SCAN = scanFor;
+          const savedLeadOf = LEAD_OF, savedLead = LEAD_TABLE;
+          LEAD_OF = scopeTrivia;
+          LEAD_TABLE = scopeLead;
           ctx.trivia = scopeTrivia;
           ctx.triviaKindLabels = scopeLabels;
           ctx.captureTrivia = true;
@@ -10569,18 +10752,25 @@ function assemble(t, prog, cfg) {
           ctx.trivia = saved;
           ctx.triviaKindLabels = savedLabels;
           SCAN = savedScan;
+          LEAD_OF = savedLeadOf;
+          LEAD_TABLE = savedLead;
           return v;
         } : (input, pos, ctx) => {
           const saved = ctx.trivia;
           const savedLabels = ctx.triviaKindLabels;
           const savedScan = SCAN;
           SCAN = scanFor;
+          const savedLeadOf = LEAD_OF, savedLead = LEAD_TABLE;
+          LEAD_OF = scopeTrivia;
+          LEAD_TABLE = scopeLead;
           ctx.trivia = scopeTrivia;
           ctx.triviaKindLabels = scopeLabels;
           const v = child(input, pos, ctx);
           ctx.trivia = saved;
           ctx.triviaKindLabels = savedLabels;
           SCAN = savedScan;
+          LEAD_OF = savedLeadOf;
+          LEAD_TABLE = savedLead;
           return v;
         };
         return scopeRootPolicy(scopePiece, code[ip] === OP_SCOPE_PLAIN ? 0 : code[ip + 3]);
@@ -10596,7 +10786,7 @@ function assemble(t, prog, cfg) {
             ctx._fx = ROUTED_FX;
             return FAIL;
           }
-          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value: item.value, span: item.span });
+          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf8(item.value, item.span));
           EC.e = item.span.end;
           return item.value;
         };
@@ -10782,7 +10972,7 @@ function assemble(t, prog, cfg) {
           if (v === FAIL) return FAIL;
           const end = EC.e;
           const value = input.slice(pos, end);
-          if (wasCapturing) pushCstLeaf(ctx, { _tag: "leaf", value, span: { start: pos, end } });
+          if (wasCapturing) pushCstLeaf(ctx, new PlainLeaf8(value, new PlainSpan9(pos, end)));
           EC.e = end;
           return value;
         };
@@ -10816,7 +11006,7 @@ function assemble(t, prog, cfg) {
             if (ctx._probe !== void 0) failAt(ctx, suffixExpected, end);
           }
           const value = input.slice(pos, end);
-          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value, span: { start: pos, end } });
+          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf8(value, new PlainSpan9(pos, end)));
           EC.e = end;
           return value;
         };
@@ -10859,7 +11049,7 @@ function assemble(t, prog, cfg) {
             }
             if (end < 0) return FAIL;
             const value = input.slice(pos, end);
-            if (wasCapturing) pushCstLeaf(ctx, { _tag: "leaf", value, span: { start: pos, end } });
+            if (wasCapturing) pushCstLeaf(ctx, new PlainLeaf8(value, new PlainSpan9(pos, end)));
             EC.e = end;
             return value;
           };
@@ -10868,7 +11058,7 @@ function assemble(t, prog, cfg) {
           const end = run(input, pos, ctx);
           if (end < 0) return FAIL;
           const value = input.slice(pos, end);
-          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, { _tag: "leaf", value, span: { start: pos, end } });
+          if (cstCaptureActive(ctx)) pushCstLeaf(ctx, new PlainLeaf8(value, new PlainSpan9(pos, end)));
           EC.e = end;
           return value;
         };
@@ -10901,12 +11091,8 @@ function assemble(t, prog, cfg) {
           }
           if (v === FAIL) return FAIL;
           const end = EC.e;
-          const out = fn(v, { start: pos, end });
-          if (wasCapturing) pushCstLeaf(ctx, {
-            _tag: "leaf",
-            value: op === OP_SOURCE_LEAF && hostCst ? input.slice(pos, end) : out,
-            span: { start: pos, end }
-          });
+          const out = fn(v, new PlainSpan9(pos, end));
+          if (wasCapturing) pushCstLeaf(ctx, new PlainLeaf8(op === OP_SOURCE_LEAF && hostCst ? input.slice(pos, end) : out, new PlainSpan9(pos, end)));
           EC.e = end;
           return out;
         };
@@ -11041,7 +11227,7 @@ function assemble(t, prog, cfg) {
               const cur = runSyncTerms(input, pos, ctx, values);
               if (cur < 0) return FAIL;
               EC.e = cur;
-              return projection >= 0 ? values[projection] : fn(values, { start: pos, end: cur });
+              return projection >= 0 ? values[projection] : fn(values, new PlainSpan9(pos, cur));
             };
           }
           if (wantValues) {
@@ -11135,7 +11321,7 @@ function assemble(t, prog, cfg) {
               const cur = runAdjTerms(input, pos, ctx, values);
               if (cur < 0) return FAIL;
               EC.e = cur;
-              return projection >= 0 ? values[projection] : fn(values, { start: pos, end: cur });
+              return projection >= 0 ? values[projection] : fn(values, new PlainSpan9(pos, cur));
             };
           }
           if (wantValues) {
@@ -11160,7 +11346,7 @@ function assemble(t, prog, cfg) {
             return (input, pos, ctx) => {
               const v = k0(input, pos, ctx);
               if (v === FAIL) return FAIL;
-              return projection === 0 ? v : fn([v], { start: pos, end: EC.e });
+              return projection === 0 ? v : fn([v], new PlainSpan9(pos, EC.e));
             };
           }
           if (wantValues) {
@@ -11185,7 +11371,7 @@ function assemble(t, prog, cfg) {
               const cur = step(k1, input, EC.e, ctx);
               if (cur < 0) return FAIL;
               EC.e = cur;
-              return projection === 0 ? v0 : projection === 1 ? TERMV : fn([v0, TERMV], { start: pos, end: cur });
+              return projection === 0 ? v0 : projection === 1 ? TERMV : fn([v0, TERMV], new PlainSpan9(pos, cur));
             };
           }
           if (wantValues) {
@@ -11219,7 +11405,7 @@ function assemble(t, prog, cfg) {
               cur = step(k2, input, cur, ctx);
               if (cur < 0) return FAIL;
               EC.e = cur;
-              return projection === 0 ? v0 : projection === 1 ? v1 : projection === 2 ? TERMV : fn([v0, v1, TERMV], { start: pos, end: cur });
+              return projection === 0 ? v0 : projection === 1 ? v1 : projection === 2 ? TERMV : fn([v0, v1, TERMV], new PlainSpan9(pos, cur));
             };
           }
           if (wantValues) {
@@ -11316,7 +11502,7 @@ function assemble(t, prog, cfg) {
             const cur = runDirectTerms(input, pos, ctx, values);
             if (cur < 0) return FAIL;
             EC.e = cur;
-            return projection >= 0 ? values[projection] : fn(values, { start: pos, end: cur });
+            return projection >= 0 ? values[projection] : fn(values, new PlainSpan9(pos, cur));
           };
         }
         if (wantValues) {
@@ -12214,10 +12400,10 @@ function assemble(t, prog, cfg) {
               return FAIL;
             }
             const value = regexValue ? input.slice(pos, end) : spec;
-            const leaf2 = { _tag: "leaf", value, span: { start: pos, end } };
+            const leaf2 = new PlainLeaf8(value, new PlainSpan9(pos, end));
             const kids = [leaf2];
             const rawKids = [leaf2];
-            const span = { start: pos, end };
+            const span = new PlainSpan9(pos, end);
             EC.e = end;
             const nd = build2(kids, void 0, span, rawKids, EMPTY_TL, void 0);
             if (ctx._cstBuf !== void 0 || ctx._cstChildren !== void 0) {
@@ -12299,7 +12485,7 @@ function assemble(t, prog, cfg) {
           const sCh = ctx._cstChildren;
           const sCap = ctx.captureTrivia;
           const sBuf = ctx._cstBuf;
-          const buf = rawOnly ? { rawOnly: true } : omitsRaw ? { noRaw: true, rawLen: 0 } : {};
+          const buf = rawOnly ? new PlainBuf2(true, void 0, 0) : omitsRaw ? new PlainBuf2(void 0, true, 0) : new PlainBuf2(void 0, void 0, 0);
           ctx._cstBuf = buf;
           ctx.captureTrivia = captureWide;
           const savedFields = ctx._fields;
@@ -12321,7 +12507,7 @@ function assemble(t, prog, cfg) {
           ctx.captureTrivia = sCap;
           if (v === FAIL) return FAIL;
           const end = EC.e;
-          const span = tracked ? spanLines(ctx, pos, end) : { start: pos, end };
+          const span = tracked ? spanLines(ctx, pos, end) : new PlainSpan9(pos, end);
           const st = readsState ? ctx.state : void 0;
           let nd;
           if (unwrap && kids.length === 1) {
@@ -12345,7 +12531,7 @@ function assemble(t, prog, cfg) {
           } else if (host !== void 0) {
             nd = host(type, hostKids, fieldMap, span, rawKids, tlog, st, tags);
           } else {
-            nd = { _tag: "node", type, span, state: st ?? null, children: kids };
+            nd = new PlainNode2(type, span, st ?? null, kids === EMPTY_CH ? kids : [...kids]);
           }
           if (sBuf !== void 0 || sCh !== void 0) {
             pushCstChild(ctx, nd, rawEntry(nd, input, pos, end));
@@ -12371,7 +12557,7 @@ function assemble(t, prog, cfg) {
           const at = fe === void 0 || fe < 0 ? pos : fe;
           return { ok: false, expected: ctx._fx ?? EMPTY_FX2, span: { start: at, end: at } };
         }
-        return { ok: true, value: v, span: { start: pos, end: EC.e } };
+        return { ok: true, value: v, span: new PlainSpan9(pos, EC.e) };
       }
     };
   }
@@ -12486,7 +12672,12 @@ function assemble(t, prog, cfg) {
         LEAD,
         triviaFieldCapture,
         skipDeferredTrivia,
-        collapseEmpty
+        collapseEmpty,
+        PlainSpan9,
+        PlainLeaf8,
+        PlainNode2,
+        PlainField,
+        PlainBuf2
       );
       emitReached = new Set(pre.reached);
       if (emitted.ext !== void 0) HYBRID = emitted;
@@ -12573,7 +12764,12 @@ function assemble(t, prog, cfg) {
         LEAD,
         triviaFieldCapture,
         skipDeferredTrivia,
-        collapseEmpty
+        collapseEmpty,
+        PlainSpan9,
+        PlainLeaf8,
+        PlainNode2,
+        PlainField,
+        PlainBuf2
       );
       emitReached = em.reached;
     } catch (e) {
@@ -13601,6 +13797,7 @@ import {
 } from "../compiler/token-capability.js";
 
 // src/combinators/keywords.ts
+import { PlainLeaf as PlainLeaf9, PlainSpan as PlainSpan10 } from "../cst/plain.js";
 function escapeRe(s) {
   return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
 }
@@ -15365,7 +15562,11 @@ function encodeTableProgram(ruleMap, settings = {}) {
   return { prog, fnSrcs: enc.fnSrcs };
 }
 
+// src/version.ts
+var PARSEMAN_VERSION = "0.59.0";
+
 // src/table/emit.ts
+var FACTORY_ARITY_GUARD = `if(arguments.length<${EMITTED_PARAMS.length})throw new Error(${JSON.stringify(`parseman: this parser was printed by parseman ${PARSEMAN_VERSION}; upgrade the parseman runtime to at least that version`)});`;
 function jsString(s) {
   return JSON.stringify(s);
 }
@@ -15451,7 +15652,7 @@ function emitAssemblies(prog, cfgs) {
       throw e;
     }
     const plan = em.plan;
-    out.push(`{key:${key},factory:function(${EMITTED_PARAMS.join(",")}){${em.source}
+    out.push(`{key:${key},factory:function(${EMITTED_PARAMS.join(",")}){${FACTORY_ARITY_GUARD}${em.source}
 },plan:{classes:[${plan.classes.map((r) => `[${r.join(",")}]`).join(",")}],armExpected:[${plan.armExpected.map((r) => `[${r.join(",")}]`).join(",")}],masks:[${plan.masks.join(",")}]},reached:[${[...em.reached].join(",")}]}`);
   }
   return [`a:[${out.join(",")}],`];
@@ -17282,8 +17483,8 @@ function compileRuleMap(ruleMap, opts = {}) {
     const roots = assemblyExtraIps(artifact);
     let siteBytes, fixed;
     try {
-      siteBytes = emitAssemblySource(table, artifact, cfg, roots, true).siteBytes;
-      fixed = emitAssemblySource(table, artifact, cfg, roots, true, /* @__PURE__ */ new Set()).source.length;
+      siteBytes = emitAssemblySource(table, artifact, cfg, roots, true, void 0, true).siteBytes;
+      fixed = emitAssemblySource(table, artifact, cfg, roots, true, /* @__PURE__ */ new Set(), true).source.length;
     } catch (e) {
       if (e instanceof Unemittable) return { ...none, refusal: e.construct };
       throw e;
@@ -17299,7 +17500,7 @@ function compileRuleMap(ruleMap, opts = {}) {
           refusal: `a site within its ${Math.floor(ceiling)} B selection ceiling (the prelude alone is ${fixed} B)`
         };
       }
-      const bytes = emitAssemblySource(table, artifact, cfg, roots, true, sites).source.length;
+      const bytes = emitAssemblySource(table, artifact, cfg, roots, true, sites, true).source.length;
       if (bytes <= ceiling) return { sites, bytes: Math.ceil(bytes * SUPERCOMPILE_GROWTH) };
       target *= Math.min(ceiling / bytes, 0.99);
     }