stringent 0.0.2 → 0.0.4

package/dist/runtime/infer.js

@@ -22,13 +22,14 @@
  * ```
  */
 export function infer(ast, _context) {
-    if (typeof ast !== "object" || ast === null) {
+    if (typeof ast !== 'object' || ast === null) {
         throw new Error(`Invalid AST node: ${ast}`);
     }
     const node = ast;
     // Nodes with outputSchema (new architecture)
-    if ("outputSchema" in node && typeof node.outputSchema === "string") {
+    if ('outputSchema' in node && typeof node.outputSchema === 'string') {
         return node.outputSchema;
     }
     throw new Error(`AST node has no outputSchema: ${JSON.stringify(ast)}`);
 }
+//# sourceMappingURL=infer.js.map

package/dist/runtime/infer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"infer.js","sourceRoot":"","sources":["../../src/runtime/infer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAMH;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,KAAK,CAAC,GAAY,EAAE,QAAiB;IACnD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,qBAAqB,GAAG,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,IAAI,GAAG,GAA8B,CAAC;IAE5C,6CAA6C;IAC7C,IAAI,cAAc,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;QACpE,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,iCAAiC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC1E,CAAC"}

package/dist/runtime/parser.d.ts

@@ -7,23 +7,49 @@
  *   2. Fall back to next level (higher precedence)
  *   3. Base case: try atoms (last level)
  */
-import type { Context } from "../context.js";
-import type { ComputeGrammar, Grammar } from "../grammar/index.js";
-import type { Parse } from "../parse/index.js";
-import type { NodeSchema } from "../schema/index.js";
-import { ASTNode } from "../primitive/index.js";
+import type { Context } from '../context.js';
+import type { ComputeGrammar, Grammar } from '../grammar/index.js';
+import type { Parse } from '../parse/index.js';
+import type { NodeSchema, StringSchema, ConstSchema, ExprSchema } from '../schema/index.js';
+import { ASTNode } from '../primitive/index.js';
+/** All built-in atoms, used as the last level of the grammar */
+export declare const BUILT_IN_ATOMS: readonly [NodeSchema<"numberLiteral", readonly [import("../schema/index.js").NumberSchema & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<import("../schema/index.js").NumberSchema, TName>;
+}], 0, "number">, NodeSchema<"stringLiteral", readonly [StringSchema<readonly ["\"", "'"]> & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<StringSchema<readonly ["\"", "'"]>, TName>;
+}], 0, "string">, NodeSchema<"nullLiteral", readonly [import("../schema/index.js").NullSchema & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<import("../schema/index.js").NullSchema, TName>;
+}], 0, "null">, NodeSchema<"booleanLiteral", readonly [import("../schema/index.js").BooleanSchema & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<import("../schema/index.js").BooleanSchema, TName>;
+}], 0, "boolean">, NodeSchema<"undefinedLiteral", readonly [import("../schema/index.js").UndefinedSchema & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<import("../schema/index.js").UndefinedSchema, TName>;
+}], 0, "undefined">, NodeSchema<"identifier", readonly [import("../schema/index.js").IdentSchema & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<import("../schema/index.js").IdentSchema, TName>;
+}], 0, "unknown">, NodeSchema<"parentheses", readonly [ConstSchema<"("> & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<ConstSchema<"(">, TName>;
+}, import("../schema/index.js").NamedSchema<ExprSchema<string, "expr">, "inner">, ConstSchema<")"> & {
+    as<TName extends string>(name: TName): import("../schema/index.js").NamedSchema<ConstSchema<")">, TName>;
+}], 0, "unknown">];
 /** Parse result: empty = no match, [node, rest] = matched */
-export type ParseResult<T extends ASTNode<any, any> = ASTNode<any, any>> = [] | [T & {}, string];
+export type ParseResult<T extends ASTNode<string, unknown> = ASTNode<string, unknown>> = [] | [T & {}, string];
 /**
- * Build runtime grammar from node schemas.
+ * Process escape sequences in a string.
+ * Supports: \n, \t, \r, \\, \", \', \0, \b, \f, \v, \xHH, \uHHHH
+ *
+ * @param str - The raw string with escape sequences
+ * @returns The processed string with escape sequences converted
+ */
+export declare function processEscapeSequences(str: string): string;
+/**
+ * Build runtime grammar from operator schemas.
  *
  * Returns a flat tuple of levels:
- *   [[ops@prec1], [ops@prec2], ..., [atoms]]
+ *   [[ops@prec1], [ops@prec2], ..., [builtInAtoms]]
  *
- * Levels are sorted by precedence ascending (lowest first).
- * Atoms are always the last level.
+ * Operators are sorted by precedence ascending (lowest first).
+ * Built-in atoms are always appended as the last level.
  */
-export declare function buildGrammar(nodes: readonly NodeSchema[]): Grammar;
+export declare function buildGrammar(operators: readonly NodeSchema[]): Grammar;
 /**
  * Parse input string using node schemas.
  *
@@ -32,3 +58,58 @@ export declare function buildGrammar(nodes: readonly NodeSchema[]): Grammar;
  * parsing stay in sync.
  */
 export declare function parse<const TNodes extends readonly NodeSchema[], const TInput extends string, const TContext extends Context>(nodes: TNodes, input: TInput, context: TContext): Parse<ComputeGrammar<TNodes>, TInput, TContext>;
+import { type RichParseError, type ParseResultWithErrors } from '../errors.js';
+export type { RichParseError, ParseResultWithErrors };
+/**
+ * Result from parseWithErrors - includes rich error information on failure.
+ */
+export interface ParseWithErrorsResult<T extends ASTNode<string, unknown> = ASTNode<string, unknown>> {
+    /** Whether parsing was successful */
+    readonly success: boolean;
+    /** The parsed AST node (only present if success is true) */
+    readonly ast?: T;
+    /** Remaining unparsed input (only present if success is true) */
+    readonly remaining?: string;
+    /** Parse error information (only present if success is false) */
+    readonly error?: RichParseError;
+    /** Original input string */
+    readonly input: string;
+}
+/**
+ * Parse input with rich error information.
+ *
+ * Unlike `parse()` which returns an empty array on failure, this function
+ * returns detailed error information including:
+ * - Position (line, column, offset)
+ * - Error message
+ * - Source snippet showing where the error occurred
+ *
+ * @example
+ * ```ts
+ * const result = parseWithErrors([add], "1 + ", context);
+ * if (!result.success) {
+ *   console.log(result.error.message);
+ *   // "No grammar rule matched at position 1:5: """
+ *   console.log(result.error.snippet);
+ *   // "1 + →"
+ * }
+ * ```
+ */
+export declare function parseWithErrors<const TNodes extends readonly NodeSchema[], const TInput extends string, const TContext extends Context>(nodes: TNodes, input: TInput, context: TContext): ParseWithErrorsResult;
+/**
+ * Format a parse error for display.
+ *
+ * @example
+ * ```ts
+ * const result = parseWithErrors([add], "1 + ", context);
+ * if (!result.success) {
+ *   console.log(formatParseError(result.error));
+ *   // Error at line 1, column 5:
+ *   //   No grammar rule matched at position 1:5: ""
+ *   //
+ *   //   1 + →
+ * }
+ * ```
+ */
+export declare function formatParseError(error: RichParseError): string;
+//# sourceMappingURL=parser.d.ts.map

package/dist/runtime/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../src/runtime/parser.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACnE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,KAAK,EACV,UAAU,EAEV,YAAY,EACZ,WAAW,EACX,UAAU,EAEX,MAAM,oBAAoB,CAAC;AAa5B,OAAO,EACL,OAAO,EAOR,MAAM,uBAAuB,CAAC;AA2E/B,gEAAgE;AAGhE,eAAO,MAAM,cAAc;;;;;;;;;;;;;;;;kBAQjB,CAAC;AAEX,6DAA6D;AAC7D,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,IACjF,EAAE,GACF,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC;AAoBrB;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CA+F1D;AA6KD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,SAAS,UAAU,EAAE,GAAG,OAAO,CAuBtE;AA4TD;;;;;;GAMG;AACH,wBAAgB,KAAK,CACnB,KAAK,CAAC,MAAM,SAAS,SAAS,UAAU,EAAE,EAC1C,KAAK,CAAC,MAAM,SAAS,MAAM,EAC3B,KAAK,CAAC,QAAQ,SAAS,OAAO,EAE9B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,QAAQ,GAChB,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAOjD;AAMD,OAAO,EACL,KAAK,cAAc,EACnB,KAAK,qBAAqB,EAG3B,MAAM,cAAc,CAAC;AAEtB,YAAY,EAAE,cAAc,EAAE,qBAAqB,EAAE,CAAC;AAEtD;;GAEG;AACH,MAAM,WAAW,qBAAqB,CACpC,CAAC,SAAS,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC;IAE7D,qCAAqC;IACrC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,4DAA4D;IAC5D,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACjB,iEAAiE;IACjE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,iEAAiE;IACjE,QAAQ,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC;IAChC,4BAA4B;IAC5B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,eAAe,CAC7B,KAAK,CAAC,MAAM,SAAS,SAAS,UAAU,EAAE,EAC1C,KAAK,CAAC,MAAM,SAAS,MAAM,EAC3B,KAAK,CAAC,QAAQ,SAAS,OAAO,EAC9B,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,GAAG,qBAAqB,CA+BxE;AAsCD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAmB9D"}