parser-lr 0.6.1 → 0.8.0

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

@@ -1,54 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.parseActionsEqual = parseActionsEqual;
-exports.formatParseAction = formatParseAction;
-exports.classifyParseConflict = classifyParseConflict;
-/**
- * Returns whether two parse actions are identical.
- *
- * @param left - First action.
- * @param right - Second action.
- */
-function parseActionsEqual(left, right) {
-    if (left.kind !== right.kind) {
-        return false;
-    }
-    switch (left.kind) {
-        case 'shift':
-            return right.kind === 'shift' && left.state === right.state;
-        case 'reduce':
-            return right.kind === 'reduce' && left.productionId === right.productionId;
-        case 'accept':
-            return true;
-    }
-}
-/**
- * Returns a readable parse action label for tests and diagnostics.
- *
- * @param action - Parse action to format.
- */
-function formatParseAction(action) {
-    switch (action.kind) {
-        case 'shift':
-            return `s${String(action.state)}`;
-        case 'reduce':
-            return `r${String(action.productionId)}`;
-        case 'accept':
-            return 'acc';
-    }
-}
-/**
- * Classifies a conflict between two distinct parse actions.
- *
- * @param existing - Action already recorded for the table slot.
- * @param incoming - New action competing for the same slot.
- */
-function classifyParseConflict(existing, incoming) {
-    const existingIsShift = existing.kind === 'shift';
-    const incomingIsShift = incoming.kind === 'shift';
-    if (existingIsShift !== incomingIsShift) {
-        return 'shift-reduce';
-    }
-    return 'reduce-reduce';
-}
-//# sourceMappingURL=parse-action.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"parse-action.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/table/parse-action.ts"],"names":[],"mappings":";;AAyCA,8CAkBC;AAOD,8CAaC;AAQD,sDAcC;AAlED;;;;;GAKG;AACH,SAAgB,iBAAiB,CAAC,IAAiB,EAAE,KAAkB;IAEnE,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAC5B,CAAC;QACG,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,QAAQ,IAAI,CAAC,IAAI,EACjB,CAAC;QACG,KAAK,OAAO;YACR,OAAO,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC;QAEhE,KAAK,QAAQ;YACT,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,YAAY,KAAK,KAAK,CAAC,YAAY,CAAC;QAE/E,KAAK,QAAQ;YACT,OAAO,IAAI,CAAC;IACpB,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,MAAmB;IAEjD,QAAQ,MAAM,CAAC,IAAI,EACnB,CAAC;QACG,KAAK,OAAO;YACR,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAEtC,KAAK,QAAQ;YACT,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;QAE7C,KAAK,QAAQ;YACT,OAAO,KAAK,CAAC;IACrB,CAAC;AACL,CAAC;AAED;;;;;GAKG;AACH,SAAgB,qBAAqB,CACjC,QAAqB,EACrB,QAAqB;IAGrB,MAAM,eAAe,GAAG,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC;IAClD,MAAM,eAAe,GAAG,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC;IAElD,IAAI,eAAe,KAAK,eAAe,EACvC,CAAC;QACG,OAAO,cAAc,CAAC;IAC1B,CAAC;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC"}

package/dist/lib-cjs/parse-table/table/table-builder-base.js

@@ -1,153 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TableBuilderBase = void 0;
-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");
-const lr0_item_set_js_1 = require("../lr0/lr0-item-set.js");
-const parse_action_js_1 = require("./parse-action.js");
-/**
- * Shared helpers for constructing LR parse tables from item sets.
- */
-class TableBuilderBase {
-    /**
-     * Precomputes GOTO target state indices for every state and grammar symbol.
-     *
-     * @param grammar - Augmented BNF grammar.
-     * @param itemSets - Canonical item set collection.
-     * @param gotoItems - Computes the GOTO item set for one state and symbol.
-     * @returns Map from `state:symbol` keys to target state indices.
-     */
-    static buildGotoTargets(grammar, itemSets, indexOf, gotoItems) {
-        const targets = new Map();
-        // Precompute GOTO for every state and symbol reachable from its items.
-        for (let state = 0; state < itemSets.length; state += 1) {
-            const itemSet = itemSets[state] ?? [];
-            for (const symbolKey of (0, lr0_item_set_js_1.symbolsAfterDot)(grammar, itemSet)) {
-                const gotoSet = gotoItems(grammar, itemSet, symbolKey);
-                if (gotoSet.length === 0) {
-                    continue;
-                }
-                const targetState = indexOf(gotoSet);
-                if (targetState === null) {
-                    continue;
-                }
-                targets.set(TableBuilderBase.gotoKey(state, symbolKey), targetState);
-            }
-        }
-        return targets;
-    }
-    /**
-     * Fills shift and GOTO entries from incomplete items in one parser state.
-     *
-     * @param grammar - Augmented BNF grammar.
-     * @param state - Parser state index.
-     * @param itemSet - Closed item set for the state.
-     * @param gotoTargets - Precomputed GOTO target indices.
-     * @param stateActions - ACTION map for the state.
-     * @param stateGotos - GOTO map for the state.
-     * @param conflicts - Resolved conflict list to append to when actions disagree.
-     */
-    static fillShiftsAndGotos(grammar, state, itemSet, gotoTargets, stateActions, stateGotos, conflicts) {
-        // Derive shift and GOTO entries from every incomplete item in the state.
-        for (const item of itemSet) {
-            const production = grammar.production(item.productionId);
-            if (production === null) {
-                continue;
-            }
-            const nextSymbol = production.rhs[item.dot];
-            if (nextSymbol === undefined) {
-                continue;
-            }
-            const symbolKey = (0, bnf_symbol_js_1.bnfParserSymbolKey)(nextSymbol);
-            const targetState = gotoTargets.get(TableBuilderBase.gotoKey(state, symbolKey));
-            if (targetState === undefined) {
-                continue;
-            }
-            // Non-terminal symbols populate GOTO; terminals populate ACTION shift entries.
-            if (nextSymbol.kind === 'nonTerminal') {
-                stateGotos.set(nextSymbol.name, targetState);
-                continue;
-            }
-            TableBuilderBase.setAction(stateActions, conflicts, state, symbolKey, { kind: 'shift', state: targetState });
-        }
-    }
-    /**
-     * Records an accept action for the augmented start production.
-     *
-     * @param state - Parser state index.
-     * @param productionName - Left-hand side of the completed production.
-     * @param stateActions - ACTION map for the state.
-     * @param conflicts - Resolved conflict list to append to when actions disagree.
-     */
-    static setAcceptAction(state, productionName, stateActions, conflicts) {
-        if (productionName !== bnf_grammar_js_1.AUGMENTED_START_SYMBOL) {
-            return;
-        }
-        TableBuilderBase.setAction(stateActions, conflicts, state, token_js_1.EOF_TOKEN_NAME, { kind: 'accept' });
-    }
-    /**
-     * Returns a stable map key for a GOTO lookup.
-     *
-     * @param state - Parser state index.
-     * @param symbolKey - Encoded terminal or non-terminal symbol.
-     */
-    static gotoKey(state, symbolKey) {
-        return `${String(state)}:${symbolKey}`;
-    }
-    /**
-     * Inserts one ACTION entry, resolving shift/reduce and reduce/reduce conflicts.
-     *
-     * @param stateActions - ACTION map for the current state.
-     * @param conflicts - Resolved conflict list to append to when actions disagree.
-     * @param state - Parser state index.
-     * @param symbol - Encoded terminal or `$eof` key.
-     * @param incoming - Candidate parse action.
-     */
-    static setAction(stateActions, conflicts, state, symbol, incoming) {
-        const existing = stateActions.get(symbol);
-        if (existing === undefined) {
-            stateActions.set(symbol, incoming);
-            return;
-        }
-        // Identical re-insertions are ignored; disagreeing actions are resolved by conflict kind.
-        if ((0, parse_action_js_1.parseActionsEqual)(existing, incoming)) {
-            return;
-        }
-        const conflictKind = (0, parse_action_js_1.classifyParseConflict)(existing, incoming);
-        if (conflictKind === 'shift-reduce') {
-            const shiftAction = existing.kind === 'shift' ? existing : incoming;
-            stateActions.set(symbol, shiftAction);
-            conflicts.push({
-                kind: 'shift-reduce',
-                state,
-                symbol,
-                existing,
-                incoming,
-                resolution: 'shift',
-            });
-            return;
-        }
-        // Reduce/reduce: keep the first reduce action already in the table.
-        conflicts.push({
-            kind: 'reduce-reduce',
-            state,
-            symbol,
-            existing,
-            incoming,
-            resolution: 'reduce',
-        });
-    }
-    /**
-     * Default GOTO implementation for LR(0) item sets.
-     *
-     * @param grammar - Augmented BNF grammar.
-     * @param items - Closed item set.
-     * @param symbolKey - Encoded terminal or non-terminal symbol.
-     */
-    static lr0GotoItems(grammar, items, symbolKey) {
-        return (0, lr0_item_set_js_1.lr0Goto)(grammar, items, symbolKey);
-    }
-}
-exports.TableBuilderBase = TableBuilderBase;
-//# sourceMappingURL=table-builder-base.js.map

package/dist/lib-cjs/parse-table/table/table-builder-base.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"table-builder-base.js","sourceRoot":"","sources":["../../../../src/lib/parse-table/table/table-builder-base.ts"],"names":[],"mappings":";;;AAAA,mDAAsD;AAEtD,0DAAgF;AAChF,wDAA0D;AAC1D,4DAAgF;AAEhF,uDAK2B;AAE3B;;GAEG;AACH,MAAa,gBAAgB;IAEzB;;;;;;;OAOG;IACI,MAAM,CAAC,gBAAgB,CAC1B,OAAmB,EACnB,QAAyC,EACzC,OAAqD,EACrD,SAIuB;QAGvB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,uEAAuE;QACvE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EACvD,CAAC;YACG,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAEtC,KAAK,MAAM,SAAS,IAAI,IAAA,iCAAe,EAAC,OAAO,EAAE,OAAO,CAAC,EACzD,CAAC;gBACG,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;gBAEvD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EACxB,CAAC;oBACG,SAAS;gBACb,CAAC;gBAED,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;gBAErC,IAAI,WAAW,KAAK,IAAI,EACxB,CAAC;oBACG,SAAS;gBACb,CAAC;gBAED,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,WAAW,CAAC,CAAC;YACzE,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;;;;;;OAUG;IACI,MAAM,CAAC,kBAAkB,CAC5B,OAAmB,EACnB,KAAa,EACb,OAA2B,EAC3B,WAAwC,EACxC,YAAsC,EACtC,UAA+B,EAC/B,SAA0B;QAG1B,yEAAyE;QACzE,KAAK,MAAM,IAAI,IAAI,OAAO,EAC1B,CAAC;YACG,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAEzD,IAAI,UAAU,KAAK,IAAI,EACvB,CAAC;gBACG,SAAS;YACb,CAAC;YAED,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAE5C,IAAI,UAAU,KAAK,SAAS,EAC5B,CAAC;gBACG,SAAS;YACb,CAAC;YAED,MAAM,SAAS,GAAG,IAAA,kCAAkB,EAAC,UAAU,CAAC,CAAC;YACjD,MAAM,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,gBAAgB,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC;YAEhF,IAAI,WAAW,KAAK,SAAS,EAC7B,CAAC;gBACG,SAAS;YACb,CAAC;YAED,+EAA+E;YAC/E,IAAI,UAAU,CAAC,IAAI,KAAK,aAAa,EACrC,CAAC;gBACG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;gBAC7C,SAAS;YACb,CAAC;YAED,gBAAgB,CAAC,SAAS,CACtB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,SAAS,EACT,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,CACxC,CAAC;QACN,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CACzB,KAAa,EACb,cAAsB,EACtB,YAAsC,EACtC,SAA0B;QAG1B,IAAI,cAAc,KAAK,uCAAsB,EAC7C,CAAC;YACG,OAAO;QACX,CAAC;QAED,gBAAgB,CAAC,SAAS,CACtB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,yBAAc,EACd,EAAE,IAAI,EAAE,QAAQ,EAAE,CACrB,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,OAAO,CAAC,KAAa,EAAE,SAAiB;QAElD,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;IAC3C,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,SAAS,CACnB,YAAsC,EACtC,SAA0B,EAC1B,KAAa,EACb,MAAc,EACd,QAAqB;QAGrB,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE1C,IAAI,QAAQ,KAAK,SAAS,EAC1B,CAAC;YACG,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACnC,OAAO;QACX,CAAC;QAED,0FAA0F;QAC1F,IAAI,IAAA,mCAAiB,EAAC,QAAQ,EAAE,QAAQ,CAAC,EACzC,CAAC;YACG,OAAO;QACX,CAAC;QAED,MAAM,YAAY,GAAG,IAAA,uCAAqB,EAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE/D,IAAI,YAAY,KAAK,cAAc,EACnC,CAAC;YACG,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;YACpE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;YACtC,SAAS,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,cAAc;gBACpB,KAAK;gBACL,MAAM;gBACN,QAAQ;gBACR,QAAQ;gBACR,UAAU,EAAE,OAAO;aACtB,CAAC,CAAC;YACH,OAAO;QACX,CAAC;QAED,oEAAoE;QACpE,SAAS,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,eAAe;YACrB,KAAK;YACL,MAAM;YACN,QAAQ;YACR,QAAQ;YACR,UAAU,EAAE,QAAQ;SACvB,CAAC,CAAC;IACP,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,YAAY,CACtB,OAAmB,EACnB,KAAyB,EACzB,SAAiB;QAGjB,OAAO,IAAA,yBAAO,EAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC;CACJ;AApOD,4CAoOC"}

package/dist/lib-cjs/parse-table/token-inventory.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.tokenInventory = tokenInventory;
-const token_js_1 = require("../lexer/token.js");
-/**
- * Returns the ordered token rule names declared in a grammar.
- *
- * @param grammar - Parsed `.grammar` file model.
- * @returns Token names in declaration order, including `$eof`.
- */
-function tokenInventory(grammar) {
-    const names = grammar.tokenRules.map((rule) => rule.name);
-    if (names.includes(token_js_1.EOF_TOKEN_NAME)) {
-        return names;
-    }
-    return [...names, token_js_1.EOF_TOKEN_NAME];
-}
-//# sourceMappingURL=token-inventory.js.map

package/dist/lib-cjs/parse-table/token-inventory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"token-inventory.js","sourceRoot":"","sources":["../../../src/lib/parse-table/token-inventory.ts"],"names":[],"mappings":";;AASA,wCAUC;AAlBD,gDAAmD;AAEnD;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,OAAgB;IAE3C,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAE1D,IAAI,KAAK,CAAC,QAAQ,CAAC,yBAAc,CAAC,EAClC,CAAC;QACG,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,EAAE,yBAAc,CAAC,CAAC;AACtC,CAAC"}

package/dist/lib-cjs/parser-lr.js

@@ -1,143 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ParserLr = void 0;
-const lexer_js_1 = require("./lexer/lexer.js");
-const parse_table_js_1 = require("./parse-table/parse-table.js");
-const shift_reduce_engine_js_1 = require("./shift-reduce/shift-reduce-engine.js");
-const cst_transformer_js_1 = require("./transform/cst-transformer.js");
-/**
- * Shift-reduce parser for EBNF grammars.
- */
-class ParserLr {
-    grammar;
-    table;
-    /**
-     * Creates a parser bound to a grammar and optional parse table.
-     *
-     * @param grammar - Parsed `.grammar` file supplying lexer and parser rules.
-     * @param table - Optional parse table used for shift-reduce parsing.
-     */
-    constructor(grammar, table = null) {
-        this.grammar = grammar;
-        this.table = table;
-    }
-    /**
-     * Creates a parser from a serialized parse table.
-     *
-     * @param table - Parse table containing lexer metadata, parser entries, and optional AST transforms.
-     * @returns A parser that lexes, parses, and applies transforms from the table JSON.
-     */
-    static fromParseTable(table) {
-        return new ParserLr(table.toGrammar(), table);
-    }
-    /**
-     * Creates a stream lexer for this parser's grammar.
-     *
-     * @returns A fresh stream lexer instance.
-     */
-    createLexer() {
-        return new lexer_js_1.Lexer(this.grammar);
-    }
-    /**
-     * Lexes source text into tokens using the grammar's token and skip rules.
-     *
-     * @param source - Input text to tokenize.
-     * @returns Matched tokens in source order, ending with `$eof`.
-     */
-    lex(source) {
-        return this.createLexer().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 (0, lexer_js_1.lexChunks)(this.grammar, 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 (0, lexer_js_1.lexChunksAsync)(this.grammar, chunks);
-    }
-    /**
-     * Collects all tokens from a synchronous chunk stream.
-     *
-     * @param chunks - Source text fragments in order.
-     * @returns Matched tokens including `$eof`.
-     */
-    lexChunkStream(chunks) {
-        return (0, lexer_js_1.lexChunkStream)(this.grammar, 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 (0, lexer_js_1.lexChunkStreamAsync)(this.grammar, chunks);
-    }
-    /**
-     * Parses a token stream into a concrete syntax tree.
-     *
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns Parse tree rooted at the grammar start symbol, or null on syntax error.
-     */
-    parseCst(tokens) {
-        if (this.table === null) {
-            return null;
-        }
-        return (0, shift_reduce_engine_js_1.parseWithTable)(this.table, tokens);
-    }
-    /**
-     * Parses a token stream into an AST when transform rules are declared.
-     *
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns Transformed AST, CST when no transform section exists, or null on failure.
-     */
-    parseAst(tokens) {
-        const cst = this.parseCst(tokens);
-        if (cst === null) {
-            return null;
-        }
-        if (this.grammar.transformSchema === null || this.table === null) {
-            return cst;
-        }
-        return (0, cst_transformer_js_1.transformCst)(cst, this.grammar.transformSchema, this.table);
-    }
-    /**
-     * Parses a token stream, applying CST-to-AST transforms when configured.
-     *
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns AST or CST parse tree, or null on syntax error.
-     */
-    parse(tokens) {
-        return this.parseAst(tokens);
-    }
-    /**
-     * Lexes and parses source text, applying CST-to-AST transforms when configured.
-     *
-     * @param source - Input text to parse.
-     * @returns AST or CST parse tree, or null on syntax error.
-     */
-    parseSource(source) {
-        return this.parse(this.lex(source));
-    }
-    /**
-     * Builds a parse table from the bound grammar, including the token inventory.
-     *
-     * @param algorithm - LR algorithm used to build the table.
-     * @returns Parse table metadata ready for serialization.
-     */
-    buildParseTable(algorithm = 'lr1') {
-        return parse_table_js_1.ParseTable.fromGrammar(this.grammar, algorithm);
-    }
-}
-exports.ParserLr = ParserLr;
-//# sourceMappingURL=parser-lr.js.map

package/dist/lib-cjs/parser-lr.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parser-lr.js","sourceRoot":"","sources":["../../src/lib/parser-lr.ts"],"names":[],"mappings":";;;AAEA,+CAM0B;AAG1B,iEAA0D;AAC1D,kFAAuE;AACvE,uEAA8D;AAE9D;;GAEG;AACH,MAAa,QAAQ;IASG;IACC;IARrB;;;;;OAKG;IACH,YACoB,OAAgB,EACf,QAA2B,IAAI;QADhC,YAAO,GAAP,OAAO,CAAS;QACf,UAAK,GAAL,KAAK,CAA0B;IAGpD,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,cAAc,CAAC,KAAiB;QAE1C,OAAO,IAAI,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACI,WAAW;QAEd,OAAO,IAAI,gBAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED;;;;;OAKG;IACI,GAAG,CAAC,MAAc;QAErB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,MAAwB;QAErC,OAAO,IAAA,oBAAS,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,MAA6B;QAE/C,OAAO,IAAA,yBAAc,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAChD,CAAC;IAED;;;;;OAKG;IACI,cAAc,CAAC,MAAwB;QAE1C,OAAO,IAAA,yBAAc,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAChD,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,mBAAmB,CAAC,MAA6B;QAE1D,OAAO,IAAA,8BAAmB,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,MAAwB;QAEpC,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EACvB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,IAAA,uCAAc,EAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,MAAwB;QAEpC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAElC,IAAI,GAAG,KAAK,IAAI,EAChB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,CAAC,eAAe,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAChE,CAAC;YACG,OAAO,GAAG,CAAC;QACf,CAAC;QAED,OAAO,IAAA,iCAAY,EAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,MAAwB;QAEjC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;;;OAKG;IACI,WAAW,CAAC,MAAc;QAE7B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;;OAKG;IACI,eAAe,CAAC,YAAyB,KAAK;QAEjD,OAAO,2BAAU,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;CACJ;AAlKD,4BAkKC"}

package/dist/lib-cjs/shift-reduce/index.js

@@ -1,11 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.tokenActionKey = exports.ShiftReduceEngine = exports.parseWithTableResult = exports.parseWithTable = exports.mergeChildLocations = exports.astNodeFromToken = void 0;
-var shift_reduce_engine_js_1 = require("./shift-reduce-engine.js");
-Object.defineProperty(exports, "astNodeFromToken", { enumerable: true, get: function () { return shift_reduce_engine_js_1.astNodeFromToken; } });
-Object.defineProperty(exports, "mergeChildLocations", { enumerable: true, get: function () { return shift_reduce_engine_js_1.mergeChildLocations; } });
-Object.defineProperty(exports, "parseWithTable", { enumerable: true, get: function () { return shift_reduce_engine_js_1.parseWithTable; } });
-Object.defineProperty(exports, "parseWithTableResult", { enumerable: true, get: function () { return shift_reduce_engine_js_1.parseWithTableResult; } });
-Object.defineProperty(exports, "ShiftReduceEngine", { enumerable: true, get: function () { return shift_reduce_engine_js_1.ShiftReduceEngine; } });
-Object.defineProperty(exports, "tokenActionKey", { enumerable: true, get: function () { return shift_reduce_engine_js_1.tokenActionKey; } });
-//# sourceMappingURL=index.js.map

package/dist/lib-cjs/shift-reduce/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/lib/shift-reduce/index.ts"],"names":[],"mappings":";;;AAAA,mEAOkC;AAN9B,0HAAA,gBAAgB,OAAA;AAChB,6HAAA,mBAAmB,OAAA;AACnB,wHAAA,cAAc,OAAA;AACd,8HAAA,oBAAoB,OAAA;AACpB,2HAAA,iBAAiB,OAAA;AACjB,wHAAA,cAAc,OAAA"}

package/dist/lib-cjs/shift-reduce/shift-reduce-engine.js

@@ -1,224 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ShiftReduceEngine = void 0;
-exports.tokenActionKey = tokenActionKey;
-exports.astNodeFromToken = astNodeFromToken;
-exports.mergeChildLocations = mergeChildLocations;
-exports.parseWithTable = parseWithTable;
-exports.parseWithTableResult = parseWithTableResult;
-const ast_node_js_1 = require("../ast/ast-node.js");
-const token_js_1 = require("../lexer/token.js");
-/**
- * Returns the ACTION table key for a lexer token.
- *
- * @param token - Current input token.
- * @returns The ACTION table key for the token, or `$eof` for end-of-input.
- */
-function tokenActionKey(token) {
-    if ((0, token_js_1.isEofToken)(token)) {
-        return token_js_1.EOF_TOKEN_NAME;
-    }
-    return token.name;
-}
-/**
- * Builds a terminal CST node from a shifted token.
- *
- * @param token - Lexer token that was shifted.
- * @returns A terminal CST node carrying the token name, text, and location.
- */
-function astNodeFromToken(token) {
-    return ast_node_js_1.AstNode.terminal(token.name, token.text, token.location);
-}
-/**
- * Merges child spans into one source location.
- *
- * @param children - Reduced child subtrees.
- * @returns The smallest span covering all child locations, or null when none exist.
- */
-function mergeChildLocations(children) {
-    let offset = null;
-    let end = null;
-    // Walk children to find the earliest offset and latest end position.
-    for (const child of children) {
-        if (child.location === null) {
-            continue;
-        }
-        if (offset === null) {
-            offset = child.location.offset;
-            end = child.location.offset + child.location.length;
-            continue;
-        }
-        offset = Math.min(offset, child.location.offset);
-        end = Math.max(end ?? child.location.offset, child.location.offset + child.location.length);
-    }
-    if (offset === null || end === null) {
-        return null;
-    }
-    return {
-        offset,
-        length: end - offset,
-    };
-}
-/**
- * Table-driven shift-reduce parser shared by all LR table algorithms.
- */
-class ShiftReduceEngine {
-    /**
-     * Parses a token stream using a serialized LR parse table.
-     *
-     * @param table - Parse table with ACTION, GOTO, and production metadata.
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns The start symbol parse tree, or null on syntax error.
-     */
-    static parse(table, tokens) {
-        return ShiftReduceEngine.parseWithResult(table, tokens).cst;
-    }
-    /**
-     * Parses a token stream and reports the first syntax error location.
-     *
-     * @param table - Parse table with ACTION, GOTO, and production metadata.
-     * @param tokens - Token stream ending with `$eof`.
-     * @returns Parse tree on success, or error offset and message on failure.
-     */
-    static parseWithResult(table, tokens) {
-        if (!table.hasParserTable) {
-            return {
-                cst: null,
-                errorOffset: 0,
-                errorMessage: 'Parse table has no parser entries',
-            };
-        }
-        if (tokens.length === 0 || !(0, token_js_1.isEofToken)(tokens[tokens.length - 1])) {
-            return {
-                cst: null,
-                errorOffset: tokens[0]?.location.offset ?? 0,
-                errorMessage: 'Token stream must end with $eof',
-            };
-        }
-        const stateStack = [0];
-        const valueStack = [];
-        let tokenIndex = 0;
-        // Drive the parser until accept, error, or an unrecoverable reduce failure.
-        while (true) {
-            const state = stateStack[stateStack.length - 1];
-            const currentToken = tokens[tokenIndex];
-            const action = table.action(state, tokenActionKey(currentToken));
-            if (action === null) {
-                return {
-                    cst: null,
-                    errorOffset: currentToken.location.offset,
-                    errorMessage: `Unexpected ${currentToken.name}`,
-                };
-            }
-            switch (action.kind) {
-                case 'shift':
-                    {
-                        valueStack.push(astNodeFromToken(currentToken));
-                        stateStack.push(action.state);
-                        tokenIndex += 1;
-                        break;
-                    }
-                case 'reduce':
-                    {
-                        const node = ShiftReduceEngine.reduce(table, action.productionId, stateStack, valueStack);
-                        if (node === null) {
-                            return {
-                                cst: null,
-                                errorOffset: currentToken.location.offset,
-                                errorMessage: 'Invalid reduce action',
-                            };
-                        }
-                        break;
-                    }
-                case 'accept':
-                    {
-                        if (valueStack.length === 0) {
-                            return {
-                                cst: null,
-                                errorOffset: currentToken.location.offset,
-                                errorMessage: 'Empty parse result',
-                            };
-                        }
-                        return {
-                            cst: valueStack[valueStack.length - 1],
-                            errorOffset: null,
-                            errorMessage: null,
-                        };
-                    }
-            }
-        }
-    }
-    /**
-     * Applies one reduce action and pushes the resulting subtree.
-     *
-     * @param table - Parse table with GOTO and production metadata.
-     * @param productionId - Production to reduce by.
-     * @param stateStack - Parser state stack.
-     * @param valueStack - Semantic value stack.
-     * @returns The reduced subtree pushed onto the value stack, or null on stack underflow.
-     */
-    static reduce(table, productionId, stateStack, valueStack) {
-        const production = table.production(productionId);
-        if (production === null) {
-            return null;
-        }
-        const rhsLength = production.rhs.length;
-        const children = [];
-        // Pop one state and value per right-hand side symbol.
-        for (let index = 0; index < rhsLength; index += 1) {
-            if (stateStack.length === 0 || valueStack.length === 0) {
-                return null;
-            }
-            stateStack.pop();
-            const child = valueStack.pop();
-            if (child === undefined) {
-                return null;
-            }
-            children.unshift(child);
-        }
-        if (stateStack.length === 0) {
-            return null;
-        }
-        // Follow GOTO for the production left-hand side and push the new subtree.
-        const gotoState = table.goto(stateStack[stateStack.length - 1], production.name);
-        if (gotoState === null) {
-            return null;
-        }
-        const node = ShiftReduceEngine.nodeFromProduction(production, children);
-        valueStack.push(node);
-        stateStack.push(gotoState);
-        return node;
-    }
-    /**
-     * Builds a CST node for one reduced production.
-     *
-     * @param production - Reduced production metadata.
-     * @param children - Child subtrees matching the production right-hand side.
-     * @returns A rule CST node spanning the reduced children.
-     */
-    static nodeFromProduction(production, children) {
-        return ast_node_js_1.AstNode.rule(production.name, children, mergeChildLocations(children), production.variant, production.id, production.origin);
-    }
-}
-exports.ShiftReduceEngine = ShiftReduceEngine;
-/**
- * Parses a token stream using a serialized LR parse table.
- *
- * @param table - Parse table with ACTION, GOTO, and production metadata.
- * @param tokens - Token stream ending with `$eof`.
- * @returns The start symbol parse tree, or null on syntax error.
- */
-function parseWithTable(table, tokens) {
-    return ShiftReduceEngine.parse(table, tokens);
-}
-/**
- * Parses a token stream and reports the first syntax error location.
- *
- * @param table - Parse table with ACTION, GOTO, and production metadata.
- * @param tokens - Token stream ending with `$eof`.
- * @returns Parse tree on success, or error offset and message on failure.
- */
-function parseWithTableResult(table, tokens) {
-    return ShiftReduceEngine.parseWithResult(table, tokens);
-}
-//# sourceMappingURL=shift-reduce-engine.js.map

package/dist/lib-cjs/shift-reduce/shift-reduce-engine.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shift-reduce-engine.js","sourceRoot":"","sources":["../../../src/lib/shift-reduce/shift-reduce-engine.ts"],"names":[],"mappings":";;;AAYA,wCAQC;AAQD,4CAGC;AAQD,kDAiCC;AAuOD,wCAGC;AASD,oDAMC;AAhUD,oDAA6C;AAC7C,gDAA2E;AAI3E;;;;;GAKG;AACH,SAAgB,cAAc,CAAC,KAAY;IAEvC,IAAI,IAAA,qBAAU,EAAC,KAAK,CAAC,EACrB,CAAC;QACG,OAAO,yBAAc,CAAC;IAC1B,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC;AACtB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,KAAY;IAEzC,OAAO,qBAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;AACpE,CAAC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,QAA4B;IAE5D,IAAI,MAAM,GAAkB,IAAI,CAAC;IACjC,IAAI,GAAG,GAAkB,IAAI,CAAC;IAE9B,qEAAqE;IACrE,KAAK,MAAM,KAAK,IAAI,QAAQ,EAC5B,CAAC;QACG,IAAI,KAAK,CAAC,QAAQ,KAAK,IAAI,EAC3B,CAAC;YACG,SAAS;QACb,CAAC;QAED,IAAI,MAAM,KAAK,IAAI,EACnB,CAAC;YACG,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YAC/B,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;YACpD,SAAS;QACb,CAAC;QAED,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjD,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChG,CAAC;IAED,IAAI,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI,EACnC,CAAC;QACG,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO;QACH,MAAM;QACN,MAAM,EAAE,GAAG,GAAG,MAAM;KACvB,CAAC;AACN,CAAC;AAiBD;;GAEG;AACH,MAAa,iBAAiB;IAE1B;;;;;;OAMG;IACI,MAAM,CAAC,KAAK,CAAC,KAAiB,EAAE,MAAwB;QAE3D,OAAO,iBAAiB,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC;IAChE,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,eAAe,CACzB,KAAiB,EACjB,MAAwB;QAGxB,IAAI,CAAC,KAAK,CAAC,cAAc,EACzB,CAAC;YACG,OAAO;gBACH,GAAG,EAAE,IAAI;gBACT,WAAW,EAAE,CAAC;gBACd,YAAY,EAAE,mCAAmC;aACpD,CAAC;QACN,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAA,qBAAU,EAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EACjE,CAAC;YACG,OAAO;gBACH,GAAG,EAAE,IAAI;gBACT,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAC5C,YAAY,EAAE,iCAAiC;aAClD,CAAC;QACN,CAAC;QAED,MAAM,UAAU,GAAa,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,UAAU,GAAc,EAAE,CAAC;QACjC,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,4EAA4E;QAC5E,OAAO,IAAI,EACX,CAAC;YACG,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAChD,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC;YAEjE,IAAI,MAAM,KAAK,IAAI,EACnB,CAAC;gBACG,OAAO;oBACH,GAAG,EAAE,IAAI;oBACT,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,MAAM;oBACzC,YAAY,EAAE,cAAc,YAAY,CAAC,IAAI,EAAE;iBAClD,CAAC;YACN,CAAC;YAED,QAAQ,MAAM,CAAC,IAAI,EACnB,CAAC;gBACG,KAAK,OAAO;oBACZ,CAAC;wBACG,UAAU,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC;wBAChD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;wBAC9B,UAAU,IAAI,CAAC,CAAC;wBAChB,MAAM;oBACV,CAAC;gBAED,KAAK,QAAQ;oBACb,CAAC;wBACG,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CACjC,KAAK,EACL,MAAM,CAAC,YAAY,EACnB,UAAU,EACV,UAAU,CACb,CAAC;wBAEF,IAAI,IAAI,KAAK,IAAI,EACjB,CAAC;4BACG,OAAO;gCACH,GAAG,EAAE,IAAI;gCACT,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,MAAM;gCACzC,YAAY,EAAE,uBAAuB;6BACxC,CAAC;wBACN,CAAC;wBAED,MAAM;oBACV,CAAC;gBAED,KAAK,QAAQ;oBACb,CAAC;wBACG,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAC3B,CAAC;4BACG,OAAO;gCACH,GAAG,EAAE,IAAI;gCACT,WAAW,EAAE,YAAY,CAAC,QAAQ,CAAC,MAAM;gCACzC,YAAY,EAAE,oBAAoB;6BACrC,CAAC;wBACN,CAAC;wBAED,OAAO;4BACH,GAAG,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;4BACtC,WAAW,EAAE,IAAI;4BACjB,YAAY,EAAE,IAAI;yBACrB,CAAC;oBACN,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACK,MAAM,CAAC,MAAM,CACjB,KAAiB,EACjB,YAAoB,EACpB,UAAoB,EACpB,UAAqB;QAGrB,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,IAAI,EACvB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;QACxC,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,sDAAsD;QACtD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,IAAI,CAAC,EACjD,CAAC;YACG,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EACtD,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,UAAU,CAAC,GAAG,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;YAE/B,IAAI,KAAK,KAAK,SAAS,EACvB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAC3B,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,0EAA0E;QAC1E,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;QAEjF,IAAI,SAAS,KAAK,IAAI,EACtB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,IAAI,GAAG,iBAAiB,CAAC,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACxE,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAE3B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,kBAAkB,CAC7B,UAAoC,EACpC,QAA4B;QAG5B,OAAO,qBAAO,CAAC,IAAI,CACf,UAAU,CAAC,IAAI,EACf,QAAQ,EACR,mBAAmB,CAAC,QAAQ,CAAC,EAC7B,UAAU,CAAC,OAAO,EAClB,UAAU,CAAC,EAAE,EACb,UAAU,CAAC,MAAM,CACpB,CAAC;IACN,CAAC;CACJ;AA1MD,8CA0MC;AAED;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,KAAiB,EAAE,MAAwB;IAEtE,OAAO,iBAAiB,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,oBAAoB,CAChC,KAAiB,EACjB,MAAwB;IAGxB,OAAO,iBAAiB,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC5D,CAAC"}