parser-lr 0.4.1 → 0.6.0

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

@@ -0,0 +1,39 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.bnfSymbolKey = bnfSymbolKey;
+exports.bnfParserSymbolKey = bnfParserSymbolKey;
+/**
+ * Returns a stable string key for a BNF symbol, including binding metadata.
+ *
+ * @param symbol - Symbol to encode.
+ */
+function bnfSymbolKey(symbol) {
+    switch (symbol.kind) {
+        case 'terminal':
+            return `"${symbol.value}"`;
+        case 'nonTerminal':
+            return symbol.binding === null
+                ? symbol.name
+                : `[${symbol.binding}]:${symbol.name}`;
+        case 'token':
+            return symbol.binding === null
+                ? symbol.name
+                : `[${symbol.binding}]:${symbol.name}`;
+    }
+}
+/**
+ * Returns the parser symbol key used in ACTION and GOTO tables.
+ *
+ * @param symbol - Symbol to encode.
+ */
+function bnfParserSymbolKey(symbol) {
+    switch (symbol.kind) {
+        case 'terminal':
+            return `"${symbol.value}"`;
+        case 'nonTerminal':
+            return symbol.name;
+        case 'token':
+            return symbol.name;
+    }
+}
+//# sourceMappingURL=bnf-symbol.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bnf-symbol.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/bnf-symbol.ts"],"names":[],"mappings":";;AAuCA,oCAiBC;AAOD,gDAaC;AA1CD;;;;GAIG;AACH,SAAgB,YAAY,CAAC,MAAiB;IAE1C,QAAQ,MAAM,CAAC,IAAI,EACnB,CAAC;QACG,KAAK,UAAU;YACX,OAAO,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC;QAE/B,KAAK,aAAa;YACd,OAAO,MAAM,CAAC,OAAO,KAAK,IAAI;gBAC1B,CAAC,CAAC,MAAM,CAAC,IAAI;gBACb,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;QAE/C,KAAK,OAAO;YACR,OAAO,MAAM,CAAC,OAAO,KAAK,IAAI;gBAC1B,CAAC,CAAC,MAAM,CAAC,IAAI;gBACb,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;IACnD,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,kBAAkB,CAAC,MAAiB;IAEhD,QAAQ,MAAM,CAAC,IAAI,EACnB,CAAC;QACG,KAAK,UAAU;YACX,OAAO,IAAI,MAAM,CAAC,KAAK,GAAG,CAAC;QAE/B,KAAK,aAAa;YACd,OAAO,MAAM,CAAC,IAAI,CAAC;QAEvB,KAAK,OAAO;YACR,OAAO,MAAM,CAAC,IAAI,CAAC;IAC3B,CAAC;AACL,CAAC"}

package/dist/lib-cjs/parse-table/bnf/desugar-ebnf.js

@@ -0,0 +1,224 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EbnfDesugarer = void 0;
+exports.desugarEbnf = desugarEbnf;
+const bnf_grammar_js_1 = require("./bnf-grammar.js");
+const token_inventory_js_1 = require("../token-inventory.js");
+/**
+ * Expands EBNF productions into plain BNF suitable for LR analysis.
+ */
+class EbnfDesugarer {
+    grammar;
+    tokenNames;
+    productions = [];
+    nextProductionId = 0;
+    nextSyntheticId = 0;
+    /**
+     * Creates a desugarer for a parsed grammar model.
+     *
+     * @param grammar - Parsed `.grammar` file model.
+     */
+    constructor(grammar) {
+        this.grammar = grammar;
+        this.tokenNames = (0, token_inventory_js_1.tokenInventory)(grammar);
+    }
+    /**
+     * Desugars all parser productions into a flat BNF grammar.
+     *
+     * @returns Plain BNF grammar with synthetic non-terminals for EBNF constructs.
+     */
+    desugar() {
+        // Expand each declared production into one or more BNF productions.
+        for (const production of this.grammar.productions) {
+            this.desugarProduction(production);
+        }
+        return new bnf_grammar_js_1.BnfGrammar(this.grammar.startSymbol, this.productions, this.tokenNames);
+    }
+    /**
+     * Expands one named production into plain BNF alternatives.
+     *
+     * @param production - Source production from the grammar model.
+     */
+    desugarProduction(production) {
+        const alternatives = this.expandExpression(production.name, production.expression, null);
+        // Record one BNF production per desugared alternative.
+        for (const alternative of alternatives) {
+            this.addProduction(production.name, alternative.symbols, alternative.variant, production.name);
+        }
+    }
+    /**
+     * Records one BNF production with the next stable id.
+     *
+     * @param name - Left-hand side non-terminal.
+     * @param rhs - Right-hand side symbol sequence; empty for epsilon.
+     * @param variant - Choice label preserved from the source grammar, if any.
+     * @param origin - Source production or synthetic construct name.
+     */
+    addProduction(name, rhs, variant, origin) {
+        this.productions.push({
+            id: this.nextProductionId,
+            name,
+            rhs,
+            variant,
+            origin,
+        });
+        this.nextProductionId += 1;
+    }
+    /**
+     * Allocates a fresh synthetic non-terminal name scoped to a source production.
+     *
+     * @param ownerName - Production currently being expanded.
+     * @param suffix - Synthetic construct kind.
+     */
+    freshName(ownerName, suffix) {
+        const syntheticName = `${ownerName}$${suffix}_${this.nextSyntheticId}`;
+        this.nextSyntheticId += 1;
+        return syntheticName;
+    }
+    /**
+     * Expands an EBNF expression into zero or more BNF right-hand sides.
+     *
+     * @param ownerName - Production providing scope for synthetic non-terminals.
+     * @param expression - EBNF expression subtree.
+     * @param variant - Choice label inherited from an outer alternative.
+     */
+    expandExpression(ownerName, expression, variant) {
+        switch (expression.kind) {
+            case 'reference':
+                return [{
+                        symbols: [this.resolveReference(null, expression.name)],
+                        variant,
+                    }];
+            case 'boundReference':
+                return [{
+                        symbols: [this.resolveReference(expression.binding, expression.name)],
+                        variant,
+                    }];
+            case 'terminal':
+                return [{
+                        symbols: [{ kind: 'terminal', value: expression.value }],
+                        variant,
+                    }];
+            case 'sequence':
+                return this.expandSequence(ownerName, expression.elements, variant);
+            case 'choice':
+                return expression.alternatives.flatMap((alternative) => this.expandExpression(ownerName, alternative.expression, alternative.label ?? variant));
+            case 'optional':
+                return this.expandOptional(ownerName, expression.element, variant);
+            case 'repeat':
+                return this.expandRepeat(ownerName, expression.element, variant);
+            case 'group':
+                return this.expandExpression(ownerName, expression.element, variant);
+        }
+    }
+    /**
+     * Expands a concatenated sequence by combining element alternatives.
+     *
+     * @param elements - Sequence members in source order.
+     * @param variant - Choice label inherited from an outer alternative.
+     */
+    expandSequence(ownerName, elements, variant) {
+        let results = [{ symbols: [], variant }];
+        // Cartesian product: combine each prefix alternative with each next-element alternative.
+        for (const element of elements) {
+            const elementAlternatives = this.expandExpression(ownerName, element, variant);
+            const combined = [];
+            for (const left of results) {
+                for (const right of elementAlternatives) {
+                    combined.push({
+                        symbols: [...left.symbols, ...right.symbols],
+                        variant: right.variant ?? left.variant,
+                    });
+                }
+            }
+            results = combined;
+        }
+        return results;
+    }
+    /**
+     * Expands `[ element ]` into epsilon and the element expansion.
+     *
+     * @param element - Optional sub-expression.
+     * @param variant - Choice label inherited from an outer alternative.
+     */
+    expandOptional(ownerName, element, variant) {
+        const inner = this.expandExpression(ownerName, element, variant);
+        return [
+            { symbols: [], variant },
+            ...inner,
+        ];
+    }
+    /**
+     * Expands `{ element }` using a fresh left-recursive list non-terminal.
+     *
+     * @param element - Repeated sub-expression.
+     * @param variant - Choice label inherited from an outer alternative.
+     */
+    expandRepeat(ownerName, element, variant) {
+        const repeatName = this.freshName(ownerName, 'repeat');
+        const elementAlternatives = this.expandExpression(repeatName, element, null);
+        const repeatReference = this.nonTerminalSymbol(repeatName, null);
+        // Build `R → α R` for each expansion of the repeated element.
+        for (const alternative of elementAlternatives) {
+            this.addProduction(repeatName, [...alternative.symbols, repeatReference], alternative.variant, repeatName);
+        }
+        // Add the epsilon base case `R → ε`.
+        this.addProduction(repeatName, [], null, repeatName);
+        return [{
+                symbols: [repeatReference],
+                variant,
+            }];
+    }
+    /**
+     * Builds a non-terminal symbol reference.
+     *
+     * @param name - Referenced production name.
+     * @param binding - Optional slot binding from the source grammar.
+     */
+    nonTerminalSymbol(name, binding) {
+        return {
+            kind: 'nonTerminal',
+            name,
+            binding,
+        };
+    }
+    /**
+     * Builds a token symbol reference.
+     *
+     * @param name - Referenced token rule name.
+     * @param binding - Optional slot binding from the source grammar.
+     */
+    tokenSymbol(name, binding) {
+        return {
+            kind: 'token',
+            name,
+            binding,
+        };
+    }
+    /**
+     * Resolves a bound or unbound reference to a token or non-terminal symbol.
+     *
+     * @param binding - Slot binding, or null for an unbound reference.
+     * @param name - Referenced symbol name.
+     */
+    resolveReference(binding, name) {
+        if (this.grammar.hasProduction(name)) {
+            return this.nonTerminalSymbol(name, binding);
+        }
+        if (this.tokenNames.includes(name)) {
+            return this.tokenSymbol(name, binding);
+        }
+        return this.nonTerminalSymbol(name, binding);
+    }
+}
+exports.EbnfDesugarer = EbnfDesugarer;
+/**
+ * Desugars a parsed grammar into plain BNF for LR table construction.
+ *
+ * @param grammar - Parsed `.grammar` file model.
+ * @returns Flat BNF grammar with synthetic non-terminals for EBNF constructs.
+ */
+function desugarEbnf(grammar) {
+    return new EbnfDesugarer(grammar).desugar();
+}
+//# sourceMappingURL=desugar-ebnf.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"desugar-ebnf.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/desugar-ebnf.ts"],"names":[],"mappings":";;;AAyUA,kCAGC;AAxUD,qDAA8C;AAG9C,8DAAuD;AAcvD;;GAEG;AACH,MAAa,aAAa;IAEL,OAAO,CAAU;IACjB,UAAU,CAAoB;IAC9B,WAAW,GAAoB,EAAE,CAAC;IAC3C,gBAAgB,GAAG,CAAC,CAAC;IACrB,eAAe,GAAG,CAAC,CAAC;IAE5B;;;;OAIG;IACH,YAAmB,OAAgB;QAE/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,IAAA,mCAAc,EAAC,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACI,OAAO;QAEV,oEAAoE;QACpE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,WAAW,EACjD,CAAC;YACG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,IAAI,2BAAU,CACjB,IAAI,CAAC,OAAO,CAAC,WAAW,EACxB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,UAAU,CAClB,CAAC;IACN,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,UAAsB;QAE5C,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAEzF,uDAAuD;QACvD,KAAK,MAAM,WAAW,IAAI,YAAY,EACtC,CAAC;YACG,IAAI,CAAC,aAAa,CACd,UAAU,CAAC,IAAI,EACf,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,OAAO,EACnB,UAAU,CAAC,IAAI,CAClB,CAAC;QACN,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACK,aAAa,CACjB,IAAY,EACZ,GAAyB,EACzB,OAAsB,EACtB,MAAc;QAGd,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YAClB,EAAE,EAAE,IAAI,CAAC,gBAAgB;YACzB,IAAI;YACJ,GAAG;YACH,OAAO;YACP,MAAM;SACT,CAAC,CAAC;QACH,IAAI,CAAC,gBAAgB,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;OAKG;IACK,SAAS,CAAC,SAAiB,EAAE,MAAc;QAE/C,MAAM,aAAa,GAAG,GAAG,SAAS,IAAI,MAAM,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;QACvE,IAAI,CAAC,eAAe,IAAI,CAAC,CAAC;QAE1B,OAAO,aAAa,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACK,gBAAgB,CACpB,SAAiB,EACjB,UAAsB,EACtB,OAAsB;QAGtB,QAAQ,UAAU,CAAC,IAAI,EACvB,CAAC;YACG,KAAK,WAAW;gBACZ,OAAO,CAAC;wBACJ,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;wBACvD,OAAO;qBACV,CAAC,CAAC;YAEP,KAAK,gBAAgB;gBACjB,OAAO,CAAC;wBACJ,OAAO,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;wBACrE,OAAO;qBACV,CAAC,CAAC;YAEP,KAAK,UAAU;gBACX,OAAO,CAAC;wBACJ,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC;wBACxD,OAAO;qBACV,CAAC,CAAC;YAEP,KAAK,UAAU;gBACX,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAExE,KAAK,QAAQ;gBACT,OAAO,UAAU,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CACnD,IAAI,CAAC,gBAAgB,CACjB,SAAS,EACT,WAAW,CAAC,UAAU,EACtB,WAAW,CAAC,KAAK,IAAI,OAAO,CAC/B,CAAC,CAAC;YAEX,KAAK,UAAU;gBACX,OAAO,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAEvE,KAAK,QAAQ;gBACT,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAErE,KAAK,OAAO;gBACR,OAAO,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7E,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAClB,SAAiB,EACjB,QAA+B,EAC/B,OAAsB;QAGtB,IAAI,OAAO,GAAyB,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAE/D,yFAAyF;QACzF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAC9B,CAAC;YACG,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAC/E,MAAM,QAAQ,GAAyB,EAAE,CAAC;YAE1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAC1B,CAAC;gBACG,KAAK,MAAM,KAAK,IAAI,mBAAmB,EACvC,CAAC;oBACG,QAAQ,CAAC,IAAI,CAAC;wBACV,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC;wBAC5C,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO;qBACzC,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;YAED,OAAO,GAAG,QAAQ,CAAC;QACvB,CAAC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAClB,SAAiB,EACjB,OAAmB,EACnB,OAAsB;QAGtB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAEjE,OAAO;YACH,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE;YACxB,GAAG,KAAK;SACX,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAChB,SAAiB,EACjB,OAAmB,EACnB,OAAsB;QAGtB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACvD,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7E,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAEjE,8DAA8D;QAC9D,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAC7C,CAAC;YACG,IAAI,CAAC,aAAa,CACd,UAAU,EACV,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,eAAe,CAAC,EACzC,WAAW,CAAC,OAAO,EACnB,UAAU,CACb,CAAC;QACN,CAAC;QAED,qCAAqC;QACrC,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QAErD,OAAO,CAAC;gBACJ,OAAO,EAAE,CAAC,eAAe,CAAC;gBAC1B,OAAO;aACV,CAAC,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CAAC,IAAY,EAAE,OAAsB;QAE1D,OAAO;YACH,IAAI,EAAE,aAAa;YACnB,IAAI;YACJ,OAAO;SACV,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,IAAY,EAAE,OAAsB;QAEpD,OAAO;YACH,IAAI,EAAE,OAAO;YACb,IAAI;YACJ,OAAO;SACV,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CAAC,OAAsB,EAAE,IAAY;QAEzD,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,EACpC,CAAC;YACG,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACjD,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAClC,CAAC;YACG,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACjD,CAAC;CACJ;AAzSD,sCAySC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAC,OAAgB;IAExC,OAAO,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;AAChD,CAAC"}

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

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EbnfDesugarer = exports.desugarEbnf = exports.BnfGrammar = exports.AUGMENTED_START_SYMBOL = exports.bnfSymbolKey = exports.bnfParserSymbolKey = void 0;
+var bnf_symbol_js_1 = require("./bnf-symbol.js");
+Object.defineProperty(exports, "bnfParserSymbolKey", { enumerable: true, get: function () { return bnf_symbol_js_1.bnfParserSymbolKey; } });
+Object.defineProperty(exports, "bnfSymbolKey", { enumerable: true, get: function () { return bnf_symbol_js_1.bnfSymbolKey; } });
+var bnf_grammar_js_1 = require("./bnf-grammar.js");
+Object.defineProperty(exports, "AUGMENTED_START_SYMBOL", { enumerable: true, get: function () { return bnf_grammar_js_1.AUGMENTED_START_SYMBOL; } });
+Object.defineProperty(exports, "BnfGrammar", { enumerable: true, get: function () { return bnf_grammar_js_1.BnfGrammar; } });
+var desugar_ebnf_js_1 = require("./desugar-ebnf.js");
+Object.defineProperty(exports, "desugarEbnf", { enumerable: true, get: function () { return desugar_ebnf_js_1.desugarEbnf; } });
+Object.defineProperty(exports, "EbnfDesugarer", { enumerable: true, get: function () { return desugar_ebnf_js_1.EbnfDesugarer; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/bnf/index.ts"],"names":[],"mappings":";;;AAAA,iDAAmE;AAA1D,mHAAA,kBAAkB,OAAA;AAAE,6GAAA,YAAY,OAAA;AAQzC,mDAAsE;AAA7D,wHAAA,sBAAsB,OAAA;AAAE,4GAAA,UAAU,OAAA;AAC3C,qDAA+D;AAAtD,8GAAA,WAAW,OAAA;AAAE,gHAAA,aAAa,OAAA"}

package/dist/lib-cjs/parse-table/build-lr-table.js

@@ -0,0 +1,171 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildLrTable = buildLrTable;
+const token_js_1 = require("../lexer/token.js");
+const first_follow_js_1 = require("./analysis/first-follow.js");
+const bnf_grammar_js_1 = require("./bnf/bnf-grammar.js");
+const lr0_item_set_js_1 = require("./lr0/lr0-item-set.js");
+const lr1_item_set_js_1 = require("./lr1/lr1-item-set.js");
+const lr_parse_table_js_1 = require("./table/lr-parse-table.js");
+const table_builder_base_js_1 = require("./table/table-builder-base.js");
+/**
+ * Builds an LR parse table for a plain BNF grammar.
+ *
+ * @param grammar - Plain BNF grammar to analyze.
+ * @param algorithm - LR table construction algorithm.
+ * @returns A populated LR parse table, possibly recording conflicts.
+ */
+function buildLrTable(grammar, algorithm) {
+    const augmented = grammar.augment();
+    const analysis = (0, first_follow_js_1.analyzeGrammar)(augmented);
+    switch (algorithm) {
+        case 'lr0':
+            return LrTableBuilder.buildLr0(augmented);
+        case 'slr':
+            return LrTableBuilder.buildSlr(augmented, analysis);
+        case 'lr1':
+            return LrTableBuilder.buildLr1(augmented, analysis);
+        case 'lalr':
+            return LrTableBuilder.buildLalr(augmented, analysis);
+    }
+}
+/**
+ * Builds LR parse tables for each supported algorithm.
+ */
+class LrTableBuilder {
+    /**
+     * Builds an LR(0) parse table.
+     *
+     * @param grammar - Augmented BNF grammar.
+     * @returns An LR(0) parse table using all terminals as reduce lookaheads.
+     */
+    static buildLr0(grammar) {
+        const itemSets = (0, lr0_item_set_js_1.buildLr0ItemSets)(grammar);
+        const terminalKeys = grammar.terminalKeys().concat([token_js_1.EOF_TOKEN_NAME]);
+        return LrTableBuilder.buildFromLr0ItemSets('lr0', grammar, itemSets, (production) => {
+            if (production.name === bnf_grammar_js_1.AUGMENTED_START_SYMBOL) {
+                return [token_js_1.EOF_TOKEN_NAME];
+            }
+            return terminalKeys;
+        });
+    }
+    /**
+     * Builds an SLR parse table.
+     *
+     * @param grammar - Augmented BNF grammar.
+     * @param analysis - Nullable, FIRST, and FOLLOW analysis for the grammar.
+     * @returns An SLR parse table using FOLLOW sets as reduce lookaheads.
+     */
+    static buildSlr(grammar, analysis) {
+        const itemSets = (0, lr0_item_set_js_1.buildLr0ItemSets)(grammar);
+        return LrTableBuilder.buildFromLr0ItemSets('slr', grammar, itemSets, (production) => {
+            if (production.name === bnf_grammar_js_1.AUGMENTED_START_SYMBOL) {
+                return [token_js_1.EOF_TOKEN_NAME];
+            }
+            return [...analysis.followOfNonTerminal(production.name)];
+        });
+    }
+    /**
+     * Builds an LR(1) parse table.
+     *
+     * @param grammar - Augmented BNF grammar.
+     * @param analysis - Nullable, FIRST, and FOLLOW analysis for the grammar.
+     * @returns An LR(1) parse table with per-item lookaheads.
+     */
+    static buildLr1(grammar, analysis) {
+        const itemSets = (0, lr1_item_set_js_1.buildLr1ItemSets)(grammar, analysis, token_js_1.EOF_TOKEN_NAME);
+        return LrTableBuilder.buildFromLr1ItemSets('lr1', grammar, analysis, itemSets);
+    }
+    /**
+     * Builds an LALR parse table.
+     *
+     * @param grammar - Augmented BNF grammar.
+     * @param analysis - Nullable, FIRST, and FOLLOW analysis for the grammar.
+     * @returns An LALR parse table merged from the canonical LR(1) collection.
+     */
+    static buildLalr(grammar, analysis) {
+        const lr1ItemSets = (0, lr1_item_set_js_1.buildLr1ItemSets)(grammar, analysis, token_js_1.EOF_TOKEN_NAME);
+        const lalrItemSets = (0, lr1_item_set_js_1.mergeLalrItemSets)(lr1ItemSets);
+        const lr1ToLalr = lr1_item_set_js_1.Lr1ItemSetBuilder.buildLr1ToLalrMap(lr1ItemSets, lalrItemSets);
+        const gotoTargets = (0, lr1_item_set_js_1.buildLalrGotoTargets)(grammar, analysis, lr1ItemSets, lr1ToLalr);
+        return LrTableBuilder.buildFromLr1ItemSets('lalr', grammar, analysis, lalrItemSets, gotoTargets);
+    }
+    /**
+     * Builds a parse table from LR(0) item sets and a reduce-lookahead rule.
+     *
+     * @param algorithm - LR algorithm being constructed.
+     * @param grammar - Augmented BNF grammar.
+     * @param itemSets - Canonical LR(0) item set collection.
+     * @param reduceLookaheads - Returns terminal keys for one completed production.
+     * @returns A parse table with ACTION, GOTO, and any recorded conflicts.
+     */
+    static buildFromLr0ItemSets(algorithm, grammar, itemSets, reduceLookaheads) {
+        const gotoTargets = table_builder_base_js_1.TableBuilderBase.buildGotoTargets(grammar, itemSets.itemSets, (items) => itemSets.indexOf(items), table_builder_base_js_1.TableBuilderBase.lr0GotoItems);
+        const actions = new Map();
+        const gotos = new Map();
+        const conflicts = [];
+        // Fill ACTION and GOTO rows for every LR(0) state.
+        for (let state = 0; state < itemSets.itemSets.length; state += 1) {
+            const itemSet = itemSets.itemSets[state] ?? [];
+            const stateActions = new Map();
+            const stateGotos = new Map();
+            actions.set(state, stateActions);
+            gotos.set(state, stateGotos);
+            table_builder_base_js_1.TableBuilderBase.fillShiftsAndGotos(grammar, state, itemSet, gotoTargets, stateActions, stateGotos, conflicts);
+            // Record reduce and accept actions for every completed item in the state.
+            for (const item of itemSet) {
+                const production = grammar.production(item.productionId);
+                if (production === null || item.dot !== production.rhs.length) {
+                    continue;
+                }
+                table_builder_base_js_1.TableBuilderBase.setAcceptAction(state, production.name, stateActions, conflicts);
+                if (production.name === bnf_grammar_js_1.AUGMENTED_START_SYMBOL) {
+                    continue;
+                }
+                for (const lookahead of reduceLookaheads(production)) {
+                    table_builder_base_js_1.TableBuilderBase.setAction(stateActions, conflicts, state, lookahead, { kind: 'reduce', productionId: production.id });
+                }
+            }
+        }
+        return new lr_parse_table_js_1.LrParseTable(algorithm, grammar, [...grammar.productions], itemSets.itemSets.length, actions, gotos, conflicts);
+    }
+    /**
+     * Builds a parse table from LR(1) or merged LALR item sets.
+     *
+     * @param algorithm - LR algorithm being constructed.
+     * @param grammar - Augmented BNF grammar.
+     * @param itemSets - LR(1) or merged LALR item set collection used for ACTION/GOTO rows.
+     * @param lr1Collection - Canonical LR(1) collection used for LALR GOTO remapping.
+     * @param gotoTargetsOverride - Optional precomputed GOTO indices for LALR.
+     * @returns A parse table with ACTION, GOTO, and any recorded conflicts.
+     */
+    static buildFromLr1ItemSets(algorithm, grammar, analysis, itemSets, gotoTargetsOverride) {
+        const gotoTargets = gotoTargetsOverride ?? table_builder_base_js_1.TableBuilderBase.buildGotoTargets(grammar, itemSets.itemSets, (items) => itemSets.indexOf(items), (grammarArg, items, symbolKey) => (0, lr1_item_set_js_1.lr1Goto)(grammarArg, analysis, items, symbolKey));
+        const actions = new Map();
+        const gotos = new Map();
+        const conflicts = [];
+        // Fill ACTION and GOTO rows for every LR(1) or merged LALR state.
+        for (let state = 0; state < itemSets.itemSets.length; state += 1) {
+            const itemSet = itemSets.itemSets[state] ?? [];
+            const stateActions = new Map();
+            const stateGotos = new Map();
+            actions.set(state, stateActions);
+            gotos.set(state, stateGotos);
+            table_builder_base_js_1.TableBuilderBase.fillShiftsAndGotos(grammar, state, itemSet, gotoTargets, stateActions, stateGotos, conflicts);
+            // Record reduce or accept for each completed item using its lookahead.
+            for (const item of itemSet) {
+                const production = grammar.production(item.productionId);
+                if (production === null || item.dot !== production.rhs.length) {
+                    continue;
+                }
+                if (production.name === bnf_grammar_js_1.AUGMENTED_START_SYMBOL) {
+                    table_builder_base_js_1.TableBuilderBase.setAction(stateActions, conflicts, state, item.lookahead, { kind: 'accept' });
+                    continue;
+                }
+                table_builder_base_js_1.TableBuilderBase.setAction(stateActions, conflicts, state, item.lookahead, { kind: 'reduce', productionId: production.id });
+            }
+        }
+        return new lr_parse_table_js_1.LrParseTable(algorithm, grammar, [...grammar.productions], itemSets.itemSets.length, actions, gotos, conflicts);
+    }
+}
+//# sourceMappingURL=build-lr-table.js.map

package/dist/lib-cjs/parse-table/build-lr-table.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-lr-table.js","sourceRoot":"","sources":["../../../src/lib/parse-table/build-lr-table.ts"],"names":[],"mappings":";;AA8BA,oCAmBC;AAjDD,gDAAmD;AAEnD,gEAAkF;AAClF,yDAA+E;AAE/E,2DAI+B;AAC/B,2DAQ+B;AAE/B,iEAAyD;AACzD,yEAAiE;AAEjE;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,OAAmB,EAAE,SAAsB;IAEpE,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAA,gCAAc,EAAC,SAAS,CAAC,CAAC;IAE3C,QAAQ,SAAS,EACjB,CAAC;QACG,KAAK,KAAK;YACN,OAAO,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAE9C,KAAK,KAAK;YACN,OAAO,cAAc,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAExD,KAAK,KAAK;YACN,OAAO,cAAc,CAAC,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAExD,KAAK,MAAM;YACP,OAAO,cAAc,CAAC,SAAS,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC7D,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,cAAc;IAEhB;;;;;OAKG;IACI,MAAM,CAAC,QAAQ,CAAC,OAAmB;QAEtC,MAAM,QAAQ,GAAG,IAAA,kCAAgB,EAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC,CAAC,yBAAc,CAAC,CAAC,CAAC;QAErE,OAAO,cAAc,CAAC,oBAAoB,CACtC,KAAK,EACL,OAAO,EACP,QAAQ,EACR,CAAC,UAAU,EAAE,EAAE;YAEX,IAAI,UAAU,CAAC,IAAI,KAAK,uCAAsB,EAC9C,CAAC;gBACG,OAAO,CAAC,yBAAc,CAAC,CAAC;YAC5B,CAAC;YAED,OAAO,YAAY,CAAC;QACxB,CAAC,CACJ,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,OAAmB,EAAE,QAAyB;QAEjE,MAAM,QAAQ,GAAG,IAAA,kCAAgB,EAAC,OAAO,CAAC,CAAC;QAE3C,OAAO,cAAc,CAAC,oBAAoB,CACtC,KAAK,EACL,OAAO,EACP,QAAQ,EACR,CAAC,UAAU,EAAE,EAAE;YAEX,IAAI,UAAU,CAAC,IAAI,KAAK,uCAAsB,EAC9C,CAAC;gBACG,OAAO,CAAC,yBAAc,CAAC,CAAC;YAC5B,CAAC;YAED,OAAO,CAAC,GAAG,QAAQ,CAAC,mBAAmB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9D,CAAC,CACJ,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,OAAmB,EAAE,QAAyB;QAEjE,MAAM,QAAQ,GAAG,IAAA,kCAAgB,EAAC,OAAO,EAAE,QAAQ,EAAE,yBAAc,CAAC,CAAC;QAErE,OAAO,cAAc,CAAC,oBAAoB,CACtC,KAAK,EACL,OAAO,EACP,QAAQ,EACR,QAAQ,CACX,CAAC;IACN,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,SAAS,CAAC,OAAmB,EAAE,QAAyB;QAElE,MAAM,WAAW,GAAG,IAAA,kCAAgB,EAAC,OAAO,EAAE,QAAQ,EAAE,yBAAc,CAAC,CAAC;QACxE,MAAM,YAAY,GAAG,IAAA,mCAAiB,EAAC,WAAW,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,mCAAiB,CAAC,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,IAAA,sCAAoB,EACpC,OAAO,EACP,QAAQ,EACR,WAAW,EACX,SAAS,CACZ,CAAC;QAEF,OAAO,cAAc,CAAC,oBAAoB,CACtC,MAAM,EACN,OAAO,EACP,QAAQ,EACR,YAAY,EACZ,WAAW,CACd,CAAC;IACN,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM,CAAC,oBAAoB,CAC/B,SAAsB,EACtB,OAAmB,EACnB,QAA8B,EAC9B,gBAAsG;QAGtG,MAAM,WAAW,GAAG,wCAAgB,CAAC,gBAAgB,CACjD,OAAO,EACP,QAAQ,CAAC,QAAQ,EACjB,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,EAClC,wCAAgB,CAAC,YAAY,CAChC,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAC;QAC5D,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;QACrD,MAAM,SAAS,GAAoB,EAAE,CAAC;QAEtC,mDAAmD;QACnD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAChE,CAAC;YACG,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;YACpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAE7B,wCAAgB,CAAC,kBAAkB,CAC/B,OAAO,EACP,KAAK,EACL,OAAO,EACP,WAAW,EACX,YAAY,EACZ,UAAU,EACV,SAAS,CACZ,CAAC;YAEF,0EAA0E;YAC1E,KAAK,MAAM,IAAI,IAAI,OAAO,EAC1B,CAAC;gBACG,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAEzD,IAAI,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,CAAC,GAAG,CAAC,MAAM,EAC7D,CAAC;oBACG,SAAS;gBACb,CAAC;gBAED,wCAAgB,CAAC,eAAe,CAC5B,KAAK,EACL,UAAU,CAAC,IAAI,EACf,YAAY,EACZ,SAAS,CACZ,CAAC;gBAEF,IAAI,UAAU,CAAC,IAAI,KAAK,uCAAsB,EAC9C,CAAC;oBACG,SAAS;gBACb,CAAC;gBAED,KAAK,MAAM,SAAS,IAAI,gBAAgB,CAAC,UAAU,CAAC,EACpD,CAAC;oBACG,wCAAgB,CAAC,SAAS,CACtB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,SAAS,EACT,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,EAAE,CAClD,CAAC;gBACN,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,gCAAY,CACnB,SAAS,EACT,OAAO,EACP,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,EACxB,QAAQ,CAAC,QAAQ,CAAC,MAAM,EACxB,OAAO,EACP,KAAK,EACL,SAAS,CACZ,CAAC;IACN,CAAC;IAED;;;;;;;;;OASG;IACK,MAAM,CAAC,oBAAoB,CAC/B,SAAsB,EACtB,OAAmB,EACnB,QAAyB,EACzB,QAA8B,EAC9B,mBAAiD;QAGjD,MAAM,WAAW,GAAG,mBAAmB,IAAI,wCAAgB,CAAC,gBAAgB,CACxE,OAAO,EACP,QAAQ,CAAC,QAA2C,EACpD,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,KAA2B,CAAC,EACxD,CAAC,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,CAC7B,IAAA,yBAAO,EAAC,UAAU,EAAE,QAAQ,EAAE,KAA2B,EAAE,SAAS,CAAC,CAC5E,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAC;QAC5D,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;QACrD,MAAM,SAAS,GAAoB,EAAE,CAAC;QAEtC,kEAAkE;QAClE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAChE,CAAC;YACG,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;YACpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAE7B,wCAAgB,CAAC,kBAAkB,CAC/B,OAAO,EACP,KAAK,EACL,OAA6B,EAC7B,WAAW,EACX,YAAY,EACZ,UAAU,EACV,SAAS,CACZ,CAAC;YAEF,uEAAuE;YACvE,KAAK,MAAM,IAAI,IAAI,OAAO,EAC1B,CAAC;gBACG,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAEzD,IAAI,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,CAAC,GAAG,CAAC,MAAM,EAC7D,CAAC;oBACG,SAAS;gBACb,CAAC;gBAED,IAAI,UAAU,CAAC,IAAI,KAAK,uCAAsB,EAC9C,CAAC;oBACG,wCAAgB,CAAC,SAAS,CACtB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,IAAI,CAAC,SAAS,EACd,EAAE,IAAI,EAAE,QAAQ,EAAE,CACrB,CAAC;oBACF,SAAS;gBACb,CAAC;gBAED,wCAAgB,CAAC,SAAS,CACtB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,IAAI,CAAC,SAAS,EACd,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,EAAE,CAClD,CAAC;YACN,CAAC;QACL,CAAC;QAED,OAAO,IAAI,gCAAY,CACnB,SAAS,EACT,OAAO,EACP,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,EACxB,QAAQ,CAAC,QAAQ,CAAC,MAAM,EACxB,OAAO,EACP,KAAK,EACL,SAAS,CACZ,CAAC;IACN,CAAC;CACJ"}

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

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ParseTable = exports.PARSE_TABLE_VERSION_FULL = exports.PARSE_TABLE_VERSION = exports.tokenInventory = exports.LrParseTable = exports.formatParseConflictWarning = exports.formatLrGotos = exports.formatLrConflicts = exports.formatLrConflictWarnings = exports.formatLrActions = exports.formatSlrConflicts = exports.formatSlrActions = exports.buildSlrTable = exports.isParseTableJsonV2 = exports.ParseTableError = exports.ParseTableBuildError = exports.LrAlgorithmError = exports.Lr1ItemSetCollection = exports.buildLr1ItemSets = exports.Lr0ItemSetCollection = exports.formatLr0ItemSet = exports.buildLr0ItemSets = exports.buildLrTable = exports.bnfSymbolKey = exports.BnfGrammar = exports.desugarEbnf = exports.GrammarAnalysis = exports.formatBnfProduction = exports.analyzeGrammar = exports.parseLrAlgorithm = exports.isLrAlgorithm = void 0;
+var lr_algorithm_js_1 = require("./lr-algorithm.js");
+Object.defineProperty(exports, "isLrAlgorithm", { enumerable: true, get: function () { return lr_algorithm_js_1.isLrAlgorithm; } });
+Object.defineProperty(exports, "parseLrAlgorithm", { enumerable: true, get: function () { return lr_algorithm_js_1.parseLrAlgorithm; } });
+var index_js_1 = require("./analysis/index.js");
+Object.defineProperty(exports, "analyzeGrammar", { enumerable: true, get: function () { return index_js_1.analyzeGrammar; } });
+Object.defineProperty(exports, "formatBnfProduction", { enumerable: true, get: function () { return index_js_1.formatBnfProduction; } });
+Object.defineProperty(exports, "GrammarAnalysis", { enumerable: true, get: function () { return index_js_1.GrammarAnalysis; } });
+var index_js_2 = require("./bnf/index.js");
+Object.defineProperty(exports, "desugarEbnf", { enumerable: true, get: function () { return index_js_2.desugarEbnf; } });
+Object.defineProperty(exports, "BnfGrammar", { enumerable: true, get: function () { return index_js_2.BnfGrammar; } });
+Object.defineProperty(exports, "bnfSymbolKey", { enumerable: true, get: function () { return index_js_2.bnfSymbolKey; } });
+var build_lr_table_js_1 = require("./build-lr-table.js");
+Object.defineProperty(exports, "buildLrTable", { enumerable: true, get: function () { return build_lr_table_js_1.buildLrTable; } });
+var index_js_3 = require("./lr0/index.js");
+Object.defineProperty(exports, "buildLr0ItemSets", { enumerable: true, get: function () { return index_js_3.buildLr0ItemSets; } });
+Object.defineProperty(exports, "formatLr0ItemSet", { enumerable: true, get: function () { return index_js_3.formatLr0ItemSet; } });
+Object.defineProperty(exports, "Lr0ItemSetCollection", { enumerable: true, get: function () { return index_js_3.Lr0ItemSetCollection; } });
+var index_js_4 = require("./lr1/index.js");
+Object.defineProperty(exports, "buildLr1ItemSets", { enumerable: true, get: function () { return index_js_4.buildLr1ItemSets; } });
+Object.defineProperty(exports, "Lr1ItemSetCollection", { enumerable: true, get: function () { return index_js_4.Lr1ItemSetCollection; } });
+var lr_algorithm_error_js_1 = require("./lr-algorithm-error.js");
+Object.defineProperty(exports, "LrAlgorithmError", { enumerable: true, get: function () { return lr_algorithm_error_js_1.LrAlgorithmError; } });
+var parse_table_build_error_js_1 = require("./parse-table-build-error.js");
+Object.defineProperty(exports, "ParseTableBuildError", { enumerable: true, get: function () { return parse_table_build_error_js_1.ParseTableBuildError; } });
+var parse_table_error_js_1 = require("./parse-table-error.js");
+Object.defineProperty(exports, "ParseTableError", { enumerable: true, get: function () { return parse_table_error_js_1.ParseTableError; } });
+var parse_table_json_js_1 = require("./parse-table-json.js");
+Object.defineProperty(exports, "isParseTableJsonV2", { enumerable: true, get: function () { return parse_table_json_js_1.isParseTableJsonV2; } });
+var index_js_5 = require("./slr/index.js");
+Object.defineProperty(exports, "buildSlrTable", { enumerable: true, get: function () { return index_js_5.buildSlrTable; } });
+Object.defineProperty(exports, "formatSlrActions", { enumerable: true, get: function () { return index_js_5.formatSlrActions; } });
+Object.defineProperty(exports, "formatSlrConflicts", { enumerable: true, get: function () { return index_js_5.formatSlrConflicts; } });
+var index_js_6 = require("./table/index.js");
+Object.defineProperty(exports, "formatLrActions", { enumerable: true, get: function () { return index_js_6.formatLrActions; } });
+Object.defineProperty(exports, "formatLrConflictWarnings", { enumerable: true, get: function () { return index_js_6.formatLrConflictWarnings; } });
+Object.defineProperty(exports, "formatLrConflicts", { enumerable: true, get: function () { return index_js_6.formatLrConflicts; } });
+Object.defineProperty(exports, "formatLrGotos", { enumerable: true, get: function () { return index_js_6.formatLrGotos; } });
+Object.defineProperty(exports, "formatParseConflictWarning", { enumerable: true, get: function () { return index_js_6.formatParseConflictWarning; } });
+Object.defineProperty(exports, "LrParseTable", { enumerable: true, get: function () { return index_js_6.LrParseTable; } });
+var token_inventory_js_1 = require("./token-inventory.js");
+Object.defineProperty(exports, "tokenInventory", { enumerable: true, get: function () { return token_inventory_js_1.tokenInventory; } });
+var parse_table_js_1 = require("./parse-table.js");
+Object.defineProperty(exports, "PARSE_TABLE_VERSION", { enumerable: true, get: function () { return parse_table_js_1.PARSE_TABLE_VERSION; } });
+Object.defineProperty(exports, "PARSE_TABLE_VERSION_FULL", { enumerable: true, get: function () { return parse_table_js_1.PARSE_TABLE_VERSION_FULL; } });
+Object.defineProperty(exports, "ParseTable", { enumerable: true, get: function () { return parse_table_js_1.ParseTable; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/lib/parse-table/index.ts"],"names":[],"mappings":";;;AAAA,qDAAoE;AAA3D,gHAAA,aAAa,OAAA;AAAE,mHAAA,gBAAgB,OAAA;AAExC,gDAA2F;AAAlF,0GAAA,cAAc,OAAA;AAAE,+GAAA,mBAAmB,OAAA;AAAE,2GAAA,eAAe,OAAA;AAC7D,2CAAuE;AAA9D,uGAAA,WAAW,OAAA;AAAE,sGAAA,UAAU,OAAA;AAAE,wGAAA,YAAY,OAAA;AAE9C,yDAAmD;AAA1C,iHAAA,YAAY,OAAA;AACrB,2CAA0F;AAAjF,4GAAA,gBAAgB,OAAA;AAAE,4GAAA,gBAAgB,OAAA;AAAE,gHAAA,oBAAoB,OAAA;AAEjE,2CAAwE;AAA/D,4GAAA,gBAAgB,OAAA;AAAE,gHAAA,oBAAoB,OAAA;AAE/C,iEAA2D;AAAlD,yHAAA,gBAAgB,OAAA;AACzB,2EAAoE;AAA3D,kIAAA,oBAAoB,OAAA;AAC7B,+DAAyD;AAAhD,uHAAA,eAAe,OAAA;AACxB,6DAA2D;AAAlD,yHAAA,kBAAkB,OAAA;AAO3B,2CAA+F;AAAtF,yGAAA,aAAa,OAAA;AAAE,4GAAA,gBAAgB,OAAA;AAAE,8GAAA,kBAAkB,OAAA;AAC5D,6CAO0B;AANtB,2GAAA,eAAe,OAAA;AACf,oHAAA,wBAAwB,OAAA;AACxB,6GAAA,iBAAiB,OAAA;AACjB,yGAAA,aAAa,OAAA;AACb,sHAAA,0BAA0B,OAAA;AAC1B,wGAAA,YAAY,OAAA;AAGhB,2DAAsD;AAA7C,oHAAA,cAAc,OAAA;AACvB,mDAA6F;AAApF,qHAAA,mBAAmB,OAAA;AAAE,0HAAA,wBAAwB,OAAA;AAAE,4GAAA,UAAU,OAAA"}

package/dist/lib-cjs/parse-table/lr-algorithm-error.js

@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LrAlgorithmError = void 0;
+const parser_lr_error_js_1 = require("../errors/parser-lr-error.js");
+/**
+ * Thrown when an LR table algorithm name is not supported.
+ */
+class LrAlgorithmError extends parser_lr_error_js_1.ParserLrError {
+    /**
+     * Creates an unsupported LR algorithm error.
+     *
+     * @param algorithm - Requested algorithm name.
+     */
+    constructor(algorithm) {
+        super(`Unsupported LR algorithm ${JSON.stringify(algorithm)}`);
+    }
+}
+exports.LrAlgorithmError = LrAlgorithmError;
+//# sourceMappingURL=lr-algorithm-error.js.map

package/dist/lib-cjs/parse-table/lr-algorithm-error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lr-algorithm-error.js","sourceRoot":"","sources":["../../../src/lib/parse-table/lr-algorithm-error.ts"],"names":[],"mappings":";;;AAAA,qEAA6D;AAE7D;;GAEG;AACH,MAAa,gBAAiB,SAAQ,kCAAa;IAE/C;;;;OAIG;IACH,YAAmB,SAAiB;QAEhC,KAAK,CAAC,4BAA4B,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACnE,CAAC;CACJ;AAXD,4CAWC"}

package/dist/lib-cjs/parse-table/lr-algorithm.js

@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isLrAlgorithm = isLrAlgorithm;
+exports.parseLrAlgorithm = parseLrAlgorithm;
+const lr_algorithm_error_js_1 = require("./lr-algorithm-error.js");
+/**
+ * Returns whether a string names a supported LR algorithm.
+ *
+ * @param value - Candidate algorithm name.
+ */
+function isLrAlgorithm(value) {
+    return value === 'lr0'
+        || value === 'slr'
+        || value === 'lalr'
+        || value === 'lr1';
+}
+/**
+ * Parses and validates an LR algorithm name.
+ *
+ * @param value - Raw algorithm name, or undefined for the default.
+ * @param defaultAlgorithm - Algorithm used when `value` is undefined.
+ * @returns Supported algorithm name.
+ */
+function parseLrAlgorithm(value, defaultAlgorithm = 'lr1') {
+    const algorithm = value ?? defaultAlgorithm;
+    if (!isLrAlgorithm(algorithm)) {
+        throw new lr_algorithm_error_js_1.LrAlgorithmError(algorithm);
+    }
+    return algorithm;
+}
+//# sourceMappingURL=lr-algorithm.js.map

package/dist/lib-cjs/parse-table/lr-algorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lr-algorithm.js","sourceRoot":"","sources":["../../../src/lib/parse-table/lr-algorithm.ts"],"names":[],"mappings":";;AAYA,sCAMC;AASD,4CAaC;AAxCD,mEAA2D;AAO3D;;;;GAIG;AACH,SAAgB,aAAa,CAAC,KAAa;IAEvC,OAAO,KAAK,KAAK,KAAK;WACf,KAAK,KAAK,KAAK;WACf,KAAK,KAAK,MAAM;WAChB,KAAK,KAAK,KAAK,CAAC;AAC3B,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC5B,KAAyB,EACzB,mBAAgC,KAAK;IAGrC,MAAM,SAAS,GAAG,KAAK,IAAI,gBAAgB,CAAC;IAE5C,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,EAC7B,CAAC;QACG,MAAM,IAAI,wCAAgB,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC"}

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

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sortLr0Items = exports.Lr0ItemSetCollection = exports.Lr0ItemSetBuilder = exports.lr0ItemsEqual = exports.lr0ItemKey = exports.lr0Goto = exports.lr0Closure = exports.formatLr0ItemSet = exports.buildLr0ItemSets = void 0;
+var lr0_item_set_js_1 = require("./lr0-item-set.js");
+Object.defineProperty(exports, "buildLr0ItemSets", { enumerable: true, get: function () { return lr0_item_set_js_1.buildLr0ItemSets; } });
+Object.defineProperty(exports, "formatLr0ItemSet", { enumerable: true, get: function () { return lr0_item_set_js_1.formatLr0ItemSet; } });
+Object.defineProperty(exports, "lr0Closure", { enumerable: true, get: function () { return lr0_item_set_js_1.lr0Closure; } });
+Object.defineProperty(exports, "lr0Goto", { enumerable: true, get: function () { return lr0_item_set_js_1.lr0Goto; } });
+Object.defineProperty(exports, "lr0ItemKey", { enumerable: true, get: function () { return lr0_item_set_js_1.lr0ItemKey; } });
+Object.defineProperty(exports, "lr0ItemsEqual", { enumerable: true, get: function () { return lr0_item_set_js_1.lr0ItemsEqual; } });
+Object.defineProperty(exports, "Lr0ItemSetBuilder", { enumerable: true, get: function () { return lr0_item_set_js_1.Lr0ItemSetBuilder; } });
+Object.defineProperty(exports, "Lr0ItemSetCollection", { enumerable: true, get: function () { return lr0_item_set_js_1.Lr0ItemSetCollection; } });
+Object.defineProperty(exports, "sortLr0Items", { enumerable: true, get: function () { return lr0_item_set_js_1.sortLr0Items; } });
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/lr0/index.ts"],"names":[],"mappings":";;;AAAA,qDAU2B;AATvB,mHAAA,gBAAgB,OAAA;AAChB,mHAAA,gBAAgB,OAAA;AAChB,6GAAA,UAAU,OAAA;AACV,0GAAA,OAAO,OAAA;AACP,6GAAA,UAAU,OAAA;AACV,gHAAA,aAAa,OAAA;AACb,oHAAA,iBAAiB,OAAA;AACjB,uHAAA,oBAAoB,OAAA;AACpB,+GAAA,YAAY,OAAA"}