parser-lr 0.0.0 → 0.2.0

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

@@ -0,0 +1,15 @@
+import { ParserLrError } from './errors/parser-lr-error.js';
+/**
+ * Thrown when parse output cannot be formatted for a requested interchange format.
+ */
+export class ParseOutputError extends ParserLrError {
+    /**
+     * Creates a parse output formatting error.
+     *
+     * @param format - Requested output format name.
+     */
+    constructor(format) {
+        super(`Unsupported output format ${JSON.stringify(format)}`);
+    }
+}
+//# sourceMappingURL=parse-output-error.js.map

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

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

package/dist/lib/parse-output.d.ts

@@ -0,0 +1,10 @@
+import type { AstNode } from './ast/ast-node.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.
+ */
+export declare function formatParseOutput(tree: AstNode | null, format: string): string;
+//# sourceMappingURL=parse-output.d.ts.map

package/dist/lib/parse-output.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse-output.d.ts","sourceRoot":"","sources":["../../src/lib/parse-output.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAGjD;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAQ9E"}

package/dist/lib/parse-output.js

@@ -0,0 +1,15 @@
+import { ParseOutputError } from './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.
+ */
+export function formatParseOutput(tree, format) {
+    if (format !== 'json') {
+        throw new ParseOutputError(format);
+    }
+    return JSON.stringify({ ast: tree }, null, 4);
+}
+//# sourceMappingURL=parse-output.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"parse-output.js","sourceRoot":"","sources":["../../src/lib/parse-output.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAoB,EAAE,MAAc;IAElE,IAAI,MAAM,KAAK,MAAM,EACrB,CAAC;QACG,MAAM,IAAI,gBAAgB,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/parse-table/analysis/first-follow.d.ts

@@ -0,0 +1,124 @@
+import { type BnfGrammar } from '../bnf/bnf-grammar.js';
+import type { BnfProduction } from '../bnf/bnf-production.js';
+import { type BnfSymbol } from '../bnf/bnf-symbol.js';
+/**
+ * Nullable non-terminals and FIRST/FOLLOW sets for a BNF grammar.
+ */
+export declare class GrammarAnalysis {
+    private readonly nullable;
+    private readonly firstByNonTerminal;
+    private readonly followByNonTerminal;
+    /**
+     * Computes nullable, FIRST, and FOLLOW sets for a BNF grammar.
+     *
+     * @param grammar - Plain BNF grammar to analyze.
+     */
+    constructor(grammar: BnfGrammar);
+    /**
+     * Returns whether a non-terminal can derive the empty string.
+     *
+     * @param name - Non-terminal name to test.
+     */
+    isNullable(name: string): boolean;
+    /**
+     * Returns FIRST symbols for a non-terminal as encoded terminal keys.
+     *
+     * @param name - Non-terminal name to look up.
+     */
+    firstOfNonTerminal(name: string): ReadonlySet<string>;
+    /**
+     * Returns FOLLOW symbols for a non-terminal as encoded terminal keys.
+     *
+     * @param name - Non-terminal name to look up.
+     */
+    followOfNonTerminal(name: string): ReadonlySet<string>;
+    /**
+     * Returns FIRST symbols for a symbol sequence.
+     *
+     * @param symbols - Right-hand side prefix or full sequence.
+     */
+    firstOfSequence(symbols: readonly BnfSymbol[]): ReadonlySet<string>;
+    /**
+     * Returns FIRST symbols for one grammar symbol.
+     *
+     * @param symbol - Terminal, token, or non-terminal symbol.
+     */
+    firstOfSymbol(symbol: BnfSymbol): ReadonlySet<string>;
+    /**
+     * Returns whether a symbol can begin with the empty string.
+     *
+     * @param symbol - Terminal, token, or non-terminal symbol.
+     */
+    isSymbolNullable(symbol: BnfSymbol): boolean;
+    /**
+     * Computes nullable non-terminals by fixed-point iteration.
+     *
+     * @param grammar - Plain BNF grammar to analyze.
+     */
+    private static computeNullable;
+    /**
+     * Computes FIRST sets for every non-terminal.
+     *
+     * @param grammar - Plain BNF grammar to analyze.
+     * @param nullable - Nullable non-terminal names.
+     */
+    private static computeFirst;
+    /**
+     * 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.
+     */
+    private static computeFollow;
+    /**
+     * 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.
+     */
+    private static addFirstOfSequence;
+    /**
+     * 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.
+     */
+    private static firstOfSequenceStatic;
+    /**
+     * Returns whether every symbol in a sequence is nullable.
+     *
+     * @param symbols - Right-hand side sequence.
+     * @param nullable - Nullable non-terminal names.
+     */
+    private static isSequenceNullableStatic;
+    /**
+     * Adds all members of `source` into `target`.
+     *
+     * @param target - Destination set.
+     * @param source - Source set.
+     */
+    private static addAll;
+}
+/**
+ * Computes nullable, FIRST, and FOLLOW sets for a BNF grammar.
+ *
+ * @param grammar - Plain BNF grammar to analyze.
+ */
+export declare function analyzeGrammar(grammar: BnfGrammar): GrammarAnalysis;
+/**
+ * Returns a readable production label for diagnostics and tests.
+ *
+ * @param production - Production to format.
+ */
+export declare function formatBnfProduction(production: BnfProduction): string;
+/**
+ * Returns whether a grammar uses the augmented `$accept` start production.
+ *
+ * @param grammar - Grammar to inspect.
+ */
+export declare function isAugmentedGrammar(grammar: BnfGrammar): boolean;
+//# sourceMappingURL=first-follow.d.ts.map

package/dist/lib/parse-table/analysis/first-follow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"first-follow.d.ts","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/first-follow.ts"],"names":[],"mappings":"AAEA,OAAO,EAA0B,KAAK,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAChF,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,EAAoC,KAAK,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAExF;;GAEG;AACH,qBAAa,eAAe;IAExB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsB;IAC/C,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAA2C;IAC9E,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAA2C;IAE/E;;;;OAIG;gBACgB,OAAO,EAAE,UAAU;IAWtC;;;;OAIG;IACI,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAKxC;;;;OAIG;IACI,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;IAK5D;;;;OAIG;IACI,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;IAK7D;;;;OAIG;IACI,eAAe,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC;IAyB1E;;;;OAIG;IACI,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC;IAU5D;;;;OAIG;IACI,gBAAgB,CAAC,MAAM,EAAE,SAAS,GAAG,OAAO;IAUnD;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAiC9B;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,YAAY;IAoC3B;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa;IAgE5B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAajC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAqCpC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAcvC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,MAAM;CAOxB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,UAAU,GAAG,eAAe,CAGnE;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,UAAU,EAAE,aAAa,GAAG,MAAM,CAUrE;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,UAAU,GAAG,OAAO,CAG/D"}

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

@@ -0,0 +1,274 @@
+import { EOF_TOKEN_NAME } from '../../lexer/token.js';
+import { AUGMENTED_START_SYMBOL } from '../bnf/bnf-grammar.js';
+import { bnfParserSymbolKey, bnfSymbolKey } from '../bnf/bnf-symbol.js';
+/**
+ * Nullable non-terminals and FIRST/FOLLOW sets for a BNF grammar.
+ */
+export 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.
+     */
+    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.
+     */
+    firstOfSequence(symbols) {
+        const result = new Set();
+        let allNullable = true;
+        for (const symbol of symbols) {
+            const symbolFirst = this.firstOfSymbol(symbol);
+            GrammarAnalysis.addAll(result, symbolFirst);
+            if (!this.isSymbolNullable(symbol)) {
+                allNullable = false;
+                break;
+            }
+        }
+        if (allNullable) {
+            result.add(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([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.
+     */
+    static computeNullable(grammar) {
+        const nullable = new Set();
+        let changed = true;
+        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.
+     */
+    static computeFirst(grammar, nullable) {
+        const firstByNonTerminal = new Map();
+        for (const name of grammar.nonTerminalNames()) {
+            firstByNonTerminal.set(name, new Set());
+        }
+        let changed = true;
+        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.
+     */
+    static computeFollow(grammar, firstByNonTerminal, nullable) {
+        const followByNonTerminal = new Map();
+        for (const name of grammar.nonTerminalNames()) {
+            followByNonTerminal.set(name, new Set());
+        }
+        const startFollow = followByNonTerminal.get(grammar.startSymbol) ?? new Set();
+        startFollow.add(EOF_TOKEN_NAME);
+        followByNonTerminal.set(grammar.startSymbol, startFollow);
+        let changed = true;
+        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);
+                    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(bnfParserSymbolKey(symbol));
+                allNullable = false;
+                break;
+            }
+        }
+        if (allNullable) {
+            result.add(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);
+        }
+    }
+}
+/**
+ * Computes nullable, FIRST, and FOLLOW sets for a BNF grammar.
+ *
+ * @param grammar - Plain BNF grammar to analyze.
+ */
+export function analyzeGrammar(grammar) {
+    return new GrammarAnalysis(grammar);
+}
+/**
+ * Returns a readable production label for diagnostics and tests.
+ *
+ * @param production - Production to format.
+ */
+export function formatBnfProduction(production) {
+    if (production.rhs.length === 0) {
+        return `${production.name} → ε`;
+    }
+    const rhs = production.rhs.map((symbol) => bnfSymbolKey(symbol)).join(' ');
+    return `${production.name} → ${rhs}`;
+}
+/**
+ * Returns whether a grammar uses the augmented `$accept` start production.
+ *
+ * @param grammar - Grammar to inspect.
+ */
+export function isAugmentedGrammar(grammar) {
+    return grammar.startSymbol === AUGMENTED_START_SYMBOL;
+}
+//# sourceMappingURL=first-follow.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"first-follow.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/first-follow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,OAAO,EAAE,sBAAsB,EAAmB,MAAM,uBAAuB,CAAC;AAEhF,OAAO,EAAE,kBAAkB,EAAE,YAAY,EAAkB,MAAM,sBAAsB,CAAC;AAExF;;GAEG;AACH,MAAM,OAAO,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;;;;OAIG;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;;;;OAIG;IACI,eAAe,CAAC,OAA6B;QAEhD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,IAAI,WAAW,GAAG,IAAI,CAAC;QAEvB,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,IAAI,WAAW,EACf,CAAC;YACG,MAAM,CAAC,GAAG,CAAC,cAAc,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,kBAAkB,CAAC,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;;;;OAIG;IACK,MAAM,CAAC,eAAe,CAAC,OAAmB;QAE9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,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;;;;;OAKG;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,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;;;;;;OAMG;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,MAAM,WAAW,GAAG,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACtF,WAAW,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAChC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAE1D,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,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,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,kBAAkB,CAAC,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,cAAc,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;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,OAAmB;IAE9C,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,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,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAE3E,OAAO,GAAG,UAAU,CAAC,IAAI,MAAM,GAAG,EAAE,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,OAAmB;IAElD,OAAO,OAAO,CAAC,WAAW,KAAK,sBAAsB,CAAC;AAC1D,CAAC"}

package/dist/lib/parse-table/analysis/index.d.ts

@@ -0,0 +1,2 @@
+export { analyzeGrammar, formatBnfProduction, GrammarAnalysis, isAugmentedGrammar } from './first-follow.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/lib/parse-table/analysis/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC"}

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

@@ -0,0 +1,2 @@
+export { analyzeGrammar, formatBnfProduction, GrammarAnalysis, isAugmentedGrammar } from './first-follow.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/analysis/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/lib/parse-table/bnf/bnf-grammar.d.ts

@@ -0,0 +1,65 @@
+import type { BnfProduction } from './bnf-production.js';
+import { type BnfSymbol } from './bnf-symbol.js';
+/** Sentinel non-terminal introducing the augmented start production. */
+export declare const AUGMENTED_START_SYMBOL = "$accept";
+/**
+ * Plain BNF grammar used for LR table construction.
+ */
+export declare class BnfGrammar {
+    readonly startSymbol: string;
+    readonly productions: readonly BnfProduction[];
+    readonly tokenNames: readonly string[];
+    private readonly productionsByName;
+    private readonly 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: string, productions: readonly BnfProduction[], tokenNames: readonly string[]);
+    /**
+     * Returns productions with a given left-hand side non-terminal.
+     *
+     * @param name - Non-terminal name to look up.
+     */
+    productionsFor(name: string): readonly BnfProduction[];
+    /**
+     * Returns a production by its stable id.
+     *
+     * @param id - Production id assigned during desugaring.
+     */
+    production(id: number): BnfProduction | null;
+    /**
+     * Whether a name is a declared token rule.
+     *
+     * @param name - Candidate token name.
+     */
+    isToken(name: string): boolean;
+    /**
+     * Returns every non-terminal name appearing in the grammar.
+     */
+    nonTerminalNames(): readonly string[];
+    /**
+     * Returns every terminal key appearing on a production right-hand side.
+     */
+    terminalKeys(): readonly string[];
+    /**
+     * Builds an augmented grammar with `$accept → startSymbol`.
+     */
+    augment(): BnfGrammar;
+    /**
+     * Returns whether a symbol key is a shift symbol (terminal or token).
+     *
+     * @param key - Encoded symbol from {@link bnfSymbolKey}.
+     */
+    isTerminalKey(key: string): boolean;
+    /**
+     * Finds the BNF symbol matching an encoded terminal key on some production rhs.
+     *
+     * @param key - Encoded terminal key.
+     */
+    terminalSymbolForKey(key: string): BnfSymbol | null;
+}
+//# sourceMappingURL=bnf-grammar.d.ts.map

package/dist/lib/parse-table/bnf/bnf-grammar.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bnf-grammar.d.ts","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/bnf-grammar.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAoC,KAAK,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEnF,wEAAwE;AACxE,eAAO,MAAM,sBAAsB,YAAY,CAAC;AAEhD;;GAEG;AACH,qBAAa,UAAU;aAaC,WAAW,EAAE,MAAM;aACnB,WAAW,EAAE,SAAS,aAAa,EAAE;aACrC,UAAU,EAAE,SAAS,MAAM,EAAE;IAbjD,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAgD;IAClF,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAqC;IAEpE;;;;;;OAMG;gBAEiB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,SAAS,aAAa,EAAE,EACrC,UAAU,EAAE,SAAS,MAAM,EAAE;IAmBjD;;;;OAIG;IACI,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,aAAa,EAAE;IAK7D;;;;OAIG;IACI,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa,GAAG,IAAI;IAKnD;;;;OAIG;IACI,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAKrC;;OAEG;IACI,gBAAgB,IAAI,SAAS,MAAM,EAAE;IAoB5C;;OAEG;IACI,YAAY,IAAI,SAAS,MAAM,EAAE;IAkBxC;;OAEG;IACI,OAAO,IAAI,UAAU;IAuB5B;;;;OAIG;IACI,aAAa,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAY1C;;;;OAIG;IACI,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;CAe7D"}