openalgo-script 0.1.0-alpha.0

package/dist/core/parse/expressions.js

@@ -0,0 +1,373 @@
+import { COMPARISON_OPERATORS, EQUALITY_OPERATORS, UNARY_OPERATORS, makeNode, } from '../ast/index.js';
+import { spanning } from '../span/index.js';
+import { describeToken } from './cursor.js';
+import { atLabel, isMeantAsAName, takeLabel, takeMember, takeName } from './names.js';
+/**
+ * The expression grammar, which is the precedence table of language.md 9.1 read
+ * from the bottom up.
+ *
+ * One function per level, in the order the table lists them, so the table can
+ * be checked against this file line by line. Precedence ends up in the shape of
+ * the tree rather than in a field, which is why nothing downstream ever has to
+ * know that `*` binds tighter than `+`.
+ *
+ * Two levels are deliberately not loops. Comparison and equality take at most
+ * one operator, because `a < b < c` has two plausible readings and the language
+ * refuses both (9.3). They are written as loops all the same, so that the
+ * second operator is reported as OS1008 with a caret on it and the expression
+ * still builds, rather than the parser stopping at a shape it cannot hold.
+ */
+const ADDITIVE = ['+', '-'];
+const MULTIPLICATIVE = ['*', '/', '%'];
+/** The tokens an expression can begin with, which is what tells two arguments apart. */
+const STARTS_EXPRESSION = new Set([
+    'numberLiteral',
+    'stringLiteral',
+    'hexColor',
+    'identifier',
+    'true',
+    'false',
+    'none',
+    '(',
+    '[',
+    '-',
+    '+',
+    'not',
+]);
+/**
+ * Whether an expression can begin here, which is what tells one argument from
+ * the next and what keeps a list from reading a closing bracket as an item.
+ *
+ * A reserved word a reader meant as a name begins one too, because `parsePrimary`
+ * reads it as the name it was meant to be rather than leaving it where it sits.
+ */
+export function startsExpression(kind) {
+    return STARTS_EXPRESSION.has(kind) || isMeantAsAName(kind);
+}
+export function parseExpression(cursor) {
+    if (!cursor.deeper(cursor.token.span))
+        return missingExpression(cursor);
+    const expression = parseTernary(cursor);
+    cursor.shallower();
+    return expression;
+}
+/**
+ * An expression in a position where a value is being tested rather than stored.
+ *
+ * `if x = 5` is the one typo the language is shaped to catch: assignment is a
+ * statement and never an expression (10.1), so there is no reading of the line
+ * that compiles, and OS1006 can name the fix instead of a type error arriving
+ * three stages later. The `==` is built as though the fix had been applied, so
+ * the rest of the file still checks.
+ */
+export function parseCondition(cursor) {
+    const condition = parseExpression(cursor);
+    const assign = cursor.take('=');
+    if (assign === undefined)
+        return condition;
+    cursor.report('OS1006', assign.span, {});
+    const right = parseExpression(cursor);
+    return makeNode('binary', spanning(condition.span, right.span), {
+        operator: '==',
+        left: condition,
+        right,
+    });
+}
+function parseTernary(cursor) {
+    const condition = parseOr(cursor);
+    const question = cursor.take('?');
+    if (question === undefined)
+        return condition;
+    const whenTrue = parseExpression(cursor);
+    if (cursor.take(':') === undefined) {
+        cursor.report('OS1015', question.span, {});
+        const hole = missingExpression(cursor);
+        return makeNode('ternary', spanning(condition.span, whenTrue.span), {
+            condition,
+            whenTrue,
+            whenFalse: hole,
+        });
+    }
+    // Right associative (9.1): the false arm takes the rest of the line, so
+    // `x > 0 ? "up" : x < 0 ? "down" : "flat"` nests to the right.
+    const whenFalse = parseExpression(cursor);
+    return makeNode('ternary', spanning(condition.span, whenFalse.span), {
+        condition,
+        whenTrue,
+        whenFalse,
+    });
+}
+function parseOr(cursor) {
+    let left = parseAnd(cursor);
+    while (cursor.take('or') !== undefined) {
+        const right = parseAnd(cursor);
+        left = makeNode('binary', spanning(left.span, right.span), { operator: 'or', left, right });
+    }
+    return left;
+}
+function parseAnd(cursor) {
+    let left = parseEquality(cursor);
+    while (cursor.take('and') !== undefined) {
+        const right = parseEquality(cursor);
+        left = makeNode('binary', spanning(left.span, right.span), { operator: 'and', left, right });
+    }
+    return left;
+}
+function parseEquality(cursor) {
+    return parseUnchainable(cursor, EQUALITY_OPERATORS, parseComparison);
+}
+function parseComparison(cursor) {
+    return parseUnchainable(cursor, COMPARISON_OPERATORS, parseAdditive);
+}
+/**
+ * A level that takes at most one operator, and says so when it is given two.
+ *
+ * The chain is folded to the left after the report so that the tree holds
+ * everything the reader wrote. A parser that stopped here would leave the rest
+ * of the line unparsed, and the reader would fix the chain only to be told
+ * about the next mistake on the same line one compile later.
+ */
+function parseUnchainable(cursor, operators, next) {
+    let left = next(cursor);
+    let first;
+    let chained = false;
+    for (;;) {
+        const operator = operatorAt(cursor, operators);
+        if (operator === undefined)
+            return left;
+        const token = cursor.advance();
+        if (first !== undefined && !chained) {
+            chained = true;
+            cursor.report('OS1008', token.span, { op1: first, op2: operator });
+        }
+        first ??= operator;
+        const right = next(cursor);
+        left = makeNode('binary', spanning(left.span, right.span), { operator, left, right });
+    }
+}
+function parseAdditive(cursor) {
+    return parseLeftAssociative(cursor, ADDITIVE, parseMultiplicative);
+}
+function parseMultiplicative(cursor) {
+    return parseLeftAssociative(cursor, MULTIPLICATIVE, parseUnary);
+}
+function parseLeftAssociative(cursor, operators, next) {
+    let left = next(cursor);
+    for (;;) {
+        const operator = operatorAt(cursor, operators);
+        if (operator === undefined)
+            return left;
+        cursor.advance();
+        const right = next(cursor);
+        left = makeNode('binary', spanning(left.span, right.span), { operator, left, right });
+    }
+}
+/**
+ * Unary minus, plus and `not`, right associative.
+ *
+ * Section 19 writes this level as taking at most one operator. The prose wins:
+ * 9.1 calls it right associative, so `not not ready` and `- -x` are shapes the
+ * tree can hold and the checker can have an opinion about.
+ */
+function parseUnary(cursor) {
+    const operator = operatorAt(cursor, UNARY_OPERATORS);
+    if (operator === undefined)
+        return parsePostfix(cursor);
+    const token = cursor.advance();
+    if (!cursor.deeper(token.span))
+        return missingExpression(cursor);
+    const operand = parseUnary(cursor);
+    cursor.shallower();
+    return makeNode('unary', spanning(token.span, operand.span), { operator, operand });
+}
+/** A call, a history or element read, and a member, applied left to right. */
+function parsePostfix(cursor) {
+    let target = parsePrimary(cursor);
+    for (;;) {
+        const before = cursor.position;
+        if (cursor.at('(')) {
+            const open = cursor.advance();
+            const args = parseBracketedList(cursor, open, parseArgument);
+            target = makeNode('call', spanning(target.span, args.end), {
+                callee: target,
+                args: args.items,
+            });
+        }
+        else if (cursor.at('[')) {
+            const open = cursor.advance();
+            const index = parseExpression(cursor);
+            const end = closeBracket(cursor, open);
+            target = makeNode('index', spanning(target.span, end), { target, index });
+        }
+        else if (cursor.at('.')) {
+            cursor.advance();
+            const member = takeMember(cursor);
+            target = makeNode('member', spanning(target.span, member.span), { object: target, member });
+        }
+        else {
+            return target;
+        }
+        if (cursor.position === before)
+            return target;
+    }
+}
+function parsePrimary(cursor) {
+    const token = cursor.token;
+    switch (token.kind) {
+        case 'numberLiteral':
+            cursor.advance();
+            return makeNode('numberLiteral', token.span, { value: token.value });
+        case 'stringLiteral':
+            cursor.advance();
+            return makeNode('stringLiteral', token.span, { value: token.value });
+        case 'true':
+        case 'false':
+            cursor.advance();
+            return makeNode('booleanLiteral', token.span, { value: token.kind === 'true' });
+        case 'none':
+            cursor.advance();
+            return makeNode('noneLiteral', token.span, {});
+        // Only `#rrggbb` and `#rrggbbaa`. A named colour is an ordinary global
+        // (3.8), so `aqua` arrives here as an identifier and leaves as a reference.
+        case 'hexColor':
+            cursor.advance();
+            return makeNode('colorLiteral', token.span, { text: token.text });
+        case 'identifier':
+            cursor.advance();
+            return makeNode('nameReference', token.span, { name: token.text });
+        case '(': {
+            cursor.advance();
+            const inner = parseExpression(cursor);
+            const end = closeBracket(cursor, token);
+            return makeNode('grouping', spanning(token.span, end), { expression: inner });
+        }
+        case '[': {
+            cursor.advance();
+            const elements = parseBracketedList(cursor, token, parseExpression);
+            return makeNode('arrayLiteral', spanning(token.span, elements.end), {
+                elements: elements.items,
+            });
+        }
+        default:
+            // A reserved word where a value belongs is the name the reader meant, and
+            // OS1019 says the language has taken the word. The word is taken here as
+            // well as reported on: a rule that reports and then consumes nothing
+            // leaves the list and the bracket above it looking at the token it could
+            // not read, and the next thing the reader is told is that a bracket they
+            // plainly closed was never closed.
+            if (isMeantAsAName(token.kind)) {
+                const name = takeName(cursor);
+                return makeNode('nameReference', name.span, { name: name.text });
+            }
+            return expressionExpected(cursor);
+    }
+}
+/** One argument, with the label of a named one when there is a label. */
+function parseArgument(cursor) {
+    if (!atLabel(cursor)) {
+        const bare = parseExpression(cursor);
+        return makeNode('argument', bare.span, { label: undefined, value: bare });
+    }
+    const label = takeLabel(cursor);
+    cursor.advance();
+    const value = parseExpression(cursor);
+    return makeNode('argument', spanning(label.span, value.span), { label, value });
+}
+/**
+ * A comma separated list inside brackets: an argument list or an array literal.
+ *
+ * The two shapes are one function because their recovery is the same and has to
+ * stay the same: a missing comma is OS1014 and the list carries on, and a list
+ * that runs to the end of the line without a closer is the bracket's own error
+ * rather than one per item.
+ */
+export function parseBracketedList(cursor, open, parseItem) {
+    const items = [];
+    for (;;) {
+        if (atListEnd(cursor))
+            break;
+        const before = cursor.position;
+        items.push(parseItem(cursor));
+        const comma = cursor.take(',');
+        if (comma !== undefined) {
+            if (!atListEnd(cursor))
+                continue;
+            // A comma promises another item (3.11 continues the line for one), so a
+            // list that ends on one has lost it rather than written an empty slot.
+            cursor.report('OS1022', cursor.holeSpan(), { token: describeToken(comma) });
+            break;
+        }
+        if (atListEnd(cursor))
+            break;
+        // The item read nothing, so it has reported its own hole and the token it
+        // could not read is still here. Taking it carries the list on to the item
+        // after it and, more importantly, to the closing bracket: a list that
+        // stopped here would hand the bracket a token that is not a closer, and the
+        // reader would be told the bracket was never closed on a line that closes
+        // it.
+        if (cursor.position === before) {
+            cursor.advance();
+            continue;
+        }
+        // What follows could not have begun a second item, so this is the closing
+        // bracket's mistake and not a missing comma.
+        if (!startsExpression(cursor.kind))
+            break;
+        cursor.report('OS1014', cursor.token.span, { token: describeToken(cursor.token) });
+    }
+    return { items, end: closeBracket(cursor, open) };
+}
+function atListEnd(cursor) {
+    return cursor.at(')') || cursor.at(']') || cursor.atStatementEnd();
+}
+/**
+ * The closing bracket, or the two ways it can be missing.
+ *
+ * OS1012 is reported at the opening bracket rather than at the end of the file,
+ * because an open bracket continues the statement onto every following line
+ * (3.11) and the mistake is where the bracket was opened.
+ */
+export function closeBracket(cursor, open) {
+    const expected = open.kind === '(' ? ')' : ']';
+    const closer = cursor.take(expected);
+    if (closer !== undefined)
+        return closer.span;
+    if (cursor.at(')') || cursor.at(']')) {
+        const found = cursor.advance();
+        cursor.report('OS1013', found.span, {
+            found: found.text,
+            expected,
+            opener: open.text,
+            line: open.span.line,
+        });
+        return found.span;
+    }
+    cursor.report('OS1012', open.span, { bracket: open.text, line: open.span.line });
+    return cursor.previous().span;
+}
+function expressionExpected(cursor) {
+    const hole = cursor.holeSpan();
+    cursor.report('OS1022', hole, {
+        token: describeToken(cursor.previousMeaningful() ?? cursor.token),
+    });
+    return makeNode('missingExpression', hole, {});
+}
+/**
+ * The hole a rule leaves where an expression was required.
+ *
+ * The span is empty and sits where the expression should have been, so it never
+ * takes a caret meant for its neighbour, and everything downstream still has a
+ * tree to walk over a file that is being typed.
+ */
+export function missingExpression(cursor) {
+    return makeNode('missingExpression', cursor.holeSpan(), {});
+}
+function operatorAt(cursor, operators) {
+    const kind = cursor.kind;
+    return operators.includes(kind) ? kind : undefined;
+}
+/** An argument list, for the three statements that are a call in all but name. */
+export function parseArgumentList(cursor, open) {
+    return parseBracketedList(cursor, open, parseArgument);
+}
+//# sourceMappingURL=expressions.js.map

package/dist/core/parse/expressions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expressions.js","sourceRoot":"","sources":["../../../src/core/parse/expressions.ts"],"names":[],"mappings":"AAOA,OAAO,EACL,oBAAoB,EACpB,kBAAkB,EAClB,eAAe,EACf,QAAQ,GACT,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAG5C,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtF;;;;;;;;;;;;;;GAcG;AAEH,MAAM,QAAQ,GAAkC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC3D,MAAM,cAAc,GAAkC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAEtE,wFAAwF;AACxF,MAAM,iBAAiB,GAA2B,IAAI,GAAG,CAAY;IACnE,eAAe;IACf,eAAe;IACf,UAAU;IACV,YAAY;IACZ,MAAM;IACN,OAAO;IACP,MAAM;IACN,GAAG;IACH,GAAG;IACH,GAAG;IACH,GAAG;IACH,KAAK;CACN,CAAC,CAAC;AAEH;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAe;IAC9C,OAAO,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;AAC7D,CAAC;AAQD,MAAM,UAAU,eAAe,CAAC,MAAc;IAC5C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACxE,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE3C,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,OAAO,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE;QAC9D,QAAQ,EAAE,IAAI;QACd,IAAI,EAAE,SAAS;QACf,KAAK;KACN,CAAC,CAAC;AACL,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAE7C,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACzC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACvC,OAAO,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;YAClE,SAAS;YACT,QAAQ;YACR,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IAED,wEAAwE;IACxE,+DAA+D;IAC/D,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE;QACnE,SAAS;QACT,QAAQ;QACR,SAAS;KACV,CAAC,CAAC;AACL,CAAC;AAED,SAAS,OAAO,CAAC,MAAc;IAC7B,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC9F,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,MAAc;IAC9B,IAAI,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,MAAc;IACnC,OAAO,gBAAgB,CAAC,MAAM,EAAE,kBAAkB,EAAE,eAAe,CAAC,CAAC;AACvE,CAAC;AAED,SAAS,eAAe,CAAC,MAAc;IACrC,OAAO,gBAAgB,CAAC,MAAM,EAAE,oBAAoB,EAAE,aAAa,CAAC,CAAC;AACvE,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,gBAAgB,CACvB,MAAc,EACd,SAA8B,EAC9B,IAAoC;IAEpC,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxB,IAAI,KAA2B,CAAC;IAChC,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,SAAS,CAAC;QACR,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAExC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;QACrE,CAAC;QACD,KAAK,KAAK,QAAQ,CAAC;QAEnB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,MAAc;IACnC,OAAO,oBAAoB,CAAC,MAAM,EAAE,QAAQ,EAAE,mBAAmB,CAAC,CAAC;AACrE,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAc;IACzC,OAAO,oBAAoB,CAAC,MAAM,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,oBAAoB,CAC3B,MAAc,EACd,SAA8B,EAC9B,IAAoC;IAEpC,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxB,SAAS,CAAC;QACR,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC/C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACxC,MAAM,CAAC,OAAO,EAAE,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACxF,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,MAAc;IAChC,MAAM,QAAQ,GAAG,UAAU,CAAgB,MAAM,EAAE,eAAe,CAAC,CAAC;IACpE,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;IAExD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;IACnC,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;AACtF,CAAC;AAED,8EAA8E;AAC9E,SAAS,YAAY,CAAC,MAAc;IAClC,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IAElC,SAAS,CAAC;QACR,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;QAE/B,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;YAC7D,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE;gBACzD,MAAM,EAAE,MAAM;gBACd,IAAI,EAAE,IAAI,CAAC,KAAK;aACjB,CAAC,CAAC;QACL,CAAC;aAAM,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACvC,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5E,CAAC;aAAM,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9F,CAAC;aAAM,CAAC;YACN,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;IAChD,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;IAE3B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,eAAe;YAClB,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACvE,KAAK,eAAe;YAClB,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACvE,KAAK,MAAM,CAAC;QACZ,KAAK,OAAO;YACV,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,gBAAgB,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC,CAAC;QAClF,KAAK,MAAM;YACT,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACjD,uEAAuE;QACvE,4EAA4E;QAC5E,KAAK,UAAU;YACb,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,cAAc,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACpE,KAAK,YAAY;YACf,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,QAAQ,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACrE,KAAK,GAAG,CAAC,CAAC,CAAC;YACT,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACxC,OAAO,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QAChF,CAAC;QACD,KAAK,GAAG,CAAC,CAAC,CAAC;YACT,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YACpE,OAAO,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;gBAClE,QAAQ,EAAE,QAAQ,CAAC,KAAK;aACzB,CAAC,CAAC;QACL,CAAC;QACD;YACE,0EAA0E;YAC1E,yEAAyE;YACzE,qEAAqE;YACrE,yEAAyE;YACzE,yEAAyE;YACzE,mCAAmC;YACnC,IAAI,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;gBAC9B,OAAO,QAAQ,CAAC,eAAe,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACnE,CAAC;YACD,OAAO,kBAAkB,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;AACH,CAAC;AAED,yEAAyE;AACzE,SAAS,aAAa,CAAC,MAAc;IACnC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,CAAC,OAAO,EAAE,CAAC;IACjB,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACtC,OAAO,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,IAAW,EACX,SAAmC;IAEnC,MAAM,KAAK,GAAW,EAAE,CAAC;IAEzB,SAAS,CAAC;QACR,IAAI,SAAS,CAAC,MAAM,CAAC;YAAE,MAAM;QAE7B,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAE9B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;gBAAE,SAAS;YACjC,wEAAwE;YACxE,uEAAuE;YACvE,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC5E,MAAM;QACR,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,CAAC;YAAE,MAAM;QAE7B,0EAA0E;QAC1E,0EAA0E;QAC1E,sEAAsE;QACtE,4EAA4E;QAC5E,0EAA0E;QAC1E,MAAM;QACN,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,EAAE,CAAC;YAC/B,MAAM,CAAC,OAAO,EAAE,CAAC;YACjB,SAAS;QACX,CAAC;QAED,0EAA0E;QAC1E,6CAA6C;QAC7C,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,MAAM;QAE1C,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;AACpD,CAAC;AAED,SAAS,SAAS,CAAC,MAAc;IAC/B,OAAO,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,cAAc,EAAE,CAAC;AACrE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc,EAAE,IAAW;IACtD,MAAM,QAAQ,GAAc,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAE1D,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,IAAI,CAAC;IAE7C,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACrC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAC/B,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,EAAE;YAClC,KAAK,EAAE,KAAK,CAAC,IAAI;YACjB,QAAQ;YACR,MAAM,EAAE,IAAI,CAAC,IAAI;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;SACrB,CAAC,CAAC;QACH,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;IACjF,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC;AAChC,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAc;IACxC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC/B,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,EAAE;QAC5B,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,kBAAkB,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC;KAClE,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC,mBAAmB,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,OAAO,QAAQ,CAAC,mBAAmB,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,UAAU,CACjB,MAAc,EACd,SAA8B;IAE9B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAgB,CAAC,CAAC,CAAC,CAAE,IAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;AAC/E,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,iBAAiB,CAAC,MAAc,EAAE,IAAW;IAC3D,OAAO,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;AACzD,CAAC"}

package/dist/core/parse/functions.d.ts

@@ -0,0 +1,16 @@
+import type { FunctionDeclaration } from '../ast/index.js';
+import type { Cursor } from './cursor.js';
+/**
+ * `fn name(parameters) => body`, language.md 11.1.
+ *
+ * The body is an expression when it is written after the `=>` on one line, and
+ * a block when the `=>` ends the line. Both forms exist because the one line
+ * form needs the implicit return and an early exit needs the explicit one.
+ *
+ * The `=>` is two tokens. Section 3.12 does not list it among the punctuation,
+ * so it arrives as an `=` and a `>` that touch, and touching is what tells it
+ * from a comparison: the lexer suppresses its continuation rule for that exact
+ * pair, and the same adjacency test is what matches it here.
+ */
+export declare function parseFunctionDeclaration(cursor: Cursor): FunctionDeclaration;
+//# sourceMappingURL=functions.d.ts.map

package/dist/core/parse/functions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"functions.d.ts","sourceRoot":"","sources":["../../../src/core/parse/functions.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAqB,mBAAmB,EAAmB,MAAM,iBAAiB,CAAC;AAM/F,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAK1C;;;;;;;;;;;GAWG;AACH,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,MAAM,GAAG,mBAAmB,CAsB5E"}

package/dist/core/parse/functions.js

@@ -0,0 +1,92 @@
+import { makeNode } from '../ast/index.js';
+import { spanning } from '../span/index.js';
+import { parseTypeAnnotation } from './annotations.js';
+import { parseBlock } from './blocks.js';
+import { parseBracketedList, parseExpression } from './expressions.js';
+import { takeName } from './names.js';
+import { finishStatement } from './statements.js';
+/**
+ * `fn name(parameters) => body`, language.md 11.1.
+ *
+ * The body is an expression when it is written after the `=>` on one line, and
+ * a block when the `=>` ends the line. Both forms exist because the one line
+ * form needs the implicit return and an early exit needs the explicit one.
+ *
+ * The `=>` is two tokens. Section 3.12 does not list it among the punctuation,
+ * so it arrives as an `=` and a `>` that touch, and touching is what tells it
+ * from a comparison: the lexer suppresses its continuation rule for that exact
+ * pair, and the same adjacency test is what matches it here.
+ */
+export function parseFunctionDeclaration(cursor) {
+    const keyword = cursor.advance();
+    const name = takeName(cursor);
+    const open = cursor.take('(');
+    if (open === undefined)
+        cursor.unexpected(cursor.token);
+    const parameters = open === undefined ? [] : parseBracketedList(cursor, open, parseParameter).items;
+    const arrow = takeArrow(cursor);
+    if (arrow === undefined) {
+        return declaration(keyword, name, parameters, headerWithNoArrow(cursor, keyword));
+    }
+    if (!cursor.atStatementEnd()) {
+        const body = parseExpression(cursor);
+        finishStatement(cursor);
+        return declaration(keyword, name, parameters, body);
+    }
+    finishStatement(cursor);
+    return declaration(keyword, name, parameters, parseBlock(cursor, 'fn', keyword.span));
+}
+/**
+ * A parameter, which is an ordinary identifier and not a label.
+ *
+ * `fn f(color = red)` is OS1019, and `plot(v, "V", color = aqua)` is not: the
+ * body of a function refers to its parameters, and nothing ever refers to a
+ * label (language.md 3.4). `takeName` is the whole of that difference.
+ */
+function parseParameter(cursor) {
+    const name = takeName(cursor);
+    const annotation = cursor.take(':') !== undefined ? parseTypeAnnotation(cursor) : undefined;
+    const defaultValue = cursor.take('=') !== undefined ? parseExpression(cursor) : undefined;
+    const end = defaultValue?.span ?? annotation?.span ?? name.span;
+    return makeNode('parameter', spanning(name.span, end), { name, annotation, defaultValue });
+}
+/** The `=>` of 11.1: an `=` and a `>` written against each other. */
+function takeArrow(cursor) {
+    const equals = cursor.token;
+    const greater = cursor.peek();
+    if (equals.kind !== '=' || greater.kind !== '>')
+        return undefined;
+    if (equals.span.offset + equals.span.length !== greater.span.offset)
+        return undefined;
+    cursor.advance();
+    return cursor.advance();
+}
+/**
+ * A header with no `=>`, which the catalogue has no code of its own for.
+ *
+ * What is reported is what is true. A token sitting where the arrow belongs is
+ * OS1018, whose fix names the operator that was meant to join the two halves. A
+ * header that simply ends is OS1010, because that is what it now is: a header
+ * with no body, since without the arrow the lexer opened no block under it.
+ */
+function headerWithNoArrow(cursor, keyword) {
+    if (!cursor.atStatementEnd()) {
+        cursor.unexpected(cursor.token);
+        const body = parseExpression(cursor);
+        finishStatement(cursor);
+        return body;
+    }
+    cursor.report('OS1010', keyword.span, { header: 'fn' });
+    finishStatement(cursor);
+    if (cursor.at('indent'))
+        return parseBlock(cursor, 'fn', keyword.span);
+    return makeNode('block', cursor.holeSpan(), { statements: [] });
+}
+function declaration(keyword, name, parameters, body) {
+    return makeNode('functionDeclaration', spanning(keyword.span, body.span), {
+        name,
+        parameters,
+        body,
+    });
+}
+//# sourceMappingURL=functions.js.map

package/dist/core/parse/functions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"functions.js","sourceRoot":"","sources":["../../../src/core/parse/functions.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CAAC,MAAc;IACrD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE9B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,IAAI,KAAK,SAAS;QAAE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACxD,MAAM,UAAU,GACd,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,KAAK,CAAC;IAEnF,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,OAAO,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,iBAAiB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACrC,eAAe,CAAC,MAAM,CAAC,CAAC;QACxB,OAAO,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,eAAe,CAAC,MAAM,CAAC,CAAC;IACxB,OAAO,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;AACxF,CAAC;AAED;;;;;;GAMG;AACH,SAAS,cAAc,CAAC,MAAc;IACpC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE9B,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5F,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE1F,MAAM,GAAG,GAAG,YAAY,EAAE,IAAI,IAAI,UAAU,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;IAChE,OAAO,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC;AAC7F,CAAC;AAED,qEAAqE;AACrE,SAAS,SAAS,CAAC,MAAc;IAC/B,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;IAC5B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,SAAS,CAAC;IAClE,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAEtF,MAAM,CAAC,OAAO,EAAE,CAAC;IACjB,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC;AAC1B,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CAAC,MAAc,EAAE,OAAc;IACvD,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACrC,eAAe,CAAC,MAAM,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IACxD,eAAe,CAAC,MAAM,CAAC,CAAC;IACxB,IAAI,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC;QAAE,OAAO,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IACvE,OAAO,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,WAAW,CAClB,OAAc,EACd,IAAU,EACV,UAAgC,EAChC,IAAwB;IAExB,OAAO,QAAQ,CAAC,qBAAqB,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;QACxE,IAAI;QACJ,UAAU;QACV,IAAI;KACL,CAAC,CAAC;AACL,CAAC"}

package/dist/core/parse/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * The parser: tokens to a syntax tree, and a diagnostic for anything the
+ * grammar does not have a shape for.
+ *
+ * The whole of language.md section 19 lives behind this door, with the prose of
+ * sections 9 to 13 winning wherever the two disagree. What comes out is a tree
+ * for every file, including a file with mistakes in it: a parse error costs the
+ * statement it is on and nothing else, so an editor asking about a half typed
+ * line still gets a tree, and a compile reports every mistake in a file rather
+ * than the first one.
+ */
+export { parse, parseTokens } from './script.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/core/parse/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/parse/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}

package/dist/core/parse/index.js

@@ -0,0 +1,13 @@
+/**
+ * The parser: tokens to a syntax tree, and a diagnostic for anything the
+ * grammar does not have a shape for.
+ *
+ * The whole of language.md section 19 lives behind this door, with the prose of
+ * sections 9 to 13 winning wherever the two disagree. What comes out is a tree
+ * for every file, including a file with mistakes in it: a parse error costs the
+ * statement it is on and nothing else, so an editor asking about a half typed
+ * line still gets a tree, and a compile reports every mistake in a file rather
+ * than the first one.
+ */
+export { parse, parseTokens } from './script.js';
+//# sourceMappingURL=index.js.map

package/dist/core/parse/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/parse/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}

package/dist/core/parse/loops.d.ts

@@ -0,0 +1,13 @@
+import type { ForInStatement, ForRangeStatement, WhileStatement } from '../ast/index.js';
+import type { Cursor } from './cursor.js';
+/**
+ * `for` and `while`, language.md 10.3 and 10.4.
+ *
+ * There are two loop forms and no third, so a header that is neither is OS1020
+ * rather than a cascade of smaller complaints: the message names the two shapes
+ * that exist, which is the only thing the reader needs. The body is read either
+ * way, so the lines under a header that was not understood are still checked.
+ */
+export declare function parseForStatement(cursor: Cursor): ForRangeStatement | ForInStatement;
+export declare function parseWhileStatement(cursor: Cursor): WhileStatement;
+//# sourceMappingURL=loops.d.ts.map

package/dist/core/parse/loops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loops.d.ts","sourceRoot":"","sources":["../../../src/core/parse/loops.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAqB,cAAc,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAK5G,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAM1C;;;;;;;GAOG;AAEH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,iBAAiB,GAAG,cAAc,CA8BpF;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,CAKlE"}

package/dist/core/parse/loops.js

@@ -0,0 +1,78 @@
+import { makeNode } from '../ast/index.js';
+import { spanning } from '../span/index.js';
+import { parseBlock } from './blocks.js';
+import { describeToken } from './cursor.js';
+import { missingExpression, parseCondition, parseExpression } from './expressions.js';
+import { takeName } from './names.js';
+import { finishStatement } from './statements.js';
+/**
+ * `for` and `while`, language.md 10.3 and 10.4.
+ *
+ * There are two loop forms and no third, so a header that is neither is OS1020
+ * rather than a cascade of smaller complaints: the message names the two shapes
+ * that exist, which is the only thing the reader needs. The body is read either
+ * way, so the lines under a header that was not understood are still checked.
+ */
+export function parseForStatement(cursor) {
+    const keyword = cursor.advance();
+    const variable = takeName(cursor);
+    if (cursor.take('in') !== undefined) {
+        const iterable = parseExpression(cursor);
+        const body = readBody(cursor, keyword);
+        return makeNode('forInStatement', spanning(keyword.span, body.span), {
+            variable,
+            iterable,
+            body,
+        });
+    }
+    if (cursor.take('=') === undefined) {
+        incompleteHeader(cursor);
+        return range(cursor, keyword, variable, missingExpression(cursor), missingExpression(cursor));
+    }
+    const from = parseExpression(cursor);
+    if (cursor.take('to') === undefined) {
+        incompleteHeader(cursor);
+        return range(cursor, keyword, variable, from, missingExpression(cursor));
+    }
+    const to = parseExpression(cursor);
+    // A missing `step` is one rather than a node the reader did not write, so
+    // OS3004 on a step of zero always has a span to point at (10.3).
+    const step = cursor.take('step') !== undefined ? parseExpression(cursor) : undefined;
+    return range(cursor, keyword, variable, from, to, step);
+}
+export function parseWhileStatement(cursor) {
+    const keyword = cursor.advance();
+    const condition = parseCondition(cursor);
+    const body = readBody(cursor, keyword);
+    return makeNode('whileStatement', spanning(keyword.span, body.span), { condition, body });
+}
+function range(cursor, keyword, variable, from, to, step) {
+    const body = readBody(cursor, keyword);
+    return makeNode('forRangeStatement', spanning(keyword.span, body.span), {
+        variable,
+        from,
+        to,
+        step,
+        body,
+    });
+}
+/**
+ * The block under a loop header, with the loop counted while it is read.
+ *
+ * The count is what `break` and `continue` ask about, so it has to go up before
+ * the body is parsed and down after it, including on the paths where the header
+ * itself was not understood: a `break` inside a broken `for` is still inside a
+ * loop, and reporting OS1009 on it would be a second complaint about the first
+ * mistake.
+ */
+function readBody(cursor, keyword) {
+    finishStatement(cursor);
+    cursor.enterLoop();
+    const body = parseBlock(cursor, keyword.text, keyword.span);
+    cursor.leaveLoop();
+    return body;
+}
+function incompleteHeader(cursor) {
+    cursor.report('OS1020', cursor.token.span, { token: describeToken(cursor.token) });
+}
+//# sourceMappingURL=loops.js.map

package/dist/core/parse/loops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loops.js","sourceRoot":"","sources":["../../../src/core/parse/loops.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACtF,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAElD;;;;;;;GAOG;AAEH,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;IACjC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;IAElC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACvC,OAAO,QAAQ,CAAC,gBAAgB,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YACnE,QAAQ;YACR,QAAQ;YACR,IAAI;SACL,CAAC,CAAC;IACL,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;QACnC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,iBAAiB,CAAC,MAAM,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QACpC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACnC,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrF,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AAC1D,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAc;IAChD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;IACjC,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,OAAO,QAAQ,CAAC,gBAAgB,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAC5F,CAAC;AAED,SAAS,KAAK,CACZ,MAAc,EACd,OAAc,EACd,QAAuC,EACvC,IAAgB,EAChB,EAAc,EACd,IAAiB;IAEjB,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,OAAO,QAAQ,CAAC,mBAAmB,EAAE,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;QACtE,QAAQ;QACR,IAAI;QACJ,EAAE;QACF,IAAI;QACJ,IAAI;KACL,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,QAAQ,CAAC,MAAc,EAAE,OAAc;IAC9C,eAAe,CAAC,MAAM,CAAC,CAAC;IACxB,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5D,MAAM,CAAC,SAAS,EAAE,CAAC;IACnB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAc;IACtC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AACrF,CAAC"}