parseman 0.5.0 → 0.6.0

package/dist/types.d.ts

@@ -69,6 +69,10 @@ export type ParserDef = {
 } | {
     tag: 'trivia';
     parser: Combinator<unknown>;
+} | {
+    tag: 'label';
+    label: string;
+    parser: Combinator<unknown>;
 } | {
     tag: 'grammar';
     parser: Combinator<unknown>;
@@ -87,7 +91,7 @@ export type ParserDef = {
     build: (children: ReadonlyArray<unknown>, rawChildren: ReadonlyArray<unknown>, span: {
         start: number;
         end: number;
-    }) => unknown;
+    }, triviaLog: readonly number[], state: unknown) => unknown;
     buildSrc?: string;
 } | {
     tag: 'guard';
@@ -119,15 +123,21 @@ export type Combinator<T> = {
     readonly _def: ParserDef;
     parse(input: string, pos: number, ctx: ParseContext): ParseResult<T>;
 };
+import type { CstCaptureBuf } from './cst/capture-buffer.ts';
 export type ParseContext = {
     trivia?: Combinator<unknown>;
+    /**
+     * Label table for the active trivia parser (`label(name, arm)` strings in
+     * choice order). When set, trivia logs include a kind index per entry.
+     */
+    triviaKindLabels?: readonly string[];
     /**
      * When true (and a CST node is collecting children), trivia consumed between
      * terms is recorded into _cstRawChildren as separate CSTTrivia tokens — one
      * per maximal sub-match of the trivia parser (e.g. a whitespace run or a
      * comment). When false/unset, trivia is skipped silently. Default: skip.
      */
-    captureTrivia?: boolean;
+    captureTrivia?: boolean | undefined;
     trackLines: boolean;
     /** Grammar-author-provided state, scoped with withCtx() and read in guard(). */
     state?: unknown;
@@ -144,30 +154,41 @@ export type ParseContext = {
     };
     /**
      * Framework-internal: current CSTNode rule's child collector.
-     * Set by GrammarParser capital-letter parser; undefined outside CST parsing.
+     * Set by node() during capture; undefined outside an active node parse.
      * CSTNode parsers append themselves here after a successful parse.
      */
-    _cstChildren?: unknown[];
+    _cstChildren?: unknown[] | undefined;
     /**
      * Framework-internal: collector for CSTLeaf terminals.
      * Usually points to the same array as _cstChildren (both live together).
      * literal() and regex() append a CSTLeaf here when set.
      */
-    _cstLeaves?: unknown[];
+    _cstLeaves?: unknown[] | undefined;
     /**
      * Framework-internal: collector for ALL children including trivia.
      * Set alongside _cstChildren/_cstLeaves. Receives CSTLeaf + CSTNode entries
      * (same as _cstChildren) PLUS CSTTrivia entries for trivia consumed between terms.
      * Passed to buildNode() as rawChildren so grammars can inspect trivia.
      */
-    _cstRawChildren?: unknown[];
+    _cstRawChildren?: unknown[] | undefined;
     /**
      * Framework-internal: flat trivia log. When set, scanTrivia records each
-     * consumed trivia run as two numbers [runStart, runEnd] appended to this
+     * consumed trivia entry as two numbers [start, end] appended to this
      * array instead of (or in addition to) rawChildren capture. Zero object
      * allocations — just number pushes.
      */
     _triviaLog?: number[];
+    /**
+     * Framework-internal: flat per-node trivia log for CST capture mode.
+     * When set alongside _cstRawChildren, each trivia entry is recorded as three
+     * numbers [start, end, insertIdx] appended here (one entry = three numbers) instead of allocating a
+     * CSTTrivia object. `insertIdx` is the _cstRawChildren.length at the moment
+     * the trivia was consumed, so consumers know where in rawChildren to insert it.
+     * Zero object allocations — replaces the CSTTrivia object path entirely.
+     */
+    _cstTriviaLog?: number[] | undefined;
+    /** Framework-internal: lazy capture buffer for active node() parse. */
+    _cstBuf?: CstCaptureBuf | undefined;
 };
 /**
  * Sentinel value returned by recover() when its inner parser fails.
@@ -185,6 +206,8 @@ export type ParserMeta = {
     canMatchNewline: boolean;
     /** Whether this parser is marked as trivia (auto-skip) */
     isTrivia: boolean;
+    /** User-defined labels for labeled trivia arms (`label(name, parser)`). */
+    triviaKindLabels?: readonly string[];
     /** choice(): true when all alternative first sets are pairwise disjoint */
     disjoint?: boolean;
 };
@@ -237,10 +260,10 @@ export type AutoNotCheck = {
  * it is evaluated (cheaply, without parsing) before the arm is attempted.
  * If the gate returns false the arm is skipped entirely.
  *
- * Usage: choice({ gate: s => (s as Ctx).inFn, parser: returnKw }, ident)
+ * Usage: choice({ gate: s => (s as Ctx).inFn, combinator: returnKw }, ident)
  */
 export type GatedArm<T = unknown> = {
     gate: (state: unknown) => boolean;
-    parser: Combinator<T>;
+    combinator: Combinator<T>;
 };
 //# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,IAAI,GAAG;IACjB,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB,CAAA;AAED,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI;IACvB,EAAE,EAAE,IAAI,CAAA;IACR,KAAK,EAAE,CAAC,CAAA;IACR,IAAI,EAAE,IAAI,CAAA;IACV,MAAM,CAAC,EAAE,IAAI,EAAE,CAAA;IACf,oHAAoH;IACpH,MAAM,CAAC,EAAE,UAAU,EAAE,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,KAAK,CAAA;IACT,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AAED,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;AAMnD,MAAM,MAAM,SAAS,GACjB;IAAE,GAAG,EAAE,SAAS,CAAC;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,OAAO,CAAA;CAAE,GAC7D;IAAE,GAAG,EAAE,OAAO,CAAC;IAAK,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,GAC5E;IAAE,GAAG,EAAE,UAAU,CAAC;IAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAA;CAAE,GACpD;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAI,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;IAAC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;CAAE,GACtL;IAAE,GAAG,EAAE,MAAM,CAAC;IAAM,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,GAAG,EAAE,CAAC,CAAA;CAAE,GACzD;IAAE,GAAG,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,GAAG,EAAE,CAAC,CAAA;CAAE,GACzD;IAAE,GAAG,EAAE,UAAU,CAAC;IAAE,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjD;IAAE,GAAG,EAAE,OAAO,CAAC;IAAK,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,SAAS,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjF;IAAE,GAAG,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GACpI;IAAE,GAAG,EAAE,MAAM,CAAC;IAAM,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAC7E;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAI,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjD;IAAE,GAAG,EAAE,SAAS,CAAC;IAAG,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,YAAY,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;IAAC,UAAU,EAAE,OAAO,CAAA;CAAE,GACrH;IAAE,GAAG,EAAE,MAAM,CAAC;IAAK,KAAK,EAAE,MAAM,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACrD;IAAE,GAAG,EAAE,KAAK,CAAC;IAAM,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAChD;IAAE,GAAG,EAAE,MAAM,CAAC;IAAK,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,WAAW,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAClN;IAAE,GAAG,EAAE,OAAO,CAAC;IAAI,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAA;CAAE,GAC3D;IAAE,GAAG,EAAE,SAAS,CAAC;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAChE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAE,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAC/E;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAG,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAC/F;IAAE,GAAG,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,eAAe,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACrG;IAAE,GAAG,EAAE,SAAS,CAAA;CAAE,CAAA;AAEtB,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;CACrE,CAAA;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;IAC5B;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IACvB,UAAU,EAAE,OAAO,CAAA;IACnB,gFAAgF;IAChF,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,uGAAuG;IACvG,OAAO,CAAC,EAAE,UAAU,EAAE,CAAA;IACtB;;;;OAIG;IACH,MAAM,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,SAAS,GAAG,IAAI,CAAA;KAAE,CAAA;IACnD;;;;OAIG;IACH,YAAY,CAAC,EAAE,OAAO,EAAE,CAAA;IACxB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,EAAE,CAAA;IACtB;;;;;OAKG;IACH,eAAe,CAAC,EAAE,OAAO,EAAE,CAAA;IAC3B;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;CACtB,CAAA;AAED;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG;IACvB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAC5B,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,gFAAgF;IAChF,QAAQ,EAAE,QAAQ,CAAA;IAClB,0DAA0D;IAC1D,eAAe,EAAE,OAAO,CAAA;IACxB,0DAA0D;IAC1D,QAAQ,EAAE,OAAO,CAAA;IACjB,2EAA2E;IAC3E,QAAQ,CAAC,EAAE,OAAO,CAAA;CACnB,CAAA;AAED,oFAAoF;AACpF,MAAM,MAAM,QAAQ,GAChB;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,GACf;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,SAAS,EAAE,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,CAAA;AAErB,MAAM,MAAM,SAAS,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAA;AAElD;;;;;;;;;GASG;AACH,MAAM,MAAM,cAAc,GACtB;IAAE,GAAG,EAAE,gBAAgB,CAAC;IAAO,UAAU,EAAE,MAAM,CAAA;CAAE,GACnD;IAAE,GAAG,EAAE,sBAAsB,CAAC;IAAC,aAAa,EAAE,MAAM,EAAE,CAAA;CAAE,GACxD;IAAE,GAAG,EAAE,YAAY,CAAA;CAAE,CAAA;AAEzB;;;;GAIG;AACH,MAAM,MAAM,YAAY,GACpB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAG,GAAG,EAAE,QAAQ,CAAA;CAAE,GACrC;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAA;AAEzC;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,OAAO,IAAI;IAClC,IAAI,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAA;IACjC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CACtB,CAAA"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,IAAI,GAAG;IACjB,KAAK,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,MAAM,CAAA;IACX,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,OAAO,CAAC,EAAE,MAAM,CAAA;IAChB,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB,CAAA;AAED,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI;IACvB,EAAE,EAAE,IAAI,CAAA;IACR,KAAK,EAAE,CAAC,CAAA;IACR,IAAI,EAAE,IAAI,CAAA;IACV,MAAM,CAAC,EAAE,IAAI,EAAE,CAAA;IACf,oHAAoH;IACpH,MAAM,CAAC,EAAE,UAAU,EAAE,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,SAAS,GAAG;IACtB,EAAE,EAAE,KAAK,CAAA;IACT,QAAQ,EAAE,MAAM,EAAE,CAAA;IAClB,IAAI,EAAE,IAAI,CAAA;CACX,CAAA;AAED,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;AAMnD,MAAM,MAAM,SAAS,GACjB;IAAE,GAAG,EAAE,SAAS,CAAC;IAAG,KAAK,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,OAAO,CAAA;CAAE,GAC7D;IAAE,GAAG,EAAE,OAAO,CAAC;IAAK,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,eAAe,EAAE,MAAM,CAAA;CAAE,GAC5E;IAAE,GAAG,EAAE,UAAU,CAAC;IAAE,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAA;CAAE,GACpD;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAI,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;IAAC,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAAC,QAAQ,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,EAAE,CAAA;CAAE,GACtL;IAAE,GAAG,EAAE,MAAM,CAAC;IAAM,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,GAAG,EAAE,CAAC,CAAA;CAAE,GACzD;IAAE,GAAG,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,GAAG,EAAE,CAAC,CAAA;CAAE,GACzD;IAAE,GAAG,EAAE,UAAU,CAAC;IAAE,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjD;IAAE,GAAG,EAAE,OAAO,CAAC;IAAK,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,SAAS,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjF;IAAE,GAAG,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,KAAK,OAAO,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GACpI;IAAE,GAAG,EAAE,MAAM,CAAC;IAAM,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAC7E;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAI,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACjD;IAAE,GAAG,EAAE,OAAO,CAAC;IAAK,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAChE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAG,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,YAAY,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;IAAC,UAAU,EAAE,OAAO,CAAA;CAAE,GACrH;IAAE,GAAG,EAAE,MAAM,CAAC;IAAK,KAAK,EAAE,MAAM,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GACrD;IAAE,GAAG,EAAE,KAAK,CAAC;IAAM,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAChD;IAAE,GAAG,EAAE,MAAM,CAAC;IAAK,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,WAAW,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAAE,GAChQ;IAAE,GAAG,EAAE,OAAO,CAAC;IAAI,SAAS,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAA;CAAE,GAC3D;IAAE,GAAG,EAAE,SAAS,CAAC;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAChE;IAAE,GAAG,EAAE,SAAS,CAAC;IAAE,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;CAAE,GAC/E;IAAE,GAAG,EAAE,QAAQ,CAAC;IAAG,QAAQ,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC;IAAC,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,GAC/F;IAAE,GAAG,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAAC,eAAe,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;CAAE,GACrG;IAAE,GAAG,EAAE,SAAS,CAAA;CAAE,CAAA;AAEtB,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,YAAY,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;CACrE,CAAA;AAED,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAA;AAE5D,MAAM,MAAM,YAAY,GAAG;IACzB,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;IAC5B;;;OAGG;IACH,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACpC;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAA;IACnC,UAAU,EAAE,OAAO,CAAA;IACnB,gFAAgF;IAChF,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,uGAAuG;IACvG,OAAO,CAAC,EAAE,UAAU,EAAE,CAAA;IACtB;;;;OAIG;IACH,MAAM,CAAC,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,SAAS,GAAG,IAAI,CAAA;KAAE,CAAA;IACnD;;;;OAIG;IACH,YAAY,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IACpC;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IAClC;;;;;OAKG;IACH,eAAe,CAAC,EAAE,OAAO,EAAE,GAAG,SAAS,CAAA;IACvC;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;IACrB;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAA;IACpC,uEAAuE;IACvE,OAAO,CAAC,EAAE,aAAa,GAAG,SAAS,CAAA;CACpC,CAAA;AAED;;;GAGG;AACH,MAAM,MAAM,UAAU,GAAG;IACvB,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAC5B,CAAA;AAED,MAAM,MAAM,UAAU,GAAG;IACvB,gFAAgF;IAChF,QAAQ,EAAE,QAAQ,CAAA;IAClB,0DAA0D;IAC1D,eAAe,EAAE,OAAO,CAAA;IACxB,0DAA0D;IAC1D,QAAQ,EAAE,OAAO,CAAA;IACjB,2EAA2E;IAC3E,gBAAgB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;IACpC,2EAA2E;IAC3E,QAAQ,CAAC,EAAE,OAAO,CAAA;CACnB,CAAA;AAED,oFAAoF;AACpF,MAAM,MAAM,QAAQ,GAChB;IAAE,IAAI,EAAE,KAAK,CAAA;CAAE,GACf;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,MAAM,EAAE,SAAS,EAAE,CAAA;CAAE,GACvC;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,CAAA;AAErB,MAAM,MAAM,SAAS,GAAG;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAA;AAElD;;;;;;;;;GASG;AACH,MAAM,MAAM,cAAc,GACtB;IAAE,GAAG,EAAE,gBAAgB,CAAC;IAAO,UAAU,EAAE,MAAM,CAAA;CAAE,GACnD;IAAE,GAAG,EAAE,sBAAsB,CAAC;IAAC,aAAa,EAAE,MAAM,EAAE,CAAA;CAAE,GACxD;IAAE,GAAG,EAAE,YAAY,CAAA;CAAE,CAAA;AAEzB;;;;GAIG;AACH,MAAM,MAAM,YAAY,GACpB;IAAE,IAAI,EAAE,UAAU,CAAC;IAAG,GAAG,EAAE,QAAQ,CAAA;CAAE,GACrC;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAA;AAEzC;;;;;;GAMG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,OAAO,IAAI;IAClC,IAAI,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAA;IACjC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CAC1B,CAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "parseman",
-  "version": "0.5.0",
+  "version": "0.6.0",
   "description": "Parser combinators that compile to optimized JavaScript — use as a library or as a build-time macro",
   "type": "module",
   "author": "Matthew Dean <matthew-dean@users.noreply.github.com>",
@@ -53,6 +53,7 @@
     "@types/node": "~26.0.0",
     "@types/parsimmon": "~1.10.9",
     "chevrotain": "~12.0.0",
+    "esbuild": "~0.27.7",
     "jison": "~0.4.18",
     "moo": "~0.5.3",
     "nearley": "~2.20.1",

package/dist/cst/grammar.d.ts

@@ -1,115 +0,0 @@
-import type { Combinator, Span } from '../types.ts';
-import type { CSTNode, CSTLeaf, CSTError, CSTRawChild, NodeLike } from './types.ts';
-import type { ParseDoc } from './incremental.ts';
-type Capital = 'A' | 'B' | 'C' | 'D' | 'E' | 'F' | 'G' | 'H' | 'I' | 'J' | 'K' | 'L' | 'M' | 'N' | 'O' | 'P' | 'Q' | 'R' | 'S' | 'T' | 'U' | 'V' | 'W' | 'X' | 'Y' | 'Z';
-/** Keys of T whose names start with a capital letter (CST parser). */
-export type RuleKeys<T> = {
-    [K in keyof T & string]: K extends `${Capital}${string}` ? K : never;
-}[keyof T & string];
-/**
- * Maps each grammar property to its resolved Combinator type.
- *
- * Use as the parameter type in rule thunks — gives `g.*` the correct
- * Combinator type instead of the raw function type:
- *
- *   Expr = (g: Refs<this>) => choice(g.Atom, sequence(g.Expr, literal('+'), g.Atom))
- */
-export type Refs<T> = {
-    [K in keyof T as K extends `_${string}` ? never : T[K] extends Combinator<any> ? K : T[K] extends (g: any) => Combinator<any> ? K : never]: T[K] extends Combinator<infer V> ? Combinator<V> : T[K] extends (g: any) => Combinator<infer V> ? Combinator<V> : never;
-};
-/**
- * Base class for grammars that automatically produce a CST (or a custom AST
- * if you override `buildNode`).
- *
- * Rules are declared as class properties:
- *   - Plain Combinator  (no cross-references needed):
- *       digits = regex(/[0-9]+/)
- *   - Thunk  (references other parser via `g`):
- *       Expr = (g: Refs<this>) => choice(g.Atom, sequence(g.Expr, literal('+')))
- *
- * Convention:
- *   Capital letter → CSTNode-producing rule (span + state + children)
- *   lowercase      → transparent helper (terminals bubble up as CSTLeaf in the
- *                    nearest enclosing capital rule)
- *
- * Mutual recursion works because thunks are collected first, ref() placeholders
- * installed for each one, then all thunks are called with `g` (a map of refs).
- * Initialization is lazy — triggered on the first call to rule().
- *
- * Grammar inheritance: subclass property initializers naturally override parent
- * ones (they run last in construction order), so extending a grammar means only
- * re-declaring the parser you want to change.
- *
- *   class JSONCParser extends JSONParser {
- *     ws = jsoncWs  // override just this one rule
- *   }
- */
-export declare class Parser<N extends NodeLike = CSTNode> {
-    private _built;
-    /** Set in a subclass to enable automatic trivia skipping between sequence terms. */
-    protected _trivia?: Combinator<unknown>;
-    /**
-     * Set in a subclass to make the rule name optional in `parse()`.
-     * When defined, `parse(input)` is equivalent to `parse(defaultRule, input)`.
-     */
-    protected _defaultRule?: RuleKeys<this>;
-    /**
-     * Set `true` in a subclass to record trivia (whitespace/comments) consumed
-     * between terms into each node's rawChildren as separate CSTTrivia tokens.
-     * Requires `_trivia` to be set. Default: trivia is skipped without recording.
-     */
-    protected _captureTrivia?: boolean;
-    /**
-     * When set, makeParseDoc injects this array as ctx._triviaLog so each
-     * scanTrivia.commit() pushes [runStart, runEnd] pairs into it.
-     * Reset to [] before each parse() call in any subclass that uses it.
-     */
-    protected _triviaLog?: number[];
-    /**
-     * Optional map of public entry-point aliases → actual rule names. Lets callers
-     * `parse('value', src)` when the grammar's rule is `ValueList`, removing
-     * per-adapter name-translation tables.
-     */
-    protected _aliases?: Record<string, string>;
-    /** Resolve an alias to its target rule name (identity if not aliased). */
-    protected _resolveRule(name: string): string;
-    private _build;
-    /**
-     * Override to produce a custom AST node instead of a plain CSTNode.
-     * The returned object must satisfy NodeLike for IncrementalParser to work.
-     *
-     * `rawChildren` is `children` plus any trivia tokens (whitespace/comments)
-     * consumed between terms, in parse order. Use it to inspect trivia when the
-     * grammar is whitespace-sensitive (e.g. CSS descendant vs adjacent combinators).
-     * The default implementation ignores `rawChildren`.
-     */
-    protected buildNode(type: string, span: Span, children: ReadonlyArray<N | CSTLeaf | CSTError>, state: unknown, _rawChildren: ReadonlyArray<CSTRawChild>): N;
-    /** Wrap an inner combinator so it produces a CSTNode on each match. */
-    private _makeNodeParser;
-    /** Reconstruct a node with a new children array (used by IncrementalParser). */
-    rebuild(node: N, newChildren: ReadonlyArray<N | CSTLeaf | CSTError>): N;
-    /**
-     * Parse input starting from a named rule, returning a ParseDoc.
-     * The doc carries the tree, any parse errors, and an edit() method
-     * for incremental re-parsing on subsequent changes.
-     *
-     *   const doc = css.parse('Stylesheet', src)
-     *   doc.tree    // the CST root, or null on failure
-     *   doc.errors  // ParseFail[], empty on success
-     *
-     *   // In an editor — just keep calling edit():
-     *   const doc2 = doc.edit(newSrc, changeStart, changeEnd)
-     *
-     * If the grammar defines `_defaultRule`, the rule name may be omitted:
-     *   const doc = css.parse(src)  // uses _defaultRule
-     */
-    parse(ruleName: RuleKeys<this>, input: string): ParseDoc<N>;
-    parse(input: string): ParseDoc<N>;
-    /**
-     * Get the compiled Combinator for a named rule.
-     * Triggers lazy initialization on first call.
-     */
-    rule(name: RuleKeys<this>): Combinator<N>;
-}
-export {};
-//# sourceMappingURL=grammar.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"grammar.d.ts","sourceRoot":"","sources":["../../src/cst/grammar.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAyC,IAAI,EAAE,MAAM,aAAa,CAAA;AAE1F,OAAO,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAa,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAE9F,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AAMhD,KAAK,OAAO,GAAG,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GACvD,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,GAAC,GAAG,CAAA;AAE9D,sEAAsE;AACtE,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI;KACvB,CAAC,IAAI,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,SAAS,GAAG,OAAO,GAAG,MAAM,EAAE,GAAG,CAAC,GAAG,KAAK;CACrE,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAA;AAEnB;;;;;;;GAOG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,IAAI;KACnB,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,IAAI,MAAM,EAAE,GAAG,KAAK,GAC3C,CAAC,CAAC,CAAC,CAAC,SAAS,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,GAChC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,KAAK,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,GAC5C,KAAK,GACN,CAAC,CAAC,CAAC,CAAC,SAAS,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAChD,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAC5D,KAAK;CACT,CAAA;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,qBAAa,MAAM,CAAC,CAAC,SAAS,QAAQ,GAAG,OAAO;IAC9C,OAAO,CAAC,MAAM,CAAQ;IAEtB,oFAAoF;IACpF,SAAS,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAA;IAEvC;;;OAGG;IACH,SAAS,CAAC,YAAY,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAA;IAEvC;;;;OAIG;IACH,SAAS,CAAC,cAAc,CAAC,EAAE,OAAO,CAAA;IAElC;;;;OAIG;IACH,SAAS,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,CAAA;IAE/B;;;;OAIG;IACH,SAAS,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAE3C,0EAA0E;IAC1E,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAE3C;IAED,OAAO,CAAC,MAAM;IA2Cd;;;;;;;;OAQG;IACH,SAAS,CAAC,SAAS,CACjB,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,EAC/C,KAAK,EAAE,OAAO,EACd,YAAY,EAAE,aAAa,CAAC,WAAW,CAAC,GACvC,CAAC,CAEH;IAED,uEAAuE;IACvE,OAAO,CAAC,eAAe;IA2CvB,gFAAgF;IAChF,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC,GAAG,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAEtE;IAED;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;IAC3D,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;IAiBjC;;;OAGG;IACH,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAMxC;CACF"}

package/dist/cst/incremental.d.ts

@@ -1,40 +0,0 @@
-import type { Combinator, ParseFail } from '../types.ts';
-import type { Parser } from './grammar.ts';
-import type { NodeLike } from './types.ts';
-/**
- * The result of Parser.parse() — holds the current tree and supports
- * incremental re-parsing via edit().
- *
- *   const doc = css.parse('Stylesheet', src)
- *   doc.tree    // CSTNode (or your N), null if parse failed
- *   doc.errors  // ParseFail[], empty on success
- *   doc.input   // the source string that produced this tree
- *
- *   const doc2 = doc.edit(changeStart, changeEnd, newText)  // "select from→to, type newText"
- */
-export interface ParseDoc<N extends NodeLike = NodeLike> {
-    readonly tree: N | null;
-    readonly errors: ParseFail[];
-    readonly input: string;
-    /** Offset reached by the top-level rule. < input.length means input was left unconsumed. */
-    readonly consumedEnd: number;
-    /**
-     * Incrementally re-parse after a text change.
-     *
-     * Think of it as "select from → to, replace with replacement": both `from`
-     * and `to` are byte offsets in the OLD input. `replacement` is what fills
-     * that range in the new text.
-     *
-     *   doc.edit(3, 7, 'hi')  →  old: "foo [XXXX] bar"   new: "foo hi bar"
-     *                                       ↑    ↑
-     *                                      from  to   (both in old text)
-     *
-     * Maps directly to editor change events:
-     *   VSCode / Monaco:  doc.edit(change.rangeOffset, change.rangeOffset + change.rangeLength, change.text)
-     *   CodeMirror 6:     doc.edit(change.from, change.to, change.insert)
-     *   LSP:              doc.edit(startByte, endByte, change.text)  // after line/col → byte offset
-     */
-    edit(from: number, to: number, replacement: string): ParseDoc<N>;
-}
-export declare function makeParseDoc<N extends NodeLike>(parser: Parser<N>, ruleName: string, input: string, trivia?: Combinator<unknown>, captureTrivia?: boolean, triviaLog?: number[]): ParseDoc<N>;
-//# sourceMappingURL=incremental.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"incremental.d.ts","sourceRoot":"","sources":["../../src/cst/incremental.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAgB,SAAS,EAAE,MAAM,aAAa,CAAA;AACtE,OAAO,KAAK,EAAE,MAAM,EAAY,MAAM,cAAc,CAAA;AACpD,OAAO,KAAK,EAAqB,QAAQ,EAAE,MAAM,YAAY,CAAA;AAM7D;;;;;;;;;;GAUG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC,SAAS,QAAQ,GAAG,QAAQ;IACrD,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAA;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,EAAE,CAAA;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,4FAA4F;IAC5F,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;IAC5B;;;;;;;;;;;;;;;OAeG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;CACjE;AAsHD,wBAAgB,YAAY,CAAC,CAAC,SAAS,QAAQ,EAC7C,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EACjB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,EAC5B,aAAa,CAAC,EAAE,OAAO,EACvB,SAAS,CAAC,EAAE,MAAM,EAAE,GACnB,QAAQ,CAAC,CAAC,CAAC,CAYb"}