parser-lr 0.6.0 → 0.7.0

package/dist/lib-cjs/lexer/lexer-compile-error.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexerCompileError = void 0;
-const parser_lr_error_js_1 = require("../errors/parser-lr-error.js");
-/**
- * Error thrown when lexer rules cannot be compiled from a grammar.
- */
-class LexerCompileError extends parser_lr_error_js_1.ParserLrError {
-    ruleName;
-    /**
-     * Creates a lexer compile error for one token rule.
-     *
-     * @param ruleName - Token or skip rule name.
-     * @param message - Underlying regular expression error message.
-     */
-    constructor(ruleName, message) {
-        super(`Invalid lexer rule ${JSON.stringify(ruleName)}: ${message}`);
-        this.ruleName = ruleName;
-    }
-}
-exports.LexerCompileError = LexerCompileError;
-//# sourceMappingURL=lexer-compile-error.js.map

package/dist/lib-cjs/lexer/lexer-compile-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer-compile-error.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer-compile-error.ts"],"names":[],"mappings":";;;AAAA,qEAA6D;AAE7D;;GAEG;AACH,MAAa,iBAAkB,SAAQ,kCAAa;IAS5B;IAPpB;;;;;OAKG;IACH,YACoB,QAAgB,EAChC,OAAe;QAGf,KAAK,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC;QAJpD,aAAQ,GAAR,QAAQ,CAAQ;IAKpC,CAAC;CACJ;AAfD,8CAeC"}

package/dist/lib-cjs/lexer/lexer-compile.js

@@ -1,201 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DEFAULT_LEXER_STATE = void 0;
-exports.compileLexerRules = compileLexerRules;
-exports.rulesForState = rulesForState;
-exports.resolveLexerStates = resolveLexerStates;
-exports.matchRule = matchRule;
-exports.hasLongerPossibleMatchCrossRule = hasLongerPossibleMatchCrossRule;
-exports.hasLongerPossibleMatch = hasLongerPossibleMatch;
-exports.isPrefixOfPotentialMatch = isPrefixOfPotentialMatch;
-exports.findLongestMatch = findLongestMatch;
-exports.assertLexerState = assertLexerState;
-const lexer_compile_error_js_1 = require("./lexer-compile-error.js");
-const lexer_state_error_js_1 = require("./lexer-state-error.js");
-/** Default lexer state when a grammar omits a `states` section. */
-exports.DEFAULT_LEXER_STATE = 'initial';
-const REGEX_LITERAL_TOKEN = 'regex_literal';
-/**
- * Compiles token and skip rules from a grammar for streaming lexing.
- *
- * @param grammar - Grammar supplying lexer rule definitions.
- * @returns Compiled rules and lexer state metadata.
- */
-function compileLexerRules(grammar) {
-    const states = resolveLexerStates(grammar.states);
-    return {
-        states,
-        initialState: states[0] ?? exports.DEFAULT_LEXER_STATE,
-        rules: [
-            ...grammar.tokenRules.map((rule) => compileRule(rule, false)),
-            ...grammar.skipRules.map((rule) => compileRule(rule, true)),
-        ],
-    };
-}
-/**
- * Returns compiled rules active in a lexer state.
- *
- * @param compiled - Compiled lexer rules for a grammar.
- * @param state - Current lexer state name.
- * @returns Rules that apply in the state, preserving declaration order.
- */
-function rulesForState(compiled, state) {
-    return compiled.rules.filter((rule) => rule.states === null || rule.states.includes(state));
-}
-/**
- * Resolves declared lexer states, supplying a default when omitted.
- *
- * @param states - State names from the grammar `states` section.
- * @returns Non-empty state name list.
- */
-function resolveLexerStates(states) {
-    if (states.length === 0) {
-        return [exports.DEFAULT_LEXER_STATE];
-    }
-    return states;
-}
-/**
- * Compiles one grammar token or skip rule into an anchored regular expression.
- *
- * @param rule - Token rule from the grammar file.
- * @param skip - Whether matches should be discarded instead of emitted.
- * @returns A compiled rule for lexing.
- */
-function compileRule(rule, skip) {
-    try {
-        return {
-            name: rule.name,
-            skip,
-            regex: new RegExp(`^(?:${rule.pattern})`, rule.flags),
-            states: rule.states === undefined ? null : [...rule.states],
-        };
-    }
-    catch (error) {
-        const message = error instanceof Error ? error.message : String(error);
-        throw new lexer_compile_error_js_1.LexerCompileError(rule.name, message);
-    }
-}
-/**
- * Matches a compiled rule at the start of a source slice.
- *
- * @param rule - Compiled token or skip rule.
- * @param slice - Remaining source text from the current offset.
- * @returns Matched lexeme text, or null when the rule does not match.
- */
-function matchRule(rule, slice) {
-    const match = rule.regex.exec(slice);
-    if (match === null || match.index !== 0) {
-        return null;
-    }
-    let text = match[0];
-    // Extend regex literals with optional JS flag letters after the closing slash.
-    if (rule.name === REGEX_LITERAL_TOKEN) {
-        const suffix = /^[gimsuy]*/.exec(slice.slice(text.length));
-        if (suffix !== null) {
-            text += suffix[0];
-        }
-    }
-    return text;
-}
-/**
- * Returns whether more input could extend the match via a different token rule.
- *
- * @param buffer - Buffered source not yet consumed.
- * @param matchedText - Current best match at the buffer start.
- * @param rules - Candidate rules for the active lexer state.
- */
-function hasLongerPossibleMatchCrossRule(buffer, matchedText, rules) {
-    const current = findLongestMatch(buffer, rules);
-    if (current === null || current.text !== matchedText) {
-        return false;
-    }
-    for (const suffix of ['=', '+', '-', '/', '"', '(', '0', 'a', 'X']) {
-        const extendedMatch = findLongestMatch(buffer + suffix, rules);
-        if (extendedMatch !== null
-            && extendedMatch.text.length > current.text.length
-            && extendedMatch.name !== current.name) {
-            return true;
-        }
-    }
-    return false;
-}
-/**
- * Returns whether a longer match may appear if more input arrives.
- *
- * @param buffer - Buffered source not yet consumed.
- * @param matchedText - Current best match at the buffer start.
- * @param rules - Candidate rules for the active lexer state.
- * @param finished - Whether the input stream has ended.
- */
-function hasLongerPossibleMatch(buffer, matchedText, rules, finished) {
-    if (finished) {
-        return false;
-    }
-    const current = findLongestMatch(buffer, rules);
-    if (current === null || current.text !== matchedText) {
-        return false;
-    }
-    for (const suffix of ['=', '+', '-', '/', '"', '(', '0', 'a', 'X']) {
-        const extendedMatch = findLongestMatch(buffer + suffix, rules);
-        if (extendedMatch !== null && extendedMatch.text.length > current.text.length) {
-            return true;
-        }
-    }
-    return false;
-}
-/**
- * Returns whether buffered input may become a token once more data arrives.
- *
- * @param buffer - Buffered source not yet consumed.
- * @param rules - Candidate rules for the active lexer state.
- */
-function isPrefixOfPotentialMatch(buffer, rules) {
-    if (buffer.length === 0) {
-        return true;
-    }
-    for (const suffix of ['=', '+', '-', '/', '"', '(', '0', 'a', 'X']) {
-        const extended = buffer + suffix;
-        const match = findLongestMatch(extended, rules);
-        if (match !== null && match.text.startsWith(buffer) && match.text.length > buffer.length) {
-            return true;
-        }
-    }
-    return false;
-}
-/**
- * Finds the longest winning rule match at the start of a buffer.
- *
- * @param buffer - Buffered source to match from the start.
- * @param rules - Candidate rules for the active lexer state.
- * @returns The longest winning match, or null when nothing matches.
- */
-function findLongestMatch(buffer, rules) {
-    let bestMatch = null;
-    // Try every rule and keep the longest match, breaking ties by rule order.
-    for (const rule of rules) {
-        const matchedText = matchRule(rule, buffer);
-        if (matchedText === null || matchedText.length === 0) {
-            continue;
-        }
-        if (bestMatch === null || matchedText.length > bestMatch.text.length) {
-            bestMatch = {
-                name: rule.name,
-                text: matchedText,
-                skip: rule.skip,
-            };
-        }
-    }
-    return bestMatch;
-}
-/**
- * Validates that a lexer state name is declared in the grammar.
- *
- * @param compiled - Compiled lexer rules for a grammar.
- * @param state - Candidate lexer state name.
- */
-function assertLexerState(compiled, state) {
-    if (!compiled.states.includes(state)) {
-        throw new lexer_state_error_js_1.LexerStateError(state);
-    }
-}
-//# sourceMappingURL=lexer-compile.js.map

package/dist/lib-cjs/lexer/lexer-compile.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer-compile.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer-compile.ts"],"names":[],"mappings":";;;AAsCA,8CAYC;AASD,sCAMC;AAQD,gDAQC;AAkCD,8BAuBC;AASD,0EA4BC;AAUD,wDA8BC;AAQD,4DAsBC;AASD,4CA4BC;AAQD,4CAMC;AArSD,qEAA6D;AAC7D,iEAAyD;AAEzD,mEAAmE;AACtD,QAAA,mBAAmB,GAAG,SAAS,CAAC;AAE7C,MAAM,mBAAmB,GAAG,eAAe,CAAC;AAuB5C;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,OAAgB;IAE9C,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAElD,OAAO;QACH,MAAM;QACN,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,2BAAmB;QAC9C,KAAK,EAAE;YACH,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAC9D;KACJ,CAAC;AACN,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,aAAa,CACzB,QAA4B,EAC5B,KAAa;IAGb,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AAChG,CAAC;AAED;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAC,MAAyB;IAExD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EACvB,CAAC;QACG,OAAO,CAAC,2BAAmB,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,IAAe,EAAE,IAAa;IAE/C,IACA,CAAC;QACG,OAAO;YACH,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI;YACJ,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC;YACrD,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;SAC9D,CAAC;IACN,CAAC;IACD,OAAO,KAAK,EACZ,CAAC;QACG,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvE,MAAM,IAAI,0CAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CAAC,IAAkB,EAAE,KAAa;IAEvD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAErC,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC,EACvC,CAAC;QACG,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAEpB,+EAA+E;IAC/E,IAAI,IAAI,CAAC,IAAI,KAAK,mBAAmB,EACrC,CAAC;QACG,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAE3D,IAAI,MAAM,KAAK,IAAI,EACnB,CAAC;YACG,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,+BAA+B,CAC3C,MAAc,EACd,WAAmB,EACnB,KAA8B;IAG9B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEhD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EACpD,CAAC;QACG,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAClE,CAAC;QACG,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC;QAE/D,IACI,aAAa,KAAK,IAAI;eACnB,aAAa,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM;eAC/C,aAAa,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,EAE1C,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,sBAAsB,CAClC,MAAc,EACd,WAAmB,EACnB,KAA8B,EAC9B,QAAiB;IAGjB,IAAI,QAAQ,EACZ,CAAC;QACG,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEhD,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EACpD,CAAC;QACG,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAClE,CAAC;QACG,MAAM,aAAa,GAAG,gBAAgB,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,CAAC,CAAC;QAE/D,IAAI,aAAa,KAAK,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,EAC7E,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,wBAAwB,CACpC,MAAc,EACd,KAA8B;IAG9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EACvB,CAAC;QACG,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAClE,CAAC;QACG,MAAM,QAAQ,GAAG,MAAM,GAAG,MAAM,CAAC;QACjC,MAAM,KAAK,GAAG,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAEhD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EACxF,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC5B,MAAc,EACd,KAA8B;IAG9B,IAAI,SAAS,GAAyD,IAAI,CAAC;IAE3E,0EAA0E;IAC1E,KAAK,MAAM,IAAI,IAAI,KAAK,EACxB,CAAC;QACG,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAE5C,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EACpD,CAAC;YACG,SAAS;QACb,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,IAAI,WAAW,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EACpE,CAAC;YACG,SAAS,GAAG;gBACR,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,IAAI,CAAC,IAAI;aAClB,CAAC;QACN,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,QAA4B,EAAE,KAAa;IAExE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EACpC,CAAC;QACG,MAAM,IAAI,sCAAe,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;AACL,CAAC"}

package/dist/lib-cjs/lexer/lexer-error.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexerError = void 0;
-const parser_lr_error_js_1 = require("../errors/parser-lr-error.js");
-/**
- * Error thrown when the lexer cannot match input at the current offset.
- */
-class LexerError extends parser_lr_error_js_1.ParserLrError {
-    offset;
-    /**
-     * Creates a lexer error at a source offset.
-     *
-     * @param message - Human-readable failure description.
-     * @param offset - Source offset where lexing stopped.
-     */
-    constructor(message, offset) {
-        super(message);
-        this.offset = offset;
-    }
-}
-exports.LexerError = LexerError;
-//# sourceMappingURL=lexer-error.js.map

package/dist/lib-cjs/lexer/lexer-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer-error.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer-error.ts"],"names":[],"mappings":";;;AAAA,qEAA6D;AAE7D;;GAEG;AACH,MAAa,UAAW,SAAQ,kCAAa;IAUrB;IARpB;;;;;OAKG;IACH,YACI,OAAe,EACC,MAAc;QAG9B,KAAK,CAAC,OAAO,CAAC,CAAC;QAHC,WAAM,GAAN,MAAM,CAAQ;IAIlC,CAAC;CACJ;AAfD,gCAeC"}

package/dist/lib-cjs/lexer/lexer-input-error.js

@@ -1,17 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexerInputError = void 0;
-const parser_lr_error_js_1 = require("../errors/parser-lr-error.js");
-/**
- * Thrown when source input is pushed after the lexer has finished.
- */
-class LexerInputError extends parser_lr_error_js_1.ParserLrError {
-    /**
-     * Creates a lexer input sequencing error.
-     */
-    constructor() {
-        super('Cannot push input after finish()');
-    }
-}
-exports.LexerInputError = LexerInputError;
-//# sourceMappingURL=lexer-input-error.js.map

package/dist/lib-cjs/lexer/lexer-input-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer-input-error.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer-input-error.ts"],"names":[],"mappings":";;;AAAA,qEAA6D;AAE7D;;GAEG;AACH,MAAa,eAAgB,SAAQ,kCAAa;IAE9C;;OAEG;IACH;QAEI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IAC9C,CAAC;CACJ;AATD,0CASC"}

package/dist/lib-cjs/lexer/lexer-state-error.js

@@ -1,19 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LexerStateError = void 0;
-const parser_lr_error_js_1 = require("../errors/parser-lr-error.js");
-/**
- * Thrown when a lexer state name is not declared in the grammar.
- */
-class LexerStateError extends parser_lr_error_js_1.ParserLrError {
-    /**
-     * Creates an unknown lexer state error.
-     *
-     * @param state - Requested lexer state name.
-     */
-    constructor(state) {
-        super(`Unknown lexer state ${JSON.stringify(state)}`);
-    }
-}
-exports.LexerStateError = LexerStateError;
-//# sourceMappingURL=lexer-state-error.js.map

package/dist/lib-cjs/lexer/lexer-state-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer-state-error.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer-state-error.ts"],"names":[],"mappings":";;;AAAA,qEAA6D;AAE7D;;GAEG;AACH,MAAa,eAAgB,SAAQ,kCAAa;IAE9C;;;;OAIG;IACH,YAAmB,KAAa;QAE5B,KAAK,CAAC,uBAAuB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC1D,CAAC;CACJ;AAXD,0CAWC"}

package/dist/lib-cjs/lexer/lexer.js

@@ -1,278 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Lexer = void 0;
-exports.lexChunks = lexChunks;
-exports.lexChunksAsync = lexChunksAsync;
-exports.lexChunkStream = lexChunkStream;
-exports.lexChunkStreamAsync = lexChunkStreamAsync;
-const lexer_compile_js_1 = require("./lexer-compile.js");
-const lexer_error_js_1 = require("./lexer-error.js");
-const lexer_input_error_js_1 = require("./lexer-input-error.js");
-const token_js_1 = require("./token.js");
-/**
- * Stream-based lexer driven by a grammar's `tokens`, `skip`, and `states` sections.
- *
- * Push source chunks with {@link push}, signal end-of-input with {@link finish},
- * then read tokens via {@link next} or iteration. The final token is always `$eof`.
- */
-class Lexer {
-    compiled;
-    queue = [];
-    buffer = '';
-    offset = 0;
-    finished = false;
-    eofEmitted = false;
-    currentState;
-    /**
-     * Creates a lexer from a parsed grammar.
-     *
-     * @param grammar - Grammar supplying token and skip rule definitions.
-     */
-    constructor(grammar) {
-        this.compiled = (0, lexer_compile_js_1.compileLexerRules)(grammar);
-        this.currentState = this.compiled.initialState;
-    }
-    /**
-     * Returns the active lexer state name.
-     */
-    get state() {
-        return this.currentState;
-    }
-    /**
-     * Enters a declared lexer state.
-     *
-     * @param stateName - Lexer state to activate.
-     */
-    enterState(stateName) {
-        (0, lexer_compile_js_1.assertLexerState)(this.compiled, stateName);
-        this.currentState = stateName;
-    }
-    /**
-     * Appends the next chunk of source text to the scan buffer.
-     *
-     * @param chunk - Source text fragment.
-     */
-    push(chunk) {
-        if (this.finished) {
-            throw new lexer_input_error_js_1.LexerInputError();
-        }
-        this.buffer += chunk;
-        this.drain(false);
-    }
-    /**
-     * Signals that no further source chunks will arrive.
-     */
-    finish() {
-        this.finished = true;
-        this.drain(true);
-    }
-    /**
-     * Returns the next token, or null when waiting for more input.
-     *
-     * @returns The next token, null while blocked, or `$eof` after input ends.
-     */
-    next() {
-        if (this.eofEmitted) {
-            return null;
-        }
-        if (this.queue.length > 0) {
-            return this.queue.shift() ?? null;
-        }
-        if (!this.finished) {
-            return null;
-        }
-        if (this.buffer.length > 0) {
-            throw new lexer_error_js_1.LexerError(`Unexpected character ${JSON.stringify(this.buffer[0])} at offset ${this.offset}`, this.offset);
-        }
-        this.eofEmitted = true;
-        return (0, token_js_1.eofToken)(this.offset);
-    }
-    /**
-     * Lexes an entire source string, including a trailing `$eof` token.
-     *
-     * @param source - Input text to tokenize.
-     * @returns Matched tokens in source order.
-     */
-    lex(source) {
-        this.reset();
-        this.push(source);
-        this.finish();
-        const tokens = [];
-        let nextToken = this.next();
-        while (nextToken !== null) {
-            tokens.push(nextToken);
-            nextToken = this.next();
-        }
-        return tokens;
-    }
-    /**
-     * Iterates all tokens until `$eof` after {@link finish} has been called.
-     */
-    [Symbol.iterator]() {
-        return {
-            next: () => {
-                const value = this.next();
-                if (value === null) {
-                    return {
-                        done: true,
-                        value: undefined,
-                    };
-                }
-                return {
-                    done: false,
-                    value,
-                };
-            },
-        };
-    }
-    /**
-     * Scans the buffer and enqueues any tokens ready to emit.
-     *
-     * @param inputFinished - Whether the full input stream has ended.
-     * @param allowChunkBoundary - Whether to commit tokens at a chunk boundary.
-     */
-    drain(inputFinished) {
-        // Scan until the buffer needs more input or input ends with an error.
-        while (true) {
-            const match = this.matchAtBufferStart(inputFinished);
-            if (match === 'need-more') {
-                return;
-            }
-            if (match === null) {
-                if (inputFinished && this.buffer.length > 0) {
-                    throw new lexer_error_js_1.LexerError(`Unexpected character ${JSON.stringify(this.buffer[0])} at offset ${this.offset}`, this.offset);
-                }
-                return;
-            }
-            this.buffer = this.buffer.slice(match.text.length);
-            this.offset += match.text.length;
-            if (!match.skip) {
-                this.queue.push((0, token_js_1.token)(match.name, match.text, match.offset));
-            }
-        }
-    }
-    /**
-     * Finds the winning rule match at the start of the scan buffer.
-     *
-     * @param inputFinished - Whether the full input stream has ended.
-     * @param allowChunkBoundary - Whether to commit tokens at a chunk boundary.
-     */
-    matchAtBufferStart(inputFinished) {
-        if (this.buffer.length === 0) {
-            return null;
-        }
-        const activeRules = (0, lexer_compile_js_1.rulesForState)(this.compiled, this.currentState);
-        const bestMatch = (0, lexer_compile_js_1.findLongestMatch)(this.buffer, activeRules);
-        if (bestMatch === null) {
-            if (!inputFinished && (0, lexer_compile_js_1.isPrefixOfPotentialMatch)(this.buffer, activeRules)) {
-                return 'need-more';
-            }
-            return null;
-        }
-        if (bestMatch.text.length === this.buffer.length && !inputFinished) {
-            if ((0, lexer_compile_js_1.hasLongerPossibleMatch)(this.buffer, bestMatch.text, activeRules, false)) {
-                return 'need-more';
-            }
-        }
-        return {
-            name: bestMatch.name,
-            text: bestMatch.text,
-            offset: this.offset,
-            skip: bestMatch.skip,
-        };
-    }
-    /**
-     * Resets stream state for a fresh lex run.
-     */
-    reset() {
-        this.queue.length = 0;
-        this.buffer = '';
-        this.offset = 0;
-        this.finished = false;
-        this.eofEmitted = false;
-    }
-}
-exports.Lexer = Lexer;
-/**
- * Lexes synchronous source chunks into a token stream ending with `$eof`.
- *
- * @param grammar - Grammar supplying lexer rules.
- * @param chunks - Source text fragments in order.
- * @returns Token iterator including `$eof`.
- */
-function lexChunks(grammar, chunks) {
-    const lexer = new Lexer(grammar);
-    return lexChunksFromLexer(lexer, chunks);
-}
-/**
- * Lexes asynchronous source chunks into a token stream ending with `$eof`.
- *
- * @param grammar - Grammar supplying lexer rules.
- * @param chunks - Source text fragments in order.
- * @returns Async token iterator including `$eof`.
- */
-async function* lexChunksAsync(grammar, chunks) {
-    const lexer = new Lexer(grammar);
-    for await (const chunk of chunks) {
-        lexer.push(chunk);
-        let nextToken = lexer.next();
-        while (nextToken !== null) {
-            yield nextToken;
-            nextToken = lexer.next();
-        }
-    }
-    lexer.finish();
-    let nextToken = lexer.next();
-    while (nextToken !== null) {
-        yield nextToken;
-        nextToken = lexer.next();
-    }
-}
-/**
- * Drains tokens from a lexer fed by synchronous chunks.
- *
- * @param lexer - Configured lexer instance.
- * @param chunks - Source text fragments in order.
- * @returns Token iterator including `$eof`.
- */
-function* lexChunksFromLexer(lexer, chunks) {
-    for (const chunk of chunks) {
-        lexer.push(chunk);
-        let nextToken = lexer.next();
-        while (nextToken !== null) {
-            yield nextToken;
-            nextToken = lexer.next();
-        }
-    }
-    lexer.finish();
-    let nextToken = lexer.next();
-    while (nextToken !== null) {
-        yield nextToken;
-        nextToken = lexer.next();
-    }
-}
-/**
- * Collects all tokens from a synchronous chunk stream.
- *
- * @param grammar - Grammar supplying lexer rules.
- * @param chunks - Source text fragments in order.
- * @returns Matched tokens including `$eof`.
- */
-function lexChunkStream(grammar, chunks) {
-    return [...lexChunks(grammar, chunks)];
-}
-/**
- * Collects all tokens from an asynchronous chunk stream.
- *
- * @param grammar - Grammar supplying lexer rules.
- * @param chunks - Source text fragments in order.
- * @returns Matched tokens including `$eof`.
- */
-async function lexChunkStreamAsync(grammar, chunks) {
-    const tokens = [];
-    for await (const value of lexChunksAsync(grammar, chunks)) {
-        tokens.push(value);
-    }
-    return tokens;
-}
-//# sourceMappingURL=lexer.js.map

package/dist/lib-cjs/lexer/lexer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lexer.js","sourceRoot":"","sources":["../../../src/lib/lexer/lexer.ts"],"names":[],"mappings":";;;AAqRA,8BAQC;AASD,wCA6BC;AA6CD,wCAMC;AASD,kDAaC;AA1YD,yDAO4B;AAE5B,qDAA8C;AAC9C,iEAAyD;AACzD,yCAA6C;AAG7C;;;;;GAKG;AACH,MAAa,KAAK;IAEG,QAAQ,CAAqB;IAC7B,KAAK,GAAY,EAAE,CAAC;IAC7B,MAAM,GAAG,EAAE,CAAC;IACZ,MAAM,GAAG,CAAC,CAAC;IACX,QAAQ,GAAG,KAAK,CAAC;IACjB,UAAU,GAAG,KAAK,CAAC;IACnB,YAAY,CAAS;IAE7B;;;;OAIG;IACH,YAAmB,OAAgB;QAE/B,IAAI,CAAC,QAAQ,GAAG,IAAA,oCAAiB,EAAC,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QAEZ,OAAO,IAAI,CAAC,YAAY,CAAC;IAC7B,CAAC;IAED;;;;OAIG;IACI,UAAU,CAAC,SAAiB;QAE/B,IAAA,mCAAgB,EAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,KAAa;QAErB,IAAI,IAAI,CAAC,QAAQ,EACjB,CAAC;YACG,MAAM,IAAI,sCAAe,EAAE,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACI,MAAM;QAET,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI;QAEP,IAAI,IAAI,CAAC,UAAU,EACnB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,CAAC;YACG,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAC1B,CAAC;YACG,MAAM,IAAI,2BAAU,CAChB,wBAAwB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,MAAM,EAAE,EACjF,IAAI,CAAC,MAAM,CACd,CAAC;QACN,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,OAAO,IAAA,mBAAQ,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,MAAc;QAErB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAE5B,OAAO,SAAS,KAAK,IAAI,EACzB,CAAC;YACG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvB,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAEpB,OAAO;YACH,IAAI,EAAE,GAA0B,EAAE;gBAE9B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAE1B,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;oBACG,OAAO;wBACH,IAAI,EAAE,IAAI;wBACV,KAAK,EAAE,SAAS;qBACnB,CAAC;gBACN,CAAC;gBAED,OAAO;oBACH,IAAI,EAAE,KAAK;oBACX,KAAK;iBACR,CAAC;YACN,CAAC;SACJ,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,aAAsB;QAEhC,sEAAsE;QACtE,OAAO,IAAI,EACX,CAAC;YACG,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,aAAa,CAAC,CAAC;YAErD,IAAI,KAAK,KAAK,WAAW,EACzB,CAAC;gBACG,OAAO;YACX,CAAC;YAED,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;gBACG,IAAI,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAC3C,CAAC;oBACG,MAAM,IAAI,2BAAU,CAChB,wBAAwB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,MAAM,EAAE,EACjF,IAAI,CAAC,MAAM,CACd,CAAC;gBACN,CAAC;gBAED,OAAO;YACX,CAAC;YAED,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnD,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;YAEjC,IAAI,CAAC,KAAK,CAAC,IAAI,EACf,CAAC;gBACG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAA,gBAAK,EAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,aAAsB;QAK7C,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAC5B,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,WAAW,GAAG,IAAA,gCAAa,EAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,IAAA,mCAAgB,EAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QAE7D,IAAI,SAAS,KAAK,IAAI,EACtB,CAAC;YACG,IAAI,CAAC,aAAa,IAAI,IAAA,2CAAwB,EAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,EACxE,CAAC;gBACG,OAAO,WAAW,CAAC;YACvB,CAAC;YAED,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,aAAa,EAClE,CAAC;YACG,IAAI,IAAA,yCAAsB,EAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,EAAE,WAAW,EAAE,KAAK,CAAC,EAC3E,CAAC;gBACG,OAAO,WAAW,CAAC;YACvB,CAAC;QACL,CAAC;QAED,OAAO;YACH,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,IAAI,EAAE,SAAS,CAAC,IAAI;YACpB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,SAAS,CAAC,IAAI;SACvB,CAAC;IACN,CAAC;IAED;;OAEG;IACK,KAAK;QAET,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;IAC5B,CAAC;CACJ;AAtPD,sBAsPC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CACrB,OAAgB,EAChB,MAAwB;IAGxB,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;IAEjC,OAAO,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;;GAMG;AACI,KAAK,SAAS,CAAC,CAAC,cAAc,CACjC,OAAgB,EAChB,MAA6B;IAG7B,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;IAEjC,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,MAAM,EAChC,CAAC;QACG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElB,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAE7B,OAAO,SAAS,KAAK,IAAI,EACzB,CAAC;YACG,MAAM,SAAS,CAAC;YAChB,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,EAAE,CAAC;IAEf,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAE7B,OAAO,SAAS,KAAK,IAAI,EACzB,CAAC;QACG,MAAM,SAAS,CAAC;QAChB,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,QAAQ,CAAC,CAAC,kBAAkB,CACxB,KAAY,EACZ,MAAwB;IAGxB,KAAK,MAAM,KAAK,IAAI,MAAM,EAC1B,CAAC;QACG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAElB,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAE7B,OAAO,SAAS,KAAK,IAAI,EACzB,CAAC;YACG,MAAM,SAAS,CAAC;YAChB,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC7B,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,EAAE,CAAC;IAEf,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAE7B,OAAO,SAAS,KAAK,IAAI,EACzB,CAAC;QACG,MAAM,SAAS,CAAC;QAChB,SAAS,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAC1B,OAAgB,EAChB,MAAwB;IAGxB,OAAO,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;AACI,KAAK,UAAU,mBAAmB,CACrC,OAAgB,EAChB,MAA6B;IAG7B,MAAM,MAAM,GAAY,EAAE,CAAC;IAE3B,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,cAAc,CAAC,OAAO,EAAE,MAAM,CAAC,EACzD,CAAC;QACG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/lib-cjs/lexer/token.js

@@ -1,44 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EOF_TOKEN_NAME = void 0;
-exports.token = token;
-exports.eofToken = eofToken;
-exports.isEofToken = isEofToken;
-/** Token name emitted once at end of input. */
-exports.EOF_TOKEN_NAME = '$eof';
-/**
- * Builds a token value from a rule name, matched text, and source offset.
- *
- * @param name - Token rule name from the grammar `tokens` section.
- * @param text - Matched lexeme text.
- * @param offset - Start offset of the lexeme in the source.
- * @returns A token record with a source span.
- */
-function token(name, text, offset) {
-    return {
-        name,
-        text,
-        location: {
-            offset,
-            length: text.length,
-        },
-    };
-}
-/**
- * Builds the end-of-input token at a source offset.
- *
- * @param offset - Source offset where input ended.
- * @returns An empty `$eof` token.
- */
-function eofToken(offset) {
-    return token(exports.EOF_TOKEN_NAME, '', offset);
-}
-/**
- * Returns whether a token is the end-of-input marker.
- *
- * @param value - Token to test.
- */
-function isEofToken(value) {
-    return value.name === exports.EOF_TOKEN_NAME;
-}
-//# sourceMappingURL=token.js.map

package/dist/lib-cjs/lexer/token.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"token.js","sourceRoot":"","sources":["../../../src/lib/lexer/token.ts"],"names":[],"mappings":";;;AAuBA,sBAcC;AAQD,4BAGC;AAOD,gCAGC;AAxDD,+CAA+C;AAClC,QAAA,cAAc,GAAG,MAAM,CAAC;AAYrC;;;;;;;GAOG;AACH,SAAgB,KAAK,CACjB,IAAY,EACZ,IAAY,EACZ,MAAc;IAGd,OAAO;QACH,IAAI;QACJ,IAAI;QACJ,QAAQ,EAAE;YACN,MAAM;YACN,MAAM,EAAE,IAAI,CAAC,MAAM;SACtB;KACJ,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,SAAgB,QAAQ,CAAC,MAAc;IAEnC,OAAO,KAAK,CAAC,sBAAc,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED;;;;GAIG;AACH,SAAgB,UAAU,CAAC,KAAY;IAEnC,OAAO,KAAK,CAAC,IAAI,KAAK,sBAAc,CAAC;AACzC,CAAC"}

package/dist/lib-cjs/package.json

@@ -1,3 +0,0 @@
-{
-    "type": "commonjs"
-}

package/dist/lib-cjs/parse-context-error.js

@@ -1,19 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParseContextError = void 0;
-const parser_lr_error_js_1 = require("./errors/parser-lr-error.js");
-/**
- * Thrown when a parse context cannot be constructed from supplied sources.
- */
-class ParseContextError extends parser_lr_error_js_1.ParserLrError {
-    /**
-     * Creates a parse context configuration error.
-     *
-     * @param message - Human-readable failure description.
-     */
-    constructor(message) {
-        super(message);
-    }
-}
-exports.ParseContextError = ParseContextError;
-//# sourceMappingURL=parse-context-error.js.map

package/dist/lib-cjs/parse-context-error.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse-context-error.js","sourceRoot":"","sources":["../../src/lib/parse-context-error.ts"],"names":[],"mappings":";;;AAAA,oEAA4D;AAE5D;;GAEG;AACH,MAAa,iBAAkB,SAAQ,kCAAa;IAEhD;;;;OAIG;IACH,YAAmB,OAAe;QAE9B,KAAK,CAAC,OAAO,CAAC,CAAC;IACnB,CAAC;CACJ;AAXD,8CAWC"}