stringent 0.0.1 → 0.0.4

package/dist/errors.js

@@ -0,0 +1,186 @@
+/**
+ * Error Types and Utilities
+ *
+ * Provides rich error information for parse failures including:
+ * - Position tracking (offset, line, column)
+ * - Source snippets showing where errors occurred
+ * - Descriptive messages for different error types
+ */
+/**
+ * Calculate position information from input and current offset.
+ *
+ * @param input - The original input string
+ * @param offset - Character offset into the input
+ * @returns Position with line and column numbers
+ */
+export function calculatePosition(input, offset) {
+    const textBeforeOffset = input.slice(0, offset);
+    const lines = textBeforeOffset.split('\n');
+    const line = lines.length;
+    const column = lines[lines.length - 1].length + 1;
+    return { offset, line, column };
+}
+// =============================================================================
+// Error Creation Utilities
+// =============================================================================
+/**
+ * Create a snippet of the input around the error position.
+ *
+ * @param input - The full input string
+ * @param offset - Character offset where error occurred
+ * @param contextChars - Number of characters to show around the error
+ * @returns A snippet with error position marker
+ */
+export function createSnippet(input, offset, contextChars = 20) {
+    if (input.length === 0)
+        return '(empty input)';
+    const start = Math.max(0, offset - contextChars);
+    const end = Math.min(input.length, offset + contextChars);
+    let snippet = '';
+    // Add ellipsis if we're not at the start
+    if (start > 0)
+        snippet += '...';
+    // Add the snippet content
+    snippet += input.slice(start, offset);
+    snippet += '→'; // Position marker
+    snippet += input.slice(offset, end);
+    // Add ellipsis if we're not at the end
+    if (end < input.length)
+        snippet += '...';
+    // Escape control characters for display
+    snippet = snippet.replace(/\n/g, '\\n').replace(/\t/g, '\\t').replace(/\r/g, '\\r');
+    return snippet;
+}
+/**
+ * Create a RichParseError.
+ */
+export function createParseError(kind, message, input, offset, context) {
+    return {
+        __error: true,
+        kind,
+        message,
+        position: calculatePosition(input, offset),
+        snippet: createSnippet(input, offset),
+        input,
+        context,
+    };
+}
+/**
+ * Create a "no match" error.
+ */
+export function noMatchError(input, offset) {
+    const position = calculatePosition(input, offset);
+    const remaining = input.slice(offset).trim();
+    const preview = remaining.slice(0, 20) + (remaining.length > 20 ? '...' : '');
+    let message;
+    if (input.trim().length === 0) {
+        message = 'Empty or whitespace-only input';
+    }
+    else if (offset >= input.length) {
+        message = 'Unexpected end of input';
+    }
+    else {
+        message = `No grammar rule matched at position ${position.line}:${position.column}: "${preview}"`;
+    }
+    return createParseError('no_match', message, input, offset);
+}
+/**
+ * Create a "type mismatch" error.
+ */
+export function typeMismatchError(input, offset, expected, actual, parsing) {
+    const position = calculatePosition(input, offset);
+    let message = `Type mismatch at ${position.line}:${position.column}: expected '${expected}', got '${actual}'`;
+    if (parsing) {
+        message += ` while parsing ${parsing}`;
+    }
+    return createParseError('type_mismatch', message, input, offset, {
+        expected,
+        actual,
+        parsing,
+    });
+}
+/**
+ * Create an "unterminated string" error.
+ */
+export function unterminatedStringError(input, offset, quote) {
+    const position = calculatePosition(input, offset);
+    const message = `Unterminated string literal at ${position.line}:${position.column}: missing closing ${quote}`;
+    return createParseError('unterminated_string', message, input, offset, {
+        parsing: 'string literal',
+    });
+}
+/**
+ * Create an "unclosed parenthesis" error.
+ */
+export function unclosedParenError(input, offset) {
+    const position = calculatePosition(input, offset);
+    const message = `Unclosed parenthesis at ${position.line}:${position.column}: missing ')'`;
+    return createParseError('unclosed_paren', message, input, offset, {
+        parsing: 'parenthesized expression',
+    });
+}
+/**
+ * Create an "unexpected token" error.
+ */
+export function unexpectedTokenError(input, offset, found, expected) {
+    const position = calculatePosition(input, offset);
+    let message = `Unexpected token at ${position.line}:${position.column}: found '${found}'`;
+    if (expected) {
+        message += `, expected ${expected}`;
+    }
+    return createParseError('unexpected_token', message, input, offset, {
+        expected,
+        parsing: 'expression',
+    });
+}
+/**
+ * Create an "empty input" error.
+ */
+export function emptyInputError(input) {
+    return createParseError('empty_input', 'Cannot parse empty or whitespace-only input', input, 0);
+}
+/**
+ * Check if a result includes errors.
+ */
+export function hasErrors(result) {
+    return result.length === 3 && result[2].length > 0;
+}
+/**
+ * Get errors from a result, or empty array if none.
+ */
+export function getErrors(result) {
+    if (result.length === 3) {
+        return result[2];
+    }
+    return [];
+}
+// =============================================================================
+// Error Formatting
+// =============================================================================
+/**
+ * Format an error for display with source context.
+ */
+export function formatError(error) {
+    const { position, message, snippet } = error;
+    const lines = [];
+    lines.push(`Error at line ${position.line}, column ${position.column}:`);
+    lines.push(`  ${message}`);
+    lines.push('');
+    lines.push(`  ${snippet}`);
+    if (error.context) {
+        const ctx = error.context;
+        if (ctx.expected && ctx.actual) {
+            lines.push('');
+            lines.push(`  Expected: ${ctx.expected}`);
+            lines.push(`  Actual:   ${ctx.actual}`);
+        }
+    }
+    return lines.join('\n');
+}
+/**
+ * Format multiple errors for display.
+ */
+export function formatErrors(errors) {
+    return errors.map(formatError).join('\n\n');
+}
+//# sourceMappingURL=errors.js.map

package/dist/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAkBH;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,MAAc;IAC7D,MAAM,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAChD,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;IAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAElD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;AAClC,CAAC;AA+CD,gFAAgF;AAChF,2BAA2B;AAC3B,gFAAgF;AAEhF;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,MAAc,EAAE,eAAuB,EAAE;IACpF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,eAAe,CAAC;IAE/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC;IAE1D,IAAI,OAAO,GAAG,EAAE,CAAC;IAEjB,yCAAyC;IACzC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC;IAEhC,0BAA0B;IAC1B,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACtC,OAAO,IAAI,GAAG,CAAC,CAAC,kBAAkB;IAClC,OAAO,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAEpC,uCAAuC;IACvC,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM;QAAE,OAAO,IAAI,KAAK,CAAC;IAEzC,wCAAwC;IACxC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAEpF,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAoB,EACpB,OAAe,EACf,KAAa,EACb,MAAc,EACd,OAAsB;IAEtB,OAAO;QACL,OAAO,EAAE,IAAI;QACb,IAAI;QACJ,OAAO;QACP,QAAQ,EAAE,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC;QAC1C,OAAO,EAAE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC;QACrC,KAAK;QACL,OAAO;KACR,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,MAAc;IACxD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE9E,IAAI,OAAe,CAAC;IACpB,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,GAAG,gCAAgC,CAAC;IAC7C,CAAC;SAAM,IAAI,MAAM,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAClC,OAAO,GAAG,yBAAyB,CAAC;IACtC,CAAC;SAAM,CAAC;QACN,OAAO,GAAG,uCAAuC,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,MAAM,OAAO,GAAG,CAAC;IACpG,CAAC;IAED,OAAO,gBAAgB,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,MAAc,EACd,QAAgB,EAChB,MAAc,EACd,OAAgB;IAEhB,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,oBAAoB,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,eAAe,QAAQ,WAAW,MAAM,GAAG,CAAC;IAC9G,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,IAAI,kBAAkB,OAAO,EAAE,CAAC;IACzC,CAAC;IAED,OAAO,gBAAgB,CAAC,eAAe,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE;QAC/D,QAAQ;QACR,MAAM;QACN,OAAO;KACR,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAa,EACb,MAAc,EACd,KAAa;IAEb,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,kCAAkC,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,qBAAqB,KAAK,EAAE,CAAC;IAE/G,OAAO,gBAAgB,CAAC,qBAAqB,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE;QACrE,OAAO,EAAE,gBAAgB;KAC1B,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAa,EAAE,MAAc;IAC9D,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,2BAA2B,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,eAAe,CAAC;IAE3F,OAAO,gBAAgB,CAAC,gBAAgB,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE;QAChE,OAAO,EAAE,0BAA0B;KACpC,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAa,EACb,MAAc,EACd,KAAa,EACb,QAAiB;IAEjB,MAAM,QAAQ,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,uBAAuB,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,MAAM,YAAY,KAAK,GAAG,CAAC;IAC1F,IAAI,QAAQ,EAAE,CAAC;QACb,OAAO,IAAI,cAAc,QAAQ,EAAE,CAAC;IACtC,CAAC;IAED,OAAO,gBAAgB,CAAC,kBAAkB,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE;QAClE,QAAQ;QACR,OAAO,EAAE,YAAY;KACtB,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,OAAO,gBAAgB,CAAC,aAAa,EAAE,6CAA6C,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAClG,CAAC;AAmBD;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,MAA6B;IACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,MAA6B;IACrD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAqB;IAC/C,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAC7C,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,IAAI,YAAY,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACzE,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;IAE3B,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC;QAC1B,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,eAAe,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAwB;IACnD,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC9C,CAAC"}

package/dist/grammar/index.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Grammar Type Computation
+ *
+ * Computes a grammar TYPE from operator schemas. The grammar is a flat tuple
+ * of precedence levels, sorted from lowest to highest precedence, with
+ * built-in atoms as the final element.
+ *
+ * Example:
+ *   [[AddOps], [MulOps], [BuiltInAtoms]]
+ *   // level 0 (lowest prec) → level 1 → atoms (last)
+ */
+import type { Pipe, Numbers, Objects, Tuples, Fn, Unions, Call } from 'hotscript';
+import type { NodeSchema } from '../schema/index.js';
+import type { BUILT_IN_ATOMS } from '../runtime/parser.js';
+/**
+ * A grammar is a tuple of levels, where each level is an array of node schemas.
+ * Sorted by precedence (lowest first), built-in atoms last.
+ */
+export type Grammar = readonly (readonly NodeSchema[])[];
+/** Built-in atoms type - derived from the runtime definitions */
+export type BuiltInAtoms = typeof BUILT_IN_ATOMS;
+/**
+ * Compare precedence entries: numbers sort ascending.
+ * Entry format: [precedence, nodes[]]
+ */
+interface SortByPrecedence extends Fn {
+    return: Call<Numbers.LessThanOrEqual, this['arg0'][0], this['arg1'][0]>;
+}
+/**
+ * Compute the grammar tuple from operator schemas.
+ *
+ * 1. Group operators by precedence
+ * 2. Convert to entries and sort (numbers ascending)
+ * 3. Extract just the node arrays
+ * 4. Append built-in atoms as the last level
+ */
+type ComputeOperatorLevels<TNodes extends readonly NodeSchema[]> = Pipe<[
+    ...TNodes
+], [
+    Tuples.GroupBy<Objects.Get<'precedence'>>,
+    Objects.Entries,
+    Unions.ToTuple,
+    Tuples.Sort<SortByPrecedence>,
+    Tuples.Map<Tuples.At<1>>
+]>;
+export type ComputeGrammar<TNodes extends readonly NodeSchema[]> = ComputeOperatorLevels<TNodes> extends infer Levels extends readonly (readonly NodeSchema[])[] ? readonly [...Levels, BuiltInAtoms] : never;
+export {};
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/grammar/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAClF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAM3D;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,UAAU,EAAE,CAAC,EAAE,CAAC;AAMzD,iEAAiE;AACjE,MAAM,MAAM,YAAY,GAAG,OAAO,cAAc,CAAC;AAMjD;;;GAGG;AACH,UAAU,gBAAiB,SAAQ,EAAE;IACnC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACzE;AAMD;;;;;;;GAOG;AACH,KAAK,qBAAqB,CAAC,MAAM,SAAS,SAAS,UAAU,EAAE,IAAI,IAAI,CACrE;IAAC,GAAG,MAAM;CAAC,EACX;IACE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;IACzC,OAAO,CAAC,OAAO;IACf,MAAM,CAAC,OAAO;IACd,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC;IAC7B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACzB,CACF,CAAC;AAEF,MAAM,MAAM,cAAc,CAAC,MAAM,SAAS,SAAS,UAAU,EAAE,IAC7D,qBAAqB,CAAC,MAAM,CAAC,SAAS,MAAM,MAAM,SAAS,SAAS,CAAC,SAAS,UAAU,EAAE,CAAC,EAAE,GACzF,SAAS,CAAC,GAAG,MAAM,EAAE,YAAY,CAAC,GAClC,KAAK,CAAC"}

package/dist/grammar/index.js

@@ -0,0 +1,13 @@
+/**
+ * Grammar Type Computation
+ *
+ * Computes a grammar TYPE from operator schemas. The grammar is a flat tuple
+ * of precedence levels, sorted from lowest to highest precedence, with
+ * built-in atoms as the final element.
+ *
+ * Example:
+ *   [[AddOps], [MulOps], [BuiltInAtoms]]
+ *   // level 0 (lowest prec) → level 1 → atoms (last)
+ */
+export {};
+//# sourceMappingURL=index.js.map

package/dist/grammar/index.js.map

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

package/dist/index.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Stringent - Type-safe Expression Parser
+ *
+ * Main entry points:
+ * - defineNode: Create grammar node schemas
+ * - createParser: Build a type-safe parser from nodes
+ * - Parse<Grammar, Input, Context>: Type-level parsing
+ */
+export { defineNode, number, string, ident, constVal, lhs, rhs, expr, nullLiteral, booleanLiteral, undefinedLiteral, } from './schema/index.js';
+export type { NodeSchema, PatternSchema, NumberSchema, StringSchema, IdentSchema, ConstSchema, NullSchema, BooleanSchema, UndefinedSchema, ExprSchema, ExprRole, Precedence, ConfigureFn, EvalFn, SchemaToType, InferBindings, InferEvaluatedBindings, UnionResultType, ResultTypeSpec, } from './schema/index.js';
+export { createParser } from './createParser.js';
+export type { Parser, Evaluator, ParseResult, SchemaRecordToData } from './createParser.js';
+export type { Parse, BinaryNode, ParseError, TypeMismatchError, NoMatchError, } from './parse/index.js';
+export type { ComputeGrammar, Grammar } from './grammar/index.js';
+export type { Context, EmptyContext } from './context.js';
+export { emptyContext } from './context.js';
+export type { ASTNode, LiteralNode, NumberNode, StringNode, IdentNode, ConstNode, NullNode, BooleanNode, UndefinedNode, } from './primitive/index.js';
+export { processEscapeSequences, parseWithErrors, formatParseError } from './runtime/parser.js';
+export type { RichParseError, ParseResultWithErrors, ParseWithErrorsResult, } from './runtime/parser.js';
+export { calculatePosition, createSnippet, createParseError, noMatchError, typeMismatchError, unterminatedStringError, unclosedParenError, unexpectedTokenError, emptyInputError, hasErrors, getErrors, formatError, formatErrors, } from './errors.js';
+export type { SourcePosition, ParseErrorKind, ErrorContext } from './errors.js';
+export { evaluate, createEvaluator } from './runtime/eval.js';
+export type { EvalContext } from './runtime/eval.js';
+export { infer } from './runtime/infer.js';
+export type { InferredType } from './runtime/infer.js';
+export type { Infer } from './static/infer.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH,OAAO,EACL,UAAU,EACV,MAAM,EACN,MAAM,EACN,KAAK,EACL,QAAQ,EACR,GAAG,EACH,GAAG,EACH,IAAI,EACJ,WAAW,EACX,cAAc,EACd,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,UAAU,EACV,aAAa,EACb,YAAY,EACZ,YAAY,EACZ,WAAW,EACX,WAAW,EACX,UAAU,EACV,aAAa,EACb,eAAe,EACf,UAAU,EACV,QAAQ,EACR,UAAU,EACV,WAAW,EACX,MAAM,EACN,YAAY,EACZ,aAAa,EACb,sBAAsB,EACtB,eAAe,EACf,cAAc,GACf,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAM5F,YAAY,EACV,KAAK,EACL,UAAU,EACV,UAAU,EACV,iBAAiB,EACjB,YAAY,GACb,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAClE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAM5C,YAAY,EACV,OAAO,EACP,WAAW,EACX,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,QAAQ,EACR,WAAW,EACX,aAAa,GACd,MAAM,sBAAsB,CAAC;AAM9B,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAChG,YAAY,EACV,cAAc,EACd,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,EACjB,uBAAuB,EACvB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,SAAS,EACT,SAAS,EACT,WAAW,EACX,YAAY,GACb,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAMhF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAC9D,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAMrD,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,YAAY,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/index.js

@@ -0,0 +1,31 @@
+/**
+ * Stringent - Type-safe Expression Parser
+ *
+ * Main entry points:
+ * - defineNode: Create grammar node schemas
+ * - createParser: Build a type-safe parser from nodes
+ * - Parse<Grammar, Input, Context>: Type-level parsing
+ */
+// =============================================================================
+// Main API: defineNode & createParser
+// =============================================================================
+export { defineNode, number, string, ident, constVal, lhs, rhs, expr, nullLiteral, booleanLiteral, undefinedLiteral, } from './schema/index.js';
+export { createParser } from './createParser.js';
+export { emptyContext } from './context.js';
+// =============================================================================
+// Runtime Utilities
+// =============================================================================
+export { processEscapeSequences, parseWithErrors, formatParseError } from './runtime/parser.js';
+// =============================================================================
+// Error Types and Utilities
+// =============================================================================
+export { calculatePosition, createSnippet, createParseError, noMatchError, typeMismatchError, unterminatedStringError, unclosedParenError, unexpectedTokenError, emptyInputError, hasErrors, getErrors, formatError, formatErrors, } from './errors.js';
+// =============================================================================
+// Runtime Evaluation
+// =============================================================================
+export { evaluate, createEvaluator } from './runtime/eval.js';
+// =============================================================================
+// Inference
+// =============================================================================
+export { infer } from './runtime/infer.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,gFAAgF;AAChF,sCAAsC;AACtC,gFAAgF;AAEhF,OAAO,EACL,UAAU,EACV,MAAM,EACN,MAAM,EACN,KAAK,EACL,QAAQ,EACR,GAAG,EACH,GAAG,EACH,IAAI,EACJ,WAAW,EACX,cAAc,EACd,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAuB3B,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAgBjD,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAkB5C,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAOhG,gFAAgF;AAChF,4BAA4B;AAC5B,gFAAgF;AAEhF,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,EACjB,uBAAuB,EACvB,kBAAkB,EAClB,oBAAoB,EACpB,eAAe,EACf,SAAS,EACT,SAAS,EACT,WAAW,EACX,YAAY,GACb,MAAM,aAAa,CAAC;AAGrB,gFAAgF;AAChF,qBAAqB;AACrB,gFAAgF;AAEhF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAG9D,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/parse/index.d.ts

@@ -0,0 +1,211 @@
+/**
+ * Parse Type - Type-Level Parsing with Grammar Support
+ *
+ * Parse<Grammar, Input, Context> computes the exact result type of parsing
+ * an input string against a grammar.
+ *
+ * The grammar is a flat tuple of precedence levels:
+ *   [[Level0Ops], [Level1Ops], ..., [Atoms]]
+ *
+ * Parsing proceeds:
+ * 1. Try operators at current level (index 0, lowest precedence)
+ * 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, 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;
+    readonly message: TMessage;
+}
+/** 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'>;
+/** Binary operator node */
+export interface BinaryNode<TName extends string = string, TLeft = unknown, TRight = unknown, TOutputSchema extends string = string> {
+    readonly node: TName;
+    readonly outputSchema: TOutputSchema;
+    readonly left: TLeft;
+    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] : [];
+/**
+ * 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> : TElement extends NullSchema ? ParseNullPrimitive<TInput> : TElement extends BooleanSchema ? ParseBooleanPrimitive<TInput> : TElement extends UndefinedSchema ? ParseUndefinedPrimitive<TInput> : never;
+/**
+ * Parse a tuple of pattern elements.
+ *
+ * TCurrentLevels - grammar from current level onward (for rhs)
+ * TNextLevels - grammar from next level onward (for lhs, avoids left-recursion)
+ * TFullGrammar - complete grammar (for expr role, full reset)
+ */
+type ParsePatternTuple<TPattern extends readonly PatternSchema[], TInput extends string, TContext extends Context, TCurrentLevels extends Grammar, TNextLevels extends Grammar, TFullGrammar extends Grammar, TAcc extends unknown[] = []> = TPattern extends readonly [
+    infer First extends PatternSchema,
+    ...infer Rest extends readonly PatternSchema[]
+] ? ParseElementWithLevel<First, TInput, TContext, TCurrentLevels, TNextLevels, TFullGrammar> extends [infer R, infer Remaining extends string] ? ParsePatternTuple<Rest, Remaining, TContext, TCurrentLevels, TNextLevels, TFullGrammar, [
+    ...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).
+ *
+ * Role determines which grammar slice is used:
+ * - "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 {
+    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] : [];
+/**
+ * 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: ComputeOutputSchema<TNode['resultType'], Bindings>;
+} & Bindings : never;
+/**
+ * Parse an expression with optional type constraint.
+ */
+type ParseExprWithConstraint<TStartLevels extends Grammar, TInput extends string, TContext extends Context, TConstraint extends string | undefined, TFullGrammar extends Grammar> = ParseLevels<TStartLevels, TInput, TContext, TFullGrammar> extends [
+    infer Node extends {
+        outputSchema: string;
+    },
+    infer Rest extends string
+] ? 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> : [];
+/**
+ * Parse using grammar levels (flat tuple).
+ *
+ * TLevels is the remaining levels to try, starting from current.
+ * - Try nodes at first level (TLevels[0])
+ * - If no match, fall back to rest of levels
+ * - Base case: single level (atoms) - just try those nodes
+ */
+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> : [];
+/**
+ * Parse<Grammar, Input, Context>
+ *
+ * Main entry point for type-level parsing.
+ *
+ * @example
+ * type Result = Parse<MyGrammar, "1+2", Context>;
+ * // [BinaryNode<"add", NumberNode<"1">, NumberNode<"2">, "number">, ""]
+ */
+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

@@ -0,0 +1,16 @@
+/**
+ * Parse Type - Type-Level Parsing with Grammar Support
+ *
+ * Parse<Grammar, Input, Context> computes the exact result type of parsing
+ * an input string against a grammar.
+ *
+ * The grammar is a flat tuple of precedence levels:
+ *   [[Level0Ops], [Level1Ops], ..., [Atoms]]
+ *
+ * Parsing proceeds:
+ * 1. Try operators at current level (index 0, lowest precedence)
+ * 2. Fall back to next level (index 1, higher precedence)
+ * 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"}