parseman 0.46.0 → 0.47.0

package/dist/compiler/token-dispatch.d.ts

@@ -0,0 +1,95 @@
+/**
+ * Derived tokenization, part 3: token-KEYED dispatch.
+ *
+ * A `dispatch()` used to emit, per case, a chained condition that re-derived the
+ * key from the selector's STRING one character at a time:
+ *
+ *   if (_dkey.length === 6 && _dkey.charCodeAt(0) === 64 && (_dkey.charCodeAt(1) | 32) === 108 && ...)
+ *   else if (_dkey.length === 15 && ...)
+ *
+ * Measured on the built css artifact: 40,269 B of 3,336,650 B was exactly these
+ * chains, 10,499 B of it inside `_r_StylesheetAtRule` alone.
+ *
+ * Instead the selector's matched span is walked to a small integer case id, and
+ * the cases select on the integer. Every id strategy below is BUILT, not
+ * reasoned about — `PARSEMAN_DISPATCH=<id>:<sel>` picks one so they can be
+ * measured on the shipped artifact rather than in a microbenchmark, which
+ * already misled us once: a standalone "table" looked slow because that
+ * implementation sliced and lowercased and hashed, not because table dispatch
+ * is slow.
+ *
+ * Every strategy is "compute a candidate case cheaply, then VERIFY against the
+ * packed key text", except `trie`, whose walk is already exact.
+ */
+/** One dispatch case's keys, in emission order. Case ids are 1-based; 0 = no match. */
+export type DispatchKeySet = {
+    keys: readonly string[];
+    caseInsensitive: boolean;
+};
+export type IdStrategy = 'trie' | 'lenswitch' | 'firstchar' | 'phash';
+export type ArmSelection = 'ifchain' | 'switch';
+export type DispatchConfig = {
+    id: IdStrategy | 'auto';
+    sel: ArmSelection;
+};
+/**
+ * `PARSEMAN_DISPATCH=<id>:<sel>`. The default is the MEASURED winner on the
+ * shipped css artifact, not a preference. All five configurations were built
+ * into this emitter and compared on the real artifact with the trees diffed for
+ * equality, interleaved in one process (medians of 31 rounds):
+ *
+ *   config          ms/parse   rel     raw B      gzip B
+ *   chain            6.092    1.000   3,336,650   426,247
+ *   trie:ifchain     5.967    0.979   3,311,657   424,465   <- default
+ *   trie:switch      5.945    0.976   3,333,421   424,895
+ *   phash:switch     6.011    0.987   3,331,361   424,637
+ *
+ * `firstchar` and `lenswitch` BUILD but are inapplicable to css's at-keyword
+ * sets — every key starts with `@`, and the lengths collide — so they fall back
+ * and emit the chain. `phash` finds an injective hash (the search works) but
+ * costs more table bytes than the trie saves. `switch` arm selection is within
+ * noise of the chain of integer compares at 3 sites x 8 cases; its larger raw
+ * size is the downstream formatter indenting case bodies, which is why gzip is
+ * the metric that decides here.
+ *
+ * The speed spread across ALL configurations is 2.4% — dispatch keying is not
+ * where css parse time goes.
+ */
+export declare function dispatchConfigFromEnv(env: Record<string, string | undefined>): DispatchConfig;
+/**
+ * ASCII letter-only case fold. Used IDENTICALLY when building the tables and
+ * when reading input — the two must never disagree. The cheaper `c | 32` is
+ * wrong here: it maps '@'(64) to '`'(96), which silently stops every '@'-led
+ * key from ever matching, and maps '_'(95) to DEL(127), which would accept a
+ * character the key does not contain.
+ */
+export declare const foldExpr: (c: string) => string;
+export declare function foldCode(c: number): number;
+/**
+ * Pack a non-negative int array into a two-chars-per-value string literal.
+ *
+ * Two chars at six bits each is TWELVE BITS: the representable range is 0..4095.
+ * The mask made anything larger wrap SILENTLY, and `unpack` then decoded a wrong
+ * index — a table that looks fine and routes to the wrong arm. Bounded here, and
+ * this is the ONLY implementation: a second copy in token-scanner.ts had the same
+ * encoding and the same missing check, which is how one defect became two.
+ */
+export declare const PACK_MAX = 4095;
+export declare function packInts(values: readonly number[]): string;
+export type SharedHelper = 'unpack' | 'verify' | 'trie' | 'lenswitch' | 'firstchar' | 'phash';
+export declare function sharedHelperDecl(kind: SharedHelper, n: (h: SharedHelper) => string): string;
+/** Per-site emission: declarations to hoist plus the call expression. */
+export type SiteEmission = {
+    strategy: IdStrategy;
+    decls: string[];
+    callExpr: string;
+    helpers: SharedHelper[];
+};
+/**
+ * Emit the id computation for one site. `auto` picks by KEY-SET SHAPE measured
+ * at macro time rather than applying one strategy everywhere: separation on
+ * char 0 is the cheapest test there is, a searched perfect hash next, then
+ * length, with the trie as the always-applicable fallback.
+ */
+export declare function emitDispatchId(cases: ReadonlyArray<DispatchKeySet>, cfg: DispatchConfig, prefix: string, helperName: (h: SharedHelper) => string, pos: string, end: string): SiteEmission | null;
+//# sourceMappingURL=token-dispatch.d.ts.map

package/dist/compiler/token-dispatch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-dispatch.d.ts","sourceRoot":"","sources":["../../src/compiler/token-dispatch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,uFAAuF;AACvF,MAAM,MAAM,cAAc,GAAG;IAAE,IAAI,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,eAAe,EAAE,OAAO,CAAA;CAAE,CAAA;AAElF,MAAM,MAAM,UAAU,GAAG,MAAM,GAAG,WAAW,GAAG,WAAW,GAAG,OAAO,CAAA;AACrE,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,QAAQ,CAAA;AAE/C,MAAM,MAAM,cAAc,GAAG;IAAE,EAAE,EAAE,UAAU,GAAG,MAAM,CAAC;IAAC,GAAG,EAAE,YAAY,CAAA;CAAE,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC,GAAG,cAAc,CAO7F;AAmBD;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,MAAO,MAAM,KAAG,MAAyD,CAAA;AAC9F,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAA2C;AAOtF;;;;;;;;GAQG;AACH,eAAO,MAAM,QAAQ,OAAO,CAAA;AAC5B,wBAAgB,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAY1D;AAQD,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,WAAW,GAAG,WAAW,GAAG,OAAO,CAAA;AAE7F,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,MAAM,GAAG,MAAM,CA8D3F;AAED,yEAAyE;AACzE,MAAM,MAAM,YAAY,GAAG;IACzB,QAAQ,EAAE,UAAU,CAAA;IACpB,KAAK,EAAE,MAAM,EAAE,CAAA;IACf,QAAQ,EAAE,MAAM,CAAA;IAChB,OAAO,EAAE,YAAY,EAAE,CAAA;CACxB,CAAA;AA+HD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,aAAa,CAAC,cAAc,CAAC,EACpC,GAAG,EAAE,cAAc,EACnB,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,CAAC,CAAC,EAAE,YAAY,KAAK,MAAM,EACvC,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,GACV,YAAY,GAAG,IAAI,CAcrB"}

package/dist/compiler/token-scanner.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Derived tokenization, part 2: emit the SCANNER for an alphabet.
+ *
+ * Shape, and why each piece is what it is (all measured on the css grammar):
+ *
+ *  - Literal and keyword terminals become a DATA TRIE walked by a fixed-size
+ *    driver. The trie walk is also the macro-time SEARCH for a distinguishing
+ *    position set: it walks until the node is uniquely accepting, so it does not
+ *    depend on a fixed discriminator. A fixed one does not work — `(len,c1,c2)`
+ *    collides on `@counter-style`/`@color-profile` and
+ *    `@font-feature-values`/`@font-palette-values`, and widening to the last
+ *    char still leaves 11 buckets for 13 keys.
+ *    Emitting the trie as CODE (nested switches) was measured at 25,223 B for 13
+ *    css at-keywords; as DATA it is 2,057 B for the same set and 1.4x the speed
+ *    of today's slice-plus-char-chain rather than 2.5x. Data also means the
+ *    driver's size is independent of how many keys the grammar has.
+ *
+ *  - Regex terminals stay sticky regexes, consulted ONLY when the position's
+ *    first char is in their first set. Ungated, a 42-regex core alphabet scans
+ *    benchmark.css at 14.5 MB/s; first-char gated, 30.4 MB/s.
+ *
+ *  - The candidate set consulted is LOCAL to the decision point (a packed table
+ *    of id lists). The id space is global. Global maximal munch over the whole
+ *    alphabet produces seven tokens for a 123 KB stylesheet.
+ *
+ *  - `tight` is set AT SCAN TIME: 1 when no trivia preceded the token. This is
+ *    what carries `noTrivia` adjacency (262 sites across the four dialects, 50 in
+ *    css) rather than the hand-spelled `boundary` classes, which are not even
+ *    self-consistent today: the 26 css `keywords(boundary:)` sites use THREE
+ *    different spellings and 16 of them omit `€-￿` and/or `\\`.
+ *
+ *  - Whitespace is a token in `MODE_SELECTOR` (the descendant combinator is
+ *    significant there) and skipped otherwise. Mode is part of the memo key.
+ */
+import type { Alphabet } from './token-alphabet.ts';
+export type ScannerEmission = {
+    /** Module-scope declarations for the artifact prelude. */
+    decls: string[];
+    /** Name of the cursor entry point. */
+    nextFn: string;
+    /** Register a candidate set, returning its table index. */
+    candidateIndexOf: (ids: readonly number[]) => number;
+    /** True when the alphabet produced a usable scanner at all. */
+    usable: boolean;
+};
+/**
+ * Emit the scanner for `alphabet`. `ns` namespaces every hoisted name exactly
+ * like `_re`/`_fx`/`_pf` so two fused pieces never collide.
+ */
+export declare function emitScanner(alphabet: Alphabet, ns: string): ScannerEmission;
+/** Patch the candidate table placeholders once every decision point registered. */
+export declare function finalizeScanner(emission: ScannerEmission): string[];
+//# sourceMappingURL=token-scanner.d.ts.map

package/dist/compiler/token-scanner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"token-scanner.d.ts","sourceRoot":"","sources":["../../src/compiler/token-scanner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAA;AAyFnD,MAAM,MAAM,eAAe,GAAG;IAC5B,0DAA0D;IAC1D,KAAK,EAAE,MAAM,EAAE,CAAA;IACf,sCAAsC;IACtC,MAAM,EAAE,MAAM,CAAA;IACd,2DAA2D;IAC3D,gBAAgB,EAAE,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,KAAK,MAAM,CAAA;IACpD,+DAA+D;IAC/D,MAAM,EAAE,OAAO,CAAA;CAChB,CAAA;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,GAAG,eAAe,CAuK3E;AAED,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,QAAQ,EAAE,eAAe,GAAG,MAAM,EAAE,CASnE"}

package/dist/compiler/value-usage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"value-usage.d.ts","sourceRoot":"","sources":["../../src/compiler/value-usage.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,aAAa,CAAA;AAExD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,IAAI,CA8HhE"}
+{"version":3,"file":"value-usage.d.ts","sourceRoot":"","sources":["../../src/compiler/value-usage.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,aAAa,CAAA;AAExD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,IAAI,CA2HhE"}

package/dist/coverage.d.ts

@@ -1,4 +1,5 @@
 import { type RunOptions, type RunResult, type Runnable } from './functional/run.ts';
+export { GRAMMAR_COVERAGE_DEFINITIONS } from './grammar-metadata.ts';
 import type { Combinator, ParseContext } from './types.ts';
 import { type GrammarCoverageDefinition } from './compiler/grammar-coverage-ids.ts';
 export type { GrammarCoverageDefinition } from './compiler/grammar-coverage-ids.ts';
@@ -29,7 +30,6 @@ export type GrammarCoverageCollector = {
 /** Metadata emitted only by a coverage-enabled macro grammar. It is attached to
  * the grammar map, rather than each rule function, so a caller chooses the
  * explicit public start rule before collecting results. */
-export declare const GRAMMAR_COVERAGE_DEFINITIONS: symbol;
 export declare function compiledGrammarCoverageDefinitions(grammar: Record<string, unknown>): readonly GrammarCoverageDefinition[];
 export type GrammarTracePhase = 'enter' | 'attempt' | 'selected' | 'success' | 'failure' | 'backtrack' | 'rollback';
 export type GrammarTraceEvent = {

package/dist/coverage.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../src/coverage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAO,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,qBAAqB,CAAA;AACzF,OAAO,KAAK,EAAE,UAAU,EAAqC,YAAY,EAAe,MAAM,YAAY,CAAA;AAmB1G,OAAO,EAAoB,KAAK,yBAAyB,EAA4B,MAAM,oCAAoC,CAAA;AAE/H,YAAY,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAA;AAcnF,MAAM,MAAM,uBAAuB,GAAG;IACpC,WAAW,EAAE,SAAS,yBAAyB,EAAE,CAAA;IACjD,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IACvB,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;IACxB;;;;;;;;;;OAUG;IACH,KAAK,EAAE,MAAM,CAAA;IACb,kFAAkF;IAClF,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAA;IACrB,QAAQ,IAAI,uBAAuB,CAAA;IACnC,KAAK,IAAI,IAAI,CAAA;CACd,CAAA;AAED;;2DAE2D;AAC3D,eAAO,MAAM,4BAA4B,EAAE,MAA0D,CAAA;AAErG,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,yBAAyB,EAAE,CAezH;AAED,MAAM,MAAM,iBAAiB,GAAG,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAA;AACnH,MAAM,MAAM,iBAAiB,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,iBAAiB,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,CAAA;AACtG,MAAM,MAAM,oBAAoB,GAAG;IAAE,MAAM,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAA;AAChH,MAAM,MAAM,gBAAgB,GAAG;IAAE,KAAK,CAAC,KAAK,EAAE,iBAAiB,GAAG,IAAI,CAAC;IAAC,QAAQ,IAAI,oBAAoB,CAAA;CAAE,CAAA;AAC1G,+EAA+E;AAC/E,MAAM,MAAM,6BAA6B,GAAG,YAAY,GAAG;IACzD,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;IACvC,aAAa,CAAC,EAAE,gBAAgB,CAAA;CACjC,CAAA;AAED,8EAA8E;AAC9E,wBAAgB,mCAAmC,CAAC,OAAO,GAAE;IAC3D,SAAS,CAAC,EAAE,wBAAwB,CAAA;IACpC,KAAK,CAAC,EAAE,gBAAgB,CAAA;IACxB,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,KAAK,CAAC,EAAE,OAAO,CAAA;CACX,GAAG,6BAA6B,CAOrC;AAED;mEACmE;AACnE,wBAAgB,sBAAsB,CAAC,OAAO,EAAE;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,iBAAiB,KAAK,OAAO,GAAG,IAAI,CAAA;CAAE,GAAG,gBAAgB,CAkB5I;AAED,wBAAgB,8BAA8B,CAAC,WAAW,EAAE,SAAS,yBAAyB,EAAE,GAAG,wBAAwB,CAqB1H;AAED,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,SAAS,yBAAyB,EAAE,CAE1J;AAED;;8EAE8E;AAC9E,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,SAAS,yBAAyB,EAAE,CAM5I;AA8MD,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAU,GAAG;IAAE,SAAS,CAAC,EAAE,wBAAwB,CAAC;IAAC,KAAK,CAAC,EAAE,gBAAgB,CAAA;CAAO,GAAG;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,uBAAuB,CAAA;CAAE,CAO9N"}
+{"version":3,"file":"coverage.d.ts","sourceRoot":"","sources":["../src/coverage.ts"],"names":[],"mappings":"AAAA,OAAO,EAAO,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,qBAAqB,CAAA;AAEzF,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAA;AACpE,OAAO,KAAK,EAAE,UAAU,EAAqC,YAAY,EAAe,MAAM,YAAY,CAAA;AAmB1G,OAAO,EAAoB,KAAK,yBAAyB,EAA4B,MAAM,oCAAoC,CAAA;AAE/H,YAAY,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAA;AAcnF,MAAM,MAAM,uBAAuB,GAAG;IACpC,WAAW,EAAE,SAAS,yBAAyB,EAAE,CAAA;IACjD,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IACvB,KAAK,EAAE,SAAS,MAAM,EAAE,CAAA;IACxB;;;;;;;;;;OAUG;IACH,KAAK,EAAE,MAAM,CAAA;IACb,kFAAkF;IAClF,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAA;IACrB,QAAQ,IAAI,uBAAuB,CAAA;IACnC,KAAK,IAAI,IAAI,CAAA;CACd,CAAA;AAED;;2DAE2D;AAC3D,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,yBAAyB,EAAE,CAezH;AAED,MAAM,MAAM,iBAAiB,GAAG,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAA;AACnH,MAAM,MAAM,iBAAiB,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,iBAAiB,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,CAAA;AACtG,MAAM,MAAM,oBAAoB,GAAG;IAAE,MAAM,EAAE,SAAS,iBAAiB,EAAE,CAAC;IAAC,SAAS,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAA;AAChH,MAAM,MAAM,gBAAgB,GAAG;IAAE,KAAK,CAAC,KAAK,EAAE,iBAAiB,GAAG,IAAI,CAAC;IAAC,QAAQ,IAAI,oBAAoB,CAAA;CAAE,CAAA;AAC1G,+EAA+E;AAC/E,MAAM,MAAM,6BAA6B,GAAG,YAAY,GAAG;IACzD,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;IACvC,aAAa,CAAC,EAAE,gBAAgB,CAAA;CACjC,CAAA;AAED,8EAA8E;AAC9E,wBAAgB,mCAAmC,CAAC,OAAO,GAAE;IAC3D,SAAS,CAAC,EAAE,wBAAwB,CAAA;IACpC,KAAK,CAAC,EAAE,gBAAgB,CAAA;IACxB,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,KAAK,CAAC,EAAE,OAAO,CAAA;CACX,GAAG,6BAA6B,CAOrC;AAED;mEACmE;AACnE,wBAAgB,sBAAsB,CAAC,OAAO,EAAE;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,iBAAiB,KAAK,OAAO,GAAG,IAAI,CAAA;CAAE,GAAG,gBAAgB,CAkB5I;AAED,wBAAgB,8BAA8B,CAAC,WAAW,EAAE,SAAS,yBAAyB,EAAE,GAAG,wBAAwB,CAqB1H;AAED,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,SAAS,yBAAyB,EAAE,CAE1J;AAED;;8EAE8E;AAC9E,wBAAgB,kCAAkC,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,SAAS,yBAAyB,EAAE,CAM5I;AAgND,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAU,GAAG;IAAE,SAAS,CAAC,EAAE,wBAAwB,CAAC;IAAC,KAAK,CAAC,EAAE,gBAAgB,CAAA;CAAO,GAAG;IAAE,MAAM,EAAE,SAAS,CAAC;IAAC,QAAQ,EAAE,uBAAuB,CAAA;CAAE,CAO9N"}

package/dist/cst/capture-buffer.d.ts

@@ -1,6 +1,9 @@
 import type { ParseContext } from '../types.ts';
 /** Lazy per-node capture state — arrays materialized on first push. */
 export type CstCaptureBuf = {
+    /** Table-host specialisation: collect source-order raw entries without the
+     * duplicate semantic children view. Selected once for the enclosing node. */
+    rawOnly?: true | undefined;
     single?: unknown | undefined;
     ch?: unknown[] | undefined;
     rawSingle?: unknown | undefined;
@@ -41,7 +44,39 @@ export type CstRollbackMark = {
     errors: number;
 };
 export declare function saveCstMark(ctx: ParseContext): CstRollbackMark;
+/**
+ * Demote everything captured since `childrenLen` from the STRUCTURAL `children`
+ * array to `rawChildren` only — it stays in the tree, it stops being a child.
+ *
+ * This is the one mechanism behind the rule that a list-producing combinator
+ * contributes the items of the list and NOTHING ELSE. `sepBy`'s separator is
+ * matched by a real combinator, so it pushes through the same nine push sites
+ * every terminal does; there is no separate channel to route it into at match
+ * time. Demoting after the fact is the cheapest correct answer: it reuses the
+ * mark the loop already took for rollback, truncates one array, and leaves
+ * `rawChildren` — the source-order record — untouched, so the separator is
+ * still recoverable WITHOUT re-reading source bytes.
+ *
+ * `raw` is deliberately NOT truncated. That asymmetry is the whole point, and it
+ * is the same asymmetry trivia already has: consumed, absent from `children`,
+ * still reachable.
+ */
+export declare function demoteCapturedToRaw(ctx: ParseContext, childrenLen: number): void;
 export declare function rollbackCstCapture(ctx: ParseContext, mark: CstRollbackMark): void;
+/**
+ * The same rollback, taking the five marks as SCALARS.
+ *
+ * `saveCstMark` allocates a five-field object, and the table driver took one per
+ * choice attempt and per repetition item — on `benchmark.less` that is 5.0%
+ * (`saveCstMark`) plus 2.1% (`saveTriviaMark`, which allocates this one AND a
+ * seven-field wrapper) of the whole parse. The compiled engine holds the same
+ * five numbers in scalar locals and allocates nothing, which is the only
+ * difference; a caller that keeps them in locals can now do the same.
+ *
+ * `rollbackCstCapture` stays as the object-taking entry point because the
+ * interpreter's call sites genuinely carry a mark around.
+ */
+export declare function rollbackCstCaptureAt(ctx: ParseContext, raw: number, tlog: number, leaves: number, fields: number, errors: number): void;
 export declare function pushCstTriviaEntry(ctx: ParseContext, start: number, end: number, kindIndex?: number): void;
 export declare function pushTriviaLogEntry(ctx: ParseContext, start: number, end: number, kindIndex?: number): void;
 export declare function cstDeferredTriviaActive(ctx: ParseContext): boolean;

package/dist/cst/capture-buffer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capture-buffer.d.ts","sourceRoot":"","sources":["../../src/cst/capture-buffer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAQ,MAAM,aAAa,CAAA;AAGrD,uEAAuE;AACvE,MAAM,MAAM,aAAa,GAAG;IAC1B,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IAC5B,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IAC1B,SAAS,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IAC/B,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IAC3B,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAA;CAC1B,CAAA;AAKD,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO,CAE3D;AAED,MAAM,MAAM,mBAAmB,GAAG;IAChC,EAAE,EAAE,YAAY,CAAC,cAAc,CAAC,CAAA;IAChC,EAAE,EAAE,YAAY,CAAC,YAAY,CAAC,CAAA;IAC9B,GAAG,EAAE,YAAY,CAAC,iBAAiB,CAAC,CAAA;IACpC,EAAE,EAAE,YAAY,CAAC,eAAe,CAAC,CAAA;IACjC,GAAG,EAAE,OAAO,GAAG,SAAS,CAAA;IACxB,GAAG,EAAE,aAAa,GAAG,SAAS,CAAA;CAC/B,CAAA;AAED,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,YAAY,GAAG,mBAAmB,CAgB1E;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,GAAG,SAAS,GAAG;IAC5D,QAAQ,EAAE,OAAO,EAAE,CAAA;IACnB,WAAW,EAAE,OAAO,EAAE,CAAA;IACtB,SAAS,EAAE,MAAM,EAAE,CAAA;CACpB,CAMA;AAED,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,mBAAmB,GACzB;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,WAAW,EAAE,OAAO,EAAE,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,CAStE;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,CASlE;AAED,8FAA8F;AAC9F,wBAAgB,YAAY,CAAC,GAAG,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,IAAI,CAevF;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAOnD;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAOtD;AAED,wBAAgB,QAAQ,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAIlD;AAED,MAAM,MAAM,eAAe,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3G,wBAAgB,WAAW,CAAC,GAAG,EAAE,YAAY,GAAG,eAAe,CAa9D;AAwBD,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,eAAe,GAAG,IAAI,CA4BjF;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,SAAS,CAAC,EAAE,MAAM,GACjB,IAAI,CAkBN;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,SAAS,CAAC,EAAE,MAAM,GACjB,IAAI,CAON;AAED,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO,CAElE"}
+{"version":3,"file":"capture-buffer.d.ts","sourceRoot":"","sources":["../../src/cst/capture-buffer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAQ,MAAM,aAAa,CAAA;AAGrD,uEAAuE;AACvE,MAAM,MAAM,aAAa,GAAG;IAC1B;iFAC6E;IAC7E,OAAO,CAAC,EAAE,IAAI,GAAG,SAAS,CAAA;IAC1B,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IAC5B,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IAC1B,SAAS,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IAC/B,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IAC3B,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAA;CAC1B,CAAA;AAKD,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO,CAE3D;AAED,MAAM,MAAM,mBAAmB,GAAG;IAChC,EAAE,EAAE,YAAY,CAAC,cAAc,CAAC,CAAA;IAChC,EAAE,EAAE,YAAY,CAAC,YAAY,CAAC,CAAA;IAC9B,GAAG,EAAE,YAAY,CAAC,iBAAiB,CAAC,CAAA;IACpC,EAAE,EAAE,YAAY,CAAC,eAAe,CAAC,CAAA;IACjC,GAAG,EAAE,OAAO,GAAG,SAAS,CAAA;IACxB,GAAG,EAAE,aAAa,GAAG,SAAS,CAAA;CAC/B,CAAA;AAED,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,YAAY,GAAG,mBAAmB,CAgB1E;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,GAAG,SAAS,GAAG;IAC5D,QAAQ,EAAE,OAAO,EAAE,CAAA;IACnB,WAAW,EAAE,OAAO,EAAE,CAAA;IACtB,SAAS,EAAE,MAAM,EAAE,CAAA;CACpB,CAMA;AAED,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,mBAAmB,GACzB;IAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;IAAC,WAAW,EAAE,OAAO,EAAE,CAAC;IAAC,SAAS,EAAE,MAAM,EAAE,CAAA;CAAE,CAStE;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,CASlE;AAED,8FAA8F;AAC9F,wBAAgB,YAAY,CAAC,GAAG,EAAE,YAAY,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,IAAI,CAiBvF;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAOnD;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAOtD;AAED,wBAAgB,QAAQ,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAIlD;AAED,MAAM,MAAM,eAAe,GAAG;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3G,wBAAgB,WAAW,CAAC,GAAG,EAAE,YAAY,GAAG,eAAe,CAa9D;AAwBD;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAahF;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,eAAe,GAAG,IAAI,CAEjF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,YAAY,EACjB,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,IAAI,CA4BN;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,SAAS,CAAC,EAAE,MAAM,GACjB,IAAI,CAkBN;AAED,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,SAAS,CAAC,EAAE,MAAM,GACjB,IAAI,CAON;AAED,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO,CAElE"}

package/dist/cst/reflection-attach.d.ts

@@ -0,0 +1,8 @@
+import { type GrammarReflection } from './reflection.ts';
+/**
+ * Legacy interpreted-rule-map attachment. It is deliberately outside the shared
+ * table runtime graph: macro/table artifacts construct reflection in their
+ * metadata prototype instead of mutating an already-built map.
+ */
+export declare function attachGrammarReflection<T extends object>(grammar: T, reflection: GrammarReflection): T;
+//# sourceMappingURL=reflection-attach.d.ts.map

package/dist/cst/reflection-attach.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reflection-attach.d.ts","sourceRoot":"","sources":["../../src/cst/reflection-attach.ts"],"names":[],"mappings":"AAAA,OAAO,EAAsB,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAA;AAE5E;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,iBAAiB,GAAG,CAAC,CAGtG"}

package/dist/cst/reflection-symbols.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Type-level CST identity lives on the hot table-runtime import graph.  Keep the
+ * symbols separate from reflection collection/attachment: the latter is a
+ * grammar-construction concern and must not make every emitted parser load its
+ * descriptor-based legacy helper.
+ */
+export declare const GRAMMAR_REFLECTION: unique symbol;
+export declare const NODE_TYPE: unique symbol;
+export declare const NODE_TAG: unique symbol;
+//# sourceMappingURL=reflection-symbols.d.ts.map

package/dist/cst/reflection-symbols.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reflection-symbols.d.ts","sourceRoot":"","sources":["../../src/cst/reflection-symbols.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,eAAO,MAAM,kBAAkB,EAAE,OAAO,MAA0D,CAAA;AAClG,eAAO,MAAM,SAAS,EAAE,OAAO,MAAsD,CAAA;AACrF,eAAO,MAAM,QAAQ,EAAE,OAAO,MAAqD,CAAA"}

package/dist/cst/reflection.d.ts

@@ -1,7 +1,6 @@
 import type { Combinator } from '../types.ts';
-export declare const GRAMMAR_REFLECTION: unique symbol;
-export declare const NODE_TYPE: unique symbol;
-export declare const NODE_TAG: unique symbol;
+import { GRAMMAR_REFLECTION, NODE_TAG, NODE_TYPE } from './reflection-symbols.ts';
+export { GRAMMAR_REFLECTION, NODE_TYPE, NODE_TAG } from './reflection-symbols.ts';
 export type GrammarNodeReflection = {
     type: string;
     tags: readonly string[];
@@ -18,7 +17,6 @@ export declare function collectGrammarReflection(ruleMap: ReadonlyArray<readonly
     followLazy?: boolean;
 }): GrammarReflection;
 export declare function mergeGrammarReflections(reflections: readonly GrammarReflection[]): GrammarReflection;
-export declare function attachGrammarReflection<T extends object>(grammar: T, reflection: GrammarReflection): T;
 export declare function grammarReflectionOf(grammar: object): GrammarReflection | undefined;
 export declare function grammarReflectionSource(reflection: GrammarReflection): string;
 //# sourceMappingURL=reflection.d.ts.map

package/dist/cst/reflection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reflection.d.ts","sourceRoot":"","sources":["../../src/cst/reflection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,aAAa,CAAA;AAExD,eAAO,MAAM,kBAAkB,EAAE,OAAO,MAA0D,CAAA;AAClG,eAAO,MAAM,SAAS,EAAE,OAAO,MAAsD,CAAA;AACrF,eAAO,MAAM,QAAQ,EAAE,OAAO,MAAqD,CAAA;AAEnF,MAAM,MAAM,qBAAqB,GAAG;IAClC,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,KAAK,EAAE,SAAS,qBAAqB,EAAE,CAAA;CACxC,CAAA;AAED,MAAM,MAAM,qBAAqB,CAC/B,QAAQ,SAAS,MAAM,GAAG,MAAM,EAChC,OAAO,SAAS,MAAM,GAAG,MAAM,IAC7B;IACF,QAAQ,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,iBAAiB,CAAA;IACjD,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAA;IAC/B,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAA;CAC9B,CAAA;AAqFD,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9D,IAAI,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,OAAO,CAAA;CAAE,GAC9B,iBAAiB,CAcnB;AAED,wBAAgB,uBAAuB,CAAC,WAAW,EAAE,SAAS,iBAAiB,EAAE,GAAG,iBAAiB,CAepG;AAED,wBAAgB,uBAAuB,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,iBAAiB,GAAG,CAAC,CAGtG;AAED,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,iBAAiB,GAAG,SAAS,CAElF;AAED,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,iBAAiB,GAAG,MAAM,CAE7E"}
+{"version":3,"file":"reflection.d.ts","sourceRoot":"","sources":["../../src/cst/reflection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,aAAa,CAAA;AACxD,OAAO,EAAE,kBAAkB,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAA;AAEjF,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;AAEjF,MAAM,MAAM,qBAAqB,GAAG;IAClC,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;CACxB,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,KAAK,EAAE,SAAS,qBAAqB,EAAE,CAAA;CACxC,CAAA;AAED,MAAM,MAAM,qBAAqB,CAC/B,QAAQ,SAAS,MAAM,GAAG,MAAM,EAChC,OAAO,SAAS,MAAM,GAAG,MAAM,IAC7B;IACF,QAAQ,CAAC,CAAC,kBAAkB,CAAC,CAAC,EAAE,iBAAiB,CAAA;IACjD,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAA;IAC/B,QAAQ,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAA;CAC9B,CAAA;AAqFD,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9D,IAAI,CAAC,EAAE;IAAE,UAAU,CAAC,EAAE,OAAO,CAAA;CAAE,GAC9B,iBAAiB,CAcnB;AAED,wBAAgB,uBAAuB,CAAC,WAAW,EAAE,SAAS,iBAAiB,EAAE,GAAG,iBAAiB,CAepG;AAED,wBAAgB,mBAAmB,CAAC,OAAO,EAAE,MAAM,GAAG,iBAAiB,GAAG,SAAS,CAElF;AAED,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,iBAAiB,GAAG,MAAM,CAE7E"}

package/dist/cst/root-trivia-scope.d.ts

@@ -0,0 +1,26 @@
+/**
+ * The ROOT-CAPTURE POLICY of one local trivia scope, in one place.
+ *
+ * Three engines install a `parser({ trivia })` scope — the interpreter
+ * (`combinators/grammar.ts`), source lowering (`compiler/codegen.ts`) and the
+ * table (`table/assemble.ts`, `table/exec.ts`) — and each of them has to answer
+ * the same two questions about selected root trivia. The refusal below was a
+ * string literal in two of them and ABSENT from the third, which is how a table
+ * parse came to accept a grammar the other two reject.
+ *
+ * Import-free, like the rest of `cst/`, so the drivers can reach it without
+ * pulling the combinator set in.
+ */
+/** The message `parser()` raises for an unclassified local scope. Exported so the
+ *  three engines cannot drift a word apart. */
+export declare const ROOT_TRIVIA_SCOPE_REFUSAL = "parser(): selected root trivia requires classifiedTrivia() for every local trivia scope, or rootCapture: 'opaque'.";
+/**
+ * Refuse a local trivia scope that cannot be reported faithfully.
+ *
+ * With selected root capture active, a scope whose trivia is not classified and
+ * is not declared opaque would silently drop the markers inside it. Throwing is
+ * the contract (`combinators/grammar.ts:98`); returning a parse that quietly
+ * omits them is the failure this exists to prevent.
+ */
+export declare function refuseUnclassifiedRootScope(strict: boolean | undefined): void;
+//# sourceMappingURL=root-trivia-scope.d.ts.map

package/dist/cst/root-trivia-scope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"root-trivia-scope.d.ts","sourceRoot":"","sources":["../../src/cst/root-trivia-scope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH;+CAC+C;AAC/C,eAAO,MAAM,yBAAyB,uHACoF,CAAA;AAE1H;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,GAAG,IAAI,CAE7E"}

package/dist/cst/trivia-charscan.d.ts

@@ -0,0 +1,18 @@
+import type { LabeledTriviaSpec } from './trivia-kinds.ts';
+export type TriviaArmMatcher = (input: string, pos: number) => number;
+/**
+ * The character-level matchers for a spec's arms — index-parallel to `spec.arms`,
+ * so a matcher's index IS its kind index — or `null` when any arm has no lowering.
+ *
+ * `spec.minRepeats > 1` is excluded: the loops below report only an END, and a run
+ * that fails a minimum of two must report NOTHING. `classifiedTrivia()` never
+ * produces one, and the combinator path still handles it if a host writes one.
+ */
+export declare function charArmsFor(spec: LabeledTriviaSpec): readonly TriviaArmMatcher[] | null;
+/** End of the trivia run at `cur`, or `cur` when nothing matched. */
+export declare function charTriviaEnd(input: string, cur: number, arms: readonly TriviaArmMatcher[]): number;
+/** As `charTriviaEnd`, reporting each chunk with the kind index that matched it. */
+export declare function charTriviaVisit(input: string, cur: number, arms: readonly TriviaArmMatcher[], visit: (start: number, end: number, kindIndex: number) => void): number;
+/** The `1 << kindIndex` mask of the categories in the run at `cur`. */
+export declare function charTriviaKindMask(input: string, cur: number, arms: readonly TriviaArmMatcher[]): number;
+//# sourceMappingURL=trivia-charscan.d.ts.map

package/dist/cst/trivia-charscan.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trivia-charscan.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-charscan.ts"],"names":[],"mappings":"AA4BA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAE1D,MAAM,MAAM,gBAAgB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,MAAM,CAAA;AAyMrE;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,iBAAiB,GAAG,SAAS,gBAAgB,EAAE,GAAG,IAAI,CAwBvF;AAED,qEAAqE;AACrE,wBAAgB,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,gBAAgB,EAAE,GAAG,MAAM,CAWnG;AAED,oFAAoF;AACpF,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,SAAS,gBAAgB,EAAE,EACjC,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAC7D,MAAM,CAWR;AAED,uEAAuE;AACvE,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,gBAAgB,EAAE,GAAG,MAAM,CAYxG"}

package/dist/cst/trivia-kinds.d.ts

@@ -63,5 +63,24 @@ export declare function recordTriviaChunks(ctx: ParseContext, chunks: readonly T
  * unaffected either way). If you expect comments and get an empty per-node log,
  * check the name against the grammar's `triviaKindLabels`.
  */
+/**
+ * Resolve an ADJACENCY kind filter against the ACTIVE trivia table — the strict
+ * counterpart of `triviaKindMask` below.
+ *
+ * Deliberately NOT lenient. `triviaKindMask` is a capture preference, where an
+ * unknown name is a legitimate cross-dialect no-op; this is a RECOGNITION
+ * constraint, and a silently-dropped name turns `notAdjacent({kinds:['whitespace']})`
+ * into a bare `notAdjacent()` — i.e. `calc()` quietly accepting a comment where
+ * css-values-4 10.1 demands real whitespace, the exact defect the filter exists to
+ * prevent. Both failure modes are hard errors.
+ */
+export declare function resolveAdjacencyKindMask(trivia: Combinator<unknown> | undefined, kinds: readonly string[]): number;
+/**
+ * Bitmask of the trivia CATEGORIES occurring in the run starting at `pos`
+ * (`1 << kindIndex` per matched chunk); `0` when no trivia is there at all.
+ * The single source of truth for the interpreter's adjacency kind test — the
+ * compiled probe (`_akN`) mirrors this loop arm for arm.
+ */
+export declare function triviaKindMaskAt(input: string, pos: number, spec: LabeledTriviaSpec, state?: unknown): number;
 export declare function triviaKindMask(labels: readonly string[] | undefined, keep: readonly string[]): number | undefined;
 //# sourceMappingURL=trivia-kinds.d.ts.map

package/dist/cst/trivia-kinds.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trivia-kinds.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-kinds.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAI3D,MAAM,MAAM,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3E,MAAM,MAAM,iBAAiB,GAAG;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;KAAE,CAAC,CAAA;IAC/F,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAC5B,CAAA;AAUD,kEAAkE;AAClE,wBAAgB,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAAG,IAAI,CAGvG;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,iBAAiB,GAAG,IAAI,CA0C1F;AAED,uEAAuE;AACvE,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,GAAG,SAAS,MAAM,EAAE,GAAG,SAAS,CAKvG;AAiBD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,CAAC,EAAE,OAAO,GACd;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,CAsBxC;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,CAAC,EAAE,OAAO,GACd,MAAM,CAgBR;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,EAAE,OAAO,GAAG,SAAS,EAC1B,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAC7D,MAAM,GAAG,SAAS,CAqBpB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,IAAI,CAmC1F;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EACrC,IAAI,EAAE,SAAS,MAAM,EAAE,GACtB,MAAM,GAAG,SAAS,CAQpB"}
+{"version":3,"file":"trivia-kinds.d.ts","sourceRoot":"","sources":["../../src/cst/trivia-kinds.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAM3D,MAAM,MAAM,WAAW,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAA;AAE3E,MAAM,MAAM,iBAAiB,GAAG;IAC9B,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;KAAE,CAAC,CAAA;IAC/F,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAC5B,CAAA;AA+BD,kEAAkE;AAClE,wBAAgB,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAAG,IAAI,CAGvG;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,iBAAiB,GAAG,IAAI,CA0C1F;AAED,uEAAuE;AACvE,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,GAAG,SAAS,MAAM,EAAE,GAAG,SAAS,CAKvG;AAiBD;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,CAAC,EAAE,OAAO,GACd;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,WAAW,EAAE,CAAA;CAAE,CAsBxC;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,CAAC,EAAE,OAAO,GACd,MAAM,CAqBR;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,EAAE,OAAO,GAAG,SAAS,EAC1B,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAC7D,MAAM,GAAG,SAAS,CAwBpB;AAED,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,WAAW,EAAE,GAAG,IAAI,CAmC1F;AAED;;;;;;;;;;;;;;GAcG;AACH;;;;;;;;;;GAUG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,EACvC,KAAK,EAAE,SAAS,MAAM,EAAE,GACvB,MAAM,CAoBR;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,iBAAiB,EACvB,KAAK,CAAC,EAAE,OAAO,GACd,MAAM,CAoBR;AAED,wBAAgB,cAAc,CAC5B,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,SAAS,EACrC,IAAI,EAAE,SAAS,MAAM,EAAE,GACtB,MAAM,GAAG,SAAS,CAQpB"}

package/dist/functional/doc.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"doc.d.ts","sourceRoot":"","sources":["../../src/functional/doc.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAmB,MAAM,aAAa,CAAA;AACrG,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AA2BlE,qFAAqF;AACrF,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,CAAC,CAAC,CAAA;AAEzF;;;;;;;GAOG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;AAmEnE,MAAM,MAAM,eAAe,CAAC,CAAC,SAAS,QAAQ,IAAI;IAChD,wEAAwE;IACxE,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;IACzE;;;;;OAKG;IACH,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B;;;;;;;;;;;;;;;;;OAiBG;IACH,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAC7B,CAAA;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,QAAQ;IAC1C;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB;;;;;;;OAOG;IACH,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,CAAA;IAC7B;;;;;OAKG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IAC/D;;;;;;;;;OASG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;CACjE;AA+TD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CA8BjE;AA0OD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAExE;AAqDD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EACzC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,eAAe,CAAC,CAAC,CAAM,GAC5B,QAAQ,CAAC,CAAC,CAAC,CAqBb"}
+{"version":3,"file":"doc.d.ts","sourceRoot":"","sources":["../../src/functional/doc.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAmB,MAAM,aAAa,CAAA;AACrG,OAAO,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAA;AA4BlE,qFAAqF;AACrF,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,CAAC,CAAC,CAAA;AAEzF;;;;;;;GAOG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;AA2HnE,MAAM,MAAM,eAAe,CAAC,CAAC,SAAS,QAAQ,IAAI;IAChD,wEAAwE;IACxE,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;OAIG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAA;IACzE;;;;;OAKG;IACH,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B;;;;;;;;;;;;;;;;;OAiBG;IACH,eAAe,CAAC,EAAE,OAAO,CAAA;IACzB;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB;;;;;;;OAOG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAC7B,CAAA;AAED,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,QAAQ;IAC1C;;;;;;;;OAQG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB;;;;;;;OAOG;IACH,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,CAAA;IAC7B;;;;;OAKG;IACH,QAAQ,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;IACtC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB;;;;OAIG;IACH,MAAM,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IAC/D;;;;;;;;;OASG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;CACjE;AAoUD;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CA8BjE;AAgPD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,SAAS,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAExE;AAqDD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,CAAC,SAAS,QAAQ,EACzC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,IAAI,GAAE,eAAe,CAAC,CAAC,CAAM,GAC5B,QAAQ,CAAC,CAAC,CAAC,CAqBb"}

package/dist/functional/run-tabled.d.ts

@@ -0,0 +1,12 @@
+import { type Runnable, type RunOptions, type RunResult } from './run.ts';
+/**
+ * Run a grammar against an input.
+ *
+ * Identical contract to `parseman/run`'s `run()`, with one difference that is
+ * the point of this module: a COMBINATOR entry is lowered to a table and the
+ * table is what parses. `options.trivia` is lowered the same way — it is a parse
+ * of the same grammar and would otherwise be the one place the interpreter still
+ * ran on the product path.
+ */
+export declare function run(entry: Runnable, input: string, options?: RunOptions): RunResult;
+//# sourceMappingURL=run-tabled.d.ts.map

package/dist/functional/run-tabled.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"run-tabled.d.ts","sourceRoot":"","sources":["../../src/functional/run-tabled.ts"],"names":[],"mappings":"AA2CA,OAAO,EAAoB,KAAK,QAAQ,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,MAAM,UAAU,CAAA;AAwF3F;;;;;;;;GAQG;AACH,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAYvF"}

package/dist/functional/run.d.ts

@@ -17,7 +17,10 @@ import { type RootTriviaIndex } from '../cst/trivia-entries.ts';
 export type Runnable = ((input: string, pos: number, ctx: ParseContext) => ParseResult<unknown>) | Combinator<unknown>;
 export type RunOptions = {
     /** Optional hooks for a coverage-enabled compiled or macro parser. Ordinary
-     * parses omit this completely, so instrumentation has no normal-path cost. */
+     * parses omit this completely, so instrumentation has no normal-path cost.
+     * Table-backed 0.47 artifacts support `_grammarCoverage` but reject
+     * `_grammarTrace` explicitly; interpreted/source-lowered entries may support
+     * both. */
     instrumentation?: {
         _grammarCoverage?: (id: string) => void;
         _grammarTrace?: {
@@ -35,14 +38,23 @@ export type RunOptions = {
     /** Initial grammar state threaded into `ctx.state`. */
     state?: unknown;
     /**
-     * The grammar's trivia rule. A root rule consumes trivia BETWEEN terms but not
-     * after the last one, so trailing whitespace/comments would otherwise look like
-     * unparsed input. Given the trivia rule, `run` skips that tail before computing
-     * `unconsumedFrom` — so only real leftover is reported. Also encodes dialect
-     * differences for free: pass the CSS trivia and a trailing `//` counts as
-     * leftover; pass the Less trivia (which treats `//` as a line comment) and it
-     * doesn't. An UNTERMINATED comment (which the trivia rule won't match) surfaces
-     * at its start. Omit to require the parse to reach the exact end itself.
+     * The grammar's trivia rule — an OVERRIDE, no longer a requirement.
+     *
+     * A root rule consumes trivia BETWEEN terms but not after the last one, so
+     * trailing whitespace/comments would otherwise look like unparsed input. `run`
+     * skips that tail before computing `unconsumedFrom` and before reporting
+     * `span`, so only real leftover is reported.
+     *
+     * The trivia used is the ENTRY's own ambient trivia — whatever
+     * `rules({ trivia })` / `parser({ trivia })` declared — resolved automatically
+     * (see `ambientTriviaFromRunnable`). Pass this only to use a DIFFERENT trivia
+     * for the document tail than the grammar parses with; it wins when given.
+     * Passing the grammar's own trivia is now a no-op, and remains supported.
+     *
+     * Either way it encodes dialect differences for free: CSS trivia leaves a
+     * trailing `//` as leftover, Less trivia (which treats `//` as a line comment)
+     * does not. An UNTERMINATED comment (which the trivia rule won't match)
+     * surfaces at its start.
      */
     trivia?: Runnable;
     /**
@@ -73,15 +85,6 @@ export type RunOptions = {
      * fails, so none of the machinery runs.
      */
     tolerant?: boolean;
-    /**
-     * Run three compiled-parser-only profiling passes: recognizer (no global
-     * sinks), structural capture without the host, then the normal host path. This
-     * is a measurement boundary, not a parser mode; ordinary `run()` output is
-     * unchanged when omitted. The input is parsed THREE times — each pass gets its
-     * own shallow copy of `options.state`, so keep per-parse state shallow (only
-     * the top level is isolated between passes).
-     */
-    profile?: boolean;
 };
 export type RootTriviaCapture = {
     /** Packed `[gapStart, gapEnd, markerStart, markerEnd, selectedKindIndex]` rows. */
@@ -91,24 +94,6 @@ export type RootTriviaCapture = {
     /** Lazy lookup over `rows`; no tokens or strings are materialized. */
     readonly index: RootTriviaIndex;
 };
-export type RunProfilePass = {
-    ms: number;
-    nodes: number;
-    childSlots: number;
-    rawSlots: number;
-    triviaSlots: number;
-    fieldSlots: number;
-    hostCalls: number;
-};
-export type RunProfile = {
-    /** Existing `voidOf(transform(..., () => undefined))` semantics, generalized
-     * to compiled structural nodes: no `ch`/`raw`/`tl` capture or raw entries. */
-    recognizer: RunProfilePass;
-    /** Captures children/raw/trivia/fields but suppresses node construction. */
-    structuralCapture: RunProfilePass;
-    /** The ordinary parser path, including its injected build host. */
-    hostConstruction: RunProfilePass;
-};
 export type RunResult = {
     ok: boolean;
     /** The entry's value on success; undefined on failure. */
@@ -128,13 +113,11 @@ export type RunResult = {
      */
     rootTrivia?: RootTriviaCapture;
     /** Offset where unparsed input begins — the first non-trivia character the parse
-     * left unconsumed (trailing trivia skipped when `trivia` is given), or null if
-     * the whole input was consumed. This is how you detect "the grammar stopped short,
-     * there's junk here". Only meaningful on success — a failed parse reports its own
-     * `span`/`expected`. */
+     * left unconsumed (the document's trailing trivia is always skipped; see
+     * `RunOptions.trivia`), or null if the whole input was consumed. This is how you
+     * detect "the grammar stopped short, there's junk here". Only meaningful on
+     * success — a failed parse reports its own `span`/`expected`. */
     unconsumedFrom: number | null;
-    /** Present only when `RunOptions.profile` is true. */
-    profile?: RunProfile;
 };
 export declare function run(entry: Runnable, input: string, options?: RunOptions): RunResult;
 //# sourceMappingURL=run.d.ts.map

package/dist/functional/run.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/functional/run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAEpF,OAAO,EAAwB,KAAK,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAMrF;;;;;;;;;;;;GAYG;AAEH,+EAA+E;AAC/E,MAAM,MAAM,QAAQ,GAChB,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,GACzE,UAAU,CAAC,OAAO,CAAC,CAAA;AAEvB,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,eAAe,CAAC,EAAE;QAChB,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;QACvC,aAAa,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,EAAE;gBAAE,EAAE,EAAE,MAAM,CAAC;gBAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;gBAAC,MAAM,EAAE,MAAM,CAAC;gBAAC,GAAG,CAAC,EAAE,MAAM,CAAA;aAAE,GAAG,IAAI,CAAA;SAAE,CAAA;KACjL,CAAA;IACD;qFACiF;IACjF,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B,uDAAuD;IACvD,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,QAAQ,CAAA;IACjB;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B;;;;OAIG;IACH,UAAU,CAAC,EAAE;QACX,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;KACnC,CAAA;IACD;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IAChC,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAA;CAChC,CAAA;AAED,MAAM,MAAM,cAAc,GAAG;IAC3B,EAAE,EAAE,MAAM,CAAA;IACV,KAAK,EAAE,MAAM,CAAA;IACb,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,WAAW,EAAE,MAAM,CAAA;IACnB,UAAU,EAAE,MAAM,CAAA;IAClB,SAAS,EAAE,MAAM,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB;kFAC8E;IAC9E,UAAU,EAAE,cAAc,CAAA;IAC1B,4EAA4E;IAC5E,iBAAiB,EAAE,cAAc,CAAA;IACjC,mEAAmE;IACnE,gBAAgB,EAAE,cAAc,CAAA;CACjC,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,OAAO,CAAA;IACX,0DAA0D;IAC1D,KAAK,EAAE,OAAO,CAAA;IACd,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IACpC,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,gGAAgG;IAChG,MAAM,EAAE,UAAU,EAAE,CAAA;IACpB;;;;OAIG;IACH,UAAU,CAAC,EAAE,iBAAiB,CAAA;IAC9B;;;;4BAIwB;IACxB,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;IAC7B,sDAAsD;IACtD,OAAO,CAAC,EAAE,UAAU,CAAA;CACrB,CAAA;AAyOD,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAgBvF"}
+{"version":3,"file":"run.d.ts","sourceRoot":"","sources":["../../src/functional/run.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW,EAAQ,MAAM,aAAa,CAAA;AAG1F,OAAO,EAAwB,KAAK,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAMrF;;;;;;;;;;;;GAYG;AAEH,+EAA+E;AAC/E,MAAM,MAAM,QAAQ,GAChB,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,KAAK,WAAW,CAAC,OAAO,CAAC,CAAC,GACzE,UAAU,CAAC,OAAO,CAAC,CAAA;AAEvB,MAAM,MAAM,UAAU,GAAG;IACvB;;;;eAIW;IACX,eAAe,CAAC,EAAE;QAChB,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,KAAK,IAAI,CAAA;QACvC,aAAa,CAAC,EAAE;YAAE,KAAK,CAAC,KAAK,EAAE;gBAAE,EAAE,EAAE,MAAM,CAAC;gBAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,UAAU,CAAC;gBAAC,MAAM,EAAE,MAAM,CAAC;gBAAC,GAAG,CAAC,EAAE,MAAM,CAAA;aAAE,GAAG,IAAI,CAAA;SAAE,CAAA;KACjL,CAAA;IACD;qFACiF;IACjF,KAAK,CAAC,EAAE,YAAY,CAAC,OAAO,CAAC,CAAA;IAC7B,uDAAuD;IACvD,KAAK,CAAC,EAAE,OAAO,CAAA;IACf;;;;;;;;;;;;;;;;;;OAkBG;IACH,MAAM,CAAC,EAAE,QAAQ,CAAA;IACjB;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B;;;;OAIG;IACH,UAAU,CAAC,EAAE;QACX,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;KACnC,CAAA;IACD;;;;;;;;;OASG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;CACnB,CAAA;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,mFAAmF;IACnF,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,CAAA;IAChC,6EAA6E;IAC7E,QAAQ,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAA;IAClC,sEAAsE;IACtE,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAA;CAChC,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,OAAO,CAAA;IACX,0DAA0D;IAC1D,KAAK,EAAE,OAAO,CAAA;IACd,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAA;IACpC,6EAA6E;IAC7E,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,gGAAgG;IAChG,MAAM,EAAE,UAAU,EAAE,CAAA;IACpB;;;;OAIG;IACH,UAAU,CAAC,EAAE,iBAAiB,CAAA;IAC9B;;;;qEAIiE;IACjE,cAAc,EAAE,MAAM,GAAG,IAAI,CAAA;CAC9B,CAAA;AAgbD,wBAAgB,GAAG,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,UAAe,GAAG,SAAS,CAEvF"}

package/dist/grammar-metadata.d.ts

@@ -0,0 +1,3 @@
+/** Import-free keys shared by grammar construction and public metadata readers. */
+export declare const GRAMMAR_COVERAGE_DEFINITIONS: symbol;
+//# sourceMappingURL=grammar-metadata.d.ts.map

package/dist/grammar-metadata.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"grammar-metadata.d.ts","sourceRoot":"","sources":["../src/grammar-metadata.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,eAAO,MAAM,4BAA4B,EAAE,MAA0D,CAAA"}