stringent 0.0.2 → 0.0.4

package/dist/parse/index.d.ts

@@ -12,11 +12,11 @@
  * 2. Fall back to next level (index 1, higher precedence)
  * 3. Continue until atoms (last element)
  */
-import type { Token } from "@sinclair/parsebox";
-import type { Context } from "../context.js";
-import type { Grammar } from "../grammar/index.js";
-import type { NodeSchema, PatternSchema, PatternSchemaBase, NamedSchema, NumberSchema, StringSchema, IdentSchema, ConstSchema, ExprSchema } from "../schema/index.js";
-import type { NumberNode, StringNode, IdentNode, ConstNode } from "../primitive/index.js";
+import type { Token } from '@sinclair/parsebox';
+import type { Context } from '../context.js';
+import type { Grammar } from '../grammar/index.js';
+import type { NodeSchema, PatternSchema, PatternSchemaBase, NamedSchema, NumberSchema, StringSchema, IdentSchema, ConstSchema, NullSchema, BooleanSchema, UndefinedSchema, UnionResultType } from '../schema/index.js';
+import type { NumberNode, StringNode, IdentNode, ConstNode, NullNode, BooleanNode, UndefinedNode } from '../primitive/index.js';
 /** Base parse error */
 export interface ParseError<TMessage extends string = string> {
     readonly __error: true;
@@ -25,7 +25,7 @@ export interface ParseError<TMessage extends string = string> {
 /** Type mismatch error (expression has wrong type) */
 export type TypeMismatchError<TExpected extends string, TActual extends string> = ParseError<`Type mismatch: expected ${TExpected}, got ${TActual}`>;
 /** No match error (no grammar rule matched) */
-export type NoMatchError = ParseError<"No grammar rule matched">;
+export type NoMatchError = ParseError<'No grammar rule matched'>;
 /** Binary operator node */
 export interface BinaryNode<TName extends string = string, TLeft = unknown, TRight = unknown, TOutputSchema extends string = string> {
     readonly node: TName;
@@ -34,23 +34,27 @@ export interface BinaryNode<TName extends string = string, TLeft = unknown, TRig
     readonly right: TRight;
 }
 type ParseNumberPrimitive<TInput extends string> = Token.TNumber<TInput> extends [infer V extends string, infer R extends string] ? [NumberNode<V>, R] : [];
-type ParseStringPrimitive<TQuotes extends readonly string[], TInput extends string> = Token.TString<[...TQuotes], TInput> extends [
-    infer V extends string,
-    infer R extends string
-] ? [StringNode<V>, R] : [];
-type ParseIdentPrimitive<TInput extends string, TContext extends Context> = Token.TIdent<TInput> extends [
-    infer V extends string,
-    infer R extends string
-] ? V extends keyof TContext["data"] ? [IdentNode<V, TContext["data"][V] & string>, R] : [IdentNode<V, "unknown">, R] : [];
-type ParseConstPrimitive<TValue extends string, TInput extends string> = Token.TConst<TValue, TInput> extends [
-    infer _V extends string,
-    infer R extends string
-] ? [ConstNode<TValue>, R] : [];
+type ParseStringPrimitive<TQuotes extends readonly string[], TInput extends string> = Token.TString<[...TQuotes], TInput> extends [infer V extends string, infer R extends string] ? [StringNode<V>, R] : [];
+type ParseIdentPrimitive<TInput extends string, TContext extends Context> = Token.TIdent<TInput> extends [infer V extends string, infer R extends string] ? V extends keyof TContext['data'] ? [IdentNode<V, TContext['data'][V] & string>, R] : [IdentNode<V, 'unknown'>, R] : [];
+type ParseConstPrimitive<TValue extends string, TInput extends string> = Token.TConst<TValue, TInput> extends [infer _V extends string, infer R extends string] ? [ConstNode<TValue>, R] : [];
+/**
+ * Parse null literal - matches "null" keyword followed by non-identifier char.
+ */
+type ParseNullPrimitive<TInput extends string> = Token.TConst<'null', TInput> extends [string, infer R extends string] ? R extends `${infer C}${string}` ? C extends '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' | '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' | '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' | '_' | '$' ? [] : [NullNode, R] : [NullNode, R] : [];
+/**
+ * Parse boolean literal - matches "true" or "false" keywords followed by non-identifier char.
+ */
+type ParseBooleanPrimitive<TInput extends string> = Token.TConst<'true', TInput> extends [string, infer R extends string] ? R extends `${infer C}${string}` ? C extends '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' | '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' | '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' | '_' | '$' ? ParseBooleanFalse<TInput> : [BooleanNode<'true'>, R] : [BooleanNode<'true'>, R] : ParseBooleanFalse<TInput>;
+type ParseBooleanFalse<TInput extends string> = Token.TConst<'false', TInput> extends [string, infer R extends string] ? R extends `${infer C}${string}` ? C extends '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' | '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' | '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' | '_' | '$' ? [] : [BooleanNode<'false'>, R] : [BooleanNode<'false'>, R] : [];
+/**
+ * Parse undefined literal - matches "undefined" keyword followed by non-identifier char.
+ */
+type ParseUndefinedPrimitive<TInput extends string> = Token.TConst<'undefined', TInput> extends [string, infer R extends string] ? R extends `${infer C}${string}` ? C extends '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' | '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' | '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' | '_' | '$' ? [] : [UndefinedNode, R] : [UndefinedNode, R] : [];
 /**
  * Parse a single pattern element (non-Expr).
  * Works with both plain schemas and NamedSchema (intersection type).
  */
-type ParseElement<TElement extends PatternSchema, TInput extends string, TContext extends Context> = TElement extends NumberSchema ? ParseNumberPrimitive<TInput> : TElement extends StringSchema<infer Q> ? ParseStringPrimitive<Q, TInput> : TElement extends IdentSchema ? ParseIdentPrimitive<TInput, TContext> : TElement extends ConstSchema<infer V> ? ParseConstPrimitive<V, TInput> : never;
+type ParseElement<TElement extends PatternSchema, TInput extends string, TContext extends Context> = TElement extends NumberSchema ? ParseNumberPrimitive<TInput> : TElement extends StringSchema<infer Q> ? ParseStringPrimitive<Q, TInput> : TElement extends IdentSchema ? ParseIdentPrimitive<TInput, TContext> : TElement extends ConstSchema<infer V> ? ParseConstPrimitive<V, TInput> : TElement extends NullSchema ? ParseNullPrimitive<TInput> : TElement extends BooleanSchema ? ParseBooleanPrimitive<TInput> : TElement extends UndefinedSchema ? ParseUndefinedPrimitive<TInput> : never;
 /**
  * Parse a tuple of pattern elements.
  *
@@ -65,6 +69,14 @@ type ParsePatternTuple<TPattern extends readonly PatternSchema[], TInput extends
     ...TAcc,
     R
 ]> : [] : [TAcc, TInput];
+/**
+ * Extract constraint from an ExprSchema by accessing the property directly.
+ * The constraint property is optional, so we exclude undefined from the result.
+ * Returns the constraint string type, or undefined if not constrained.
+ */
+type ExtractConstraint<T> = T extends {
+    constraint: infer C extends string;
+} ? C : undefined;
 /**
  * Parse an expression element based on its role.
  * Works with both plain schemas and NamedSchema (intersection type).
@@ -73,28 +85,83 @@ type ParsePatternTuple<TPattern extends readonly PatternSchema[], TInput extends
  * - "lhs": TNextLevels (avoids left-recursion)
  * - "rhs": TCurrentLevels (maintains precedence, enables right-associativity)
  * - "expr": TFullGrammar (full reset for delimited contexts)
+ *
+ * Uses structural matching on `kind: "expr"` and `role` property to handle
+ * both plain ExprSchema and NamedSchema<ExprSchema, ...> intersection types.
  */
-type ParseElementWithLevel<TElement extends PatternSchema, TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar> = TElement extends ExprSchema<infer C, infer Role> ? Role extends "lhs" ? ParseExprWithConstraint<TNextLevels, TInput, TContext, C, TFullGrammar> : Role extends "rhs" ? ParseExprWithConstraint<TCurrentLevels, TInput, TContext, C, TFullGrammar> : ParseExprWithConstraint<TFullGrammar, TInput, TContext, C, TFullGrammar> : ParseElement<TElement, TInput, TContext>;
+type ParseElementWithLevel<TElement extends PatternSchema, TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar> = TElement extends {
+    kind: 'expr';
+    role: infer Role;
+} ? Role extends 'lhs' ? ParseExprWithConstraint<TNextLevels, TInput, TContext, ExtractConstraint<TElement>, TFullGrammar> : Role extends 'rhs' ? ParseExprWithConstraint<TCurrentLevels, TInput, TContext, ExtractConstraint<TElement>, TFullGrammar> : ParseExprWithConstraint<TFullGrammar, TInput, TContext, ExtractConstraint<TElement>, TFullGrammar> : ParseElement<TElement, TInput, TContext>;
 /**
  * Parse a node's pattern and build the result node.
  */
-type ParseNodePattern<TNode extends NodeSchema, TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar> = ParsePatternTuple<TNode["pattern"], TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> extends [infer Children extends unknown[], infer Rest extends string] ? [BuildNodeResult<TNode, Children>, Rest] : [];
+type ParseNodePattern<TNode extends NodeSchema, TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar> = ParsePatternTuple<TNode['pattern'], TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> extends [infer Children extends unknown[], infer Rest extends string] ? [BuildNodeResult<TNode, Children>, Rest] : [];
+/**
+ * Extract bindings from pattern and children (recursive zip).
+ * Only includes children where the pattern element is a NamedSchema.
+ */
 type ExtractBindings<TPattern extends readonly PatternSchema[], TChildren extends unknown[], TAcc extends {} = {}> = TPattern extends readonly [
     infer First extends PatternSchema,
     ...infer RestPattern extends readonly PatternSchema[]
 ] ? TChildren extends [infer Child, ...infer RestChildren] ? First extends NamedSchema<PatternSchemaBase, infer Name> ? ExtractBindings<RestPattern, RestChildren, {
     [P in keyof TAcc | Name]: P extends Name ? Child : P extends keyof TAcc ? TAcc[P] : never;
 }> : ExtractBindings<RestPattern, RestChildren, TAcc> : TAcc : TAcc;
+/**
+ * Helper: Check if type has exactly one key.
+ */
+type HasExactlyOneKey<T> = keyof T extends infer K ? K extends unknown ? [K] extends [keyof T] ? keyof T extends K ? true : false : false : false : false;
+/**
+ * Helper: Get the single key from a type with exactly one key.
+ */
+type SingleKey<T> = keyof T extends infer K ? K extends keyof T ? keyof T extends K ? K : never : never : never;
+/**
+ * Helper: Extract outputSchema from the single binding.
+ * If there's exactly one binding and it has an outputSchema, return it.
+ * Otherwise return 'unknown'.
+ */
+type SingleBindingOutputSchema<Bindings> = HasExactlyOneKey<Bindings> extends true ? SingleKey<Bindings> extends infer K ? K extends keyof Bindings ? Bindings[K] extends {
+    outputSchema: infer S;
+} ? S : 'unknown' : 'unknown' : 'unknown' : 'unknown';
+/**
+ * Helper: Extract outputSchema from a binding by name.
+ * Returns the outputSchema if the binding exists and has one, otherwise 'unknown'.
+ */
+type BindingOutputSchema<Bindings, TName extends string> = TName extends keyof Bindings ? Bindings[TName] extends {
+    outputSchema: infer S;
+} ? S : 'unknown' : 'unknown';
+/**
+ * Helper: Compute the union outputSchema string from multiple bindings.
+ * Given a tuple of binding names, extracts each binding's outputSchema and
+ * constructs a union string like "type1 | type2".
+ *
+ * @example
+ * // Bindings = { then: { outputSchema: 'boolean' }, else: { outputSchema: 'number' } }
+ * // Names = ['then', 'else']
+ * // Result = 'boolean | number'
+ */
+type ComputeUnionOutputSchema<Bindings, TNames extends readonly string[], TAcc extends string = never> = TNames extends readonly [infer First extends string, ...infer Rest extends readonly string[]] ? BindingOutputSchema<Bindings, First> extends infer S extends string ? ComputeUnionOutputSchema<Bindings, Rest, TAcc | S> : ComputeUnionOutputSchema<Bindings, Rest, TAcc> : [TAcc] extends [never] ? 'unknown' : TAcc;
+/**
+ * Helper: Compute the effective outputSchema.
+ * - If resultType is a UnionResultType, compute the union from the specified bindings
+ * - If resultType is 'unknown' and there's exactly one binding with an outputSchema,
+ *   propagate that binding's outputSchema (matches runtime behavior).
+ * - Otherwise use the static resultType.
+ */
+type ComputeOutputSchema<TResultType, Bindings> = TResultType extends UnionResultType<infer TNames extends readonly string[]> ? ComputeUnionOutputSchema<Bindings, TNames> : TResultType extends 'unknown' ? SingleBindingOutputSchema<Bindings> extends infer S ? S extends 'unknown' ? 'unknown' : S : 'unknown' : TResultType;
 /**
  * Build the result node from parsed children.
  *
  * Uses named bindings from .as() to determine node fields.
  * - Single unnamed child: passthrough (atom behavior)
  * - Otherwise: bindings become node fields
+ *
+ * For nodes with resultType 'unknown' and exactly one binding,
+ * the outputSchema is propagated from the binding (matches runtime).
  */
-type BuildNodeResult<TNode extends NodeSchema, TChildren extends unknown[]> = ExtractBindings<TNode["pattern"], TChildren> extends infer Bindings ? keyof Bindings extends never ? TChildren extends [infer Only] ? Only : never : {
-    readonly node: TNode["name"];
-    readonly outputSchema: TNode["resultType"];
+type BuildNodeResult<TNode extends NodeSchema, TChildren extends unknown[]> = ExtractBindings<TNode['pattern'], TChildren> extends infer Bindings ? keyof Bindings extends never ? TChildren extends [infer Only] ? Only : never : {
+    readonly node: TNode['name'];
+    readonly outputSchema: ComputeOutputSchema<TNode['resultType'], Bindings>;
 } & Bindings : never;
 /**
  * Parse an expression with optional type constraint.
@@ -104,14 +171,17 @@ type ParseExprWithConstraint<TStartLevels extends Grammar, TInput extends string
         outputSchema: string;
     },
     infer Rest extends string
-] ? TConstraint extends string ? Node["outputSchema"] extends TConstraint ? [Node, Rest] : [] : [Node, Rest] : [];
+] ? TConstraint extends string ? Node['outputSchema'] extends TConstraint ? [Node, Rest] : [] : [Node, Rest] : [];
 /**
  * Try parsing each node in a level.
  */
 type ParseNodes<TNodes extends readonly NodeSchema[], TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar> = TNodes extends readonly [
     infer First extends NodeSchema,
     ...infer Rest extends readonly NodeSchema[]
-] ? ParseNodePattern<First, TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> extends [infer R, infer Remaining extends string] ? [R, Remaining] : ParseNodes<Rest, TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> : [];
+] ? ParseNodePattern<First, TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> extends [
+    infer R,
+    infer Remaining extends string
+] ? [R, Remaining] : ParseNodes<Rest, TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> : [];
 /**
  * Parse using grammar levels (flat tuple).
  *
@@ -123,7 +193,10 @@ type ParseNodes<TNodes extends readonly NodeSchema[], TInput extends string, TCo
 type ParseLevels<TLevels extends Grammar, TInput extends string, TContext extends Context, TFullGrammar extends Grammar> = TLevels extends readonly [
     infer CurrentNodes extends readonly NodeSchema[],
     ...infer NextNodes extends Grammar
-] ? ParseNodes<CurrentNodes, TInput, TContext, TLevels, NextNodes, TFullGrammar> extends [infer R, infer Remaining extends string] ? [R, Remaining] : ParseLevels<NextNodes, TInput, TContext, TFullGrammar> : TLevels extends readonly [infer LastNodes extends readonly NodeSchema[]] ? ParseNodes<LastNodes, TInput, TContext, TLevels, TLevels, TFullGrammar> : [];
+] ? ParseNodes<CurrentNodes, TInput, TContext, TLevels, NextNodes, TFullGrammar> extends [
+    infer R,
+    infer Remaining extends string
+] ? [R, Remaining] : ParseLevels<NextNodes, TInput, TContext, TFullGrammar> : TLevels extends readonly [infer LastNodes extends readonly NodeSchema[]] ? ParseNodes<LastNodes, TInput, TContext, TLevels, TLevels, TFullGrammar> : [];
 /**
  * Parse<Grammar, Input, Context>
  *
@@ -135,3 +208,4 @@ type ParseLevels<TLevels extends Grammar, TInput extends string, TContext extend
  */
 export type Parse<TGrammar extends Grammar, TInput extends string, TContext extends Context> = ParseLevels<TGrammar, TInput, TContext, TGrammar>;
 export {};
+//# sourceMappingURL=index.d.ts.map

package/dist/parse/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/parse/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,KAAK,EACV,UAAU,EACV,aAAa,EACb,iBAAiB,EACjB,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,WAAW,EACX,UAAU,EACV,aAAa,EACb,eAAe,EACf,eAAe,EAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,QAAQ,EACR,WAAW,EACX,aAAa,EACd,MAAM,uBAAuB,CAAC;AAM/B,uBAAuB;AACvB,MAAM,WAAW,UAAU,CAAC,QAAQ,SAAS,MAAM,GAAG,MAAM;IAC1D,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;CAC5B;AAED,sDAAsD;AACtD,MAAM,MAAM,iBAAiB,CAC3B,SAAS,SAAS,MAAM,EACxB,OAAO,SAAS,MAAM,IACpB,UAAU,CAAC,2BAA2B,SAAS,SAAS,OAAO,EAAE,CAAC,CAAC;AAEvE,+CAA+C;AAC/C,MAAM,MAAM,YAAY,GAAG,UAAU,CAAC,yBAAyB,CAAC,CAAC;AAMjE,2BAA2B;AAC3B,MAAM,WAAW,UAAU,CACzB,KAAK,SAAS,MAAM,GAAG,MAAM,EAC7B,KAAK,GAAG,OAAO,EACf,MAAM,GAAG,OAAO,EAChB,aAAa,SAAS,MAAM,GAAG,MAAM;IAErC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAMD,KAAK,oBAAoB,CAAC,MAAM,SAAS,MAAM,IAC7C,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GAC1E,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,EAAE,CAAC;AAET,KAAK,oBAAoB,CAAC,OAAO,SAAS,SAAS,MAAM,EAAE,EAAE,MAAM,SAAS,MAAM,IAChF,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACxF,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAClB,EAAE,CAAC;AAET,KAAK,mBAAmB,CAAC,MAAM,SAAS,MAAM,EAAE,QAAQ,SAAS,OAAO,IACtE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACzE,CAAC,SAAS,MAAM,QAAQ,CAAC,MAAM,CAAC,GAC9B,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,GAC/C,CAAC,SAAS,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,GAC9B,EAAE,CAAC;AAET,KAAK,mBAAmB,CAAC,MAAM,SAAS,MAAM,EAAE,MAAM,SAAS,MAAM,IACnE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GAClF,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GACtB,EAAE,CAAC;AAET;;GAEG;AACH,KAAK,kBAAkB,CAAC,MAAM,SAAS,MAAM,IAC3C,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACjE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,MAAM,EAAE,GAC7B,CAAC,SACG,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACL,EAAE,GACF,CAAC,QAAQ,EAAE,CAAC,CAAC,GACf,CAAC,QAAQ,EAAE,CAAC,CAAC,GACf,EAAE,CAAC;AAET;;GAEG;AACH,KAAK,qBAAqB,CAAC,MAAM,SAAS,MAAM,IAC9C,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACjE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,MAAM,EAAE,GAC7B,CAAC,SACG,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACL,iBAAiB,CAAC,MAAM,CAAC,GACzB,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAC1B,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,GAC1B,iBAAiB,CAAC,MAAM,CAAC,CAAC;AAEhC,KAAK,iBAAiB,CAAC,MAAM,SAAS,MAAM,IAC1C,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GAClE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,MAAM,EAAE,GAC7B,CAAC,SACG,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACL,EAAE,GACF,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAC3B,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,GAC3B,EAAE,CAAC;AAET;;GAEG;AACH,KAAK,uBAAuB,CAAC,MAAM,SAAS,MAAM,IAChD,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,MAAM,CAAC,GACtE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,MAAM,EAAE,GAC7B,CAAC,SACG,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACL,EAAE,GACF,CAAC,aAAa,EAAE,CAAC,CAAC,GACpB,CAAC,aAAa,EAAE,CAAC,CAAC,GACpB,EAAE,CAAC;AAMT;;;GAGG;AACH,KAAK,YAAY,CACf,QAAQ,SAAS,aAAa,EAC9B,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,IACtB,QAAQ,SAAS,YAAY,GAC7B,oBAAoB,CAAC,MAAM,CAAC,GAC5B,QAAQ,SAAS,YAAY,CAAC,MAAM,CAAC,CAAC,GACpC,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,GAC/B,QAAQ,SAAS,WAAW,GAC1B,mBAAmB,CAAC,MAAM,EAAE,QAAQ,CAAC,GACrC,QAAQ,SAAS,WAAW,CAAC,MAAM,CAAC,CAAC,GACnC,mBAAmB,CAAC,CAAC,EAAE,MAAM,CAAC,GAC9B,QAAQ,SAAS,UAAU,GACzB,kBAAkB,CAAC,MAAM,CAAC,GAC1B,QAAQ,SAAS,aAAa,GAC5B,qBAAqB,CAAC,MAAM,CAAC,GAC7B,QAAQ,SAAS,eAAe,GAC9B,uBAAuB,CAAC,MAAM,CAAC,GAC/B,KAAK,CAAC;AAEtB;;;;;;GAMG;AACH,KAAK,iBAAiB,CACpB,QAAQ,SAAS,SAAS,aAAa,EAAE,EACzC,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,cAAc,SAAS,OAAO,EAC9B,WAAW,SAAS,OAAO,EAC3B,YAAY,SAAS,OAAO,EAC5B,IAAI,SAAS,OAAO,EAAE,GAAG,EAAE,IACzB,QAAQ,SAAS,SAAS;IAC5B,MAAM,KAAK,SAAS,aAAa;IACjC,GAAG,MAAM,IAAI,SAAS,SAAS,aAAa,EAAE;CAC/C,GACG,qBAAqB,CACnB,KAAK,EACL,MAAM,EACN,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,CACb,SAAS,CAAC,MAAM,CAAC,EAAE,MAAM,SAAS,SAAS,MAAM,CAAC,GACjD,iBAAiB,CACf,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,EACZ;IAAC,GAAG,IAAI;IAAE,CAAC;CAAC,CACb,GACD,EAAE,GACJ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAEnB;;;;GAIG;AACH,KAAK,iBAAiB,CAAC,CAAC,IAAI,CAAC,SAAS;IAAE,UAAU,EAAE,MAAM,CAAC,SAAS,MAAM,CAAA;CAAE,GAAG,CAAC,GAAG,SAAS,CAAC;AAE7F;;;;;;;;;;;GAWG;AACH,KAAK,qBAAqB,CACxB,QAAQ,SAAS,aAAa,EAC9B,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,cAAc,SAAS,OAAO,EAC9B,WAAW,SAAS,OAAO,EAC3B,YAAY,SAAS,OAAO,IAC1B,QAAQ,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,IAAI,CAAA;CAAE,GACnD,IAAI,SAAS,KAAK,GAChB,uBAAuB,CACrB,WAAW,EACX,MAAM,EACN,QAAQ,EACR,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,CACb,GACD,IAAI,SAAS,KAAK,GAChB,uBAAuB,CACrB,cAAc,EACd,MAAM,EACN,QAAQ,EACR,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,CACb,GACD,uBAAuB,CACrB,YAAY,EACZ,MAAM,EACN,QAAQ,EACR,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,CACb,GACL,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;AAM7C;;GAEG;AACH,KAAK,gBAAgB,CACnB,KAAK,SAAS,UAAU,EACxB,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,cAAc,SAAS,OAAO,EAC9B,WAAW,SAAS,OAAO,EAC3B,YAAY,SAAS,OAAO,IAE5B,iBAAiB,CACf,KAAK,CAAC,SAAS,CAAC,EAChB,MAAM,EACN,QAAQ,EACR,cAAc,EACd,WAAW,EACX,YAAY,CACb,SAAS,CAAC,MAAM,QAAQ,SAAS,OAAO,EAAE,EAAE,MAAM,IAAI,SAAS,MAAM,CAAC,GACnE,CAAC,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,IAAI,CAAC,GACxC,EAAE,CAAC;AAET;;;GAGG;AACH,KAAK,eAAe,CAClB,QAAQ,SAAS,SAAS,aAAa,EAAE,EACzC,SAAS,SAAS,OAAO,EAAE,EAC3B,IAAI,SAAS,EAAE,GAAG,EAAE,IAClB,QAAQ,SAAS,SAAS;IAC5B,MAAM,KAAK,SAAS,aAAa;IACjC,GAAG,MAAM,WAAW,SAAS,SAAS,aAAa,EAAE;CACtD,GACG,SAAS,SAAS,CAAC,MAAM,KAAK,EAAE,GAAG,MAAM,YAAY,CAAC,GACpD,KAAK,SAAS,WAAW,CAAC,iBAAiB,EAAE,MAAM,IAAI,CAAC,GACtD,eAAe,CACb,WAAW,EACX,YAAY,EACZ;KACG,CAAC,IAAI,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,IAAI,GACpC,KAAK,GACL,CAAC,SAAS,MAAM,IAAI,GAClB,IAAI,CAAC,CAAC,CAAC,GACP,KAAK;CACZ,CACF,GACD,eAAe,CAAC,WAAW,EAAE,YAAY,EAAE,IAAI,CAAC,GAClD,IAAI,GACN,IAAI,CAAC;AAET;;GAEG;AACH,KAAK,gBAAgB,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,MAAM,CAAC,GAC9C,CAAC,SAAS,OAAO,GACf,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,GACnB,MAAM,CAAC,SAAS,CAAC,GACf,IAAI,GACJ,KAAK,GACP,KAAK,GACP,KAAK,GACP,KAAK,CAAC;AAEV;;GAEG;AACH,KAAK,SAAS,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,MAAM,CAAC,GACvC,CAAC,SAAS,MAAM,CAAC,GACf,MAAM,CAAC,SAAS,CAAC,GACf,CAAC,GACD,KAAK,GACP,KAAK,GACP,KAAK,CAAC;AAEV;;;;GAIG;AACH,KAAK,yBAAyB,CAAC,QAAQ,IACrC,gBAAgB,CAAC,QAAQ,CAAC,SAAS,IAAI,GACnC,SAAS,CAAC,QAAQ,CAAC,SAAS,MAAM,CAAC,GACjC,CAAC,SAAS,MAAM,QAAQ,GACtB,QAAQ,CAAC,CAAC,CAAC,SAAS;IAAE,YAAY,EAAE,MAAM,CAAC,CAAA;CAAE,GAC3C,CAAC,GACD,SAAS,GACX,SAAS,GACX,SAAS,GACX,SAAS,CAAC;AAEhB;;;GAGG;AACH,KAAK,mBAAmB,CAAC,QAAQ,EAAE,KAAK,SAAS,MAAM,IAAI,KAAK,SAAS,MAAM,QAAQ,GACnF,QAAQ,CAAC,KAAK,CAAC,SAAS;IAAE,YAAY,EAAE,MAAM,CAAC,CAAA;CAAE,GAC/C,CAAC,GACD,SAAS,GACX,SAAS,CAAC;AAEd;;;;;;;;;GASG;AACH,KAAK,wBAAwB,CAC3B,QAAQ,EACR,MAAM,SAAS,SAAS,MAAM,EAAE,EAChC,IAAI,SAAS,MAAM,GAAG,KAAK,IACzB,MAAM,SAAS,SAAS,CAAC,MAAM,KAAK,SAAS,MAAM,EAAE,GAAG,MAAM,IAAI,SAAS,SAAS,MAAM,EAAE,CAAC,GAC7F,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,MAAM,CAAC,SAAS,MAAM,GACjE,wBAAwB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAClD,wBAAwB,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,GAChD,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GACpB,SAAS,GACT,IAAI,CAAC;AAEX;;;;;;GAMG;AAEH,KAAK,mBAAmB,CAAC,WAAW,EAAE,QAAQ,IAC5C,WAAW,SAAS,eAAe,CAAC,MAAM,MAAM,SAAS,SAAS,MAAM,EAAE,CAAC,GACvE,wBAAwB,CAAC,QAAQ,EAAE,MAAM,CAAC,GAC1C,WAAW,SAAS,SAAS,GAC3B,yBAAyB,CAAC,QAAQ,CAAC,SAAS,MAAM,CAAC,GACjD,CAAC,SAAS,SAAS,GACjB,SAAS,GACT,CAAC,GACH,SAAS,GACX,WAAW,CAAC;AAEpB;;;;;;;;;GASG;AACH,KAAK,eAAe,CAAC,KAAK,SAAS,UAAU,EAAE,SAAS,SAAS,OAAO,EAAE,IACxE,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC,SAAS,MAAM,QAAQ,GAC/D,MAAM,QAAQ,SAAS,KAAK,GAC1B,SAAS,SAAS,CAAC,MAAM,IAAI,CAAC,GAC5B,IAAI,GACJ,KAAK,GACP;IACE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,mBAAmB,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,QAAQ,CAAC,CAAC;CAC3E,GAAG,QAAQ,GACd,KAAK,CAAC;AAMZ;;GAEG;AACH,KAAK,uBAAuB,CAC1B,YAAY,SAAS,OAAO,EAC5B,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,WAAW,SAAS,MAAM,GAAG,SAAS,EACtC,YAAY,SAAS,OAAO,IAE5B,WAAW,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,CAAC,SAAS;IAChE,MAAM,IAAI,SAAS;QAAE,YAAY,EAAE,MAAM,CAAA;KAAE;IAC3C,MAAM,IAAI,SAAS,MAAM;CAC1B,GACG,WAAW,SAAS,MAAM,GACxB,IAAI,CAAC,cAAc,CAAC,SAAS,WAAW,GACtC,CAAC,IAAI,EAAE,IAAI,CAAC,GACZ,EAAE,GACJ,CAAC,IAAI,EAAE,IAAI,CAAC,GACd,EAAE,CAAC;AAMT;;GAEG;AACH,KAAK,UAAU,CACb,MAAM,SAAS,SAAS,UAAU,EAAE,EACpC,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,cAAc,SAAS,OAAO,EAC9B,WAAW,SAAS,OAAO,EAC3B,YAAY,SAAS,OAAO,IAC1B,MAAM,SAAS,SAAS;IAC1B,MAAM,KAAK,SAAS,UAAU;IAC9B,GAAG,MAAM,IAAI,SAAS,SAAS,UAAU,EAAE;CAC5C,GACG,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,CAAC,SAAS;IAC3F,MAAM,CAAC;IACP,MAAM,SAAS,SAAS,MAAM;CAC/B,GACC,CAAC,CAAC,EAAE,SAAS,CAAC,GACd,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,CAAC,GAC/E,EAAE,CAAC;AAEP;;;;;;;GAOG;AACH,KAAK,WAAW,CACd,OAAO,SAAS,OAAO,EACvB,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,EACxB,YAAY,SAAS,OAAO,IAC1B,OAAO,SAAS,SAAS;IAC3B,MAAM,YAAY,SAAS,SAAS,UAAU,EAAE;IAChD,GAAG,MAAM,SAAS,SAAS,OAAO;CACnC,GAEG,UAAU,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,CAAC,SAAS;IACnF,MAAM,CAAC;IACP,MAAM,SAAS,SAAS,MAAM;CAC/B,GACC,CAAC,CAAC,EAAE,SAAS,CAAC,GACd,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,CAAC,GACxD,OAAO,SAAS,SAAS,CAAC,MAAM,SAAS,SAAS,SAAS,UAAU,EAAE,CAAC,GAEtE,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,GACvE,EAAE,CAAC;AAMT;;;;;;;;GAQG;AACH,MAAM,MAAM,KAAK,CACf,QAAQ,SAAS,OAAO,EACxB,MAAM,SAAS,MAAM,EACrB,QAAQ,SAAS,OAAO,IACtB,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC"}

package/dist/parse/index.js

@@ -13,3 +13,4 @@
  * 3. Continue until atoms (last element)
  */
 export {};
+//# sourceMappingURL=index.js.map

package/dist/parse/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/parse/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG"}

package/dist/performance.bench.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Performance Benchmarks for Stringent Parser
+ *
+ * This file contains benchmarks to measure and document the performance
+ * characteristics of the runtime parser.
+ *
+ * Run with: pnpm bench
+ */
+export {};
+//# sourceMappingURL=performance.bench.d.ts.map

package/dist/performance.bench.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"performance.bench.d.ts","sourceRoot":"","sources":["../src/performance.bench.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/performance.bench.js

@@ -0,0 +1,379 @@
+/**
+ * Performance Benchmarks for Stringent Parser
+ *
+ * This file contains benchmarks to measure and document the performance
+ * characteristics of the runtime parser.
+ *
+ * Run with: pnpm bench
+ */
+import { bench, describe } from 'vitest';
+import { createParser, defineNode, constVal, lhs, rhs, expr } from './index.js';
+// =============================================================================
+// Test Grammar Setup
+// =============================================================================
+// Basic arithmetic grammar
+const add = defineNode({
+    name: 'add',
+    pattern: [lhs('number').as('left'), constVal('+'), rhs('number').as('right')],
+    precedence: 1,
+    resultType: 'number',
+});
+const mul = defineNode({
+    name: 'mul',
+    pattern: [lhs('number').as('left'), constVal('*'), rhs('number').as('right')],
+    precedence: 2,
+    resultType: 'number',
+});
+const pow = defineNode({
+    name: 'pow',
+    pattern: [lhs('number').as('left'), constVal('**'), rhs('number').as('right')],
+    precedence: 3,
+    resultType: 'number',
+});
+const sub = defineNode({
+    name: 'sub',
+    pattern: [lhs('number').as('left'), constVal('-'), rhs('number').as('right')],
+    precedence: 1,
+    resultType: 'number',
+});
+const div = defineNode({
+    name: 'div',
+    pattern: [lhs('number').as('left'), constVal('/'), rhs('number').as('right')],
+    precedence: 2,
+    resultType: 'number',
+});
+// Comparison operators
+const eq = defineNode({
+    name: 'eq',
+    pattern: [lhs().as('left'), constVal('=='), rhs().as('right')],
+    precedence: 0,
+    resultType: 'boolean',
+});
+// String operations
+const concat = defineNode({
+    name: 'concat',
+    pattern: [lhs('string').as('left'), constVal('++'), rhs('string').as('right')],
+    precedence: 1,
+    resultType: 'string',
+});
+// Ternary
+const ternary = defineNode({
+    name: 'ternary',
+    pattern: [
+        lhs('boolean').as('condition'),
+        constVal('?'),
+        expr().as('then'),
+        constVal(':'),
+        rhs().as('else'),
+    ],
+    precedence: 0,
+    resultType: 'unknown',
+});
+// Create parsers
+const arithmeticParser = createParser([add, sub, mul, div, pow]);
+const fullParser = createParser([add, sub, mul, div, pow, eq, concat, ternary]);
+// =============================================================================
+// Test Data Generation
+// =============================================================================
+/** Generate a simple number literal */
+function simpleNumber() {
+    return String(Math.floor(Math.random() * 1000));
+}
+/** Generate a chained addition expression */
+function chainedAddition(count) {
+    return Array.from({ length: count }, () => simpleNumber()).join(' + ');
+}
+/** Generate a chained multiplication expression */
+function chainedMultiplication(count) {
+    return Array.from({ length: count }, () => simpleNumber()).join(' * ');
+}
+/** Generate a mixed precedence expression */
+function mixedPrecedence(count) {
+    const ops = ['+', '-', '*', '/', '**'];
+    let expr = simpleNumber();
+    for (let i = 0; i < count - 1; i++) {
+        const op = ops[i % ops.length];
+        expr += ` ${op} ${simpleNumber()}`;
+    }
+    return expr;
+}
+/** Generate nested parentheses */
+function nestedParens(depth) {
+    let expr = simpleNumber();
+    for (let i = 0; i < depth; i++) {
+        expr = `(${expr})`;
+    }
+    return expr;
+}
+/** Generate expression with nested parentheses and operations */
+function nestedParensWithOps(depth) {
+    let expr = simpleNumber();
+    for (let i = 0; i < depth; i++) {
+        expr = `(${expr} + ${simpleNumber()})`;
+    }
+    return expr;
+}
+// =============================================================================
+// Benchmarks: Simple Literals
+// =============================================================================
+describe('Simple Literals', () => {
+    bench('number literal', () => {
+        arithmeticParser.parse('42', {});
+    });
+    bench('decimal number', () => {
+        arithmeticParser.parse('3.14159', {});
+    });
+    bench('large number', () => {
+        arithmeticParser.parse('9007199254740991', {});
+    });
+    bench('string literal (double quotes)', () => {
+        fullParser.parse('"hello world"', {});
+    });
+    bench('string literal (single quotes)', () => {
+        fullParser.parse("'hello world'", {});
+    });
+    bench('identifier', () => {
+        arithmeticParser.parse('variableName', { variableName: 'number' });
+    });
+});
+// =============================================================================
+// Benchmarks: Binary Operations
+// =============================================================================
+describe('Binary Operations', () => {
+    bench('simple addition: 1 + 2', () => {
+        arithmeticParser.parse('1 + 2', {});
+    });
+    bench('simple multiplication: 3 * 4', () => {
+        arithmeticParser.parse('3 * 4', {});
+    });
+    bench('simple exponentiation: 2 ** 8', () => {
+        arithmeticParser.parse('2 ** 8', {});
+    });
+    bench('mixed precedence: 1 + 2 * 3', () => {
+        arithmeticParser.parse('1 + 2 * 3', {});
+    });
+    bench('mixed precedence: 2 * 3 + 4 * 5', () => {
+        arithmeticParser.parse('2 * 3 + 4 * 5', {});
+    });
+    bench('three precedence levels: 1 + 2 * 3 ** 4', () => {
+        arithmeticParser.parse('1 + 2 * 3 ** 4', {});
+    });
+});
+// =============================================================================
+// Benchmarks: Chained Operations
+// =============================================================================
+describe('Chained Operations', () => {
+    const chain5 = chainedAddition(5);
+    const chain10 = chainedAddition(10);
+    const chain20 = chainedAddition(20);
+    const chain50 = chainedAddition(50);
+    bench('5-element addition chain', () => {
+        arithmeticParser.parse(chain5, {});
+    });
+    bench('10-element addition chain', () => {
+        arithmeticParser.parse(chain10, {});
+    });
+    bench('20-element addition chain', () => {
+        arithmeticParser.parse(chain20, {});
+    });
+    bench('50-element addition chain', () => {
+        arithmeticParser.parse(chain50, {});
+    });
+    const mulChain10 = chainedMultiplication(10);
+    const mulChain20 = chainedMultiplication(20);
+    bench('10-element multiplication chain', () => {
+        arithmeticParser.parse(mulChain10, {});
+    });
+    bench('20-element multiplication chain', () => {
+        arithmeticParser.parse(mulChain20, {});
+    });
+    const mixed10 = mixedPrecedence(10);
+    const mixed20 = mixedPrecedence(20);
+    bench('10-element mixed precedence', () => {
+        arithmeticParser.parse(mixed10, {});
+    });
+    bench('20-element mixed precedence', () => {
+        arithmeticParser.parse(mixed20, {});
+    });
+});
+// =============================================================================
+// Benchmarks: Nested Parentheses
+// =============================================================================
+describe('Nested Parentheses', () => {
+    const parens5 = nestedParens(5);
+    const parens10 = nestedParens(10);
+    const parens20 = nestedParens(20);
+    bench('5 levels of nesting', () => {
+        arithmeticParser.parse(parens5, {});
+    });
+    bench('10 levels of nesting', () => {
+        arithmeticParser.parse(parens10, {});
+    });
+    bench('20 levels of nesting', () => {
+        arithmeticParser.parse(parens20, {});
+    });
+    const parensOps5 = nestedParensWithOps(5);
+    const parensOps10 = nestedParensWithOps(10);
+    const parensOps20 = nestedParensWithOps(20);
+    bench('5 levels with operations', () => {
+        arithmeticParser.parse(parensOps5, {});
+    });
+    bench('10 levels with operations', () => {
+        arithmeticParser.parse(parensOps10, {});
+    });
+    bench('20 levels with operations', () => {
+        arithmeticParser.parse(parensOps20, {});
+    });
+});
+// =============================================================================
+// Benchmarks: Complex Expressions
+// =============================================================================
+describe('Complex Expressions', () => {
+    bench('precedence override: (1 + 2) * 3', () => {
+        arithmeticParser.parse('(1 + 2) * 3', {});
+    });
+    bench('nested groups: ((1 + 2) * 3) + 4', () => {
+        arithmeticParser.parse('((1 + 2) * 3) + 4', {});
+    });
+    bench('complex: (1 + 2) * (3 + 4)', () => {
+        arithmeticParser.parse('(1 + 2) * (3 + 4)', {});
+    });
+    bench('very complex: ((1 + 2) * 3 + 4) ** 2 / (5 - 6)', () => {
+        arithmeticParser.parse('((1 + 2) * 3 + 4) ** 2 / (5 - 6)', {});
+    });
+});
+// =============================================================================
+// Benchmarks: Parser Creation
+// =============================================================================
+describe('Parser Creation', () => {
+    bench('create simple parser (1 node)', () => {
+        createParser([add]);
+    });
+    bench('create medium parser (5 nodes)', () => {
+        createParser([add, sub, mul, div, pow]);
+    });
+    bench('create full parser (8 nodes)', () => {
+        createParser([add, sub, mul, div, pow, eq, concat, ternary]);
+    });
+});
+// =============================================================================
+// Benchmarks: Grammar Complexity
+// =============================================================================
+describe('Grammar Complexity', () => {
+    // Create parsers with varying numbers of operators at the same precedence
+    const samePrec2 = createParser([
+        defineNode({
+            name: 'op1',
+            pattern: [lhs('number').as('l'), constVal('|1|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+        defineNode({
+            name: 'op2',
+            pattern: [lhs('number').as('l'), constVal('|2|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+    ]);
+    const samePrec5 = createParser([
+        defineNode({
+            name: 'op1',
+            pattern: [lhs('number').as('l'), constVal('|1|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+        defineNode({
+            name: 'op2',
+            pattern: [lhs('number').as('l'), constVal('|2|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+        defineNode({
+            name: 'op3',
+            pattern: [lhs('number').as('l'), constVal('|3|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+        defineNode({
+            name: 'op4',
+            pattern: [lhs('number').as('l'), constVal('|4|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+        defineNode({
+            name: 'op5',
+            pattern: [lhs('number').as('l'), constVal('|5|'), rhs('number').as('r')],
+            precedence: 1,
+            resultType: 'number',
+        }),
+    ]);
+    bench('2 ops at same precedence - first op', () => {
+        samePrec2.parse('1 |1| 2', {});
+    });
+    bench('2 ops at same precedence - second op', () => {
+        samePrec2.parse('1 |2| 2', {});
+    });
+    bench('5 ops at same precedence - first op', () => {
+        samePrec5.parse('1 |1| 2', {});
+    });
+    bench('5 ops at same precedence - fifth op', () => {
+        samePrec5.parse('1 |5| 2', {});
+    });
+    bench('5 ops at same precedence - number literal only', () => {
+        samePrec5.parse('42', {});
+    });
+});
+// =============================================================================
+// Benchmarks: String Parsing
+// =============================================================================
+describe('String Parsing', () => {
+    const stringParser = createParser([concat]);
+    const shortStr = '"hello"';
+    const mediumStr = '"' + 'a'.repeat(100) + '"';
+    const longStr = '"' + 'a'.repeat(1000) + '"';
+    bench('short string (5 chars)', () => {
+        stringParser.parse(shortStr, {});
+    });
+    bench('medium string (100 chars)', () => {
+        stringParser.parse(mediumStr, {});
+    });
+    bench('long string (1000 chars)', () => {
+        stringParser.parse(longStr, {});
+    });
+    const escapedStr = '"hello\\nworld\\t\\u0041"';
+    bench('string with escapes', () => {
+        stringParser.parse(escapedStr, {});
+    });
+    bench('string concatenation', () => {
+        stringParser.parse('"hello" ++ "world"', {});
+    });
+});
+// =============================================================================
+// Benchmarks: Context Resolution
+// =============================================================================
+describe('Context Resolution', () => {
+    const smallContext = { x: 'number' };
+    const mediumContext = {
+        a: 'number',
+        b: 'number',
+        c: 'number',
+        d: 'number',
+        e: 'number',
+        x: 'number',
+    };
+    const largeContext = Object.fromEntries(Array.from({ length: 100 }, (_, i) => [`var${i}`, 'number']));
+    largeContext['x'] = 'number';
+    bench('small context - identifier lookup', () => {
+        arithmeticParser.parse('x', smallContext);
+    });
+    bench('medium context - identifier lookup', () => {
+        arithmeticParser.parse('x', mediumContext);
+    });
+    bench('large context - identifier lookup', () => {
+        arithmeticParser.parse('x', largeContext);
+    });
+    bench('context - expression with identifiers', () => {
+        arithmeticParser.parse('x + x * x', smallContext);
+    });
+});
+//# sourceMappingURL=performance.bench.js.map