parser-lr 0.0.0 → 0.2.0

package/dist/lib/transform/binding-map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binding-map.js","sourceRoot":"","sources":["../../../src/lib/transform/binding-map.ts"],"names":[],"mappings":"AAYA;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAEzC,MAAM,YAAY,GAAG,qCAAqC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAErE,IAAI,YAAY,KAAK,IAAI,EACzB,CAAC;QACG,OAAO;YACH,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;SAC1B,CAAC;IACN,CAAC;IAED,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAC5C,CAAC;QACG,OAAO;YACH,OAAO,EAAE,IAAI;YACb,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC3B,CAAC;IACN,CAAC;IAED,OAAO;QACH,OAAO,EAAE,IAAI;QACb,MAAM,EAAE,GAAG;KACd,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,UAAoC;IAEhE,OAAO,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;QAErC,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QAEtC,OAAO;YACH,KAAK;YACL,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,MAAM,EAAE,MAAM,CAAC,MAAM;SACxB,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAC9B,UAAoC,EACpC,SAAiB;IAGjB,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,UAAU,CAAC,EAC9C,CAAC;QACG,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAC9B,CAAC;YACG,OAAO,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;IACL,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,UAAU,CAAC,EAC9C,CAAC;QACG,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EACtD,CAAC;YACG,OAAO,IAAI,CAAC,KAAK,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/lib/transform/cst-transformer.d.ts

@@ -0,0 +1,158 @@
+import { AstNode } from '../ast/ast-node.js';
+import type { TransformSchema } from '../grammar/transform-schema.js';
+import type { ParseTableProductionJson } from '../parse-table/parse-table-json.js';
+import type { ParseTable } from '../parse-table/parse-table.js';
+import { type ProductionSlot } from './binding-map.js';
+/**
+ * Applies CST-to-AST transform rules to a concrete syntax tree.
+ */
+export declare class CstTransformer {
+    private readonly schema;
+    private readonly table;
+    /**
+     * Creates a transformer for a transform schema and parse table.
+     *
+     * @param schema - CST-to-AST rules from the grammar `transform` section.
+     * @param table - Parse table supplying production metadata for reference lookup.
+     */
+    constructor(schema: TransformSchema, table: ParseTable);
+    /**
+     * Transforms a concrete syntax tree into an abstract syntax tree.
+     *
+     * @param cst - Parse tree rooted at the grammar start symbol.
+     * @returns Transformed AST, or null when transformation fails.
+     */
+    transform(cst: AstNode | null): AstNode | null;
+    /**
+     * Transforms a CST using a transform schema and parse table.
+     *
+     * @param cst - Parse tree rooted at the grammar start symbol.
+     * @param schema - CST-to-AST rules from the grammar `transform` section.
+     * @param table - Parse table supplying production metadata for reference lookup.
+     */
+    static transform(cst: AstNode | null, schema: TransformSchema, table: ParseTable): AstNode | null;
+    /**
+     * Transforms one CST node and its descendants.
+     *
+     * @param node - CST node to transform.
+     */
+    private transformNode;
+    /**
+     * Applies one transform expression to a CST node.
+     *
+     * @param node - CST node being transformed.
+     * @param expression - Transform expression for the matched alternative.
+     */
+    private applyExpression;
+    /**
+     * Builds an AST node from a `type.#variant(arg, …)` transform.
+     *
+     * @param node - CST node supplying bound child references.
+     * @param expression - Build transform expression.
+     */
+    private applyBuild;
+    /**
+     * Left-folds repeated infix operators into chained AST nodes.
+     *
+     * @param node - CST node for one operator application or repeat segment.
+     * @param expression - Fold-left transform expression.
+     */
+    private applyFoldLeft;
+    /**
+     * Right-folds repeated infix operators into chained AST nodes.
+     *
+     * @param node - CST node for one operator application or repeat segment.
+     * @param expression - Fold-right transform expression.
+     */
+    private applyFoldRight;
+    /**
+     * Flattens a `{ head tail }` repetition into one list AST node.
+     *
+     * @param node - CST node for one repeat segment.
+     * @param expression - Flatten transform expression.
+     */
+    private applyFlatten;
+    /**
+     * Transforms a CST node without explicit transform rules.
+     *
+     * @param node - CST node to pass through or unwrap.
+     */
+    private defaultTransform;
+    /**
+     * Transforms and compacts a list of child CST nodes.
+     *
+     * @param children - Child CST nodes.
+     */
+    private transformChildren;
+    /**
+     * Transforms one referenced child of a CST node.
+     *
+     * @param node - Parent CST node.
+     * @param reference - Binding or symbol name from a transform expression.
+     */
+    private transformReference;
+    /**
+     * Returns the CST child for a transform reference name.
+     *
+     * @param node - Parent CST node.
+     * @param reference - Binding or symbol name from a transform expression.
+     */
+    private resolveReferenceNode;
+    /**
+     * Resolves transform references to CST child nodes.
+     *
+     * @param node - Parent CST node.
+     * @param references - Reference names from a transform expression.
+     */
+    private resolveReferences;
+    /**
+     * Returns the recursive tail child for a repeat production node.
+     *
+     * @param node - Repeat CST node.
+     * @param resolved - Resolved reference child nodes.
+     */
+    private findRepeatTail;
+    /**
+     * Returns whether a CST node represents an epsilon production.
+     *
+     * @param node - CST node to test.
+     */
+    private isEpsilonNode;
+    /**
+     * Returns parse table production metadata for a CST node.
+     *
+     * @param node - CST node reduced by a known production.
+     */
+    private productionFor;
+    /**
+     * Finds the transform alternative matching a CST node variant.
+     *
+     * @param alternatives - Transform alternatives for one production.
+     * @param node - CST node being transformed.
+     */
+    private findAlternative;
+    /**
+     * Builds an AST interior node from transformed children.
+     *
+     * @param typeName - AST type name.
+     * @param variant - AST variant label.
+     * @param children - Transformed child nodes.
+     * @param location - Optional source span.
+     */
+    private buildAstNode;
+}
+/**
+ * Transforms a CST into an AST using transform rules and production metadata.
+ *
+ * @param cst - Parse tree rooted at the grammar start symbol.
+ * @param schema - CST-to-AST rules from the grammar `transform` section.
+ * @param table - Parse table supplying production metadata for reference lookup.
+ */
+export declare function transformCst(cst: AstNode | null, schema: TransformSchema, table: ParseTable): AstNode | null;
+/**
+ * Returns indexed slots for one production, for use in tests and diagnostics.
+ *
+ * @param production - Parse table production metadata.
+ */
+export declare function describeProductionSlots(production: ParseTableProductionJson): readonly ProductionSlot[];
+//# sourceMappingURL=cst-transformer.d.ts.map

package/dist/lib/transform/cst-transformer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cst-transformer.d.ts","sourceRoot":"","sources":["../../../src/lib/transform/cst-transformer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAG7C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAEtE,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,oCAAoC,CAAC;AACnF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAuC,KAAK,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAE5F;;GAEG;AACH,qBAAa,cAAc;IAEvB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;IAEnC;;;;;OAKG;gBACgB,MAAM,EAAE,eAAe,EAAE,KAAK,EAAE,UAAU;IAM7D;;;;;OAKG;IACI,SAAS,CAAC,GAAG,EAAE,OAAO,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI;IAUrD;;;;;;OAMG;WACW,SAAS,CACnB,GAAG,EAAE,OAAO,GAAG,IAAI,EACnB,MAAM,EAAE,eAAe,EACvB,KAAK,EAAE,UAAU,GAClB,OAAO,GAAG,IAAI;IAUjB;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAiCrB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAwBvB;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IA2BlB;;;;;OAKG;IACH,OAAO,CAAC,aAAa;IA2DrB;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAsEtB;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IA6BpB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IA2BxB;;;;OAIG;IACH,OAAO,CAAC,iBAAiB;IAiBzB;;;;;OAKG;IACH,OAAO,CAAC,kBAAkB;IAY1B;;;;;OAKG;IACH,OAAO,CAAC,oBAAoB;IAyB5B;;;;;OAKG;IACH,OAAO,CAAC,iBAAiB;IAsBzB;;;;;OAKG;IACH,OAAO,CAAC,cAAc;IAoBtB;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAiBrB;;;;OAIG;IACH,OAAO,CAAC,aAAa;IAUrB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAuBvB;;;;;;;OAOG;IACH,OAAO,CAAC,YAAY;CAcvB;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CACxB,GAAG,EAAE,OAAO,GAAG,IAAI,EACnB,MAAM,EAAE,eAAe,EACvB,KAAK,EAAE,UAAU,GAClB,OAAO,GAAG,IAAI,CAGhB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACnC,UAAU,EAAE,wBAAwB,GACrC,SAAS,cAAc,EAAE,CAG3B"}

package/dist/lib/transform/cst-transformer.js

@@ -0,0 +1,381 @@
+import { AstNode } from '../ast/ast-node.js';
+import { AUGMENTED_START_SYMBOL } from '../parse-table/bnf/bnf-grammar.js';
+import { mergeChildLocations } from '../shift-reduce/shift-reduce-engine.js';
+import { productionSlots, referenceSlotIndex } from './binding-map.js';
+/**
+ * Applies CST-to-AST transform rules to a concrete syntax tree.
+ */
+export class CstTransformer {
+    schema;
+    table;
+    /**
+     * Creates a transformer for a transform schema and parse table.
+     *
+     * @param schema - CST-to-AST rules from the grammar `transform` section.
+     * @param table - Parse table supplying production metadata for reference lookup.
+     */
+    constructor(schema, table) {
+        this.schema = schema;
+        this.table = table;
+    }
+    /**
+     * Transforms a concrete syntax tree into an abstract syntax tree.
+     *
+     * @param cst - Parse tree rooted at the grammar start symbol.
+     * @returns Transformed AST, or null when transformation fails.
+     */
+    transform(cst) {
+        if (cst === null) {
+            return null;
+        }
+        return this.transformNode(cst);
+    }
+    /**
+     * Transforms a CST using a transform schema and parse table.
+     *
+     * @param cst - Parse tree rooted at the grammar start symbol.
+     * @param schema - CST-to-AST rules from the grammar `transform` section.
+     * @param table - Parse table supplying production metadata for reference lookup.
+     */
+    static transform(cst, schema, table) {
+        if (cst === null) {
+            return null;
+        }
+        return new CstTransformer(schema, table).transform(cst);
+    }
+    /**
+     * Transforms one CST node and its descendants.
+     *
+     * @param node - CST node to transform.
+     */
+    transformNode(node) {
+        if (node.isTerminal) {
+            return node;
+        }
+        if (node.symbol === AUGMENTED_START_SYMBOL) {
+            return node.children.length === 1
+                ? this.transformNode(node.children[0])
+                : null;
+        }
+        const rule = this.schema.rule(node.symbol) ?? (node.origin === null ? null : this.schema.rule(node.origin));
+        if (rule === null) {
+            return this.defaultTransform(node);
+        }
+        const alternative = this.findAlternative(rule.alternatives, node);
+        if (alternative === null) {
+            return this.defaultTransform(node);
+        }
+        return this.applyExpression(node, alternative.expression);
+    }
+    /**
+     * Applies one transform expression to a CST node.
+     *
+     * @param node - CST node being transformed.
+     * @param expression - Transform expression for the matched alternative.
+     */
+    applyExpression(node, expression) {
+        switch (expression.kind) {
+            case 'drop':
+                return null;
+            case 'pass':
+                return this.transformReference(node, expression.reference);
+            case 'build':
+                return this.applyBuild(node, expression);
+            case 'foldLeft':
+                return this.applyFoldLeft(node, expression);
+            case 'foldRight':
+                return this.applyFoldRight(node, expression);
+            case 'flatten':
+                return this.applyFlatten(node, expression);
+        }
+    }
+    /**
+     * Builds an AST node from a `type.#variant(arg, …)` transform.
+     *
+     * @param node - CST node supplying bound child references.
+     * @param expression - Build transform expression.
+     */
+    applyBuild(node, expression) {
+        const children = [];
+        for (const reference of expression.arguments) {
+            const child = this.transformReference(node, reference);
+            if (child === null) {
+                return null;
+            }
+            children.push(child);
+        }
+        return AstNode.rule(expression.typeName, children, mergeChildLocations(children) ?? node.location, expression.variant);
+    }
+    /**
+     * Left-folds repeated infix operators into chained AST nodes.
+     *
+     * @param node - CST node for one operator application or repeat segment.
+     * @param expression - Fold-left transform expression.
+     */
+    applyFoldLeft(node, expression) {
+        const slots = this.resolveReferences(node, expression.references);
+        if (slots === null) {
+            return null;
+        }
+        const [leftRef, operatorRef, rightRef] = expression.references;
+        const left = this.transformReference(node, leftRef);
+        const operator = this.transformReference(node, operatorRef);
+        const right = this.transformReference(node, rightRef);
+        if (left === null || operator === null || right === null) {
+            return null;
+        }
+        let acc = this.buildAstNode(expression.typeName, expression.variant, [left, operator, right], node.location);
+        let tail = this.findRepeatTail(node, slots);
+        while (tail !== null && !this.isEpsilonNode(tail)) {
+            const tailSlots = this.resolveReferences(tail, expression.references);
+            if (tailSlots === null) {
+                return null;
+            }
+            const tailOperator = this.transformReference(tail, operatorRef);
+            const tailRight = this.transformReference(tail, rightRef);
+            if (tailOperator === null || tailRight === null) {
+                return null;
+            }
+            acc = this.buildAstNode(expression.typeName, expression.variant, [acc, tailOperator, tailRight], mergeChildLocations([acc, tailRight]) ?? node.location);
+            tail = this.findRepeatTail(tail, tailSlots);
+        }
+        return acc;
+    }
+    /**
+     * Right-folds repeated infix operators into chained AST nodes.
+     *
+     * @param node - CST node for one operator application or repeat segment.
+     * @param expression - Fold-right transform expression.
+     */
+    applyFoldRight(node, expression) {
+        const parts = [];
+        let current = node;
+        while (current !== null && !this.isEpsilonNode(current)) {
+            const leftRef = expression.references[0];
+            const operatorRef = expression.references[1];
+            const rightRef = expression.references[2];
+            if (leftRef === undefined || operatorRef === undefined || rightRef === undefined) {
+                return null;
+            }
+            const slots = this.resolveReferences(current, expression.references);
+            if (slots === null) {
+                return null;
+            }
+            const left = this.transformReference(current, leftRef);
+            const operator = this.transformReference(current, operatorRef);
+            const right = this.transformReference(current, rightRef);
+            if (left === null || operator === null || right === null) {
+                return null;
+            }
+            parts.push({ left, operator, right });
+            current = this.findRepeatTail(current, slots);
+        }
+        if (parts.length === 0) {
+            return null;
+        }
+        let acc = parts[parts.length - 1]?.right ?? null;
+        for (let index = parts.length - 1; index >= 0; index -= 1) {
+            const part = parts[index];
+            if (part === undefined || acc === null) {
+                return null;
+            }
+            acc = this.buildAstNode(expression.typeName, expression.variant, [part.left, part.operator, acc], mergeChildLocations([part.left, acc]) ?? node.location);
+        }
+        return acc;
+    }
+    /**
+     * Flattens a `{ head tail }` repetition into one list AST node.
+     *
+     * @param node - CST node for one repeat segment.
+     * @param expression - Flatten transform expression.
+     */
+    applyFlatten(node, expression) {
+        const items = [];
+        let current = node;
+        while (current !== null && !this.isEpsilonNode(current)) {
+            const head = this.transformReference(current, expression.head);
+            if (head === null) {
+                return null;
+            }
+            items.push(head);
+            current = this.resolveReferenceNode(current, expression.tail);
+        }
+        return AstNode.rule(expression.typeName, items, mergeChildLocations(items) ?? node.location, expression.variant);
+    }
+    /**
+     * Transforms a CST node without explicit transform rules.
+     *
+     * @param node - CST node to pass through or unwrap.
+     */
+    defaultTransform(node) {
+        if (this.isEpsilonNode(node)) {
+            return null;
+        }
+        const children = this.transformChildren(node.children);
+        if (children.length === 1) {
+            return children[0];
+        }
+        if (children.length === 0) {
+            return null;
+        }
+        return AstNode.rule(node.symbol, children, mergeChildLocations(children) ?? node.location, node.variant);
+    }
+    /**
+     * Transforms and compacts a list of child CST nodes.
+     *
+     * @param children - Child CST nodes.
+     */
+    transformChildren(children) {
+        const transformed = [];
+        for (const child of children) {
+            const node = this.transformNode(child);
+            if (node !== null) {
+                transformed.push(node);
+            }
+        }
+        return transformed;
+    }
+    /**
+     * Transforms one referenced child of a CST node.
+     *
+     * @param node - Parent CST node.
+     * @param reference - Binding or symbol name from a transform expression.
+     */
+    transformReference(node, reference) {
+        const child = this.resolveReferenceNode(node, reference);
+        if (child === null) {
+            return null;
+        }
+        return this.transformNode(child);
+    }
+    /**
+     * Returns the CST child for a transform reference name.
+     *
+     * @param node - Parent CST node.
+     * @param reference - Binding or symbol name from a transform expression.
+     */
+    resolveReferenceNode(node, reference) {
+        const production = this.productionFor(node);
+        if (production !== null) {
+            const slotIndex = referenceSlotIndex(production, reference);
+            if (slotIndex !== null) {
+                return node.children[slotIndex] ?? null;
+            }
+        }
+        for (const child of node.children) {
+            if (child.symbol === reference || child.origin === reference) {
+                return child;
+            }
+        }
+        return null;
+    }
+    /**
+     * Resolves transform references to CST child nodes.
+     *
+     * @param node - Parent CST node.
+     * @param references - Reference names from a transform expression.
+     */
+    resolveReferences(node, references) {
+        const resolved = [];
+        for (const reference of references) {
+            const child = this.resolveReferenceNode(node, reference);
+            if (child === null) {
+                return null;
+            }
+            resolved.push(child);
+        }
+        return resolved;
+    }
+    /**
+     * Returns the recursive tail child for a repeat production node.
+     *
+     * @param node - Repeat CST node.
+     * @param resolved - Resolved reference child nodes.
+     */
+    findRepeatTail(node, resolved) {
+        const lastChild = node.children[node.children.length - 1];
+        if (lastChild !== undefined && (lastChild.symbol === node.symbol || lastChild.origin === node.origin)) {
+            return lastChild;
+        }
+        for (const child of resolved) {
+            if (child.symbol === node.symbol || child.origin === node.origin) {
+                return child;
+            }
+        }
+        return null;
+    }
+    /**
+     * Returns whether a CST node represents an epsilon production.
+     *
+     * @param node - CST node to test.
+     */
+    isEpsilonNode(node) {
+        if (node.isTerminal) {
+            return false;
+        }
+        if (node.children.length > 0) {
+            return false;
+        }
+        const production = this.productionFor(node);
+        return production !== null && production.rhs.length === 0;
+    }
+    /**
+     * Returns parse table production metadata for a CST node.
+     *
+     * @param node - CST node reduced by a known production.
+     */
+    productionFor(node) {
+        if (node.productionId === null) {
+            return null;
+        }
+        return this.table.production(node.productionId);
+    }
+    /**
+     * Finds the transform alternative matching a CST node variant.
+     *
+     * @param alternatives - Transform alternatives for one production.
+     * @param node - CST node being transformed.
+     */
+    findAlternative(alternatives, node) {
+        if (node.variant !== null) {
+            const matched = alternatives.find((alternative) => alternative.label === node.variant);
+            if (matched !== undefined) {
+                return matched;
+            }
+        }
+        if (alternatives.length === 1) {
+            return alternatives[0];
+        }
+        return null;
+    }
+    /**
+     * Builds an AST interior node from transformed children.
+     *
+     * @param typeName - AST type name.
+     * @param variant - AST variant label.
+     * @param children - Transformed child nodes.
+     * @param location - Optional source span.
+     */
+    buildAstNode(typeName, variant, children, location) {
+        return AstNode.rule(typeName, [...children], location, variant);
+    }
+}
+/**
+ * Transforms a CST into an AST using transform rules and production metadata.
+ *
+ * @param cst - Parse tree rooted at the grammar start symbol.
+ * @param schema - CST-to-AST rules from the grammar `transform` section.
+ * @param table - Parse table supplying production metadata for reference lookup.
+ */
+export function transformCst(cst, schema, table) {
+    return CstTransformer.transform(cst, schema, table);
+}
+/**
+ * Returns indexed slots for one production, for use in tests and diagnostics.
+ *
+ * @param production - Parse table production metadata.
+ */
+export function describeProductionSlots(production) {
+    return productionSlots(production);
+}
+//# sourceMappingURL=cst-transformer.js.map

package/dist/lib/transform/cst-transformer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cst-transformer.js","sourceRoot":"","sources":["../../../src/lib/transform/cst-transformer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAI7C,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAG3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,wCAAwC,CAAC;AAE7E,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAuB,MAAM,kBAAkB,CAAC;AAE5F;;GAEG;AACH,MAAM,OAAO,cAAc;IAEN,MAAM,CAAkB;IACxB,KAAK,CAAa;IAEnC;;;;;OAKG;IACH,YAAmB,MAAuB,EAAE,KAAiB;QAEzD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACI,SAAS,CAAC,GAAmB;QAEhC,IAAI,GAAG,KAAK,IAAI,EAChB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,SAAS,CACnB,GAAmB,EACnB,MAAuB,EACvB,KAAiB;QAGjB,IAAI,GAAG,KAAK,IAAI,EAChB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,IAAa;QAE/B,IAAI,IAAI,CAAC,UAAU,EACnB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,sBAAsB,EAC1C,CAAC;YACG,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC7B,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC,CAAC,IAAI,CAAC;QACf,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAC1C,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAC9D,CAAC;QAEF,IAAI,IAAI,KAAK,IAAI,EACjB,CAAC;YACG,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAElE,IAAI,WAAW,KAAK,IAAI,EACxB,CAAC;YACG,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IAED;;;;;OAKG;IACK,eAAe,CAAC,IAAa,EAAE,UAA+B;QAElE,QAAQ,UAAU,CAAC,IAAI,EACvB,CAAC;YACG,KAAK,MAAM;gBACP,OAAO,IAAI,CAAC;YAEhB,KAAK,MAAM;gBACP,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,SAAS,CAAC,CAAC;YAE/D,KAAK,OAAO;gBACR,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAE7C,KAAK,UAAU;gBACX,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAEhD,KAAK,WAAW;gBACZ,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YAEjD,KAAK,SAAS;gBACV,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACnD,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACK,UAAU,CACd,IAAa,EACb,UAA2D;QAG3D,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,SAAS,EAC5C,CAAC;YACG,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAEvD,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CACf,UAAU,CAAC,QAAQ,EACnB,QAAQ,EACR,mBAAmB,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAC9C,UAAU,CAAC,OAAO,CACrB,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,aAAa,CACjB,IAAa,EACb,UAA8D;QAG9D,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;QAElE,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,CAAC,OAAO,EAAE,WAAW,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,UAAU,CAAC;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC5D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAEtD,IAAI,IAAI,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EACxD,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CACvB,UAAU,CAAC,QAAQ,EACnB,UAAU,CAAC,OAAO,EAClB,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,EACvB,IAAI,CAAC,QAAQ,CAChB,CAAC;QACF,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAE5C,OAAO,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EACjD,CAAC;YACG,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;YAEtE,IAAI,SAAS,KAAK,IAAI,EACtB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YAChE,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAE1D,IAAI,YAAY,KAAK,IAAI,IAAI,SAAS,KAAK,IAAI,EAC/C,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,GAAG,GAAG,IAAI,CAAC,YAAY,CACnB,UAAU,CAAC,QAAQ,EACnB,UAAU,CAAC,OAAO,EAClB,CAAC,GAAG,EAAE,YAAY,EAAE,SAAS,CAAC,EAC9B,mBAAmB,CAAC,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CACzD,CAAC;YACF,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAClB,IAAa,EACb,UAA+D;QAG/D,MAAM,KAAK,GAIL,EAAE,CAAC;QACT,IAAI,OAAO,GAAmB,IAAI,CAAC;QAEnC,OAAO,OAAO,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EACvD,CAAC;YACG,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,WAAW,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAE1C,IAAI,OAAO,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAChF,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC;YAErE,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAEzD,IAAI,IAAI,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,EACxD,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YACtC,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EACtB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC;QAEjD,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EACzD,CAAC;YACG,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YAE1B,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI,EACtC,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,GAAG,GAAG,IAAI,CAAC,YAAY,CACnB,UAAU,CAAC,QAAQ,EACnB,UAAU,CAAC,OAAO,EAClB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,EAC/B,mBAAmB,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CACzD,CAAC;QACN,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAChB,IAAa,EACb,UAA6D;QAG7D,MAAM,KAAK,GAAc,EAAE,CAAC;QAC5B,IAAI,OAAO,GAAmB,IAAI,CAAC;QAEnC,OAAO,OAAO,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EACvD,CAAC;YACG,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;YAE/D,IAAI,IAAI,KAAK,IAAI,EACjB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;QAClE,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CACf,UAAU,CAAC,QAAQ,EACnB,KAAK,EACL,mBAAmB,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAC3C,UAAU,CAAC,OAAO,CACrB,CAAC;IACN,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,IAAa;QAElC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAC5B,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEvD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EACzB,CAAC;YACG,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EACzB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CACf,IAAI,CAAC,MAAM,EACX,QAAQ,EACR,mBAAmB,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAC9C,IAAI,CAAC,OAAO,CACf,CAAC;IACN,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,QAA4B;QAElD,MAAM,WAAW,GAAc,EAAE,CAAC;QAElC,KAAK,MAAM,KAAK,IAAI,QAAQ,EAC5B,CAAC;YACG,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAEvC,IAAI,IAAI,KAAK,IAAI,EACjB,CAAC;gBACG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACK,kBAAkB,CAAC,IAAa,EAAE,SAAiB;QAEvD,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAEzD,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC;IAED;;;;;OAKG;IACK,oBAAoB,CAAC,IAAa,EAAE,SAAiB;QAEzD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,UAAU,KAAK,IAAI,EACvB,CAAC;YACG,MAAM,SAAS,GAAG,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAE5D,IAAI,SAAS,KAAK,IAAI,EACtB,CAAC;gBACG,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC;YAC5C,CAAC;QACL,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EACjC,CAAC;YACG,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAC5D,CAAC;gBACG,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,iBAAiB,CACrB,IAAa,EACb,UAA6B;QAG7B,MAAM,QAAQ,GAAc,EAAE,CAAC;QAE/B,KAAK,MAAM,SAAS,IAAI,UAAU,EAClC,CAAC;YACG,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAEzD,IAAI,KAAK,KAAK,IAAI,EAClB,CAAC;gBACG,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,IAAa,EAAE,QAA4B;QAE9D,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE1D,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,EACrG,CAAC;YACG,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,QAAQ,EAC5B,CAAC;YACG,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAChE,CAAC;gBACG,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,IAAa;QAE/B,IAAI,IAAI,CAAC,UAAU,EACnB,CAAC;YACG,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAC5B,CAAC;YACG,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAE5C,OAAO,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,IAAa;QAE/B,IAAI,IAAI,CAAC,YAAY,KAAK,IAAI,EAC9B,CAAC;YACG,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACK,eAAe,CACnB,YAA6C,EAC7C,IAAa;QAGb,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,EACzB,CAAC;YACG,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC;YAEvF,IAAI,OAAO,KAAK,SAAS,EACzB,CAAC;gBACG,OAAO,OAAO,CAAC;YACnB,CAAC;QACL,CAAC;QAED,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAC7B,CAAC;YACG,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACK,YAAY,CAChB,QAAgB,EAChB,OAAe,EACf,QAA4B,EAC5B,QAA6B;QAG7B,OAAO,OAAO,CAAC,IAAI,CACf,QAAQ,EACR,CAAC,GAAG,QAAQ,CAAC,EACb,QAAQ,EACR,OAAO,CACV,CAAC;IACN,CAAC;CACJ;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CACxB,GAAmB,EACnB,MAAuB,EACvB,KAAiB;IAGjB,OAAO,cAAc,CAAC,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;AACxD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACnC,UAAoC;IAGpC,OAAO,eAAe,CAAC,UAAU,CAAC,CAAC;AACvC,CAAC"}

package/dist/lib/transform/index.d.ts

@@ -0,0 +1,4 @@
+export { parseRhsSymbolKey, productionSlots, referenceSlotIndex } from './binding-map.js';
+export type { ProductionSlot } from './binding-map.js';
+export { CstTransformer, describeProductionSlots, transformCst } from './cst-transformer.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/lib/transform/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/lib/transform/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,uBAAuB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/lib/transform/index.js

@@ -0,0 +1,3 @@
+export { parseRhsSymbolKey, productionSlots, referenceSlotIndex } from './binding-map.js';
+export { CstTransformer, describeProductionSlots, transformCst } from './cst-transformer.js';
+//# sourceMappingURL=index.js.map

package/dist/lib/transform/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/lib/transform/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAE1F,OAAO,EAAE,cAAc,EAAE,uBAAuB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC"}

package/package.json

@@ -1,7 +1,7 @@
 {
     "name": "parser-lr",
     "author": "Adam R Moss <adamrmoss@gmail.com>",
-    "version": "0.0.0",
+    "version": "0.2.0",
     "description": "Shift-reduce parser library for EBNF grammars",
     "license": "MIT",
     "type": "module",
@@ -29,21 +29,28 @@
         "registry": "https://registry.npmjs.org/"
     },
     "scripts": {
+        "publish": "npm run build && npm publish",
+        "bootstrap": "npm link && parser-lr table generate -g grammars/grammar.grammar -o src/lib/grammar/grammar.json",
         "build": "npm run build:clean && npm run build:lib && npm run build:cli",
         "build:clean": "rm -rf dist && rm -f bin/parser-lr.js bin/parser-lr.js.map",
-        "build:lib": "tsc -p tsconfig.lib.json",
-        "build:cli": "rollup -c rollup.cli.config.js",
+        "build:lib": "tsc -p tsconfig.lib.json && cp src/lib/grammar/grammar.json dist/lib/grammar/",
+        "build:cli": "rollup -c rollup.cli.config.js && chmod +x bin/parser-lr.js",
+        "test": "jest",
         "prepack": "npm run build"
     },
     "dependencies": {},
     "devDependencies": {
+        "@jest/globals": "29.x",
         "@rollup/plugin-commonjs": "28.x",
         "@rollup/plugin-json": "6.x",
         "@rollup/plugin-node-resolve": "16.x",
         "@rollup/plugin-typescript": "12.x",
+        "@types/jest": "29.x",
         "@types/node": "22.x",
         "commander": "12.x",
+        "jest": "29.x",
         "rollup": "4.x",
+        "ts-jest": "29.x",
         "tslib": "2.x",
         "typescript": "5.x"
     }