@jbrowse/jexl 4.0.1 → 5.0.1

package/dist/parser/states.js

@@ -1,176 +0,0 @@
-"use strict";
-/*
- * Jexl
- * Copyright 2020 Tom Shawver
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.states = void 0;
-const h = __importStar(require("./handlers.js"));
-/**
- * The tokens that may follow a finished operand: an operator to combine it
- * with, a dot or subscript to keep drilling into it, a question mark opening a
- * ternary, or a semicolon ending the statement. Shared by every state that
- * sits on a complete value, which is also why each of them is completable.
- */
-const afterOperand = {
-    binaryOp: { toState: 'expectOperand' },
-    dot: { toState: 'traverse' },
-    openBracket: { toState: 'filter' },
-    question: { toState: 'ternaryMid', handler: h.ternaryStart },
-    semicolon: { handler: h.semicolon }
-};
-/**
- * A mapping of all states in the finite state machine to a set of instructions
- * for handling or transitioning into other states. Each state can be handled
- * in one of two schemes: a tokenType map, or a subHandler.
- *
- * Standard expression elements are handled through the tokenType object. This
- * is an object map of all legal token types to encounter in this state (and
- * any unexpected token types will generate a thrown error) to an options
- * object that defines how they're handled.  The available options are:
- *
- *      {string} toState: The name of the state to which to transition
- *          immediately after handling this token
- *      {string} handler: The handler function to call when this token type is
- *          encountered in this state.  If omitted, the default handler
- *          matching the token's "type" property will be called. If the handler
- *          function does not exist, no call will be made and no error will be
- *          generated.  This is useful for tokens whose sole purpose is to
- *          transition to other states.
- *
- * States that consume a subexpression should define a subHandler, the
- * function to be called with an expression tree argument when the
- * subexpression is complete. Completeness is determined through the
- * endStates object, which maps tokens on which an expression should end to the
- * state to which to transition once the subHandler function has been called.
- *
- * Additionally, any state in which it is legal to mark the AST as completed
- * should have a 'completable' property set to boolean true.  Attempting to
- * call {@link Parser#complete} in any state without this property will result
- * in a thrown Error.
- *
- * @type {{}}
- */
-exports.states = {
-    expectOperand: {
-        tokenTypes: {
-            literal: { toState: 'expectBinOp' },
-            templateString: { toState: 'expectBinOp' },
-            identifier: { toState: 'identifier' },
-            unaryOp: {},
-            openParen: { toState: 'subExpression' },
-            openCurl: { toState: 'expectObjKey', handler: h.objStart },
-            dot: { toState: 'traverse' },
-            openBracket: { toState: 'arrayVal', handler: h.arrayStart }
-        }
-    },
-    expectBinOp: {
-        tokenTypes: afterOperand,
-        completable: true
-    },
-    expectObjKey: {
-        tokenTypes: {
-            literal: { toState: 'expectKeyValSep', handler: h.objKey },
-            identifier: { toState: 'expectKeyValSep', handler: h.objKey },
-            closeCurl: { toState: 'expectBinOp' }
-        }
-    },
-    expectKeyValSep: {
-        tokenTypes: {
-            colon: { toState: 'objVal' }
-        }
-    },
-    identifier: {
-        tokenTypes: {
-            ...afterOperand,
-            // a name is the only operand that can be followed by an argument list,
-            // since a function is called by name rather than evaluated as a value
-            openParen: { toState: 'argVal', handler: h.functionCall }
-        },
-        completable: true
-    },
-    traverse: {
-        tokenTypes: {
-            identifier: { toState: 'identifier' }
-        }
-    },
-    filter: {
-        subHandler: h.filter,
-        endStates: {
-            closeBracket: 'identifier'
-        }
-    },
-    subExpression: {
-        subHandler: h.subExpression,
-        endStates: {
-            closeParen: 'expectBinOp'
-        }
-    },
-    argVal: {
-        subHandler: h.argVal,
-        endStates: {
-            comma: 'argVal',
-            // a call's result is an ordinary operand: it can be operated on or
-            // drilled into, but not called again, since only a name can be called
-            closeParen: 'expectBinOp'
-        }
-    },
-    objVal: {
-        subHandler: h.objVal,
-        endStates: {
-            comma: 'expectObjKey',
-            closeCurl: 'expectBinOp'
-        }
-    },
-    arrayVal: {
-        subHandler: h.arrayVal,
-        endStates: {
-            comma: 'arrayVal',
-            closeBracket: 'expectBinOp'
-        }
-    },
-    ternaryMid: {
-        subHandler: h.ternaryMid,
-        endStates: {
-            colon: 'ternaryEnd'
-        }
-    },
-    ternaryEnd: {
-        subHandler: h.ternaryEnd,
-        completable: true
-    }
-};
-//# sourceMappingURL=states.js.map

package/dist/parser/states.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"states.js","sourceRoot":"","sources":["../../src/parser/states.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,iDAAkC;AAmBlC;;;;;GAKG;AACH,MAAM,YAAY,GAAqC;IACrD,QAAQ,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;IACtC,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;IAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;IAClC,QAAQ,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;IAC5D,SAAS,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC,SAAS,EAAE;CACpC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACU,QAAA,MAAM,GAAW;IAC5B,aAAa,EAAE;QACb,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YACnC,cAAc,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;YAC1C,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;YACrC,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE;YACvC,QAAQ,EAAE,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE;YAC1D,GAAG,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE;YAC5B,WAAW,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,CAAC,UAAU,EAAE;SAC5D;KACF;IACD,WAAW,EAAE;QACX,UAAU,EAAE,YAAY;QACxB,WAAW,EAAE,IAAI;KAClB;IACD,YAAY,EAAE;QACZ,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC1D,UAAU,EAAE,EAAE,OAAO,EAAE,iBAAiB,EAAE,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;YAC7D,SAAS,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;SACtC;KACF;IACD,eAAe,EAAE;QACf,UAAU,EAAE;YACV,KAAK,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;SAC7B;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE;YACV,GAAG,YAAY;YACf,uEAAuE;YACvE,sEAAsE;YACtE,SAAS,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE;SAC1D;QACD,WAAW,EAAE,IAAI;KAClB;IACD,QAAQ,EAAE;QACR,UAAU,EAAE;YACV,UAAU,EAAE,EAAE,OAAO,EAAE,YAAY,EAAE;SACtC;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,YAAY,EAAE,YAAY;SAC3B;KACF;IACD,aAAa,EAAE;QACb,UAAU,EAAE,CAAC,CAAC,aAAa;QAC3B,SAAS,EAAE;YACT,UAAU,EAAE,aAAa;SAC1B;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,QAAQ;YACf,mEAAmE;YACnE,sEAAsE;YACtE,UAAU,EAAE,aAAa;SAC1B;KACF;IACD,MAAM,EAAE;QACN,UAAU,EAAE,CAAC,CAAC,MAAM;QACpB,SAAS,EAAE;YACT,KAAK,EAAE,cAAc;YACrB,SAAS,EAAE,aAAa;SACzB;KACF;IACD,QAAQ,EAAE;QACR,UAAU,EAAE,CAAC,CAAC,QAAQ;QACtB,SAAS,EAAE;YACT,KAAK,EAAE,UAAU;YACjB,YAAY,EAAE,aAAa;SAC5B;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,SAAS,EAAE;YACT,KAAK,EAAE,YAAY;SACpB;KACF;IACD,UAAU,EAAE;QACV,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,WAAW,EAAE,IAAI;KAClB;CACF,CAAA"}

package/esm/parser/handlers.d.ts

@@ -1,115 +0,0 @@
-import Parser from './Parser.ts';
-import type { AstNode, Token } from '../types.ts';
-/**
- * Handles a subexpression that's used to define a transform argument's value.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function argVal(this: Parser, ast: AstNode | null): void;
-/**
- * Handles new array literals by adding them as a new node in the AST,
- * initialized with an empty array.
- */
-export declare function arrayStart(this: Parser): void;
-/**
- * Handles a subexpression representing an element of an array literal.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function arrayVal(this: Parser, ast: AstNode | null): void;
-/**
- * Handles tokens of type 'binaryOp', indicating an operation that has two
- * inputs: a left side and a right side.
- * @param {{type: <string>}} token A token object
- */
-export declare function binaryOp(this: Parser, token: Token): void;
-/**
- * Handles successive nodes in an identifier chain.  More specifically, it
- * sets values that determine how the following identifier gets placed in the
- * AST.
- */
-export declare function dot(this: Parser): void;
-/**
- * Handles a subexpression used for filtering an array returned by an
- * identifier chain.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function filter(this: Parser, ast: AstNode | null): void;
-/**
- * Handles identifier tokens when used to indicate the name of a function to
- * be called.
- *
- * A call written against a value, `a.b(x)`, becomes `b(a, x)`: jexl functions
- * live in one global pool and have no receiver, so the value the name was read
- * from is passed as the first argument instead. Every function in the pool is
- * already written that way — `get(feature, key)`, `split(str, sep)` — which is
- * what makes the two spellings equivalent. Previously the receiver was simply
- * dropped, so `refName.split(' ')` quietly called `split(' ')`.
- */
-export declare function functionCall(this: Parser): void;
-/**
- * Handles identifier tokens by adding them as a new node in the AST.
- * @param {{type: <string>}} token A token object
- */
-export declare function identifier(this: Parser, token: Token): void;
-/**
- * Handles literal values, such as strings, booleans, and numerics, by adding
- * them as a new node in the AST.
- * @param {{type: <string>}} token A token object
- */
-export declare function literal(this: Parser, token: Token): void;
-/**
- * Handles template string tokens by parsing their interpolation expressions
- * and creating a TemplateLiteral AST node.
- * @param {{type: <string>}} token A token object
- */
-export declare function templateString(this: Parser, token: Token): void;
-/**
- * Queues a new object literal key to be written once a value is collected.
- * @param {{type: <string>}} token A token object
- */
-export declare function objKey(this: Parser, token: Token): void;
-/**
- * Handles new object literals by adding them as a new node in the AST,
- * initialized with an empty object.
- */
-export declare function objStart(this: Parser): void;
-/**
- * Handles an object value by adding its AST to the queued key on the object
- * literal node currently at the cursor.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function objVal(this: Parser, ast: AstNode | null): void;
-/**
- * Handles traditional subexpressions, delineated with the groupStart and
- * groupEnd elements.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function subExpression(this: Parser, ast: AstNode | null): void;
-/**
- * Handles a completed alternate subexpression of a ternary operator.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function ternaryEnd(this: Parser, ast: AstNode | null): void;
-/**
- * Handles a completed consequent subexpression of a ternary operator.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export declare function ternaryMid(this: Parser, ast: AstNode | null): void;
-/**
- * Handles the start of a new ternary expression by encapsulating the tree so
- * far in a ConditionalExpression node, and using it as the test element.
- *
- * Every operator binds tighter than the conditional and so belongs in the test
- * — except `=`, which binds looser. `x = a ? b : c` therefore assigns the
- * conditional rather than testing the assignment, which had stored `a` in `x`.
- */
-export declare function ternaryStart(this: Parser): void;
-/**
- * Handles token of type 'unaryOp', indicating that the operation has only
- * one input: a right side.
- * @param {{type: <string>}} token A token object
- */
-export declare function unaryOp(this: Parser, token: Token): void;
-/**
- * Handles semicolon separator between expressions
- */
-export declare function semicolon(this: Parser): void;

package/esm/parser/handlers.js

@@ -1,328 +0,0 @@
-/*
- * Jexl
- * Copyright 2020 Tom Shawver
- */
-import { precedenceOf } from "../grammar.js";
-// circular with Parser.ts, which is fine: the binding is only read from inside
-// a handler, long after both modules have finished evaluating
-import Parser from "./Parser.js";
-/**
- * Handles a subexpression that's used to define a transform argument's value.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function argVal(ast) {
-    if (ast) {
-        ;
-        this._cursor.args.push(ast);
-    }
-}
-/**
- * Handles new array literals by adding them as a new node in the AST,
- * initialized with an empty array.
- */
-export function arrayStart() {
-    const node = {
-        type: 'ArrayLiteral',
-        value: []
-    };
-    this._placeAtCursor(node);
-}
-/**
- * Handles a subexpression representing an element of an array literal.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function arrayVal(ast) {
-    if (ast) {
-        ;
-        this._cursor.value.push(ast);
-    }
-}
-/**
- * Handles tokens of type 'binaryOp', indicating an operation that has two
- * inputs: a left side and a right side.
- * @param {{type: <string>}} token A token object
- */
-export function binaryOp(token) {
-    if (token.value === '=') {
-        // `from` marks a member access such as `a.b`; only a bare name can be
-        // assigned to, since the compiled closure writes straight into the context
-        if (this._cursor?.type !== 'Identifier' ||
-            this._cursor.from) {
-            throw new Error('Left side of assignment must be a variable name');
-        }
-        const node = {
-            type: 'AssignmentExpression',
-            operator: '=',
-            left: this._cursor
-        };
-        this._cursor = this._cursor._parent;
-        this._placeAtCursor(node);
-        return;
-    }
-    const tokenValue = token.value;
-    const precedence = precedenceOf(this._grammar.elements[tokenValue]);
-    let parent = this._cursor?._parent;
-    while (parent) {
-        const parentExpr = parent;
-        if (!parentExpr.operator) {
-            break;
-        }
-        // a prefix operator binds tighter than any binary one, so `-x ^ 2` groups
-        // as `(-x) ^ 2` — the same way `-2 ^ 2` already does, since the Lexer folds
-        // that sign into the literal. Looking `-` up in the grammar finds its
-        // binary precedence instead, which is lower than `^`'s and gave `-(x ^ 2)`
-        const parentPrecedence = parent.type === 'UnaryExpression'
-            ? Infinity
-            : precedenceOf(this._grammar.elements[parentExpr.operator]);
-        if (parentPrecedence < precedence) {
-            break;
-        }
-        this._cursor = parent;
-        parent = parent._parent;
-    }
-    const node = {
-        type: 'BinaryExpression',
-        operator: tokenValue,
-        left: this._cursor
-    };
-    this._setParent(this._cursor, node);
-    this._cursor = parent;
-    this._placeAtCursor(node);
-}
-/**
- * Handles successive nodes in an identifier chain.  More specifically, it
- * sets values that determine how the following identifier gets placed in the
- * AST.
- */
-export function dot() {
-    const cursor = this._cursor;
-    // a dot continues an identifier chain. With nothing to continue — no cursor,
-    // or an operator still waiting on its right-hand side — it would instead open
-    // a relative path, the leading dot of `list[.price > 5]`. This fork removed
-    // array filtering expressions, which are the only construct that gives a
-    // relative path a root to resolve against, so it is rejected here rather than
-    // parsed into a tree that can only fail once it is evaluated.
-    if (!cursor ||
-        cursor.type === 'UnaryExpression' ||
-        (cursor.type === 'BinaryExpression' && !cursor.right)) {
-        throw new Error(`Relative paths are not supported: ${this._exprStr}`);
-    }
-    this._nextIdentEncapsulate = true;
-}
-/**
- * Handles a subexpression used for filtering an array returned by an
- * identifier chain.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function filter(ast) {
-    const node = {
-        type: 'FilterExpression',
-        expr: ast,
-        subject: this._cursor
-    };
-    this._placeBeforeCursor(node);
-}
-/**
- * Handles identifier tokens when used to indicate the name of a function to
- * be called.
- *
- * A call written against a value, `a.b(x)`, becomes `b(a, x)`: jexl functions
- * live in one global pool and have no receiver, so the value the name was read
- * from is passed as the first argument instead. Every function in the pool is
- * already written that way — `get(feature, key)`, `split(str, sep)` — which is
- * what makes the two spellings equivalent. Previously the receiver was simply
- * dropped, so `refName.split(' ')` quietly called `split(' ')`.
- */
-export function functionCall() {
-    const cursor = this._cursor;
-    if (cursor?.type !== 'Identifier') {
-        // reached by `a[expr]()`, whose subject is a filter rather than a name;
-        // there is nothing to look up in the function pool
-        throw new Error(`Functions must be called by name: ${this._exprStr}`);
-    }
-    const { from, value } = cursor;
-    const node = {
-        type: 'FunctionCall',
-        name: value,
-        args: from ? [from] : []
-    };
-    this._placeBeforeCursor(node);
-}
-/**
- * Handles identifier tokens by adding them as a new node in the AST.
- * @param {{type: <string>}} token A token object
- */
-export function identifier(token) {
-    const node = {
-        type: 'Identifier',
-        value: token.value
-    };
-    if (this._nextIdentEncapsulate) {
-        node.from = this._cursor;
-        this._placeBeforeCursor(node);
-        this._nextIdentEncapsulate = false;
-    }
-    else {
-        this._placeAtCursor(node);
-    }
-}
-/**
- * Handles literal values, such as strings, booleans, and numerics, by adding
- * them as a new node in the AST.
- * @param {{type: <string>}} token A token object
- */
-export function literal(token) {
-    const node = {
-        type: 'Literal',
-        value: token.value
-    };
-    this._placeAtCursor(node);
-}
-/**
- * Handles template string tokens by parsing their interpolation expressions
- * and creating a TemplateLiteral AST node.
- * @param {{type: <string>}} token A token object
- */
-export function templateString(token) {
-    const parts = [];
-    const tokenParts = Array.isArray(token.value) ? token.value : [];
-    for (const part of tokenParts) {
-        if (part.type === 'static') {
-            parts.push({
-                type: 'static',
-                value: this._lexer._unescapeTemplateString(part.value)
-            });
-        }
-        else {
-            const subTokens = this._lexer.tokenize(part.value);
-            const subParser = new Parser(this._grammar, this._lexer);
-            subParser.addTokens(subTokens);
-            const subAst = subParser.complete();
-            if (!subAst) {
-                throw new Error('Empty interpolation in template string');
-            }
-            parts.push({
-                type: 'expression',
-                value: subAst
-            });
-        }
-    }
-    const node = {
-        type: 'TemplateLiteral',
-        parts
-    };
-    this._placeAtCursor(node);
-}
-/**
- * Queues a new object literal key to be written once a value is collected.
- * @param {{type: <string>}} token A token object
- */
-export function objKey(token) {
-    this._curObjKey = token.value;
-}
-/**
- * Handles new object literals by adding them as a new node in the AST,
- * initialized with an empty object.
- */
-export function objStart() {
-    const node = {
-        type: 'ObjectLiteral',
-        value: {}
-    };
-    this._placeAtCursor(node);
-}
-/**
- * Handles an object value by adding its AST to the queued key on the object
- * literal node currently at the cursor.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function objVal(ast) {
-    // defined rather than assigned so that the key "__proto__" becomes an
-    // ordinary entry of the node's key map instead of re-pointing its prototype,
-    // which dropped the entry before it could be compiled
-    Object.defineProperty(this._cursor.value, this._curObjKey, {
-        value: ast,
-        writable: true,
-        enumerable: true,
-        configurable: true
-    });
-}
-/**
- * Handles traditional subexpressions, delineated with the groupStart and
- * groupEnd elements.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function subExpression(ast) {
-    this._placeAtCursor(ast);
-}
-/**
- * Handles a completed alternate subexpression of a ternary operator.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function ternaryEnd(ast) {
-    ;
-    this._cursor.alternate = ast ?? undefined;
-}
-/**
- * Handles a completed consequent subexpression of a ternary operator.
- * @param {{type: <string>}} ast The subexpression tree
- */
-export function ternaryMid(ast) {
-    ;
-    this._cursor.consequent = ast ?? undefined;
-}
-/**
- * Handles the start of a new ternary expression by encapsulating the tree so
- * far in a ConditionalExpression node, and using it as the test element.
- *
- * Every operator binds tighter than the conditional and so belongs in the test
- * — except `=`, which binds looser. `x = a ? b : c` therefore assigns the
- * conditional rather than testing the assignment, which had stored `a` in `x`.
- */
-export function ternaryStart() {
-    let assignment;
-    let test = this._tree;
-    while (test.type === 'AssignmentExpression' && test.right) {
-        assignment = test;
-        test = test.right;
-    }
-    const node = {
-        type: 'ConditionalExpression',
-        test
-    };
-    if (assignment) {
-        assignment.right = node;
-        this._setParent(node, assignment);
-    }
-    else {
-        this._tree = node;
-    }
-    this._cursor = node;
-}
-/**
- * Handles token of type 'unaryOp', indicating that the operation has only
- * one input: a right side.
- * @param {{type: <string>}} token A token object
- */
-export function unaryOp(token) {
-    const node = {
-        type: 'UnaryExpression',
-        operator: token.value
-    };
-    this._placeAtCursor(node);
-}
-/**
- * Handles semicolon separator between expressions
- */
-export function semicolon() {
-    if (!this._sequenceExpressions) {
-        this._sequenceExpressions = [this._tree];
-    }
-    else {
-        this._sequenceExpressions.push(this._tree);
-    }
-    this._tree = null;
-    this._cursor = null;
-    this._state = 'expectOperand';
-}
-//# sourceMappingURL=handlers.js.map

package/esm/parser/handlers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"handlers.js","sourceRoot":"","sources":["../../src/parser/handlers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAC5C,+EAA+E;AAC/E,8DAA8D;AAC9D,OAAO,MAAM,MAAM,aAAa,CAAA;AAkBhC;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAChD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU;IACxB,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAe,GAAmB;IACxD,IAAI,GAAG,EAAE,CAAC;QACR,CAAC;QAAC,IAAI,CAAC,OAAwB,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACjD,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAe,KAAY;IACjD,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QACxB,sEAAsE;QACtE,2EAA2E;QAC3E,IACE,IAAI,CAAC,OAAO,EAAE,IAAI,KAAK,YAAY;YAClC,IAAI,CAAC,OAAsB,CAAC,IAAI,EACjC,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAA;QACpE,CAAC;QAED,MAAM,IAAI,GAAyB;YACjC,IAAI,EAAE,sBAAsB;YAC5B,QAAQ,EAAE,GAAG;YACb,IAAI,EAAE,IAAI,CAAC,OAAqB;SACjC,CAAA;QACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAA;QACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;QACzB,OAAM;IACR,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;IACxC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAA;IACnE,IAAI,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,OAAO,CAAA;IAClC,OAAO,MAAM,EAAE,CAAC;QACd,MAAM,UAAU,GAAG,MAA0B,CAAA;QAC7C,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAK;QACP,CAAC;QACD,0EAA0E;QAC1E,4EAA4E;QAC5E,sEAAsE;QACtE,2EAA2E;QAC3E,MAAM,gBAAgB,GACpB,MAAM,CAAC,IAAI,KAAK,iBAAiB;YAC/B,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAA;QAC/D,IAAI,gBAAgB,GAAG,UAAU,EAAE,CAAC;YAClC,MAAK;QACP,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;QACrB,MAAM,GAAG,MAAM,CAAC,OAAO,CAAA;IACzB,CAAC;IACD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,QAAQ,EAAE,UAAU;QACpB,IAAI,EAAE,IAAI,CAAC,OAAQ;KACpB,CAAA;IACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAQ,EAAE,IAAI,CAAC,CAAA;IACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA;IACrB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,GAAG;IACjB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,6EAA6E;IAC7E,8EAA8E;IAC9E,4EAA4E;IAC5E,yEAAyE;IACzE,8EAA8E;IAC9E,8DAA8D;IAC9D,IACE,CAAC,MAAM;QACP,MAAM,CAAC,IAAI,KAAK,iBAAiB;QACjC,CAAC,MAAM,CAAC,IAAI,KAAK,kBAAkB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EACrD,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,MAAM,IAAI,GAAqB;QAC7B,IAAI,EAAE,kBAAkB;QACxB,IAAI,EAAE,GAAI;QACV,OAAO,EAAE,IAAI,CAAC,OAAQ;KACvB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY;IAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;IAC3B,IAAI,MAAM,EAAE,IAAI,KAAK,YAAY,EAAE,CAAC;QAClC,wEAAwE;QACxE,mDAAmD;QACnD,MAAM,IAAI,KAAK,CAAC,qCAAqC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAA;IACvE,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,MAAoB,CAAA;IAC5C,MAAM,IAAI,GAAiB;QACzB,IAAI,EAAE,cAAc;QACpB,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;KACzB,CAAA;IACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,KAAY;IACnD,MAAM,IAAI,GAAe;QACvB,IAAI,EAAE,YAAY;QAClB,KAAK,EAAE,KAAK,CAAC,KAAe;KAC7B,CAAA;IACD,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAQ,CAAA;QACzB,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;IACpC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IAC3B,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAY;QACpB,IAAI,EAAE,SAAS;QACf,KAAK,EAAE,KAAK,CAAC,KAAkC;KAChD,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAe,KAAY;IACvD,MAAM,KAAK,GAA6B,EAAE,CAAA;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAEhE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC;aACvD,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAClD,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;YACxD,SAAS,CAAC,SAAS,CAAC,SAAS,CAAC,CAAA;YAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,EAAE,CAAA;YAEnC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAA;YAC3D,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,MAAM;aACd,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,KAAK;KACN,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAe,KAAY;IAC/C,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,KAAe,CAAA;AACzC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ;IACtB,MAAM,IAAI,GAAkB;QAC1B,IAAI,EAAE,eAAe;QACrB,KAAK,EAAE,EAAE;KACV,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAe,GAAmB;IACtD,sEAAsE;IACtE,6EAA6E;IAC7E,sDAAsD;IACtD,MAAM,CAAC,cAAc,CAClB,IAAI,CAAC,OAAyB,CAAC,KAAK,EACrC,IAAI,CAAC,UAAW,EAChB;QACE,KAAK,EAAE,GAAI;QACX,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,IAAI;QAChB,YAAY,EAAE,IAAI;KACnB,CACF,CAAA;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAe,GAAmB;IAC7D,IAAI,CAAC,cAAc,CAAC,GAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,SAAS,GAAG,GAAG,IAAI,SAAS,CAAA;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAe,GAAmB;IAC1D,CAAC;IAAC,IAAI,CAAC,OAAiC,CAAC,UAAU,GAAG,GAAG,IAAI,SAAS,CAAA;AACxE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY;IAC1B,IAAI,UAA+B,CAAA;IACnC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAM,CAAA;IACtB,OAAO,IAAI,CAAC,IAAI,KAAK,sBAAsB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC1D,UAAU,GAAG,IAAI,CAAA;QACjB,IAAI,GAAG,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,MAAM,IAAI,GAA0B;QAClC,IAAI,EAAE,uBAAuB;QAC7B,IAAI;KACL,CAAA;IACD,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,CAAC,KAAK,GAAG,IAAI,CAAA;QACvB,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,CAAA;IACnC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACnB,CAAC;IACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;AACrB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAe,KAAY;IAChD,MAAM,IAAI,GAAoB;QAC5B,IAAI,EAAE,iBAAiB;QACvB,QAAQ,EAAE,KAAK,CAAC,KAAe;KAChC,CAAA;IACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS;IACvB,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/B,IAAI,CAAC,oBAAoB,GAAG,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3C,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC7C,CAAC;IAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAA;IACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;IACnB,IAAI,CAAC,MAAM,GAAG,eAAe,CAAA;AAC/B,CAAC"}

package/esm/parser/states.d.ts

@@ -1,47 +0,0 @@
-import type { AstNode, Token } from '../types.ts';
-import type Parser from './Parser.ts';
-interface TokenTypeOptions {
-    toState?: string;
-    handler?: (this: Parser, token: Token) => void;
-}
-interface StateDefinition {
-    tokenTypes?: Record<string, TokenTypeOptions>;
-    subHandler?: (this: Parser, ast: AstNode | null) => void;
-    endStates?: Record<string, string>;
-    completable?: boolean;
-}
-type States = Record<string, StateDefinition>;
-/**
- * A mapping of all states in the finite state machine to a set of instructions
- * for handling or transitioning into other states. Each state can be handled
- * in one of two schemes: a tokenType map, or a subHandler.
- *
- * Standard expression elements are handled through the tokenType object. This
- * is an object map of all legal token types to encounter in this state (and
- * any unexpected token types will generate a thrown error) to an options
- * object that defines how they're handled.  The available options are:
- *
- *      {string} toState: The name of the state to which to transition
- *          immediately after handling this token
- *      {string} handler: The handler function to call when this token type is
- *          encountered in this state.  If omitted, the default handler
- *          matching the token's "type" property will be called. If the handler
- *          function does not exist, no call will be made and no error will be
- *          generated.  This is useful for tokens whose sole purpose is to
- *          transition to other states.
- *
- * States that consume a subexpression should define a subHandler, the
- * function to be called with an expression tree argument when the
- * subexpression is complete. Completeness is determined through the
- * endStates object, which maps tokens on which an expression should end to the
- * state to which to transition once the subHandler function has been called.
- *
- * Additionally, any state in which it is legal to mark the AST as completed
- * should have a 'completable' property set to boolean true.  Attempting to
- * call {@link Parser#complete} in any state without this property will result
- * in a thrown Error.
- *
- * @type {{}}
- */
-export declare const states: States;
-export {};