parser-lr 0.6.1 → 0.7.0

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

@@ -1,137 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParseContext = void 0;
-const parse_context_error_js_1 = require("./parse-context-error.js");
-const read_grammar_js_1 = require("./grammar/read-grammar.js");
-const lr_algorithm_js_1 = require("./parse-table/lr-algorithm.js");
-const parse_table_js_1 = require("./parse-table/parse-table.js");
-const parser_lr_js_1 = require("./parser-lr.js");
-/**
- * Parser and parse table loaded from a grammar or serialized table.
- */
-class ParseContext {
-    parser;
-    table;
-    /**
-     * Creates a parse context from a parser and its table.
-     *
-     * @param parser - Shift-reduce parser instance.
-     * @param table - Parse table backing the parser.
-     */
-    constructor(parser, table) {
-        this.parser = parser;
-        this.table = table;
-    }
-    /**
-     * Builds a parse context from grammar file text.
-     *
-     * @param source - Full `.grammar` file contents.
-     * @param algorithm - LR algorithm used to build the table.
-     * @returns Parser and parse table ready for lexing or parsing.
-     */
-    static fromGrammar(source, algorithm = 'lr1') {
-        const grammar = (0, read_grammar_js_1.readGrammar)(source);
-        const table = parse_table_js_1.ParseTable.fromGrammar(grammar, algorithm);
-        const parser = new parser_lr_js_1.ParserLr(grammar, table);
-        return new ParseContext(parser, table);
-    }
-    /**
-     * Builds a parse context from serialized parse table JSON.
-     *
-     * @param json - Serialized parse table JSON including `ast` and `transform` when present.
-     * @returns Parser and parse table ready for lexing and full AST parsing.
-     */
-    static fromTableJson(json) {
-        const table = parse_table_js_1.ParseTable.fromJsonString(json);
-        return new ParseContext(parser_lr_js_1.ParserLr.fromParseTable(table), table);
-    }
-    /**
-     * Builds a parse context from a grammar or table source string.
-     *
-     * @param options - Grammar source, table JSON, and optional algorithm.
-     * @returns Parser and parse table ready for lexing or parsing.
-     */
-    static fromSources(options) {
-        // Prefer grammar source over a saved table when both are supplied.
-        if (options.grammarSource !== undefined) {
-            return ParseContext.fromGrammar(options.grammarSource, (0, lr_algorithm_js_1.parseLrAlgorithm)(options.algorithm));
-        }
-        if (options.tableJson !== undefined) {
-            return ParseContext.fromTableJson(options.tableJson);
-        }
-        throw new parse_context_error_js_1.ParseContextError('required: grammar source or table JSON');
-    }
-    /**
-     * Creates a stream lexer for this context's grammar.
-     *
-     * @returns A fresh stream lexer instance.
-     */
-    createLexer() {
-        return this.parser.createLexer();
-    }
-    /**
-     * Lexes source text using this context's parser.
-     *
-     * @param source - Input text to tokenize.
-     * @returns Matched tokens in source order, ending with `$eof`.
-     */
-    lex(source) {
-        return this.parser.lex(source);
-    }
-    /**
-     * Lexes synchronous source chunks into a token stream ending with `$eof`.
-     *
-     * @param chunks - Source text fragments in order.
-     * @returns Token iterator including `$eof`.
-     */
-    lexChunks(chunks) {
-        return this.parser.lexChunks(chunks);
-    }
-    /**
-     * Lexes asynchronous source chunks into a token stream ending with `$eof`.
-     *
-     * @param chunks - Source text fragments in order.
-     * @returns Async token iterator including `$eof`.
-     */
-    lexChunksAsync(chunks) {
-        return this.parser.lexChunksAsync(chunks);
-    }
-    /**
-     * Collects all tokens from a synchronous chunk stream.
-     *
-     * @param chunks - Source text fragments in order.
-     * @returns Matched tokens including `$eof`.
-     */
-    lexChunkStream(chunks) {
-        return this.parser.lexChunkStream(chunks);
-    }
-    /**
-     * Collects all tokens from an asynchronous chunk stream.
-     *
-     * @param chunks - Source text fragments in order.
-     * @returns Matched tokens including `$eof`.
-     */
-    async lexChunkStreamAsync(chunks) {
-        return this.parser.lexChunkStreamAsync(chunks);
-    }
-    /**
-     * Parses a token stream into an AST, applying transforms from the grammar or table when present.
-     *
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns Transformed AST, CST when no transform rules exist, or null on syntax error.
-     */
-    parse(tokens) {
-        return this.parser.parse(tokens);
-    }
-    /**
-     * Lexes and parses source text into an AST, applying transforms when present.
-     *
-     * @param source - Input text to parse.
-     * @returns Transformed AST, CST when no transform rules exist, or null on syntax error.
-     */
-    parseSource(source) {
-        return this.parser.parseSource(source);
-    }
-}
-exports.ParseContext = ParseContext;
-//# sourceMappingURL=parse-context.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"parse-context.js","sourceRoot":"","sources":["../../src/lib/parse-context.ts"],"names":[],"mappings":";;;AACA,qEAA6D;AAC7D,+DAAwD;AAIxD,mEAAiE;AACjE,iEAA0D;AAC1D,iDAA0C;AAE1C;;GAEG;AACH,MAAa,YAAY;IASD;IACA;IARpB;;;;;OAKG;IACH,YACoB,MAAgB,EAChB,KAAiB;QADjB,WAAM,GAAN,MAAM,CAAU;QAChB,UAAK,GAAL,KAAK,CAAY;IAGrC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,WAAW,CACrB,MAAc,EACd,YAAyB,KAAK;QAG9B,MAAM,OAAO,GAAG,IAAA,6BAAW,EAAC,MAAM,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,2BAAU,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,uBAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAE5C,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,IAAY;QAEpC,MAAM,KAAK,GAAG,2BAAU,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAE9C,OAAO,IAAI,YAAY,CAAC,uBAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CAAC,OAA4B;QAElD,mEAAmE;QACnE,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS,EACvC,CAAC;YACG,OAAO,YAAY,CAAC,WAAW,CAC3B,OAAO,CAAC,aAAa,EACrB,IAAA,kCAAgB,EAAC,OAAO,CAAC,SAAS,CAAC,CACtC,CAAC;QACN,CAAC;QAED,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EACnC,CAAC;YACG,OAAO,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,IAAI,0CAAiB,CAAC,wCAAwC,CAAC,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACI,WAAW;QAEd,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,MAAc;QAErB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,MAAwB;QAErC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,MAA6B;QAE/C,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,MAAwB;QAE1C,OAAO,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,mBAAmB,CAAC,MAA6B;QAE1D,OAAO,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,MAAwB;QAEjC,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACI,WAAW,CAAC,MAAc;QAE7B,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;CACJ;AA9JD,oCA8JC"}

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

@@ -1,19 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParseOutputError = void 0;
-const parser_lr_error_js_1 = require("./errors/parser-lr-error.js");
-/**
- * Thrown when parse output cannot be formatted for a requested interchange format.
- */
-class ParseOutputError extends parser_lr_error_js_1.ParserLrError {
-    /**
-     * Creates a parse output formatting error.
-     *
-     * @param format - Requested output format name.
-     */
-    constructor(format) {
-        super(`Unsupported output format ${JSON.stringify(format)}`);
-    }
-}
-exports.ParseOutputError = ParseOutputError;
-//# sourceMappingURL=parse-output-error.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"parse-output-error.js","sourceRoot":"","sources":["../../src/lib/parse-output-error.ts"],"names":[],"mappings":";;;AAAA,oEAA4D;AAE5D;;GAEG;AACH,MAAa,gBAAiB,SAAQ,kCAAa;IAE/C;;;;OAIG;IACH,YAAmB,MAAc;QAE7B,KAAK,CAAC,6BAA6B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC;CACJ;AAXD,4CAWC"}

package/dist/lib-cjs/parse-output.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.formatParseOutput = formatParseOutput;
-const parse_output_error_js_1 = require("./parse-output-error.js");
-/**
- * Formats parse output for a named interchange format.
- *
- * @param tree - Parsed concrete syntax tree, or null on syntax error.
- * @param format - Output format name.
- * @returns Formatted output text.
- */
-function formatParseOutput(tree, format) {
-    if (format !== 'json') {
-        throw new parse_output_error_js_1.ParseOutputError(format);
-    }
-    return JSON.stringify({ ast: tree }, null, 4);
-}
-//# sourceMappingURL=parse-output.js.map

package/dist/lib-cjs/parse-output.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse-output.js","sourceRoot":"","sources":["../../src/lib/parse-output.ts"],"names":[],"mappings":";;AAUA,8CAQC;AAjBD,mEAA2D;AAE3D;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,IAAoB,EAAE,MAAc;IAElE,IAAI,MAAM,KAAK,MAAM,EACrB,CAAC;QACG,MAAM,IAAI,wCAAgB,CAAC,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAClD,CAAC"}

package/dist/lib-cjs/parse-table/analysis/first-follow.js

@@ -1,294 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GrammarAnalysis = void 0;
-exports.analyzeGrammar = analyzeGrammar;
-exports.formatBnfProduction = formatBnfProduction;
-exports.isAugmentedGrammar = isAugmentedGrammar;
-const token_js_1 = require("../../lexer/token.js");
-const bnf_grammar_js_1 = require("../bnf/bnf-grammar.js");
-const bnf_symbol_js_1 = require("../bnf/bnf-symbol.js");
-/**
- * Nullable non-terminals and FIRST/FOLLOW sets for a BNF grammar.
- */
-class GrammarAnalysis {
-    nullable;
-    firstByNonTerminal;
-    followByNonTerminal;
-    /**
-     * Computes nullable, FIRST, and FOLLOW sets for a BNF grammar.
-     *
-     * @param grammar - Plain BNF grammar to analyze.
-     */
-    constructor(grammar) {
-        this.nullable = GrammarAnalysis.computeNullable(grammar);
-        this.firstByNonTerminal = GrammarAnalysis.computeFirst(grammar, this.nullable);
-        this.followByNonTerminal = GrammarAnalysis.computeFollow(grammar, this.firstByNonTerminal, this.nullable);
-    }
-    /**
-     * Returns whether a non-terminal can derive the empty string.
-     *
-     * @param name - Non-terminal name to test.
-     * @returns True when the non-terminal can derive ε.
-     */
-    isNullable(name) {
-        return this.nullable.has(name);
-    }
-    /**
-     * Returns FIRST symbols for a non-terminal as encoded terminal keys.
-     *
-     * @param name - Non-terminal name to look up.
-     */
-    firstOfNonTerminal(name) {
-        return this.firstByNonTerminal.get(name) ?? new Set();
-    }
-    /**
-     * Returns FOLLOW symbols for a non-terminal as encoded terminal keys.
-     *
-     * @param name - Non-terminal name to look up.
-     */
-    followOfNonTerminal(name) {
-        return this.followByNonTerminal.get(name) ?? new Set();
-    }
-    /**
-     * Returns FIRST symbols for a symbol sequence.
-     *
-     * @param symbols - Right-hand side prefix or full sequence.
-     * @returns Encoded terminal keys in FIRST of the sequence.
-     */
-    firstOfSequence(symbols) {
-        const result = new Set();
-        let allNullable = true;
-        // Accumulate FIRST of each prefix symbol until a non-nullable symbol stops propagation.
-        for (const symbol of symbols) {
-            const symbolFirst = this.firstOfSymbol(symbol);
-            GrammarAnalysis.addAll(result, symbolFirst);
-            if (!this.isSymbolNullable(symbol)) {
-                allNullable = false;
-                break;
-            }
-        }
-        // Every symbol is nullable, so end-of-input is in FIRST.
-        if (allNullable) {
-            result.add(token_js_1.EOF_TOKEN_NAME);
-        }
-        return result;
-    }
-    /**
-     * Returns FIRST symbols for one grammar symbol.
-     *
-     * @param symbol - Terminal, token, or non-terminal symbol.
-     */
-    firstOfSymbol(symbol) {
-        if (symbol.kind === 'nonTerminal') {
-            return this.firstOfNonTerminal(symbol.name);
-        }
-        return new Set([(0, bnf_symbol_js_1.bnfParserSymbolKey)(symbol)]);
-    }
-    /**
-     * Returns whether a symbol can begin with the empty string.
-     *
-     * @param symbol - Terminal, token, or non-terminal symbol.
-     */
-    isSymbolNullable(symbol) {
-        if (symbol.kind === 'nonTerminal') {
-            return this.isNullable(symbol.name);
-        }
-        return false;
-    }
-    /**
-     * Computes nullable non-terminals by fixed-point iteration.
-     *
-     * @param grammar - Plain BNF grammar to analyze.
-     * @returns The set of non-terminal names that derive ε.
-     */
-    static computeNullable(grammar) {
-        const nullable = new Set();
-        let changed = true;
-        // Fixed-point: mark A nullable when every production A → α has nullable α.
-        while (changed) {
-            changed = false;
-            for (const production of grammar.productions) {
-                if (production.rhs.length === 0 && !nullable.has(production.name)) {
-                    nullable.add(production.name);
-                    changed = true;
-                    continue;
-                }
-                if (production.rhs.every((symbol) => symbol.kind === 'nonTerminal' && nullable.has(symbol.name))) {
-                    if (!nullable.has(production.name)) {
-                        nullable.add(production.name);
-                        changed = true;
-                    }
-                }
-            }
-        }
-        return nullable;
-    }
-    /**
-     * Computes FIRST sets for every non-terminal.
-     *
-     * @param grammar - Plain BNF grammar to analyze.
-     * @param nullable - Nullable non-terminal names.
-     * @returns FIRST set for every non-terminal name.
-     */
-    static computeFirst(grammar, nullable) {
-        const firstByNonTerminal = new Map();
-        for (const name of grammar.nonTerminalNames()) {
-            firstByNonTerminal.set(name, new Set());
-        }
-        let changed = true;
-        // Fixed-point: add FIRST(α) into FIRST(A) for each production A → α.
-        while (changed) {
-            changed = false;
-            for (const production of grammar.productions) {
-                const first = firstByNonTerminal.get(production.name) ?? new Set();
-                const before = first.size;
-                GrammarAnalysis.addFirstOfSequence(first, production.rhs, firstByNonTerminal, nullable);
-                if (first.size !== before) {
-                    changed = true;
-                }
-                firstByNonTerminal.set(production.name, first);
-            }
-        }
-        return firstByNonTerminal;
-    }
-    /**
-     * Computes FOLLOW sets for every non-terminal.
-     *
-     * @param grammar - Plain BNF grammar to analyze.
-     * @param firstByNonTerminal - Precomputed FIRST sets.
-     * @param nullable - Nullable non-terminal names.
-     * @returns FOLLOW set for every non-terminal name.
-     */
-    static computeFollow(grammar, firstByNonTerminal, nullable) {
-        const followByNonTerminal = new Map();
-        for (const name of grammar.nonTerminalNames()) {
-            followByNonTerminal.set(name, new Set());
-        }
-        // Seed FOLLOW of the start symbol with end-of-input.
-        const startFollow = followByNonTerminal.get(grammar.startSymbol) ?? new Set();
-        startFollow.add(token_js_1.EOF_TOKEN_NAME);
-        followByNonTerminal.set(grammar.startSymbol, startFollow);
-        let changed = true;
-        // Fixed-point: propagate FOLLOW through every production A → α B β.
-        while (changed) {
-            changed = false;
-            for (const production of grammar.productions) {
-                for (let index = 0; index < production.rhs.length; index += 1) {
-                    const symbol = production.rhs[index];
-                    if (symbol.kind !== 'nonTerminal') {
-                        continue;
-                    }
-                    const follow = followByNonTerminal.get(symbol.name) ?? new Set();
-                    const before = follow.size;
-                    const beta = production.rhs.slice(index + 1);
-                    const betaFirst = GrammarAnalysis.firstOfSequenceStatic(beta, firstByNonTerminal, nullable);
-                    GrammarAnalysis.addAll(follow, betaFirst);
-                    // When β is empty or nullable, inherit FOLLOW of the production lhs.
-                    if (beta.length === 0 || GrammarAnalysis.isSequenceNullableStatic(beta, nullable)) {
-                        const lhsFollow = followByNonTerminal.get(production.name) ?? new Set();
-                        GrammarAnalysis.addAll(follow, lhsFollow);
-                    }
-                    if (follow.size !== before) {
-                        changed = true;
-                    }
-                    followByNonTerminal.set(symbol.name, follow);
-                }
-            }
-        }
-        return followByNonTerminal;
-    }
-    /**
-     * Adds FIRST symbols for a symbol sequence into a working set.
-     *
-     * @param target - FIRST set being accumulated.
-     * @param symbols - Right-hand side sequence.
-     * @param firstByNonTerminal - Precomputed FIRST sets.
-     * @param nullable - Nullable non-terminal names.
-     */
-    static addFirstOfSequence(target, symbols, firstByNonTerminal, nullable) {
-        GrammarAnalysis.addAll(target, GrammarAnalysis.firstOfSequenceStatic(symbols, firstByNonTerminal, nullable));
-    }
-    /**
-     * Returns FIRST symbols for a symbol sequence using precomputed maps.
-     *
-     * @param symbols - Right-hand side sequence.
-     * @param firstByNonTerminal - Precomputed FIRST sets.
-     * @param nullable - Nullable non-terminal names.
-     */
-    static firstOfSequenceStatic(symbols, firstByNonTerminal, nullable) {
-        const result = new Set();
-        let allNullable = true;
-        for (const symbol of symbols) {
-            if (symbol.kind === 'nonTerminal') {
-                GrammarAnalysis.addAll(result, firstByNonTerminal.get(symbol.name) ?? new Set());
-                if (!nullable.has(symbol.name)) {
-                    allNullable = false;
-                    break;
-                }
-            }
-            else {
-                result.add((0, bnf_symbol_js_1.bnfParserSymbolKey)(symbol));
-                allNullable = false;
-                break;
-            }
-        }
-        if (allNullable) {
-            result.add(token_js_1.EOF_TOKEN_NAME);
-        }
-        return result;
-    }
-    /**
-     * Returns whether every symbol in a sequence is nullable.
-     *
-     * @param symbols - Right-hand side sequence.
-     * @param nullable - Nullable non-terminal names.
-     */
-    static isSequenceNullableStatic(symbols, nullable) {
-        if (symbols.length === 0) {
-            return true;
-        }
-        return symbols.every((symbol) => symbol.kind === 'nonTerminal' && nullable.has(symbol.name));
-    }
-    /**
-     * Adds all members of `source` into `target`.
-     *
-     * @param target - Destination set.
-     * @param source - Source set.
-     */
-    static addAll(target, source) {
-        for (const value of source) {
-            target.add(value);
-        }
-    }
-}
-exports.GrammarAnalysis = GrammarAnalysis;
-/**
- * Computes nullable, FIRST, and FOLLOW sets for a BNF grammar.
- *
- * @param grammar - Plain BNF grammar to analyze.
- * @returns Nullable, FIRST, and FOLLOW analysis for the grammar.
- */
-function analyzeGrammar(grammar) {
-    return new GrammarAnalysis(grammar);
-}
-/**
- * Returns a readable production label for diagnostics and tests.
- *
- * @param production - Production to format.
- */
-function formatBnfProduction(production) {
-    if (production.rhs.length === 0) {
-        return `${production.name} → ε`;
-    }
-    const rhs = production.rhs.map((symbol) => (0, bnf_symbol_js_1.bnfSymbolKey)(symbol)).join(' ');
-    return `${production.name} → ${rhs}`;
-}
-/**
- * Returns whether a grammar uses the augmented `$accept` start production.
- *
- * @param grammar - Grammar to inspect.
- */
-function isAugmentedGrammar(grammar) {
-    return grammar.startSymbol === bnf_grammar_js_1.AUGMENTED_START_SYMBOL;
-}
-//# sourceMappingURL=first-follow.js.map

package/dist/lib-cjs/parse-table/analysis/first-follow.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"first-follow.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/first-follow.ts"],"names":[],"mappings":";;;AAsYA,wCAGC;AAOD,kDAUC;AAOD,gDAGC;AApaD,mDAAsD;AAEtD,0DAAgF;AAEhF,wDAAwF;AAExF;;GAEG;AACH,MAAa,eAAe;IAEP,QAAQ,CAAsB;IAC9B,kBAAkB,CAA2C;IAC7D,mBAAmB,CAA2C;IAE/E;;;;OAIG;IACH,YAAmB,OAAmB;QAElC,IAAI,CAAC,QAAQ,GAAG,eAAe,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,CAAC,kBAAkB,GAAG,eAAe,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/E,IAAI,CAAC,mBAAmB,GAAG,eAAe,CAAC,aAAa,CACpD,OAAO,EACP,IAAI,CAAC,kBAAkB,EACvB,IAAI,CAAC,QAAQ,CAChB,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACI,UAAU,CAAC,IAAY;QAE1B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,IAAY;QAElC,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IAClE,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,IAAY;QAEnC,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,eAAe,CAAC,OAA6B;QAEhD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,IAAI,WAAW,GAAG,IAAI,CAAC;QAEvB,wFAAwF;QACxF,KAAK,MAAM,MAAM,IAAI,OAAO,EAC5B,CAAC;YACG,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC/C,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YAE5C,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAClC,CAAC;gBACG,WAAW,GAAG,KAAK,CAAC;gBACpB,MAAM;YACV,CAAC;QACL,CAAC;QAED,yDAAyD;QACzD,IAAI,WAAW,EACf,CAAC;YACG,MAAM,CAAC,GAAG,CAAC,yBAAc,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,MAAiB;QAElC,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EACjC,CAAC;YACG,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,IAAI,GAAG,CAAS,CAAC,IAAA,kCAAkB,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;;;OAIG;IACI,gBAAgB,CAAC,MAAiB;QAErC,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EACjC,CAAC;YACG,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,eAAe,CAAC,OAAmB;QAE9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,2EAA2E;QAC3E,OAAO,OAAO,EACd,CAAC;YACG,OAAO,GAAG,KAAK,CAAC;YAEhB,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW,EAC5C,CAAC;gBACG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EACjE,CAAC;oBACG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBAC9B,OAAO,GAAG,IAAI,CAAC;oBACf,SAAS;gBACb,CAAC;gBAED,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAChC,MAAM,CAAC,IAAI,KAAK,aAAa,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAC/D,CAAC;oBACG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,EAClC,CAAC;wBACG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;wBAC9B,OAAO,GAAG,IAAI,CAAC;oBACnB,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,YAAY,CACvB,OAAmB,EACnB,QAA6B;QAG7B,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE1D,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,gBAAgB,EAAE,EAC7C,CAAC;YACG,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,qEAAqE;QACrE,OAAO,OAAO,EACd,CAAC;YACG,OAAO,GAAG,KAAK,CAAC;YAEhB,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW,EAC5C,CAAC;gBACG,MAAM,KAAK,GAAG,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBAC3E,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;gBAC1B,eAAe,CAAC,kBAAkB,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,EAAE,kBAAkB,EAAE,QAAQ,CAAC,CAAC;gBAExF,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM,EACzB,CAAC;oBACG,OAAO,GAAG,IAAI,CAAC;gBACnB,CAAC;gBAED,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACnD,CAAC;QACL,CAAC;QAED,OAAO,kBAAkB,CAAC;IAC9B,CAAC;IAED;;;;;;;OAOG;IACK,MAAM,CAAC,aAAa,CACxB,OAAmB,EACnB,kBAA4D,EAC5D,QAA6B;QAG7B,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE3D,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,gBAAgB,EAAE,EAC7C,CAAC;YACG,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC;QACrD,CAAC;QAED,qDAAqD;QACrD,MAAM,WAAW,GAAG,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACtF,WAAW,CAAC,GAAG,CAAC,yBAAc,CAAC,CAAC;QAChC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAE1D,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,oEAAoE;QACpE,OAAO,OAAO,EACd,CAAC;YACG,OAAO,GAAG,KAAK,CAAC;YAEhB,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW,EAC5C,CAAC;gBACG,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAC7D,CAAC;oBACG,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAErC,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EACjC,CAAC;wBACG,SAAS;oBACb,CAAC;oBAED,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;oBACzE,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;oBAC3B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;oBAC7C,MAAM,SAAS,GAAG,eAAe,CAAC,qBAAqB,CACnD,IAAI,EACJ,kBAAkB,EAClB,QAAQ,CACX,CAAC;oBAEF,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAE1C,qEAAqE;oBACrE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,eAAe,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,EACjF,CAAC;wBACG,MAAM,SAAS,GAAG,mBAAmB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;wBAChF,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;oBAC9C,CAAC;oBAED,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAC1B,CAAC;wBACG,OAAO,GAAG,IAAI,CAAC;oBACnB,CAAC;oBAED,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBACjD,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,mBAAmB,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACK,MAAM,CAAC,kBAAkB,CAC7B,MAAmB,EACnB,OAA6B,EAC7B,kBAAoD,EACpD,QAA6B;QAG7B,eAAe,CAAC,MAAM,CAClB,MAAM,EACN,eAAe,CAAC,qBAAqB,CAAC,OAAO,EAAE,kBAAkB,EAAE,QAAQ,CAAC,CAC/E,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,qBAAqB,CAChC,OAA6B,EAC7B,kBAA4D,EAC5D,QAA6B;QAG7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,IAAI,WAAW,GAAG,IAAI,CAAC;QAEvB,KAAK,MAAM,MAAM,IAAI,OAAO,EAC5B,CAAC;YACG,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EACjC,CAAC;gBACG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC;gBAEzF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAC9B,CAAC;oBACG,WAAW,GAAG,KAAK,CAAC;oBACpB,MAAM;gBACV,CAAC;YACL,CAAC;iBAED,CAAC;gBACG,MAAM,CAAC,GAAG,CAAC,IAAA,kCAAkB,EAAC,MAAM,CAAC,CAAC,CAAC;gBACvC,WAAW,GAAG,KAAK,CAAC;gBACpB,MAAM;YACV,CAAC;QACL,CAAC;QAED,IAAI,WAAW,EACf,CAAC;YACG,MAAM,CAAC,GAAG,CAAC,yBAAc,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,wBAAwB,CACnC,OAA6B,EAC7B,QAA6B;QAG7B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EACxB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAC5B,MAAM,CAAC,IAAI,KAAK,aAAa,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,MAAM,CAAC,MAAmB,EAAE,MAA2B;QAElE,KAAK,MAAM,KAAK,IAAI,MAAM,EAC1B,CAAC;YACG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;CACJ;AArXD,0CAqXC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,OAAmB;IAE9C,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAAC,UAAyB;IAEzD,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,EAC/B,CAAC;QACG,OAAO,GAAG,UAAU,CAAC,IAAI,MAAM,CAAC;IACpC,CAAC;IAED,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAA,4BAAY,EAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAE3E,OAAO,GAAG,UAAU,CAAC,IAAI,MAAM,GAAG,EAAE,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,OAAmB;IAElD,OAAO,OAAO,CAAC,WAAW,KAAK,uCAAsB,CAAC;AAC1D,CAAC"}

package/dist/lib-cjs/parse-table/analysis/index.js

@@ -1,9 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isAugmentedGrammar = exports.GrammarAnalysis = exports.formatBnfProduction = exports.analyzeGrammar = void 0;
-var first_follow_js_1 = require("./first-follow.js");
-Object.defineProperty(exports, "analyzeGrammar", { enumerable: true, get: function () { return first_follow_js_1.analyzeGrammar; } });
-Object.defineProperty(exports, "formatBnfProduction", { enumerable: true, get: function () { return first_follow_js_1.formatBnfProduction; } });
-Object.defineProperty(exports, "GrammarAnalysis", { enumerable: true, get: function () { return first_follow_js_1.GrammarAnalysis; } });
-Object.defineProperty(exports, "isAugmentedGrammar", { enumerable: true, get: function () { return first_follow_js_1.isAugmentedGrammar; } });
-//# sourceMappingURL=index.js.map

package/dist/lib-cjs/parse-table/analysis/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/index.ts"],"names":[],"mappings":";;;AAAA,qDAA6G;AAApG,iHAAA,cAAc,OAAA;AAAE,sHAAA,mBAAmB,OAAA;AAAE,kHAAA,eAAe,OAAA;AAAE,qHAAA,kBAAkB,OAAA"}

package/dist/lib-cjs/parse-table/bnf/bnf-grammar.js

@@ -1,140 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BnfGrammar = exports.AUGMENTED_START_SYMBOL = void 0;
-const bnf_symbol_js_1 = require("./bnf-symbol.js");
-/** Sentinel non-terminal introducing the augmented start production. */
-exports.AUGMENTED_START_SYMBOL = '$accept';
-/**
- * Plain BNF grammar used for LR table construction.
- */
-class BnfGrammar {
-    startSymbol;
-    productions;
-    tokenNames;
-    productionsByName;
-    productionById;
-    /**
-     * Creates a BNF grammar from its productions and token inventory.
-     *
-     * @param startSymbol - Entry non-terminal from the source grammar.
-     * @param productions - Flat BNF productions with stable ids.
-     * @param tokenNames - Token rule names treated as terminals.
-     */
-    constructor(startSymbol, productions, tokenNames) {
-        this.startSymbol = startSymbol;
-        this.productions = productions;
-        this.tokenNames = tokenNames;
-        // Index productions by left-hand side name.
-        const productionsByName = new Map();
-        const productionById = new Map();
-        for (const production of productions) {
-            const existing = productionsByName.get(production.name) ?? [];
-            existing.push(production);
-            productionsByName.set(production.name, existing);
-            productionById.set(production.id, production);
-        }
-        this.productionsByName = productionsByName;
-        this.productionById = productionById;
-    }
-    /**
-     * Returns productions with a given left-hand side non-terminal.
-     *
-     * @param name - Non-terminal name to look up.
-     */
-    productionsFor(name) {
-        return this.productionsByName.get(name) ?? [];
-    }
-    /**
-     * Returns a production by its stable id.
-     *
-     * @param id - Production id assigned during desugaring.
-     */
-    production(id) {
-        return this.productionById.get(id) ?? null;
-    }
-    /**
-     * Whether a name is a declared token rule.
-     *
-     * @param name - Candidate token name.
-     */
-    isToken(name) {
-        return this.tokenNames.includes(name);
-    }
-    /**
-     * Returns every non-terminal name appearing in the grammar.
-     */
-    nonTerminalNames() {
-        const names = new Set();
-        for (const production of this.productions) {
-            names.add(production.name);
-            for (const symbol of production.rhs) {
-                if (symbol.kind === 'nonTerminal') {
-                    names.add(symbol.name);
-                }
-            }
-        }
-        return [...names].sort();
-    }
-    /**
-     * Returns every terminal key appearing on a production right-hand side.
-     */
-    terminalKeys() {
-        const keys = new Set();
-        for (const production of this.productions) {
-            for (const symbol of production.rhs) {
-                if (symbol.kind === 'terminal' || symbol.kind === 'token') {
-                    keys.add((0, bnf_symbol_js_1.bnfParserSymbolKey)(symbol));
-                }
-            }
-        }
-        return [...keys].sort();
-    }
-    /**
-     * Builds an augmented grammar with `$accept → startSymbol`.
-     */
-    augment() {
-        const acceptProduction = {
-            id: this.productions.length,
-            name: exports.AUGMENTED_START_SYMBOL,
-            rhs: [
-                {
-                    kind: 'nonTerminal',
-                    name: this.startSymbol,
-                    binding: null,
-                },
-            ],
-            variant: null,
-            origin: exports.AUGMENTED_START_SYMBOL,
-        };
-        return new BnfGrammar(exports.AUGMENTED_START_SYMBOL, [...this.productions, acceptProduction], this.tokenNames);
-    }
-    /**
-     * Returns whether a symbol key is a shift symbol (terminal or token).
-     *
-     * @param key - Encoded symbol from {@link bnfSymbolKey}.
-     */
-    isTerminalKey(key) {
-        if (key.startsWith('"') && key.endsWith('"')) {
-            return true;
-        }
-        const bareName = key.includes(':') ? key.slice(key.indexOf(':') + 1) : key;
-        return this.tokenNames.includes(bareName);
-    }
-    /**
-     * Finds the BNF symbol matching an encoded terminal key on some production rhs.
-     *
-     * @param key - Encoded terminal key.
-     */
-    terminalSymbolForKey(key) {
-        for (const production of this.productions) {
-            for (const symbol of production.rhs) {
-                if (symbol.kind !== 'nonTerminal' && (0, bnf_symbol_js_1.bnfParserSymbolKey)(symbol) === key) {
-                    return symbol;
-                }
-            }
-        }
-        return null;
-    }
-}
-exports.BnfGrammar = BnfGrammar;
-//# sourceMappingURL=bnf-grammar.js.map

package/dist/lib-cjs/parse-table/bnf/bnf-grammar.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bnf-grammar.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/bnf-grammar.ts"],"names":[],"mappings":";;;AACA,mDAAmF;AAEnF,wEAAwE;AAC3D,QAAA,sBAAsB,GAAG,SAAS,CAAC;AAEhD;;GAEG;AACH,MAAa,UAAU;IAaC;IACA;IACA;IAbH,iBAAiB,CAAgD;IACjE,cAAc,CAAqC;IAEpE;;;;;;OAMG;IACH,YACoB,WAAmB,EACnB,WAAqC,EACrC,UAA6B;QAF7B,gBAAW,GAAX,WAAW,CAAQ;QACnB,gBAAW,GAAX,WAAW,CAA0B;QACrC,eAAU,GAAV,UAAU,CAAmB;QAG7C,4CAA4C;QAC5C,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAA2B,CAAC;QAC7D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAyB,CAAC;QAExD,KAAK,MAAM,UAAU,IAAI,WAAW,EACpC,CAAC;YACG,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC9D,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC1B,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACjD,cAAc,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,IAAY;QAE9B,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACI,UAAU,CAAC,EAAU;QAExB,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IAC/C,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,IAAY;QAEvB,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACI,gBAAgB;QAEnB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAEhC,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EACzC,CAAC;YACG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAE3B,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,EACnC,CAAC;gBACG,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,EACjC,CAAC;oBACG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,YAAY;QAEf,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EACzC,CAAC;YACG,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,EACnC,CAAC;gBACG,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EACzD,CAAC;oBACG,IAAI,CAAC,GAAG,CAAC,IAAA,kCAAkB,EAAC,MAAM,CAAC,CAAC,CAAC;gBACzC,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,OAAO;QAEV,MAAM,gBAAgB,GAAkB;YACpC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;YAC3B,IAAI,EAAE,8BAAsB;YAC5B,GAAG,EAAE;gBACD;oBACI,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,IAAI,CAAC,WAAW;oBACtB,OAAO,EAAE,IAAI;iBAChB;aACJ;YACD,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,8BAAsB;SACjC,CAAC;QAEF,OAAO,IAAI,UAAU,CACjB,8BAAsB,EACtB,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,gBAAgB,CAAC,EACvC,IAAI,CAAC,UAAU,CAClB,CAAC;IACN,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,GAAW;QAE5B,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAC5C,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAE3E,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACI,oBAAoB,CAAC,GAAW;QAEnC,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EACzC,CAAC;YACG,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,GAAG,EACnC,CAAC;gBACG,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,IAAI,IAAA,kCAAkB,EAAC,MAAM,CAAC,KAAK,GAAG,EACvE,CAAC;oBACG,OAAO,MAAM,CAAC;gBAClB,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AA3KD,gCA2KC"}

package/dist/lib-cjs/parse-table/bnf/bnf-production.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=bnf-production.js.map

package/dist/lib-cjs/parse-table/bnf/bnf-production.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bnf-production.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/bnf-production.ts"],"names":[],"mappings":""}