@mojir/lits 2.0.14 → 2.0.16

package/dist/testFramework.js

@@ -238,6 +238,12 @@ function isFunctionType(type) {
     return typeof type === 'number' && functionTypeName.has(type);
 }
 
+function getSourceCodeInfo(anyValue, sourceCodeInfo) {
+    var _a;
+    // eslint-disable-next-line ts/no-unsafe-return, ts/no-unsafe-member-access
+    return (_a = anyValue === null || anyValue === void 0 ? void 0 : anyValue.sourceCodeInfo) !== null && _a !== void 0 ? _a : sourceCodeInfo;
+}
+
 function isTokenDebugData(tokenDebugData) {
     return (typeof tokenDebugData === 'object'
         && tokenDebugData !== null
@@ -256,8 +262,12 @@ function addTokenDebugData(token, debugData) {
     }
     token.push(debugData);
 }
-function throwUnexpectedToken(expected, actual) {
-    throw new LitsError("Unexpected token: ".concat(actual, ", expected ").concat(expected), undefined);
+function throwUnexpectedToken(expected, expectedValue, actual) {
+    if (actual === undefined) {
+        throw new LitsError("Unexpected end of input, expected ".concat(expected).concat(expectedValue ? " '".concat(expectedValue, "'") : ''), undefined);
+    }
+    var actualOutput = "".concat(actual[0]).concat(actual[1] ? " '".concat(actual[1], "'") : '');
+    throw new LitsError("Unexpected token: ".concat(actualOutput, ", expected ").concat(expected).concat(expectedValue ? " '".concat(expectedValue, "'") : ''), getSourceCodeInfo(actual));
 }
 
 var commonSimpleTokenTypes = [
@@ -279,7 +289,7 @@ function isLParenToken(token) {
 }
 function assertLParenToken(token) {
     if (!isLParenToken(token)) {
-        throwUnexpectedToken('LParen', token);
+        throwUnexpectedToken('LParen', undefined, token);
     }
 }
 function asLParenToken(token) {
@@ -291,7 +301,7 @@ function isRParenToken(token) {
 }
 function assertRParenToken(token) {
     if (!isRParenToken(token)) {
-        throwUnexpectedToken('RParen', token);
+        throwUnexpectedToken('RParen', undefined, token);
     }
 }
 function isLBracketToken(token) {
@@ -299,7 +309,7 @@ function isLBracketToken(token) {
 }
 function assertLBracketToken(token) {
     if (!isLBracketToken(token)) {
-        throwUnexpectedToken('LBracket', token);
+        throwUnexpectedToken('LBracket', undefined, token);
     }
 }
 function asLBracketToken(token) {
@@ -311,7 +321,7 @@ function isRBracketToken(token) {
 }
 function assertRBracketToken(token) {
     if (!isRBracketToken(token)) {
-        throwUnexpectedToken('RBracket', token);
+        throwUnexpectedToken('RBracket', undefined, token);
     }
 }
 function isLBraceToken(token) {
@@ -319,7 +329,7 @@ function isLBraceToken(token) {
 }
 function assertLBraceToken(token) {
     if (!isLBraceToken(token)) {
-        throwUnexpectedToken('LBrace', token);
+        throwUnexpectedToken('LBrace', undefined, token);
     }
 }
 function asLBraceToken(token) {
@@ -331,7 +341,7 @@ function isRBraceToken(token) {
 }
 function assertRBraceToken(token) {
     if (!isRBraceToken(token)) {
-        throwUnexpectedToken('RBrace', token);
+        throwUnexpectedToken('RBrace', undefined, token);
     }
 }
 function isStringToken(token) {
@@ -339,7 +349,7 @@ function isStringToken(token) {
 }
 function assertStringToken(token) {
     if (!isStringToken(token)) {
-        throwUnexpectedToken('String', token);
+        throwUnexpectedToken('String', undefined, token);
     }
 }
 function asStringToken(token) {
@@ -357,7 +367,7 @@ function isEndNotationToken(token) {
 }
 function assertEndNotationToken(token) {
     if (!isEndNotationToken(token)) {
-        throwUnexpectedToken('EndNotation', token);
+        throwUnexpectedToken('EndNotation', undefined, token);
     }
 }
 
@@ -415,24 +425,18 @@ var otherSymbolicOperators = [
 var symbolicOperators = __spreadArray(__spreadArray(__spreadArray([], __read(symbolicUnaryOperators), false), __read(symbolicBinaryOperators), false), __read(otherSymbolicOperators), false);
 var nonFunctionOperators = [
     '??',
-    'and',
+    '&&',
     'comment',
     'cond',
-    'declared?',
+    'defined?',
     'if',
-    'if-not',
-    'or',
-    'when',
-    'when-not',
+    'unless',
+    '||',
     'do',
-    'time!',
     'throw',
     'let',
     'def',
     'defs',
-    'if-let',
-    'when-let',
-    'when-first',
     'fn',
     'defn',
     'defns',
@@ -458,23 +462,40 @@ var symbolicOperatorSet = new Set(symbolicOperators);
 function isSymbolicOperator(operator) {
     return symbolicOperatorSet.has(operator);
 }
-function isA_SymbolToken(token) {
-    return (token === null || token === void 0 ? void 0 : token[0]) === 'A_Symbol';
+function isA_SymbolToken(token, symbolName) {
+    if ((token === null || token === void 0 ? void 0 : token[0]) !== 'A_Symbol') {
+        return false;
+    }
+    if (symbolName && token[1] !== symbolName) {
+        return false;
+    }
+    return true;
 }
-function assertA_SymbolToken(token) {
-    if (!isA_SymbolToken(token)) {
-        throwUnexpectedToken('A_Symbol', token);
+function assertA_SymbolToken(token, symbolName) {
+    if (!isA_SymbolToken(token, symbolName)) {
+        throwUnexpectedToken('A_Symbol', undefined, token);
     }
 }
-function asA_SymbolToken(token) {
-    assertA_SymbolToken(token);
+function asA_SymbolToken(token, symbolName) {
+    assertA_SymbolToken(token, symbolName);
     return token;
 }
 function isA_BinaryOperatorToken(token) {
     return (token === null || token === void 0 ? void 0 : token[0]) === 'A_Operator' && isSymbolicBinaryOperator(token[1]);
 }
-function isA_ReservedSymbolToken(token) {
-    return (token === null || token === void 0 ? void 0 : token[0]) === 'A_ReservedSymbol';
+function isA_ReservedSymbolToken(token, symbolName) {
+    if ((token === null || token === void 0 ? void 0 : token[0]) !== 'A_ReservedSymbol') {
+        return false;
+    }
+    if (symbolName && token[1] !== symbolName) {
+        return false;
+    }
+    return true;
+}
+function assertA_ReservedSymbolToken(token, symbolName) {
+    if (!isA_ReservedSymbolToken(token, symbolName)) {
+        throwUnexpectedToken('A_ReservedSymbol', symbolName, token);
+    }
 }
 function isA_CommentToken(token) {
     return (token === null || token === void 0 ? void 0 : token[0]) === 'A_SingleLineComment';
@@ -493,10 +514,9 @@ function isA_OperatorToken(token, operatorName) {
 }
 function assertA_OperatorToken(token, operatorName) {
     if (!isA_OperatorToken(token, operatorName)) {
-        if (operatorName) {
+        {
             throw new LitsError("Unexpected token: ".concat(token, ", expected operator ").concat(operatorName), undefined);
         }
-        throwUnexpectedToken('A_Operator', token);
     }
 }
 function isA_WhitespaceToken(token) {
@@ -509,7 +529,7 @@ function isA_BasePrefixedNumberToken(token) {
     return (token === null || token === void 0 ? void 0 : token[0]) === 'A_BasePrefixedNumber';
 }
 
-var modifierNames = ['&', '&let', '&when', '&while'];
+var modifierNames = ['&rest', '&let', '&when', '&while'];
 var polishOnlySimpleTokenTypes = [
     'P_FnShorthand',
 ];
@@ -532,7 +552,7 @@ function isP_StringShorthandToken(token) {
 }
 function assertP_StringShorthandToken(token) {
     if (!isP_StringShorthandToken(token)) {
-        throwUnexpectedToken('P_StringShorthand', token);
+        throwUnexpectedToken('P_StringShorthand', undefined, token);
     }
 }
 function asP_StringShorthandToken(token) {
@@ -544,7 +564,7 @@ function isP_SymbolToken(token) {
 }
 function assertP_SymbolToken(token) {
     if (!isP_SymbolToken(token)) {
-        throwUnexpectedToken('P_Symbol', token);
+        throwUnexpectedToken('P_Symbol', undefined, token);
     }
 }
 function asP_SymbolToken(token) {
@@ -562,7 +582,7 @@ function isP_RegexpShorthandToken(token) {
 }
 function assertP_RegexpShorthandToken(token) {
     if (!isP_RegexpShorthandToken(token)) {
-        throwUnexpectedToken('P_RegexpShorthand', token);
+        throwUnexpectedToken('P_RegexpShorthand', undefined, token);
     }
 }
 function asP_RegexpShorthandToken(token) {
@@ -577,7 +597,7 @@ function isP_CollectionAccessorToken(token) {
 }
 function assertP_CollectionAccessorToken(token) {
     if (!isP_CollectionAccessorToken(token)) {
-        throwUnexpectedToken('P_CollectionAccessor', token);
+        throwUnexpectedToken('P_CollectionAccessor', undefined, token);
     }
 }
 function asP_CollectionAccessorToken(token) {
@@ -589,7 +609,7 @@ function isP_CommentToken(token) {
 }
 function assertP_CommentToken(token) {
     if (!isP_CommentToken(token)) {
-        throwUnexpectedToken('P_Comment', token);
+        throwUnexpectedToken('P_Comment', undefined, token);
     }
 }
 function asP_CommentToken(token) {
@@ -604,7 +624,7 @@ function isP_NumberToken(token) {
 }
 function assertP_NumberToken(token) {
     if (!isP_NumberToken(token)) {
-        throwUnexpectedToken('P_Number', token);
+        throwUnexpectedToken('P_Number', undefined, token);
     }
 }
 
@@ -672,12 +692,6 @@ function valueToString(value) {
     return JSON.stringify(value);
 }
 
-function getSourceCodeInfo(anyValue, sourceCodeInfo) {
-    var _a;
-    // eslint-disable-next-line ts/no-unsafe-return, ts/no-unsafe-member-access
-    return (_a = anyValue === null || anyValue === void 0 ? void 0 : anyValue.sourceCodeInfo) !== null && _a !== void 0 ? _a : sourceCodeInfo;
-}
-
 function getRangeString(options) {
     var hasUpperAndLowerBound = (typeof options.gt === 'number' || typeof options.gte === 'number')
         && (typeof options.lt === 'number' || typeof options.lte === 'number');
@@ -810,7 +824,7 @@ function isExpressionNode(value) {
 }
 
 var specialExpressionCommentRemovers = {
-    'and': function (node, removeOptions) {
+    '&&': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
@@ -822,7 +836,11 @@ var specialExpressionCommentRemovers = {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
-    'declared?': function (node, removeOptions) {
+    'switch': function (node, removeOptions) {
+        removeOptions.removeCommenNodesFromArray(node.p);
+        node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
+    },
+    'defined?': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
@@ -843,12 +861,11 @@ var specialExpressionCommentRemovers = {
     'doseq': function (_node, _removeOptions) { },
     'fn': function (_node, _removeOptions) { },
     'for': function (_node, _removeOptions) { },
-    'if-let': function (_node, _removeOptions) { },
     'if': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
-    'if-not': function (node, removeOptions) {
+    'unless': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
@@ -860,7 +877,7 @@ var specialExpressionCommentRemovers = {
         });
     },
     'loop': function (_node, _removeOptions) { },
-    'or': function (node, removeOptions) {
+    '||': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
@@ -872,19 +889,11 @@ var specialExpressionCommentRemovers = {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
-    'time!': function (node, removeOptions) {
-        removeOptions.removeCommenNodesFromArray(node.p);
-        node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
-    },
     'throw': function (node, removeOptions) {
         removeOptions.removeCommenNodesFromArray(node.p);
         node.p.forEach(removeOptions.recursivelyRemoveCommentNodes);
     },
     'try': function (_node, _removeOptions) { },
-    'when-first': function (_node, _removeOptions) { },
-    'when-let': function (_node, _removeOptions) { },
-    'when': function (_node, _removeOptions) { },
-    'when-not': function (_node, _removeOptions) { },
 };
 function removeCommentNodesFromSpecialExpression(node, removeOptions) {
     var uncommenter = specialExpressionCommentRemovers[node.n];
@@ -926,6 +935,13 @@ function assertEvenNumberOfParams(node) {
         throw new LitsError("Wrong number of arguments, expected an even number, got ".concat(valueToString(length), "."), (_a = getTokenDebugData(node.token)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
     }
 }
+function assertOddNumberOfParams(node) {
+    var _a;
+    var length = withoutCommentNodes(node.p).length;
+    if (length % 2 !== 1) {
+        throw new LitsError("Wrong number of arguments, expected an odd number, got ".concat(valueToString(length), "."), (_a = getTokenDebugData(node.token)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
+    }
+}
 function assertNumberOfParams(count, node) {
     var _a, _b;
     assertCount({
@@ -970,7 +986,7 @@ function assertCount(_a) {
 }
 
 var bitwiseNormalExpression = {
-    'bit-shift-left': {
+    '<<': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], count = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -979,7 +995,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'bit-shift-right': {
+    '>>': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], count = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -988,7 +1004,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'unsigned-bit-shift-right': {
+    '>>>': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], count = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -997,7 +1013,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'bit-not': {
+    '~': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), num = _b[0];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -1005,7 +1021,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'bit-and': {
+    '&': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a), first = _b[0], rest = _b.slice(1);
             assertNumber(first, sourceCodeInfo, { integer: true });
@@ -1016,7 +1032,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2 }, node); },
     },
-    'bit-and-not': {
+    '&!': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a), first = _b[0], rest = _b.slice(1);
             assertNumber(first, sourceCodeInfo, { integer: true });
@@ -1027,7 +1043,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2 }, node); },
     },
-    'bit-or': {
+    '|': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a), first = _b[0], rest = _b.slice(1);
             assertNumber(first, sourceCodeInfo, { integer: true });
@@ -1038,7 +1054,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2 }, node); },
     },
-    'bit-xor': {
+    '^': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a), first = _b[0], rest = _b.slice(1);
             assertNumber(first, sourceCodeInfo, { integer: true });
@@ -1049,7 +1065,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2 }, node); },
     },
-    'bit-flip': {
+    'bit_flip': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], index = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -1059,7 +1075,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'bit-set': {
+    'bit_set': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], index = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -1069,7 +1085,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'bit-clear': {
+    'bit_clear': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], index = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -1079,7 +1095,7 @@ var bitwiseNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'bit-test': {
+    'bit_test': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), num = _b[0], index = _b[1];
             assertNumber(num, sourceCodeInfo, { integer: true });
@@ -2780,7 +2796,7 @@ var mathNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'rem': {
+    '%': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), dividend = _b[0], divisor = _b[1];
             assertNumber(dividend, sourceCodeInfo);
@@ -2806,7 +2822,7 @@ var mathNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'pow': {
+    '**': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), first = _b[0], second = _b[1];
             assertNumber(first, sourceCodeInfo);
@@ -3083,10 +3099,6 @@ var mathNormalExpression = {
     },
 };
 
-var version = "2.0.14";
-
-var uuidTemplate = 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx';
-var xyRegexp = /[xy]/g;
 var miscNormalExpression = {
     '!=': {
         evaluate: function (params) {
@@ -3100,7 +3112,7 @@ var miscNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 1 }, node); },
     },
-    '=': {
+    '==': {
         evaluate: function (_a) {
             var e_1, _b;
             var _c = __read(_a), first = _c[0], rest = _c.slice(1);
@@ -3225,20 +3237,14 @@ var miscNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 1 }, node); },
     },
-    'not': {
+    '!': {
         evaluate: function (_a) {
             var _b = __read(_a, 1), first = _b[0];
             return !first;
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'inst-ms!': {
-        evaluate: function () {
-            return Date.now();
-        },
-        validate: function (node) { return assertNumberOfParams(0, node); },
-    },
-    'inst-ms->iso-date-time': {
+    'epoch>iso_date': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), ms = _b[0];
             assertNumber(ms, sourceCodeInfo);
@@ -3246,7 +3252,7 @@ var miscNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'iso-date-time->inst-ms': {
+    'iso_date>epoch': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), dateTime = _b[0];
             assertString(dateTime, sourceCodeInfo);
@@ -3279,23 +3285,7 @@ var miscNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'uuid!': {
-        evaluate: function () {
-            return uuidTemplate.replace(xyRegexp, function (character) {
-                var randomNbr = Math.floor(Math.random() * 16);
-                var newValue = character === 'x' ? randomNbr : (randomNbr & 0x3) | 0x8;
-                return newValue.toString(16);
-            });
-        },
-        validate: function (node) { return assertNumberOfParams(0, node); },
-    },
-    'lits-version!': {
-        evaluate: function () {
-            return version;
-        },
-        validate: function (node) { return assertNumberOfParams(0, node); },
-    },
-    'json-parse': {
+    'json_parse': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), first = _b[0];
             assertString(first, sourceCodeInfo);
@@ -3304,7 +3294,7 @@ var miscNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'json-stringify': {
+    'json_stringify': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), first = _b[0], second = _b[1];
             assertAny(first, sourceCodeInfo);
@@ -3517,7 +3507,7 @@ var assertNormalExpression = {
 };
 
 var objectNormalExpression = {
-    'object': {
+    object: {
         evaluate: function (params, sourceCodeInfo) {
             var result = {};
             for (var i = 0; i < params.length; i += 2) {
@@ -3530,7 +3520,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertEvenNumberOfParams(node); },
     },
-    'keys': {
+    keys: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), obj = _b[0];
             assertObj(obj, sourceCodeInfo);
@@ -3538,7 +3528,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'vals': {
+    vals: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), obj = _b[0];
             assertObj(obj, sourceCodeInfo);
@@ -3546,7 +3536,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'entries': {
+    entries: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), obj = _b[0];
             assertObj(obj, sourceCodeInfo);
@@ -3554,7 +3544,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'find': {
+    find: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), obj = _b[0], key = _b[1];
             assertObj(obj, sourceCodeInfo);
@@ -3565,7 +3555,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'dissoc': {
+    dissoc: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), obj = _b[0], key = _b[1];
             assertObj(obj, sourceCodeInfo);
@@ -3576,7 +3566,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'merge': {
+    merge: {
         evaluate: function (params, sourceCodeInfo) {
             if (params.length === 0)
                 return null;
@@ -3589,7 +3579,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 0 }, node); },
     },
-    'merge-with': {
+    merge_with: {
         evaluate: function (params, sourceCodeInfo, contextStack, _a) {
             var executeFunction = _a.executeFunction;
             var first = params[0];
@@ -3612,7 +3602,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2 }, node); },
     },
-    'zipmap': {
+    zipmap: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), keys = _b[0], values = _b[1];
             assertStringArray(keys, sourceCodeInfo);
@@ -3627,7 +3617,7 @@ var objectNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(2, node); },
     },
-    'select-keys': {
+    select_keys: {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), obj = _b[0], keys = _b[1];
             assertStringArray(keys, sourceCodeInfo);
@@ -3893,7 +3883,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2, max: 3 }, node); },
     },
-    'string-repeat': {
+    'string_repeat': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), str = _b[0], count = _b[1];
             assertString(str, sourceCodeInfo);
@@ -3927,27 +3917,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'number-to-string': {
-        evaluate: function (params, sourceCodeInfo) {
-            var _a = __read(params, 2), num = _a[0], base = _a[1];
-            assertNumber(num, sourceCodeInfo, { finite: true });
-            if (params.length === 1) {
-                return "".concat(num);
-            }
-            else {
-                assertNumber(base, sourceCodeInfo, { finite: true });
-                if (base !== 2 && base !== 8 && base !== 10 && base !== 16) {
-                    throw new LitsError("Expected \"number-to-string\" base argument to be 2, 8, 10 or 16, got: ".concat(base), sourceCodeInfo);
-                }
-                if (base === 10)
-                    return "".concat(num);
-                assertNumber(num, sourceCodeInfo, { integer: true, nonNegative: true });
-                return Number(num).toString(base);
-            }
-        },
-        validate: function (node) { return assertNumberOfParams({ min: 1, max: 2 }, node); },
-    },
-    'from-char-code': {
+    'from_char_code': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), num = _b[0];
             assertNumber(num, sourceCodeInfo, { finite: true });
@@ -3961,7 +3931,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'to-char-code': {
+    'to_char_code': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), str = _b[0];
             assertString(str, sourceCodeInfo, { nonEmpty: true });
@@ -3969,7 +3939,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'lower-case': {
+    'lower_case': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), str = _b[0];
             assertString(str, sourceCodeInfo);
@@ -3977,7 +3947,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'upper-case': {
+    'upper_case': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), str = _b[0];
             assertString(str, sourceCodeInfo);
@@ -3993,7 +3963,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'trim-left': {
+    'trim_left': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), str = _b[0];
             assertString(str, sourceCodeInfo);
@@ -4001,7 +3971,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'trim-right': {
+    'trim_right': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), str = _b[0];
             assertString(str, sourceCodeInfo);
@@ -4009,6 +3979,30 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
+    '++': {
+        evaluate: function (params, sourceCodeInfo) {
+            if (params.length === 0) {
+                return '';
+            }
+            var first = params[0];
+            if (first !== null) {
+                assertStringOrNumber(first, sourceCodeInfo);
+            }
+            if (params.length === 1) {
+                return first === null ? '' : "".concat(first);
+            }
+            return params.slice(1).reduce(function (acc, str) {
+                if (str !== null) {
+                    assertStringOrNumber(str, sourceCodeInfo);
+                }
+                if (str === null) {
+                    return acc;
+                }
+                return "".concat(acc).concat(str);
+            }, first === null ? '' : "".concat(first));
+        },
+        validate: function () { return undefined; },
+    },
     'join': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 2), stringList = _b[0], delimiter = _b[1];
@@ -4033,7 +4027,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2, max: 3 }, node); },
     },
-    'pad-left': {
+    'pad_left': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 3), str = _b[0], length = _b[1], padString = _b[2];
             assertString(str, sourceCodeInfo);
@@ -4044,7 +4038,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 2, max: 3 }, node); },
     },
-    'pad-right': {
+    'pad_right': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 3), str = _b[0], length = _b[1], padString = _b[2];
             assertString(str, sourceCodeInfo);
@@ -4086,7 +4080,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams({ min: 1, max: 10 }, node); },
     },
-    'encode-base64': {
+    'encode_base64': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), value = _b[0];
             assertString(value, sourceCodeInfo);
@@ -4097,7 +4091,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'decode-base64': {
+    'decode_base64': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), value = _b[0];
             assertString(value, sourceCodeInfo);
@@ -4115,7 +4109,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'encode-uri-component': {
+    'encode_uri_component': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), value = _b[0];
             assertString(value, sourceCodeInfo);
@@ -4123,7 +4117,7 @@ var stringNormalExpression = {
         },
         validate: function (node) { return assertNumberOfParams(1, node); },
     },
-    'decode-uri-component': {
+    'decode_uri_component': {
         evaluate: function (_a, sourceCodeInfo) {
             var _b = __read(_a, 1), value = _b[0];
             assertString(value, sourceCodeInfo);
@@ -4292,7 +4286,7 @@ var andSpecialExpression = {
         assertRParenToken(tokenStream.tokens[parseState.position++]);
         var node = {
             t: AstNodeType.SpecialExpression,
-            n: 'and',
+            n: '&&',
             p: params,
             token: getTokenDebugData(firstToken) && firstToken,
         };
@@ -4377,8 +4371,39 @@ var condSpecialExpression = {
     },
 };
 
+var switchSpecialExpression = {
+    polishParse: getCommonPolishSpecialExpressionParser('switch'),
+    validateParameterCount: function (node) { return assertOddNumberOfParams(node); },
+    evaluate: function (node, contextStack, _a) {
+        var e_1, _b;
+        var evaluateAstNode = _a.evaluateAstNode;
+        var switchValue = evaluateAstNode(node.p[0], contextStack);
+        try {
+            for (var _c = __values(arrayToPairs(node.p.slice(1))), _d = _c.next(); !_d.done; _d = _c.next()) {
+                var _e = __read(_d.value, 2), test = _e[0], form = _e[1];
+                var value = evaluateAstNode(test, contextStack);
+                if (value === switchValue) {
+                    return evaluateAstNode(form, contextStack);
+                }
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (_d && !_d.done && (_b = _c.return)) _b.call(_c);
+            }
+            finally { if (e_1) throw e_1.error; }
+        }
+        return null;
+    },
+    findUnresolvedIdentifiers: function (node, contextStack, _a) {
+        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
+        return findUnresolvedIdentifiers(node.p, contextStack, builtin);
+    },
+};
+
 var declaredSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('declared?'),
+    polishParse: getCommonPolishSpecialExpressionParser('defined?'),
     validateParameterCount: function (node) { return assertNumberOfParams(1, node); },
     evaluate: function (node, contextStack) {
         var lookUpResult = contextStack.lookUp(node.p[0]);
@@ -4433,9 +4458,7 @@ var defSpecialExpression = {
         var sourceCodeInfo = (_b = getTokenDebugData(node.token)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo;
         var name = node.p[0].v;
         assertNameNotDefined(name, contextStack, builtin, sourceCodeInfo);
-        contextStack.globalContext[name] = {
-            value: evaluateAstNode(node.p[1], contextStack),
-        };
+        contextStack.exportValue(name, evaluateAstNode(node.p[1], contextStack));
         return null;
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
@@ -4446,7 +4469,7 @@ var defSpecialExpression = {
         var result = findUnresolvedIdentifiers([subNode], contextStack, builtin);
         var name = asSymbolNode(node.p[0]).v;
         assertNameNotDefined(name, contextStack, builtin, sourceCodeInfo);
-        contextStack.globalContext[name] = { value: true };
+        contextStack.exportValue(name, true);
         return result;
     },
 };
@@ -4472,9 +4495,7 @@ var defsSpecialExpression = {
         var name = evaluateAstNode(node.p[0], contextStack);
         assertString(name, sourceCodeInfo);
         assertNameNotDefined(name, contextStack, builtin, (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo);
-        contextStack.globalContext[name] = {
-            value: evaluateAstNode(node.p[1], contextStack),
-        };
+        contextStack.exportValue(name, evaluateAstNode(node.p[1], contextStack));
         return null;
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
@@ -4486,7 +4507,7 @@ var defsSpecialExpression = {
         var name = evaluateAstNode(node.p[0], contextStack);
         assertString(name, sourceCodeInfo);
         assertNameNotDefined(name, contextStack, builtin, sourceCodeInfo);
-        contextStack.globalContext[name] = { value: true };
+        contextStack.exportValue(name, true);
         return result;
     },
 };
@@ -4517,7 +4538,7 @@ var doSpecialExpression = {
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
         var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        return findUnresolvedIdentifiers(node.p, contextStack, builtin);
+        return findUnresolvedIdentifiers(node.p, contextStack.create({}), builtin);
     },
 };
 
@@ -4546,11 +4567,6 @@ function joinAnalyzeResults() {
 function addAnalyzeResults(target, source) {
     source.forEach(function (symbol) { return target.add(symbol); });
 }
-function combinate(arrays) {
-    return arrays.reduce(function (acc, curr) {
-        return acc.flatMap(function (a) { return curr.map(function (c) { return __spreadArray(__spreadArray([], __read(a), false), [c], false); }); });
-    }, [[]]);
-}
 
 var defnSpecialExpression = {
     polishParse: function (tokenStream, parseState, firstToken, parsers) {
@@ -4585,13 +4601,13 @@ var defnSpecialExpression = {
             _b.n = name,
             _b.o = evaluatedFunctionOverloades,
             _b);
-        contextStack.globalContext[name] = { value: litsFunction };
+        contextStack.exportValue(name, litsFunction);
         return null;
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
         var _b;
         var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        contextStack.globalContext[node.f.v] = { value: true };
+        contextStack.exportValue(node.f.v, true);
         var newContext = (_b = {}, _b[node.f.v] = { value: true }, _b);
         return addOverloadsUnresolvedIdentifiers(node.o, contextStack, findUnresolvedIdentifiers, builtin, newContext);
     },
@@ -4627,7 +4643,7 @@ var defnsSpecialExpression = {
             _b.n = name,
             _b.o = evaluatedFunctionOverloades,
             _b);
-        contextStack.globalContext[name] = { value: litsFunction };
+        contextStack.exportValue(name, litsFunction);
         return null;
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
@@ -4638,7 +4654,7 @@ var defnsSpecialExpression = {
         var name = evaluateAstNode(asAstNode(node.f, sourceCodeInfo), contextStack);
         assertString(name, sourceCodeInfo);
         assertNameNotDefined(name, contextStack, builtin, sourceCodeInfo);
-        contextStack.globalContext[name] = { value: true };
+        contextStack.exportValue(name, true);
         var newContext = (_b = {}, _b[name] = { value: true }, _b);
         return addOverloadsUnresolvedIdentifiers(node.o, contextStack, findUnresolvedIdentifiers, builtin, newContext);
     },
@@ -4848,7 +4864,7 @@ function parseFunctionArguments(tokenStream, parseState, parsers) {
             tkn = asToken(tokenStream.tokens[parseState.position]);
             if (node.t === AstNodeType.Modifier) {
                 switch (node.v) {
-                    case '&':
+                    case '&rest':
                         if (state === 'rest')
                             throw new LitsError('& can only appear once', (_a = getTokenDebugData(tkn)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
                         state = 'rest';
@@ -4911,56 +4927,8 @@ var ifSpecialExpression = {
     },
 };
 
-var ifLetSpecialExpression = {
-    polishParse: function (tokenStream, parseState, firstToken, _a) {
-        var _b, _c;
-        var parseBindings = _a.parseBindings, parseTokensUntilClosingBracket = _a.parseTokensUntilClosingBracket;
-        var bindings = parseBindings(tokenStream, parseState);
-        if (bindings.length !== 1) {
-            throw new LitsError("Expected exactly one binding, got ".concat(valueToString(bindings.length)), (_b = getTokenDebugData(firstToken)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo);
-        }
-        var params = parseTokensUntilClosingBracket(tokenStream, parseState);
-        assertRParenToken(tokenStream.tokens[parseState.position++]);
-        var node = {
-            t: AstNodeType.SpecialExpression,
-            n: 'if-let',
-            b: asNonUndefined(bindings[0], (_c = getTokenDebugData(firstToken)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo),
-            p: params,
-            token: getTokenDebugData(firstToken) && firstToken,
-        };
-        return node;
-    },
-    validateParameterCount: function (node) { return assertNumberOfParams({ min: 1, max: 2 }, node); },
-    evaluate: function (node, contextStack, _a) {
-        var _b;
-        var evaluateAstNode = _a.evaluateAstNode;
-        var sourceCodeInfo = (_b = getTokenDebugData(node.token)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo;
-        var locals = {};
-        var bindingValue = evaluateAstNode(node.b.v, contextStack);
-        if (bindingValue) {
-            locals[node.b.n] = { value: bindingValue };
-            var newContextStack = contextStack.create(locals);
-            var thenForm = asAstNode(node.p[0], sourceCodeInfo);
-            return evaluateAstNode(thenForm, newContextStack);
-        }
-        if (node.p.length === 2) {
-            var elseForm = asAstNode(node.p[1], sourceCodeInfo);
-            return evaluateAstNode(elseForm, contextStack);
-        }
-        return null;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var _b;
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        var newContext = (_b = {}, _b[node.b.n] = { value: true }, _b);
-        var bindingResult = findUnresolvedIdentifiers([node.b.v], contextStack, builtin);
-        var paramsResult = findUnresolvedIdentifiers(node.p, contextStack.create(newContext), builtin);
-        return joinAnalyzeResults(bindingResult, paramsResult);
-    },
-};
-
-var ifNotSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('if-not'),
+var unlessSpecialExpression = {
+    polishParse: getCommonPolishSpecialExpressionParser('unless'),
     validateParameterCount: function (node) { return assertNumberOfParams({ min: 2, max: 3 }, node); },
     evaluate: function (node, contextStack, _a) {
         var _b;
@@ -4985,55 +4953,39 @@ var ifNotSpecialExpression = {
 
 var letSpecialExpression = {
     polishParse: function (tokenStream, parseState, firstToken, _a) {
-        var parseBindings = _a.parseBindings, parseTokensUntilClosingBracket = _a.parseTokensUntilClosingBracket;
+        var parseBindings = _a.parseBindings;
         var bindings = parseBindings(tokenStream, parseState);
-        var params = parseTokensUntilClosingBracket(tokenStream, parseState);
+        // const params = parseTokensUntilClosingBracket(tokenStream, parseState)
         assertRParenToken(tokenStream.tokens[parseState.position++]);
         var node = {
             t: AstNodeType.SpecialExpression,
             n: 'let',
-            p: params,
+            p: [],
             bs: bindings,
             token: getTokenDebugData(firstToken) && firstToken,
         };
         return node;
     },
-    validateParameterCount: function () { return undefined; },
+    validateParameterCount: function (node) { return assertNumberOfParams(0, node); },
     evaluate: function (node, contextStack, _a) {
-        var e_1, _b, e_2, _c;
+        var e_1, _b;
         var evaluateAstNode = _a.evaluateAstNode;
-        var locals = {};
-        var newContextStack = contextStack.create(locals);
         try {
-            for (var _d = __values(node.bs), _e = _d.next(); !_e.done; _e = _d.next()) {
-                var binding = _e.value;
+            for (var _c = __values(node.bs), _d = _c.next(); !_d.done; _d = _c.next()) {
+                var binding = _d.value;
                 var bindingValueNode = binding.v;
-                var bindingValue = evaluateAstNode(bindingValueNode, newContextStack);
-                locals[binding.n] = { value: bindingValue };
+                var bindingValue = evaluateAstNode(bindingValueNode, contextStack);
+                contextStack.addValue(binding.n, bindingValue);
             }
         }
         catch (e_1_1) { e_1 = { error: e_1_1 }; }
         finally {
             try {
-                if (_e && !_e.done && (_b = _d.return)) _b.call(_d);
+                if (_d && !_d.done && (_b = _c.return)) _b.call(_c);
             }
             finally { if (e_1) throw e_1.error; }
         }
-        var result = null;
-        try {
-            for (var _f = __values(node.p), _g = _f.next(); !_g.done; _g = _f.next()) {
-                var astNode = _g.value;
-                result = evaluateAstNode(astNode, newContextStack);
-            }
-        }
-        catch (e_2_1) { e_2 = { error: e_2_1 }; }
-        finally {
-            try {
-                if (_g && !_g.done && (_c = _f.return)) _c.call(_f);
-            }
-            finally { if (e_2) throw e_2.error; }
-        }
-        return result;
+        return null;
     },
     findUnresolvedIdentifiers: function (node, contextStack, _a) {
         var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
@@ -5043,11 +4995,10 @@ var letSpecialExpression = {
             context[name] = { value: true };
             return context;
         }, {});
-        var bindingContext = {};
         var bindingResults = node.bs.map(function (bindingNode) {
             var valueNode = bindingNode.v;
-            var bindingsResult = findUnresolvedIdentifiers([valueNode], contextStack.create(bindingContext), builtin);
-            bindingContext[bindingNode.n] = { value: true };
+            var bindingsResult = findUnresolvedIdentifiers([valueNode], contextStack, builtin);
+            contextStack.addValue(bindingNode.n, { value: true });
             return bindingsResult;
         });
         var paramsResult = findUnresolvedIdentifiers(node.p, contextStack.create(newContext), builtin);
@@ -5170,7 +5121,7 @@ function parseLoopBinding(tokenStream, parseState, _a) {
                 loopBinding.we = parseToken(tokenStream, parseState);
                 loopBinding.m.push('&while');
                 break;
-            case '&':
+            case '&rest':
                 throw new LitsError("Illegal modifier: ".concat(modifier), (_e = getTokenDebugData(tkn)) === null || _e === void 0 ? void 0 : _e.sourceCodeInfo);
             default:
                 throw new LitsError("Illegal modifier: ".concat(modifier), (_f = getTokenDebugData(tkn)) === null || _f === void 0 ? void 0 : _f.sourceCodeInfo);
@@ -5370,7 +5321,7 @@ var doseqSpecialExpression = {
 };
 
 var orSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('or'),
+    polishParse: getCommonPolishSpecialExpressionParser('||'),
     validateParameterCount: function () { return undefined; },
     evaluate: function (node, contextStack, _a) {
         var e_1, _b;
@@ -5462,25 +5413,6 @@ var throwSpecialExpression = {
     },
 };
 
-var timeSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('time!'),
-    validateParameterCount: function (node) { return assertNumberOfParams(1, node); },
-    evaluate: function (node, contextStack, _a) {
-        var evaluateAstNode = _a.evaluateAstNode;
-        var param = node.p[0];
-        var startTime = Date.now();
-        var result = evaluateAstNode(param, contextStack);
-        var totalTime = Date.now() - startTime;
-        // eslint-disable-next-line no-console
-        console.log("Elapsed time: ".concat(totalTime, " ms"));
-        return result;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        return findUnresolvedIdentifiers(node.p, contextStack, builtin);
-    },
-};
-
 var trySpecialExpression = {
     polishParse: function (tokenStream, parseState, firstToken, _a) {
         var _b, _c, _d;
@@ -5517,9 +5449,10 @@ var trySpecialExpression = {
             return evaluateAstNode(tryExpressions[0], contextStack);
         }
         catch (error) {
-            var newContext = (_b = {},
-                _b[errorNode.v] = { value: asAny(error, (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo) },
-                _b);
+            var newContext = errorNode
+                ? (_b = {},
+                    _b[errorNode.v] = { value: asAny(error, (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo) },
+                    _b) : {};
             return evaluateAstNode(catchExpression, contextStack.create(newContext));
         }
     },
@@ -5528,288 +5461,128 @@ var trySpecialExpression = {
         var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
         var tryExpressions = node.p, catchExpression = node.ce, errorNode = node.e;
         var tryResult = findUnresolvedIdentifiers(tryExpressions, contextStack, builtin);
-        var newContext = (_b = {},
-            _b[errorNode.v] = { value: true },
-            _b);
+        var newContext = errorNode
+            ? (_b = {},
+                _b[errorNode.v] = { value: true },
+                _b) : {};
         var catchResult = findUnresolvedIdentifiers([catchExpression], contextStack.create(newContext), builtin);
         return joinAnalyzeResults(tryResult, catchResult);
     },
 };
 
-var whenSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('when'),
-    validateParameterCount: function (node) { return assertNumberOfParams({ min: 1 }, node); },
-    evaluate: function (node, contextStack, _a) {
-        var e_1, _b;
-        var _c;
-        var evaluateAstNode = _a.evaluateAstNode;
-        var _d = __read(node.p), whenExpression = _d[0], body = _d.slice(1);
-        assertAstNode(whenExpression, (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo);
-        if (!evaluateAstNode(whenExpression, contextStack))
-            return null;
-        var result = null;
+var specialExpressions = {
+    '&&': andSpecialExpression,
+    'comment': commentSpecialExpression,
+    'cond': condSpecialExpression,
+    'switch': switchSpecialExpression,
+    'def': defSpecialExpression,
+    'defn': defnSpecialExpression,
+    'defns': defnsSpecialExpression,
+    'defs': defsSpecialExpression,
+    'do': doSpecialExpression,
+    'doseq': doseqSpecialExpression,
+    'for': forSpecialExpression,
+    'fn': fnSpecialExpression,
+    'if': ifSpecialExpression,
+    'unless': unlessSpecialExpression,
+    'let': letSpecialExpression,
+    'loop': loopSpecialExpression,
+    '||': orSpecialExpression,
+    'recur': recurSpecialExpression,
+    'throw': throwSpecialExpression,
+    'try': trySpecialExpression,
+    'defined?': declaredSpecialExpression,
+    '??': qqSpecialExpression,
+};
+Object.keys(specialExpressions).forEach(function (key) {
+    /* v8 ignore next 2 */
+    if (normalExpressions[key])
+        throw new Error("Expression ".concat(key, " is defined as both a normal expression and a special expression"));
+});
+var builtin = {
+    normalExpressions: normalExpressions,
+    specialExpressions: specialExpressions,
+};
+var normalExpressionKeys = Object.keys(normalExpressions);
+var specialExpressionKeys = Object.keys(specialExpressions);
+
+function isContextEntry(value) {
+    return isUnknownRecord(value) && value.value !== undefined;
+}
+
+var ContextStackImpl = /** @class */ (function () {
+    function ContextStackImpl(_a) {
+        var contexts = _a.contexts, hostValues = _a.values, lazyHostValues = _a.lazyValues, nativeJsFunctions = _a.nativeJsFunctions;
+        this.globalContext = asNonUndefined(contexts[0]);
+        this.contexts = contexts;
+        this.values = hostValues;
+        this.lazyValues = lazyHostValues;
+        this.nativeJsFunctions = nativeJsFunctions;
+    }
+    ContextStackImpl.prototype.create = function (context, extraData) {
+        var globalContext = this.globalContext;
+        var contextStack = new ContextStackImpl({
+            contexts: __spreadArray([context], __read(this.contexts), false),
+            values: this.values,
+            lazyValues: extraData ? __assign(__assign({}, this.lazyValues), extraData) : this.lazyValues,
+            nativeJsFunctions: this.nativeJsFunctions,
+        });
+        contextStack.globalContext = globalContext;
+        return contextStack;
+    };
+    ContextStackImpl.prototype.exportValue = function (name, value) {
+        if (this.globalContext[name]) {
+            throw new Error("Cannot redefine exported value \"".concat(name, "\""));
+        }
+        if (specialExpressionKeys.includes(name)) {
+            throw new Error("Cannot shadow special expression \"".concat(name, "\""));
+        }
+        if (normalExpressionKeys.includes(name)) {
+            throw new Error("Cannot shadow builtin function \"".concat(name, "\""));
+        }
+        this.addValue(name, value);
+        this.globalContext[name] = { value: value };
+    };
+    ContextStackImpl.prototype.addValue = function (name, value) {
+        var currentContext = this.contexts[0];
+        if (!currentContext) {
+            throw new Error('No context to add value to');
+        }
+        if (currentContext[name]) {
+            throw new Error("Cannot redefine value \"".concat(name, "\""));
+        }
+        if (specialExpressionKeys.includes(name)) {
+            throw new Error("Cannot shadow special expression \"".concat(name, "\""));
+        }
+        if (normalExpressionKeys.includes(name)) {
+            throw new Error("Cannot shadow builtin function \"".concat(name, "\""));
+        }
+        currentContext[name] = { value: toAny(value) };
+    };
+    ContextStackImpl.prototype.clone = function () {
+        // eslint-disable-next-line ts/no-unsafe-argument
+        return new ContextStackImpl(JSON.parse(JSON.stringify({
+            contexts: this.contexts,
+            values: this.values,
+            lazyValues: this.lazyValues,
+            nativeJsFunctions: this.nativeJsFunctions,
+        })));
+    };
+    ContextStackImpl.prototype.getValue = function (name) {
+        var e_1, _a;
+        var _b, _c, _d;
         try {
-            for (var body_1 = __values(body), body_1_1 = body_1.next(); !body_1_1.done; body_1_1 = body_1.next()) {
-                var form = body_1_1.value;
-                result = evaluateAstNode(form, contextStack);
+            for (var _e = __values(this.contexts), _f = _e.next(); !_f.done; _f = _e.next()) {
+                var context = _f.value;
+                var contextEntry = context[name];
+                if (contextEntry)
+                    return contextEntry.value;
             }
         }
         catch (e_1_1) { e_1 = { error: e_1_1 }; }
         finally {
             try {
-                if (body_1_1 && !body_1_1.done && (_b = body_1.return)) _b.call(body_1);
-            }
-            finally { if (e_1) throw e_1.error; }
-        }
-        return result;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        return findUnresolvedIdentifiers(node.p, contextStack, builtin);
-    },
-};
-
-var whenFirstSpecialExpression = {
-    polishParse: function (tokenStream, parseState, firstToken, _a) {
-        var _b, _c;
-        var parseBindings = _a.parseBindings, parseTokensUntilClosingBracket = _a.parseTokensUntilClosingBracket;
-        var bindings = parseBindings(tokenStream, parseState);
-        if (bindings.length !== 1) {
-            throw new LitsError("Expected exactly one binding, got ".concat(valueToString(bindings.length)), (_b = getTokenDebugData(firstToken)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo);
-        }
-        var params = parseTokensUntilClosingBracket(tokenStream, parseState);
-        assertRParenToken(tokenStream.tokens[parseState.position++]);
-        var node = {
-            t: AstNodeType.SpecialExpression,
-            n: 'when-first',
-            b: asNonUndefined(bindings[0], (_c = getTokenDebugData(firstToken)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo),
-            p: params,
-            token: getTokenDebugData(firstToken) && firstToken,
-        };
-        return node;
-    },
-    validateParameterCount: function () { return undefined; },
-    evaluate: function (node, contextStack, _a) {
-        var e_1, _b;
-        var _c;
-        var evaluateAstNode = _a.evaluateAstNode;
-        var locals = {};
-        var binding = node.b;
-        var evaluatedBindingForm = evaluateAstNode(binding.v, contextStack);
-        if (!isSeq(evaluatedBindingForm)) {
-            throw new LitsError("Expected undefined or a sequence, got ".concat(valueToString(evaluatedBindingForm)), (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo);
-        }
-        if (evaluatedBindingForm.length === 0)
-            return null;
-        var bindingValue = toAny(evaluatedBindingForm[0]);
-        locals[binding.n] = { value: bindingValue };
-        var newContextStack = contextStack.create(locals);
-        var result = null;
-        try {
-            for (var _d = __values(node.p), _e = _d.next(); !_e.done; _e = _d.next()) {
-                var form = _e.value;
-                result = evaluateAstNode(form, newContextStack);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_e && !_e.done && (_b = _d.return)) _b.call(_d);
-            }
-            finally { if (e_1) throw e_1.error; }
-        }
-        return result;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var _b;
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        var binding = node.b;
-        var newContext = (_b = {}, _b[binding.n] = { value: true }, _b);
-        var bindingResult = findUnresolvedIdentifiers([binding.v], contextStack, builtin);
-        var paramsResult = findUnresolvedIdentifiers(node.p, contextStack.create(newContext), builtin);
-        return joinAnalyzeResults(bindingResult, paramsResult);
-    },
-};
-
-var whenLetSpecialExpression = {
-    polishParse: function (tokenStream, parseState, firstToken, _a) {
-        var _b, _c;
-        var parseBindings = _a.parseBindings, parseTokensUntilClosingBracket = _a.parseTokensUntilClosingBracket;
-        var bindings = parseBindings(tokenStream, parseState);
-        if (bindings.length !== 1) {
-            throw new LitsError("Expected exactly one binding, got ".concat(valueToString(bindings.length)), (_b = getTokenDebugData(firstToken)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo);
-        }
-        var params = parseTokensUntilClosingBracket(tokenStream, parseState);
-        assertRParenToken(tokenStream.tokens[parseState.position++]);
-        var node = {
-            t: AstNodeType.SpecialExpression,
-            n: 'when-let',
-            b: asNonUndefined(bindings[0], (_c = getTokenDebugData(firstToken)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo),
-            p: params,
-            token: getTokenDebugData(firstToken) && firstToken,
-        };
-        return node;
-    },
-    validateParameterCount: function () { return undefined; },
-    evaluate: function (node, contextStack, _a) {
-        var e_1, _b;
-        var evaluateAstNode = _a.evaluateAstNode;
-        var binding = node.b;
-        var locals = {};
-        var bindingValue = evaluateAstNode(binding.v, contextStack);
-        if (!bindingValue)
-            return null;
-        locals[binding.n] = { value: bindingValue };
-        var newContextStack = contextStack.create(locals);
-        var result = null;
-        try {
-            for (var _c = __values(node.p), _d = _c.next(); !_d.done; _d = _c.next()) {
-                var form = _d.value;
-                result = evaluateAstNode(form, newContextStack);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_d && !_d.done && (_b = _c.return)) _b.call(_c);
-            }
-            finally { if (e_1) throw e_1.error; }
-        }
-        return result;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var _b;
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        var binding = node.b;
-        var newContext = (_b = {}, _b[binding.n] = { value: true }, _b);
-        var bindingResult = findUnresolvedIdentifiers([binding.v], contextStack, builtin);
-        var paramsResult = findUnresolvedIdentifiers(node.p, contextStack.create(newContext), builtin);
-        return joinAnalyzeResults(bindingResult, paramsResult);
-    },
-};
-
-var whenNotSpecialExpression = {
-    polishParse: getCommonPolishSpecialExpressionParser('when-not'),
-    validateParameterCount: function (node) { return assertNumberOfParams({ min: 1 }, node); },
-    evaluate: function (node, contextStack, _a) {
-        var e_1, _b;
-        var _c;
-        var evaluateAstNode = _a.evaluateAstNode;
-        var _d = __read(node.p), whenExpression = _d[0], body = _d.slice(1);
-        assertAstNode(whenExpression, (_c = getTokenDebugData(node.token)) === null || _c === void 0 ? void 0 : _c.sourceCodeInfo);
-        if (evaluateAstNode(whenExpression, contextStack))
-            return null;
-        var result = null;
-        try {
-            for (var body_1 = __values(body), body_1_1 = body_1.next(); !body_1_1.done; body_1_1 = body_1.next()) {
-                var form = body_1_1.value;
-                result = evaluateAstNode(form, contextStack);
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (body_1_1 && !body_1_1.done && (_b = body_1.return)) _b.call(body_1);
-            }
-            finally { if (e_1) throw e_1.error; }
-        }
-        return result;
-    },
-    findUnresolvedIdentifiers: function (node, contextStack, _a) {
-        var findUnresolvedIdentifiers = _a.findUnresolvedIdentifiers, builtin = _a.builtin;
-        return findUnresolvedIdentifiers(node.p, contextStack, builtin);
-    },
-};
-
-var specialExpressions = {
-    'and': andSpecialExpression,
-    'comment': commentSpecialExpression,
-    'cond': condSpecialExpression,
-    'def': defSpecialExpression,
-    'defn': defnSpecialExpression,
-    'defns': defnsSpecialExpression,
-    'defs': defsSpecialExpression,
-    'do': doSpecialExpression,
-    'doseq': doseqSpecialExpression,
-    'for': forSpecialExpression,
-    'fn': fnSpecialExpression,
-    'if': ifSpecialExpression,
-    'if-let': ifLetSpecialExpression,
-    'if-not': ifNotSpecialExpression,
-    'let': letSpecialExpression,
-    'loop': loopSpecialExpression,
-    'or': orSpecialExpression,
-    'recur': recurSpecialExpression,
-    'throw': throwSpecialExpression,
-    'time!': timeSpecialExpression,
-    'try': trySpecialExpression,
-    'when': whenSpecialExpression,
-    'when-first': whenFirstSpecialExpression,
-    'when-let': whenLetSpecialExpression,
-    'when-not': whenNotSpecialExpression,
-    'declared?': declaredSpecialExpression,
-    '??': qqSpecialExpression,
-};
-Object.keys(specialExpressions).forEach(function (key) {
-    /* v8 ignore next 2 */
-    if (normalExpressions[key])
-        throw new Error("Expression ".concat(key, " is defined as both a normal expression and a special expression"));
-});
-var builtin = {
-    normalExpressions: normalExpressions,
-    specialExpressions: specialExpressions,
-};
-var normalExpressionKeys = Object.keys(normalExpressions);
-var specialExpressionKeys = Object.keys(specialExpressions);
-
-function isContextEntry(value) {
-    return isUnknownRecord(value) && value.value !== undefined;
-}
-
-var ContextStackImpl = /** @class */ (function () {
-    function ContextStackImpl(_a) {
-        var contexts = _a.contexts, hostValues = _a.values, lazyHostValues = _a.lazyValues, nativeJsFunctions = _a.nativeJsFunctions;
-        this.contexts = contexts;
-        this.globalContext = asNonUndefined(contexts[0]);
-        this.values = hostValues;
-        this.lazyValues = lazyHostValues;
-        this.nativeJsFunctions = nativeJsFunctions;
-    }
-    ContextStackImpl.prototype.create = function (context, extraData) {
-        var globalContext = this.globalContext;
-        var contextStack = new ContextStackImpl({
-            contexts: __spreadArray([context], __read(this.contexts), false),
-            values: this.values,
-            lazyValues: extraData ? __assign(__assign({}, this.lazyValues), extraData) : this.lazyValues,
-            nativeJsFunctions: this.nativeJsFunctions,
-        });
-        contextStack.globalContext = globalContext;
-        return contextStack;
-    };
-    ContextStackImpl.prototype.clone = function () {
-        // eslint-disable-next-line ts/no-unsafe-argument
-        return new ContextStackImpl(JSON.parse(JSON.stringify({
-            contexts: this.contexts,
-            values: this.values,
-            lazyValues: this.lazyValues,
-            nativeJsFunctions: this.nativeJsFunctions,
-        })));
-    };
-    ContextStackImpl.prototype.getValue = function (name) {
-        var e_1, _a;
-        var _b, _c, _d;
-        try {
-            for (var _e = __values(this.contexts), _f = _e.next(); !_f.done; _f = _e.next()) {
-                var context = _f.value;
-                var contextEntry = context[name];
-                if (contextEntry)
-                    return contextEntry.value;
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (_f && !_f.done && (_a = _e.return)) _a.call(_e);
+                if (_f && !_f.done && (_a = _e.return)) _a.call(_e);
             }
             finally { if (e_1) throw e_1.error; }
         }
@@ -5915,7 +5688,7 @@ function createContextStack(params) {
                 return acc;
             }, {}),
     });
-    return contextStack;
+    return contextStack.create({});
 }
 
 var _a;
@@ -6227,7 +6000,14 @@ function evaluateNumberAsFunction(fn, params, sourceCodeInfo) {
 
 var findUnresolvedIdentifiers = function (ast, contextStack, builtin) {
     var e_1, _a;
-    var astNodes = Array.isArray(ast) ? ast : ast.b;
+    var astNodes = Array.isArray(ast)
+        ? ast
+        : [{
+                t: AstNodeType.SpecialExpression,
+                n: 'do',
+                p: ast.b,
+                token: undefined,
+            }];
     var unresolvedIdentifiers = new Set();
     try {
         for (var astNodes_1 = __values(astNodes), astNodes_1_1 = astNodes_1.next(); !astNodes_1_1.done; astNodes_1_1 = astNodes_1.next()) {
@@ -6299,538 +6079,9 @@ function findUnresolvedIdentifiersInAstNode(astNode, contextStack, builtin) {
     }
 }
 
-var calculateAndOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p)
-        .map(function (p) { return ({
-        n: 'and',
-        t: AstNodeType.SpecialExpression,
-        p: p,
-        token: astNode.token,
-    }); });
-};
-
-var calculateCondOutcomes = function (_a) {
-    var astNode = _a.astNode, nilNode = _a.nilNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, isAstComputable = _a.isAstComputable;
-    var testNodes = arrayToPairs(astNode.p).map(function (_a) {
-        var _b = __read(_a, 1), t = _b[0];
-        return t;
-    });
-    if (isAstComputable(testNodes)) {
-        return combinate(arrayToPairs(astNode.p)
-            // Create a list of ast nodes from the test and form of each condition
-            .reduce(function (acc, _a) {
-            var _b = __read(_a, 2), test = _b[0], form = _b[1];
-            acc.push(calculatePossibleAstNodes(test), calculatePossibleAstNodes(form));
-            return acc;
-        }, []))
-            // Create a new CondNode for each combination of test and form outcomes
-            .map(function (conditionAsts) { return (__assign(__assign({}, astNode), { c: arrayToPairs(conditionAsts).map(function (_a) {
-                var _b = __read(_a, 2), t = _b[0], f = _b[1];
-                return ({ t: t, f: f });
-            }) })); });
-    }
-    return __spreadArray(__spreadArray([], __read(arrayToPairs(astNode.p).flatMap(function (_a) {
-        var _b = __read(_a, 2); _b[0]; var form = _b[1];
-        return calculatePossibleAstNodes(form);
-    })), false), [
-        nilNode,
-    ], false);
-};
-
-var trueNode = { t: AstNodeType.ReservedSymbol, v: 'true', token: undefined, p: [], n: undefined };
-var falseNode = { t: AstNodeType.ReservedSymbol, v: 'false', token: undefined, p: [], n: undefined };
-var calculateDeclaredOutcomes = function (_a) {
-    var astNode = _a.astNode, isAstComputable = _a.isAstComputable;
-    if (isAstComputable(astNode.p))
-        return [trueNode];
-    return [trueNode, falseNode];
-};
-
-var calculateDefOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, addGlobalIdentifier = _a.addGlobalIdentifier;
-    var nameNode = asSymbolNode(astNode.p[0]);
-    var valueNode = astNode.p[1];
-    addGlobalIdentifier(nameNode.v);
-    return calculatePossibleAstNodes(valueNode)
-        .map(function (node) { return (__assign(__assign({}, astNode), { p: [nameNode, node] })); });
-};
-
-var calculateDefsOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p)
-        .map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-};
-
-var calculateDoOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p).map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-};
-
-function calculateFunctionOverloadOutcomes(combinateAstNodes, functionOverloads) {
-    return combinate(functionOverloads
-        // For each overload, calculate the possible outcomes for each parameter
-        .map(function (functionOverload) {
-        var _a;
-        return combinateAstNodes(functionOverload.b, [
-            functionOverload.as.m,
-            functionOverload.as.b.map(function (bindingNode) { return bindingNode.n; }),
-            (_a = functionOverload.as.r) !== null && _a !== void 0 ? _a : [],
-        ].flat())
-            // For each combination of parameter outcomes, create a new overload
-            .map(function (body) { return (__assign(__assign({}, functionOverload), { b: body })); });
-    }));
-}
-var calculateDefnOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes, addGlobalIdentifier = _a.addGlobalIdentifier;
-    addGlobalIdentifier(astNode.f.v);
-    // astNode.o is an array of overloads
-    return calculateFunctionOverloadOutcomes(combinateAstNodes, astNode.o).map(function (functionOverloads) { return (__assign(__assign({}, astNode), { o: functionOverloads })); });
-};
-var calculateDefnsOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes;
-    // astNode.o is an array of overloads
-    return calculatePossibleAstNodes(astNode.f).flatMap(function (functionName) {
-        return calculateFunctionOverloadOutcomes(combinateAstNodes, astNode.o).map(function (functionOverloads) { return (__assign(__assign({}, astNode), { f: functionName, o: functionOverloads })); });
-    });
-};
-var calculateFnOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    // astNode.o is an array of overloads
-    return calculateFunctionOverloadOutcomes(combinateAstNodes, astNode.o).map(function (functionOverloads) { return (__assign(__assign({}, astNode), { o: functionOverloads })); });
-};
-
-var calculateIfLetOutcomes = function (_a) {
-    var _b;
-    var astNode = _a.astNode, nilNode = _a.nilNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    var bindingNode = astNode.b;
-    var thenBranch = astNode.p[0];
-    var elseBranch = (_b = astNode.p[1]) !== null && _b !== void 0 ? _b : nilNode;
-    if (!isAstComputable(bindingNode.v)) {
-        return __spreadArray(__spreadArray([], __read(calculatePossibleAstNodes(thenBranch)), false), __read(calculatePossibleAstNodes(elseBranch)), false);
-    }
-    var newIdentifier = bindingNode.n;
-    return calculatePossibleAstNodes(bindingNode.v)
-        .map(function (bindingValue) { return (__assign(__assign({}, bindingNode), { v: bindingValue })); })
-        .flatMap(function (b) { return combinateAstNodes(astNode.p, [newIdentifier])
-        .map(function (p) { return (__assign(__assign({}, astNode), { b: b, p: p })); }); });
-};
-
-var calculateIfNotOutcomes = function (_a) {
-    var _b;
-    var astNode = _a.astNode, nilNode = _a.nilNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    var condition = astNode.p[0];
-    var thenBranch = astNode.p[1];
-    var elseBranch = (_b = astNode.p[2]) !== null && _b !== void 0 ? _b : nilNode;
-    if (isAstComputable(condition)) {
-        return combinateAstNodes(astNode.p)
-            .map(function (p) { return ({
-            n: 'if-not',
-            t: astNode.t,
-            p: p,
-            token: astNode.token,
-        }); });
-    }
-    return __spreadArray(__spreadArray([], __read(calculatePossibleAstNodes(thenBranch)), false), __read(calculatePossibleAstNodes(elseBranch)), false);
-};
-
-var calculateIfOutcomes = function (_a) {
-    var _b;
-    var astNode = _a.astNode, nilNode = _a.nilNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    var condition = astNode.p[0];
-    var thenBranch = astNode.p[1];
-    var elseBranch = (_b = astNode.p[2]) !== null && _b !== void 0 ? _b : nilNode;
-    if (isAstComputable(condition)) {
-        return combinateAstNodes(astNode.p)
-            .map(function (p) { return ({
-            n: 'if',
-            t: astNode.t,
-            p: p,
-            token: astNode.token,
-        }); });
-    }
-    return __spreadArray(__spreadArray([], __read(calculatePossibleAstNodes(thenBranch)), false), __read(calculatePossibleAstNodes(elseBranch)), false);
-};
-
-var calculateLetOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    try {
-        // check bindings, if any binding value cannot be calculated, convert the whole let to a do-expression
-        if (!isAstComputable(astNode.bs.map(function (b) { return calculatePossibleAstNodes(b.v); })))
-            throw new Error('Could not calculate binding value');
-    }
-    catch (_b) {
-        var doNodes = combinateAstNodes(astNode.p)
-            .map(function (p) {
-            return {
-                n: 'do',
-                t: AstNodeType.SpecialExpression,
-                p: p,
-                token: astNode.token,
-            };
-        });
-        return doNodes;
-    }
-    var newIdentifiers = astNode.bs.map(function (bindingNode) { return bindingNode.n; });
-    var letNodes = combinate(astNode.bs.map(function (bindingNode) {
-        return calculatePossibleAstNodes(bindingNode.v)
-            .map(function (bindingValues) { return (__assign(__assign({}, bindingNode), { v: bindingValues })); });
-    }))
-        .flatMap(function (bindingNodes) { return combinate(astNode.p.map(function (p) { return calculatePossibleAstNodes(p, newIdentifiers); }))
-        .map(function (p) {
-        return {
-            n: 'let',
-            bs: bindingNodes,
-            t: AstNodeType.SpecialExpression,
-            p: p,
-            token: astNode.token,
-        };
-    }); });
-    return letNodes;
-};
-
-var calculateForOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes;
-    if (!isDeterministic(calculatePossibleAstNodes, astNode))
-        throw new Error('Could not calculate for loop, not deterministic');
-    return [astNode];
-};
-var calculateDoSeqOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes;
-    if (!isDeterministic(calculatePossibleAstNodes, astNode))
-        throw new Error('Could not calculate doSeq node, not deterministic');
-    return [astNode];
-};
-function isDeterministic(calculatePossibleAstNodes, astNode) {
-    var e_1, _a;
-    try {
-        for (var _b = __values(astNode.l), _c = _b.next(); !_c.done; _c = _b.next()) {
-            var _d = _c.value, b = _d.b, l = _d.l, wn = _d.wn, we = _d.we;
-            if (l && l.some(function (_a) {
-                var v = _a.v;
-                return !astIsDeterministic(calculatePossibleAstNodes, v);
-            }))
-                return false;
-            if (!astIsDeterministic(calculatePossibleAstNodes, b.v))
-                return false;
-            if (wn && !astIsDeterministic(calculatePossibleAstNodes, wn))
-                return false;
-            if (we && !astIsDeterministic(calculatePossibleAstNodes, we))
-                return false;
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
-    }
-    if (!astIsDeterministic(calculatePossibleAstNodes, astNode.p[0]))
-        return false;
-    return true;
-}
-function astIsDeterministic(calculatePossibleAstNodes, astNode) {
-    return calculatePossibleAstNodes(astNode).length === 1;
-}
-
-var calculateOrOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p)
-        .map(function (p) { return ({
-        n: 'or',
-        t: AstNodeType.SpecialExpression,
-        p: p,
-        token: astNode.token,
-    }); });
-};
-
-var calculateQqOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    if (!isAstComputable(astNode.p[0]))
-        throw new Error('First argument of ?? not computable');
-    return combinateAstNodes(astNode.p)
-        .map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-};
-
-var calculateThrowOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes;
-    return calculatePossibleAstNodes(astNode.p[0]).map(function (m) { return (__assign(__assign({}, astNode), { p: [m] })); });
-};
-
-var calculateTimeOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes;
-    return calculatePossibleAstNodes(astNode.p[0])
-        .map(function (p) { return (__assign(__assign({}, astNode), { n: 'do', p: [p] })); });
-};
-
-var calculateTryOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes;
-    var _b = calculatePossibleAstNodes(astNode.p[0]).reduce(function (acc, node) {
-        if (node.n === 'throw') {
-            acc.throws.push(node.p[0]);
-        }
-        else {
-            acc.vals.push(node);
-        }
-        return acc;
-    }, { vals: [], throws: [] }), vals = _b.vals, throws = _b.throws;
-    var catches = throws.flatMap(function (throwNode) {
-        var letNode = {
-            t: AstNodeType.SpecialExpression,
-            n: 'let',
-            bs: [{
-                    t: AstNodeType.Binding,
-                    n: astNode.e.v,
-                    v: throwNode,
-                    token: undefined,
-                    p: [],
-                }],
-            p: [astNode.ce],
-            token: undefined,
-        };
-        return calculatePossibleAstNodes(letNode);
-    });
-    return __spreadArray(__spreadArray([], __read(vals), false), __read(catches), false);
-};
-
-var calculateWhenFirstOutcomes = function (_a) {
-    var astNode = _a.astNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    var bindingNode = astNode.b;
-    if (!isAstComputable(bindingNode.v))
-        throw new Error('Could not calculate binding value');
-    var newIdentifier = bindingNode.n;
-    return calculatePossibleAstNodes(bindingNode.v)
-        .map(function (bindingValue) { return (__assign(__assign({}, bindingNode), { v: bindingValue })); })
-        .flatMap(function (b) {
-        return combinateAstNodes(astNode.p, [newIdentifier])
-            .map(function (p) { return (__assign(__assign({}, astNode), { b: b, p: p })); });
-    });
-};
-
-var calculateWhenLetOutcomes = function (_a) {
-    var astNode = _a.astNode, nilNode = _a.nilNode, calculatePossibleAstNodes = _a.calculatePossibleAstNodes, combinateAstNodes = _a.combinateAstNodes, isAstComputable = _a.isAstComputable;
-    var bindingNode = astNode.b;
-    if (!isAstComputable(bindingNode.v)) {
-        return __spreadArray(__spreadArray([], __read(combinateAstNodes(astNode.p)
-            .map(function (p) { return ({
-            n: 'do',
-            t: astNode.t,
-            p: p,
-            token: astNode.token,
-        }); })), false), [
-            nilNode,
-        ], false);
-    }
-    var newIdentifier = bindingNode.n;
-    return calculatePossibleAstNodes(bindingNode.v)
-        .map(function (bindingValue) { return (__assign(__assign({}, bindingNode), { v: bindingValue })); })
-        .flatMap(function (b) {
-        return combinateAstNodes(astNode.p, [newIdentifier])
-            .map(function (p) { return (__assign(__assign({}, astNode), { b: b, p: p })); });
-    });
-};
-
-var calculateWhenNotOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes, nilNode = _a.nilNode, isAstComputable = _a.isAstComputable;
-    var condition = astNode.p[0];
-    if (isAstComputable(condition)) {
-        return combinateAstNodes(astNode.p)
-            .map(function (p) { return ({
-            n: 'when-not',
-            t: astNode.t,
-            p: p,
-            token: astNode.token,
-        }); });
-    }
-    var body = astNode.p.slice(1);
-    return __spreadArray(__spreadArray([], __read(combinateAstNodes(body)
-        .map(function (p) { return ({
-        n: 'do',
-        t: astNode.t,
-        p: p,
-        token: astNode.token,
-    }); })), false), [
-        nilNode,
-    ], false);
-};
-
-var calculateWhenOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes, nilNode = _a.nilNode, isAstComputable = _a.isAstComputable;
-    var condition = astNode.p[0];
-    if (isAstComputable(condition)) {
-        return combinateAstNodes(astNode.p)
-            .map(function (p) { return ({
-            n: 'when',
-            t: astNode.t,
-            p: p,
-            token: astNode.token,
-        }); });
-    }
-    var body = astNode.p.slice(1);
-    return __spreadArray(__spreadArray([], __read(combinateAstNodes(body)
-        .map(function (p) { return ({
-        n: 'do',
-        t: astNode.t,
-        p: p,
-        token: astNode.token,
-    }); })), false), [
-        nilNode,
-    ], false);
-};
-
-var calculateRecurOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p)
-        .map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-};
-
-var calculateCommentOutcomes = function (_a) {
-    var nilNode = _a.nilNode;
-    return [nilNode];
-};
-
-var calculateLoopOutcomes = function (_a) {
-    var astNode = _a.astNode, combinateAstNodes = _a.combinateAstNodes;
-    return combinateAstNodes(astNode.p, astNode.bs.map(function (bindingNode) { return bindingNode.n; }))
-        .map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-};
-
-var specialExpressionCalculator = {
-    'and': function (astNode, helperOptions) { return calculateAndOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'comment': function (astNode, helperOptions) { return calculateCommentOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'cond': function (astNode, helperOptions) { return calculateCondOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'declared?': function (astNode, helperOptions) { return calculateDeclaredOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'defn': function (astNode, helperOptions) { return calculateDefnOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'def': function (astNode, helperOptions) { return calculateDefOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'defns': function (astNode, helperOptions) { return calculateDefnsOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'defs': function (astNode, helperOptions) { return calculateDefsOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'do': function (astNode, helperOptions) { return calculateDoOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'doseq': function (astNode, helperOptions) { return calculateDoSeqOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'fn': function (astNode, helperOptions) { return calculateFnOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'for': function (astNode, helperOptions) { return calculateForOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'if-let': function (astNode, helperOptions) { return calculateIfLetOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'if': function (astNode, helperOptions) { return calculateIfOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'if-not': function (astNode, helperOptions) { return calculateIfNotOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'let': function (astNode, helperOptions) { return calculateLetOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'loop': function (astNode, helperOptions) { return calculateLoopOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'or': function (astNode, helperOptions) { return calculateOrOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    '??': function (astNode, helperOptions) { return calculateQqOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'recur': function (astNode, helperOptions) { return calculateRecurOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'time!': function (astNode, helperOptions) { return calculateTimeOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'throw': function (astNode, helperOptions) { return calculateThrowOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'try': function (astNode, helperOptions) { return calculateTryOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'when-first': function (astNode, helperOptions) { return calculateWhenFirstOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'when-let': function (astNode, helperOptions) { return calculateWhenLetOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'when': function (astNode, helperOptions) { return calculateWhenOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-    'when-not': function (astNode, helperOptions) { return calculateWhenNotOutcomes(__assign({ astNode: astNode }, helperOptions)); },
-};
-
-function isIdempotent(normalExpressionName) {
-    return !normalExpressionName.endsWith('!')
-        || normalExpressionName === 'write!';
-}
-function calculateOutcomes(contextStack, astNodes) {
-    // First, we try to calculate outcomes for the whole astNodes array.
-    // If that fails, we try to calculate outcomes for the array without the first element.
-    // If that fails, we try to calculate outcomes for the array without the first two elements.
-    // And so on.
-    // This makes it possible to calculate outcomes for e.g.
-    // (write! x) x
-    // Problems occur for e.g.
-    // (def x 1) (write! x) x
-    // This should output [1], but since (write! x) fails to calculate outcomes, we get null.
-    // Ok, but not optimal
-    // The contract is that when an array is returned, it must be correct.
-    // But returning null (indicating that the calculation failed) is always a way out.
-    for (var i = 0; i < astNodes.length; i++) {
-        var usingAstNode = astNodes.slice(i);
-        var outcomes = calculateOutcomesInner(contextStack, usingAstNode);
-        if (outcomes !== null)
-            return outcomes;
-    }
-    return null;
-}
-function calculateOutcomesInner(contextStack, astNodes) {
-    var e_1, _a;
-    var possibleAsts = calculatePossibleAsts(contextStack.clone(), astNodes);
-    if (possibleAsts === null)
-        return null;
-    var outcomes = [];
-    try {
-        for (var possibleAsts_1 = __values(possibleAsts), possibleAsts_1_1 = possibleAsts_1.next(); !possibleAsts_1_1.done; possibleAsts_1_1 = possibleAsts_1.next()) {
-            var possibleAst = possibleAsts_1_1.value;
-            var unresolvedIdentifiers = findUnresolvedIdentifiers(possibleAst, contextStack.clone(), builtin);
-            if (unresolvedIdentifiers.size !== 0)
-                return null;
-            var ast = {
-                b: possibleAst,
-                hasDebugData: true,
-            };
-            try {
-                outcomes.push(evaluate(ast, contextStack.clone()));
-            }
-            catch (e) {
-                outcomes.push(e);
-            }
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (possibleAsts_1_1 && !possibleAsts_1_1.done && (_a = possibleAsts_1.return)) _a.call(possibleAsts_1);
-        }
-        finally { if (e_1) throw e_1.error; }
-    }
-    return outcomes;
-}
-function calculatePossibleAsts(contextStack, astNodes) {
-    var possibleAsts;
-    try {
-        possibleAsts = combinate(astNodes.map(function (astNode) { return calculatePossibleAstNodes(contextStack, astNode); }));
-    }
-    catch (e) {
-        return null;
-    }
-    return possibleAsts;
-}
-var nilNode = { t: AstNodeType.ReservedSymbol, v: 'nil', token: undefined, p: [], n: undefined };
-function calculatePossibleAstNodes(contextStack, astNode, newIndentifiers) {
-    var newContext = newIndentifiers
-        ? newIndentifiers.reduce(function (acc, identity) {
-            acc[identity] = { value: null };
-            return acc;
-        }, {})
-        : undefined;
-    var newContextStack = newContext ? contextStack.create(newContext) : contextStack;
-    if (astNode.t === AstNodeType.NormalExpression) {
-        if (astNode.n && !isIdempotent(astNode.n))
-            throw new Error("NormalExpressionNode with name ".concat(astNode.n, " is not idempotent. Cannot calculate possible ASTs."));
-        return combinate(astNode.p.map(function (n) { return calculatePossibleAstNodes(newContextStack, n); }))
-            .map(function (p) { return (__assign(__assign({}, astNode), { p: p })); });
-    }
-    else if (astNode.t === AstNodeType.SpecialExpression) {
-        var helperOptions = {
-            nilNode: nilNode,
-            calculatePossibleAstNodes: function (node, identifiers) { return calculatePossibleAstNodes(newContextStack.clone(), node, identifiers); },
-            combinateAstNodes: function (nodes, identifiers) {
-                return combinate(nodes.map(function (node) { return calculatePossibleAstNodes(newContextStack.clone(), node, identifiers); }));
-            },
-            isAstComputable: function (node) {
-                return calculateOutcomesInner(newContextStack, Array.isArray(node) ? node.flat() : [node]) !== null;
-            },
-            addGlobalIdentifier: function (name) { return newContextStack.globalContext[name] = { value: null }; },
-        };
-        // eslint-disable-next-line ts/no-unsafe-argument
-        return specialExpressionCalculator[astNode.n](astNode, helperOptions);
-    }
-    return [astNode];
-}
-
 function analyze(ast, params) {
     return {
         unresolvedIdentifiers: findUnresolvedIdentifiers(ast, createContextStack(params), builtin),
-        outcomes: calculateOutcomes(createContextStack(params), ast.b),
     };
 }
 
@@ -7032,13 +6283,10 @@ function fromUnaryAlgebraicToAstNode(operator, operand) {
     var operatorName = operator[1];
     switch (operatorName) {
         case '+':
-            return createNamedNormalExpressionNode('+', [operand], token);
         case '-':
-            return createNamedNormalExpressionNode('-', [operand], token);
         case '!':
-            return createNamedNormalExpressionNode('not', [operand], token);
         case '~':
-            return createNamedNormalExpressionNode('bit-not', [operand], token);
+            return createNamedNormalExpressionNode(operatorName, [operand], token);
         /* v8 ignore next 2 */
         default:
             throw new Error("Unknown operator: ".concat(operatorName));
@@ -7051,64 +6299,31 @@ function fromBinaryOperatorToAstNode(operator, left, right, token) {
         case '.':
             return createAccessorNode(left, fromSymbolToStringNode(asSymbolNode(right, (_a = getTokenDebugData(token)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo)), token);
         case '**': // exponentiation
-            return createNamedNormalExpressionNode('pow', [left, right], token);
         case '*':
-            return createNamedNormalExpressionNode('*', [left, right], token);
         case '/':
-            return createNamedNormalExpressionNode('/', [left, right], token);
         case '%':
-            return createNamedNormalExpressionNode('rem', [left, right], token);
         case '+':
-            return createNamedNormalExpressionNode('+', [left, right], token);
         case '-':
-            return createNamedNormalExpressionNode('-', [left, right], token);
         case '<<':
-            return createNamedNormalExpressionNode('bit-shift-left', [left, right], token);
         case '>>':
-            return createNamedNormalExpressionNode('bit-shift-right', [left, right], token);
         case '>>>':
-            return createNamedNormalExpressionNode('unsigned-bit-shift-right', [left, right], token);
-        case '++': {
-            var leftString = createNamedNormalExpressionNode('str', [left], token);
-            var rightString = createNamedNormalExpressionNode('str', [right], token);
-            return createNamedNormalExpressionNode('str', [leftString, rightString], token);
-        }
+        case '++':
         case '<':
-            return createNamedNormalExpressionNode('<', [left, right], token);
         case '<=':
-            return createNamedNormalExpressionNode('<=', [left, right], token);
         case '>':
-            return createNamedNormalExpressionNode('>', [left, right], token);
         case '>=':
-            return createNamedNormalExpressionNode('>=', [left, right], token);
         case '==':
-            return createNamedNormalExpressionNode('=', [left, right], token);
         case '!=':
-            return createNamedNormalExpressionNode('!=', [left, right], token);
         case '&':
-            return createNamedNormalExpressionNode('bit-and', [left, right], token);
         case '^':
-            return createNamedNormalExpressionNode('bit-xor', [left, right], token);
         case '|':
-            return createNamedNormalExpressionNode('bit-or', [left, right], token);
+            return createNamedNormalExpressionNode(operatorName, [left, right], token);
         case '&&':
-            return {
-                t: AstNodeType.SpecialExpression,
-                n: 'and',
-                p: [left, right],
-                token: getTokenDebugData(token) && token,
-            };
         case '||':
-            return {
-                t: AstNodeType.SpecialExpression,
-                n: 'or',
-                p: [left, right],
-                token: getTokenDebugData(token) && token,
-            };
         case '??':
             return {
                 t: AstNodeType.SpecialExpression,
-                n: '??',
+                n: operatorName,
                 p: [left, right],
                 token: getTokenDebugData(token) && token,
             };
@@ -7148,19 +6363,43 @@ var AlgebraicParser = /** @class */ (function () {
         var _a;
         if (precedence === void 0) { precedence = 0; }
         var firstToken = this.peek();
-        if (isA_SymbolToken(firstToken) && firstToken[1] === 'def') {
-            return this.parseDef(firstToken);
-        }
-        if (isA_SymbolToken(firstToken) && firstToken[1] === 'defn') {
-            return this.parseDefn(firstToken);
+        var left;
+        if (isA_SymbolToken(firstToken)) {
+            switch (firstToken[1]) {
+                case 'def':
+                    return this.parseDef(firstToken);
+                case 'defn':
+                    return this.parseDefn(firstToken);
+                case 'let':
+                    return this.parseLet(firstToken);
+                case 'if':
+                case 'unless':
+                    left = this.parseIfOrUnless(firstToken);
+                    break;
+                case 'cond':
+                    left = this.parseCond(firstToken);
+                    break;
+                case 'switch':
+                    left = this.parseSwitch(firstToken);
+                    break;
+                case 'for':
+                case 'doseq':
+                    left = this.parseForOrDoseq(firstToken);
+                    break;
+                case 'do':
+                    left = this.parseDo(firstToken);
+                    break;
+                case 'loop':
+                    left = this.parseLoop(firstToken);
+                    break;
+                case 'try':
+                    left = this.parseTry(firstToken);
+                    break;
+            }
         }
-        var left = this.parseOperand();
+        left || (left = this.parseOperand());
         var operator = this.peek();
-        while (!this.isAtEnd()
-            && !isA_OperatorToken(operator, ',')
-            && !isA_OperatorToken(operator, ';')
-            && !isRBracketToken(operator)
-            && !isRParenToken(operator)) {
+        while (!this.isAtExpressionEnd()) {
             if (isA_BinaryOperatorToken(operator)) {
                 var name_1 = operator[1];
                 var newPrecedece = getPrecedence(name_1);
@@ -7391,9 +6630,6 @@ var AlgebraicParser = /** @class */ (function () {
         var _a, _b;
         var isNamedFunction = symbol.t === AstNodeType.Symbol;
         this.advance();
-        if (isNamedFunction && symbol.v === 'for') {
-            return this.parseFor(symbol);
-        }
         var params = [];
         while (!this.isAtEnd() && !isRParenToken(this.peek())) {
             params.push(this.parseExpression());
@@ -7414,17 +6650,11 @@ var AlgebraicParser = /** @class */ (function () {
                 var name_2 = symbol.v;
                 switch (name_2) {
                     case '??':
-                    case 'and':
+                    case '&&':
                     case 'comment':
-                    case 'cond':
-                    case 'declared?':
-                    case 'if':
-                    case 'if-not':
-                    case 'or':
-                    case 'when':
-                    case 'when-not':
-                    case 'do':
-                    case 'time!':
+                    case 'defined?':
+                    case '||':
+                    case 'recur':
                     case 'throw': {
                         var node = {
                             t: AstNodeType.SpecialExpression,
@@ -7435,17 +6665,10 @@ var AlgebraicParser = /** @class */ (function () {
                         builtin.specialExpressions[node.n].validateParameterCount(node);
                         return node;
                     }
-                    case 'let':
-                        return this.parseLet(symbol, params);
                     case 'defs':
-                    case 'if-let':
-                    case 'when-let':
-                    case 'when-first':
                     case 'fn':
                     case 'defns':
                     case 'try':
-                    case 'recur':
-                    case 'loop':
                     case 'doseq':
                         throw new Error("Special expression ".concat(name_2, " is not available in algebraic notation"));
                     default:
@@ -7582,93 +6805,200 @@ var AlgebraicParser = /** @class */ (function () {
                 }
             }
         }
-        var mandatoryArguments = [];
-        for (var i = 1; i <= arity; i += 1) {
-            if (i === 1 && percent1 === 'NAKED')
-                mandatoryArguments.push('$');
-            else
-                mandatoryArguments.push("$".concat(i));
+        var mandatoryArguments = [];
+        for (var i = 1; i <= arity; i += 1) {
+            if (i === 1 && percent1 === 'NAKED')
+                mandatoryArguments.push('$');
+            else
+                mandatoryArguments.push("$".concat(i));
+        }
+        var args = {
+            b: [],
+            m: mandatoryArguments,
+        };
+        var node = {
+            t: AstNodeType.SpecialExpression,
+            n: 'fn',
+            p: [],
+            o: [
+                {
+                    as: args,
+                    b: [exprNode],
+                    a: args.m.length,
+                },
+            ],
+            token: getTokenDebugData(firstToken) && firstToken,
+        };
+        return node;
+    };
+    AlgebraicParser.prototype.parseLet = function (token) {
+        this.advance();
+        var letSymbol = parseSymbol(this.tokenStream, this.parseState);
+        assertA_OperatorToken(this.peek(), '=');
+        this.advance();
+        var value = this.parseExpression();
+        return {
+            t: AstNodeType.SpecialExpression,
+            n: 'let',
+            p: [],
+            token: getTokenDebugData(letSymbol.token) && letSymbol.token,
+            bs: [{
+                    t: AstNodeType.Binding,
+                    n: letSymbol.v,
+                    v: value,
+                    p: [],
+                    token: getTokenDebugData(token) && token,
+                }],
+        };
+    };
+    AlgebraicParser.prototype.parseDo = function (token) {
+        this.advance();
+        var expressions = [];
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            expressions.push(this.parseExpression());
+            if (isA_OperatorToken(this.peek(), ';')) {
+                this.advance();
+            }
+        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        return {
+            t: AstNodeType.SpecialExpression,
+            n: 'do',
+            p: expressions,
+            token: getTokenDebugData(token) && token,
+        };
+    };
+    AlgebraicParser.prototype.parseLoop = function (token) {
+        var _a;
+        this.advance();
+        assertLParenToken(this.peek());
+        this.advance();
+        var bindingNodes = [];
+        while (!this.isAtEnd() && !isRParenToken(this.peek())) {
+            var symbol = parseSymbol(this.tokenStream, this.parseState);
+            assertA_OperatorToken(this.peek(), '=');
+            this.advance();
+            var value = this.parseExpression();
+            bindingNodes.push({
+                t: AstNodeType.Binding,
+                n: symbol.v,
+                v: value,
+                p: [],
+                token: getTokenDebugData(symbol.token) && symbol.token,
+            });
+            if (isA_OperatorToken(this.peek(), ',')) {
+                this.advance();
+            }
+        }
+        if (bindingNodes.length === 0) {
+            throw new LitsError('Expected binding', (_a = getTokenDebugData(this.peek())) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
         }
-        var args = {
-            b: [],
-            m: mandatoryArguments,
-        };
-        var node = {
+        assertRParenToken(this.peek());
+        this.advance();
+        var params = [];
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            params.push(this.parseExpression());
+            if (isA_OperatorToken(this.peek(), ';')) {
+                this.advance();
+            }
+        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        return {
             t: AstNodeType.SpecialExpression,
-            n: 'fn',
-            p: [],
-            o: [
-                {
-                    as: args,
-                    b: [exprNode],
-                    a: args.m.length,
-                },
-            ],
-            token: getTokenDebugData(firstToken) && firstToken,
+            n: 'loop',
+            p: params,
+            bs: bindingNodes,
+            token: getTokenDebugData(token) && token,
         };
-        return node;
     };
-    AlgebraicParser.prototype.parseLet = function (letSymbol, params) {
-        var _a, _b;
-        if (params.length !== 2) {
-            throw new LitsError('let expects two arguments', (_a = getTokenDebugData(letSymbol.token)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
+    AlgebraicParser.prototype.parseTry = function (token) {
+        this.advance();
+        var tryExpressions = [];
+        while (!this.isAtEnd() && !isA_SymbolToken(this.peek(), 'catch')) {
+            tryExpressions.push(this.parseExpression());
+            if (isA_OperatorToken(this.peek(), ';')) {
+                this.advance();
+            }
+        }
+        var tryExpression = tryExpressions.length === 1
+            ? tryExpressions[0]
+            : {
+                t: AstNodeType.SpecialExpression,
+                n: 'do',
+                p: tryExpressions,
+                token: getTokenDebugData(token) && token,
+            };
+        assertA_SymbolToken(this.peek(), 'catch');
+        this.advance();
+        var errorSymbol;
+        if (isLParenToken(this.peek())) {
+            this.advance();
+            errorSymbol = parseSymbol(this.tokenStream, this.parseState);
+            assertRParenToken(this.peek());
+            this.advance();
         }
-        var letObject = params[0];
-        if (letObject.t !== AstNodeType.NormalExpression || letObject.n !== 'object') {
-            throw new LitsError('let expects an object as first argument', (_b = getTokenDebugData(letObject.token)) === null || _b === void 0 ? void 0 : _b.sourceCodeInfo);
+        var catchExpressions = [];
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            catchExpressions.push(this.parseExpression());
+            if (isA_OperatorToken(this.peek(), ';')) {
+                this.advance();
+            }
         }
-        var letBindings = arrayToPairs(letObject.p);
-        var expression = params[1];
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        var catchExpression = catchExpressions.length === 1
+            ? catchExpressions[0]
+            : {
+                t: AstNodeType.SpecialExpression,
+                n: 'do',
+                p: catchExpressions,
+                token: getTokenDebugData(token) && token,
+            };
         return {
             t: AstNodeType.SpecialExpression,
-            n: 'let',
-            p: [expression],
-            token: getTokenDebugData(letSymbol.token) && letSymbol.token,
-            bs: letBindings.map(function (pair) {
-                var key = pair[0];
-                var value = pair[1];
-                return {
-                    t: AstNodeType.Binding,
-                    n: key.v,
-                    v: value,
-                    p: [],
-                    token: getTokenDebugData(key.token) && key.token,
-                };
-            }),
+            n: 'try',
+            p: [tryExpression],
+            ce: catchExpression,
+            e: errorSymbol,
+            token: getTokenDebugData(token) && token,
         };
     };
-    AlgebraicParser.prototype.parseFor = function (forSymbol) {
+    AlgebraicParser.prototype.parseForOrDoseq = function (token) {
+        var isDoseq = token[1] === 'doseq';
+        this.advance();
+        assertLParenToken(this.peek());
+        this.advance();
         var forLoopBindings = [
             this.parseForLoopBinding(),
         ];
-        var nextToken = this.peekAhead();
-        while (isA_SymbolToken(nextToken) && nextToken[1] === 'of') {
+        while (!this.isAtEnd() && !isRParenToken(this.peek())) {
             forLoopBindings.push(this.parseForLoopBinding());
-            nextToken = this.peekAhead();
+            if (isA_OperatorToken(this.peek(), ',')) {
+                this.advance();
+            }
         }
-        var expression = this.parseExpression();
         assertRParenToken(this.peek());
         this.advance();
+        var expression = this.parseExpression();
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
         return {
             t: AstNodeType.SpecialExpression,
-            n: 'for',
+            n: isDoseq ? 'doseq' : 'for',
             p: [expression],
-            token: getTokenDebugData(forSymbol.token) && forSymbol.token,
+            token: getTokenDebugData(token) && token,
             l: forLoopBindings,
         };
     };
-    // export interface LoopBindingNode {
-    //   b: BindingNode // Binding
-    //   m: Array<'&let' | '&when' | '&while'> // Modifiers
-    //   l?: BindingNode[] // Let-Bindings
-    //   wn?: AstNode // When Node
-    //   we?: AstNode // While Node
-    // }
     AlgebraicParser.prototype.parseForLoopBinding = function () {
         var _a;
         var bindingNode = this.parseBinding();
-        if (isA_OperatorToken(this.peek(), ',')) {
-            this.advance();
+        if (isRParenToken(this.peek()) || isA_OperatorToken(this.peek(), ',')) {
+            if (isA_OperatorToken(this.peek(), ',')) {
+                this.advance();
+            }
             return {
                 b: bindingNode,
                 m: [],
@@ -7676,33 +7006,26 @@ var AlgebraicParser = /** @class */ (function () {
         }
         var modifiers = [];
         var token = this.peek();
-        if (!isA_SymbolToken(token)) {
+        if (!isA_SymbolToken(token, 'let')
+            && !isA_ReservedSymbolToken(token, 'when')
+            && !isA_ReservedSymbolToken(token, 'while')) {
             throw new LitsError('Expected symbol let, when or while', (_a = getTokenDebugData(token)) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
         }
         var letBindings;
         if (token[1] === 'let') {
             modifiers.push('&let');
             letBindings = [];
-            this.advance();
-            var letObject = this.parseObject();
-            letBindings = arrayToPairs(letObject.p).map(function (pair) {
-                var key = pair[0];
-                var value = pair[1];
-                return {
-                    t: AstNodeType.Binding,
-                    n: key.v,
-                    v: value,
-                    p: [],
-                    token: getTokenDebugData(key.token) && key.token,
-                };
-            });
+            while (isA_SymbolToken(token, 'let')) {
+                var letNode = this.parseLet(token);
+                letBindings.push(letNode.bs[0]);
+                token = this.peek();
+            }
         }
         token = this.peek();
         var whenNode;
         var whileNode;
-        while (isA_SymbolToken(token)
-            && ((token[1] === 'when' && !modifiers.includes('&when'))
-                || (token[1] === 'while' && !modifiers.includes('&while')))) {
+        while (isA_ReservedSymbolToken(token, 'when')
+            || isA_ReservedSymbolToken(token, 'while')) {
             this.advance();
             if (token[1] === 'when') {
                 modifiers.push('&when');
@@ -7714,8 +7037,9 @@ var AlgebraicParser = /** @class */ (function () {
             }
             token = this.peek();
         }
-        assertA_OperatorToken(token, ',');
-        this.advance();
+        if (isA_OperatorToken(token, ',')) {
+            this.advance();
+        }
         return {
             b: bindingNode,
             m: modifiers,
@@ -7744,6 +7068,141 @@ var AlgebraicParser = /** @class */ (function () {
         };
         return node;
     };
+    AlgebraicParser.prototype.parseIfOrUnless = function (token) {
+        var isUnless = token[1] === 'unless';
+        this.advance();
+        var condition = this.parseExpression();
+        assertA_ReservedSymbolToken(this.peek(), 'then');
+        this.advance();
+        var thenExpressions = [];
+        while (!this.isAtEnd()
+            && !isA_ReservedSymbolToken(this.peek(), 'else')
+            && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            thenExpressions.push(this.parseExpression());
+            if (isA_OperatorToken(this.peek(), ';')) {
+                this.advance();
+            }
+        }
+        var thenExpression = thenExpressions.length === 1
+            ? thenExpressions[0]
+            : {
+                t: AstNodeType.SpecialExpression,
+                n: 'do',
+                p: thenExpressions,
+                token: getTokenDebugData(token) && token,
+            };
+        var elseExpression;
+        if (isA_ReservedSymbolToken(this.peek(), 'else')) {
+            this.advance();
+            var elseExpressions = [];
+            while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+                elseExpressions.push(this.parseExpression());
+                if (isA_OperatorToken(this.peek(), ';')) {
+                    this.advance();
+                }
+            }
+            elseExpression = elseExpressions.length === 1
+                ? elseExpressions[0]
+                : {
+                    t: AstNodeType.SpecialExpression,
+                    n: 'do',
+                    p: elseExpressions,
+                    token: getTokenDebugData(token) && token,
+                };
+        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        var params = [condition, thenExpression];
+        if (elseExpression) {
+            params.push(elseExpression);
+        }
+        return {
+            t: AstNodeType.SpecialExpression,
+            n: isUnless ? 'unless' : 'if',
+            p: params,
+            token: getTokenDebugData(token) && token,
+        };
+    };
+    AlgebraicParser.prototype.parseCond = function (token) {
+        this.advance();
+        var params = [];
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            assertA_ReservedSymbolToken(this.peek(), 'case');
+            this.advance();
+            params.push(this.parseExpression());
+            assertA_ReservedSymbolToken(this.peek(), 'then');
+            this.advance();
+            var expressions = [];
+            while (!this.isAtEnd()
+                && !isA_ReservedSymbolToken(this.peek(), 'case')
+                && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+                expressions.push(this.parseExpression());
+                if (isA_OperatorToken(this.peek(), ';')) {
+                    this.advance();
+                }
+            }
+            params.push(expressions.length === 1
+                ? expressions[0]
+                : {
+                    t: AstNodeType.SpecialExpression,
+                    n: 'do',
+                    p: expressions,
+                    token: getTokenDebugData(token) && token,
+                });
+            if (isA_ReservedSymbolToken(this.peek(), 'end')) {
+                break;
+            }
+            assertA_ReservedSymbolToken(this.peek(), 'case');
+        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        return {
+            t: AstNodeType.SpecialExpression,
+            n: 'cond',
+            p: params,
+            token: getTokenDebugData(token) && token,
+        };
+    };
+    AlgebraicParser.prototype.parseSwitch = function (token) {
+        this.advance();
+        var params = [this.parseExpression()];
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+            assertA_ReservedSymbolToken(this.peek(), 'case');
+            this.advance();
+            params.push(this.parseExpression());
+            assertA_ReservedSymbolToken(this.peek(), 'then');
+            this.advance();
+            var expressions = [];
+            while (!this.isAtEnd()
+                && !isA_ReservedSymbolToken(this.peek(), 'case')
+                && !isA_ReservedSymbolToken(this.peek(), 'end')) {
+                expressions.push(this.parseExpression());
+                if (isA_OperatorToken(this.peek(), ';')) {
+                    this.advance();
+                }
+            }
+            params.push(expressions.length === 1
+                ? expressions[0]
+                : {
+                    t: AstNodeType.SpecialExpression,
+                    n: 'do',
+                    p: expressions,
+                    token: getTokenDebugData(token) && token,
+                });
+            if (isA_ReservedSymbolToken(this.peek(), 'end')) {
+                break;
+            }
+            assertA_ReservedSymbolToken(this.peek(), 'case');
+        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
+        this.advance();
+        return {
+            t: AstNodeType.SpecialExpression,
+            n: 'switch',
+            p: params,
+            token: getTokenDebugData(token) && token,
+        };
+    };
     AlgebraicParser.prototype.parseDef = function (token) {
         this.advance();
         var symbol = parseSymbol(this.tokenStream, this.parseState);
@@ -7758,22 +7217,17 @@ var AlgebraicParser = /** @class */ (function () {
         };
     };
     AlgebraicParser.prototype.parseDefn = function (token) {
-        var _a;
         this.advance();
         var symbol = parseSymbol(this.tokenStream, this.parseState);
-        var _b = this.parseFunctionArguments(), functionArguments = _b.functionArguments, arity = _b.arity;
-        assertLBraceToken(this.peek());
-        this.advance();
+        var _a = this.parseFunctionArguments(), functionArguments = _a.functionArguments, arity = _a.arity;
         var body = [];
-        while (!this.isAtEnd() && !isRBraceToken(this.peek())) {
+        while (!this.isAtEnd() && !isA_ReservedSymbolToken(this.peek(), 'end')) {
             body.push(this.parseExpression());
             if (isA_OperatorToken(this.peek(), ';')) {
                 this.advance();
             }
         }
-        if (!isRBraceToken(this.peek())) {
-            throw new LitsError('Expected closing brace', (_a = getTokenDebugData(this.peek())) === null || _a === void 0 ? void 0 : _a.sourceCodeInfo);
-        }
+        assertA_ReservedSymbolToken(this.peek(), 'end');
         this.advance();
         return {
             t: AstNodeType.SpecialExpression,
@@ -7791,12 +7245,25 @@ var AlgebraicParser = /** @class */ (function () {
     AlgebraicParser.prototype.isAtEnd = function () {
         return this.parseState.position >= this.tokenStream.tokens.length;
     };
+    AlgebraicParser.prototype.isAtExpressionEnd = function () {
+        if (this.isAtEnd()) {
+            return true;
+        }
+        var token = this.peek();
+        if (isA_OperatorToken(token)) {
+            return [';', ','].includes(token[1]);
+        }
+        if (isA_SymbolToken(token)) {
+            return ['catch'].includes(token[1]);
+        }
+        if (isA_ReservedSymbolToken(token)) {
+            return ['else', 'when', 'while', 'then', 'end', 'case'].includes(token[1]);
+        }
+        return false;
+    };
     AlgebraicParser.prototype.peek = function () {
         return this.tokenStream.tokens[this.parseState.position];
     };
-    AlgebraicParser.prototype.peekAhead = function () {
-        return this.tokenStream.tokens[this.parseState.position + 1];
-    };
     return AlgebraicParser;
 }());
 
@@ -8169,7 +7636,7 @@ function parseToken(tokenStream, parseState) {
     return parsePolishToken(tokenStream, parseState);
 }
 
-var polishIdentifierCharacterClass = '[\\w@%^?=!$<>+*/:-]';
+var polishIdentifierCharacterClass = '[\\w@%^?=!$<>+*/:&\|~-]';
 var algebraicIdentifierCharacterClass = '[\\w$:!?]';
 var algebraicIdentifierFirstCharacterClass = '[a-zA-Z_$]';
 
@@ -8249,22 +7716,23 @@ var commonTokenizers = [
     tokenizeString,
 ];
 
-var algebraicReservedNamesRecord = {
-    'true': { value: true },
-    'false': { value: false },
-    'nil': { value: null },
-    'null': { value: null },
-    'if-let': { value: null, forbidden: true },
-    'when-let': { value: null, forbidden: true },
-    'when-first': { value: null, forbidden: true },
-    'fn': { value: null, forbidden: true },
-    'defns': { value: null, forbidden: true },
-    'try': { value: null, forbidden: true },
-    'recur': { value: null, forbidden: true },
-    'loop': { value: null, forbidden: true },
-    'time!': { value: null, forbidden: true },
-    'doseq': { value: null, forbidden: true },
+var validAlgebraicReservedNamesRecord = {
+    true: { value: true, forbidden: false },
+    false: { value: false, forbidden: false },
+    nil: { value: null, forbidden: false },
+    null: { value: null, forbidden: false },
+    then: { value: null, forbidden: false },
+    else: { value: null, forbidden: false },
+    end: { value: null, forbidden: false },
+    case: { value: null, forbidden: false },
+    when: { value: null, forbidden: false },
+    while: { value: null, forbidden: false },
 };
+var forbiddenAlgebraicReservedNamesRecord = {
+    fn: { value: null, forbidden: true },
+    defns: { value: null, forbidden: true },
+};
+var algebraicReservedNamesRecord = __assign(__assign({}, validAlgebraicReservedNamesRecord), forbiddenAlgebraicReservedNamesRecord);
 
 var identifierRegExp = new RegExp(algebraicIdentifierCharacterClass);
 var identifierFirstCharacterRegExp = new RegExp(algebraicIdentifierFirstCharacterClass);
@@ -8336,45 +7804,19 @@ var tokenizeA_BasePrefixedNumber = function (input, position) {
     }
     return [length, ['A_BasePrefixedNumber', input.substring(position, i)]];
 };
-var tokenizeA_ReservedSymbolToken = function (input, position) {
-    var e_1, _a;
-    try {
-        for (var _b = __values(Object.entries(algebraicReservedNamesRecord)), _c = _b.next(); !_c.done; _c = _b.next()) {
-            var _d = __read(_c.value, 2), reservedName = _d[0], forbidden = _d[1].forbidden;
-            var length_1 = reservedName.length;
-            var nextChar = input[position + length_1];
-            if (nextChar && identifierRegExp.test(nextChar))
-                continue;
-            var name_1 = input.substring(position, position + length_1);
-            if (name_1 === reservedName) {
-                if (forbidden)
-                    throw new LitsError("".concat(name_1, " is forbidden!"), undefined);
-                return [length_1, ['A_ReservedSymbol', reservedName]];
-            }
-        }
-    }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
-    }
-    return NO_MATCH;
-};
 var tokenizeA_Symbol = function (input, position) {
     var value = input[position];
     if (!value) {
         return NO_MATCH;
     }
     if (value === '\'') {
-        var length_2 = 1;
-        var char = input[position + length_2];
+        var length_1 = 1;
+        var char = input[position + length_1];
         var escaping = false;
         while (char !== '\'' || escaping) {
             if (char === undefined)
                 throw new LitsError("Unclosed string at position ".concat(position, "."), undefined);
-            length_2 += 1;
+            length_1 += 1;
             if (escaping) {
                 escaping = false;
                 value += char;
@@ -8385,10 +7827,10 @@ var tokenizeA_Symbol = function (input, position) {
                 }
                 value += char;
             }
-            char = input[position + length_2];
+            char = input[position + length_1];
         }
         value += '\''; // closing quote
-        return [length_2 + 1, ['A_Symbol', value]];
+        return [length_1 + 1, ['A_Symbol', value]];
     }
     if (identifierFirstCharacterRegExp.test(value)) {
         var initialPosition = position;
@@ -8403,6 +7845,22 @@ var tokenizeA_Symbol = function (input, position) {
     }
     return NO_MATCH;
 };
+var tokenizeA_ReservedSymbolToken = function (input, position) {
+    var symbolMeta = tokenizeA_Symbol(input, position);
+    if (symbolMeta[0] === 0 || !symbolMeta[1]) {
+        return NO_MATCH;
+    }
+    var symbolName = symbolMeta[1][1];
+    symbolName = symbolName.startsWith('\'') ? symbolName.slice(1, symbolName.length - 1) : symbolName;
+    var info = algebraicReservedNamesRecord[symbolName];
+    if (!info) {
+        return NO_MATCH;
+    }
+    if (info.forbidden) {
+        throw new LitsError("".concat(symbolName, " is forbidden!"), undefined);
+    }
+    return [symbolMeta[0], ['A_ReservedSymbol', symbolName]];
+};
 var tokenizeA_Operator = function (input, position) {
     var _a;
     var threeChars = input.slice(position, position + 3);
@@ -8421,30 +7879,30 @@ var tokenizeA_Operator = function (input, position) {
 };
 var tokenizeA_MultiLineComment = function (input, position) {
     if (input[position] === '/' && input[position + 1] === '*') {
-        var length_3 = 2;
+        var length_2 = 2;
         var value = '/*';
-        while (input[position + length_3] !== '*' && input[position + length_3 + 1] !== '/' && position + length_3 + 1 < input.length) {
-            value += input[position + length_3];
-            length_3 += 1;
+        while (input[position + length_2] !== '*' && input[position + length_2 + 1] !== '/' && position + length_2 + 1 < input.length) {
+            value += input[position + length_2];
+            length_2 += 1;
         }
-        if (position + length_3 + 1 >= input.length) {
+        if (position + length_2 + 1 >= input.length) {
             throw new LitsError('Comment not closed', undefined);
         }
         value += '*/';
-        length_3 += 2;
-        return [length_3, ['A_MultiLineComment', value]];
+        length_2 += 2;
+        return [length_2, ['A_MultiLineComment', value]];
     }
     return NO_MATCH;
 };
 var tokenizeA_SingleLineComment = function (input, position) {
     if (input[position] === '/' && input[position + 1] === '/') {
-        var length_4 = 2;
+        var length_3 = 2;
         var value = '//';
-        while (input[position + length_4] !== '\n' && position + length_4 < input.length) {
-            value += input[position + length_4];
-            length_4 += 1;
+        while (input[position + length_3] !== '\n' && position + length_3 < input.length) {
+            value += input[position + length_3];
+            length_3 += 1;
         }
-        return [length_4, ['A_SingleLineComment', value]];
+        return [length_3, ['A_SingleLineComment', value]];
     }
     return NO_MATCH;
 };
@@ -8604,31 +8062,20 @@ var tokenizeP_FnShorthand = function (input, position) {
     return [1, ['P_FnShorthand']];
 };
 var tokenizeP_ReservedSymbol = function (input, position) {
-    var e_1, _a;
-    try {
-        for (var _b = __values(Object.entries(polishReservedNamesRecord)), _c = _b.next(); !_c.done; _c = _b.next()) {
-            var _d = __read(_c.value, 2), reservedName = _d[0], forbidden = _d[1].forbidden;
-            var length_3 = reservedName.length;
-            var nextChar = input[position + length_3];
-            if (nextChar && P_symbolRegExp.test(nextChar)) {
-                continue;
-            }
-            var symbol = input.substring(position, position + length_3);
-            if (symbol === reservedName) {
-                if (forbidden)
-                    throw new LitsError("".concat(symbol, " is forbidden!"), undefined);
-                return [length_3, ['P_ReservedSymbol', reservedName]];
-            }
-        }
+    var symbolMeta = tokenizeP_Symbol(input, position);
+    if (symbolMeta[0] === 0 || !symbolMeta[1]) {
+        return NO_MATCH;
     }
-    catch (e_1_1) { e_1 = { error: e_1_1 }; }
-    finally {
-        try {
-            if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
-        }
-        finally { if (e_1) throw e_1.error; }
+    var symbolName = symbolMeta[1][1];
+    symbolName = symbolName.startsWith('\'') ? symbolName.slice(1, symbolName.length - 1) : symbolName;
+    var info = polishReservedNamesRecord[symbolName];
+    if (!info) {
+        return NO_MATCH;
     }
-    return NO_MATCH;
+    if (info.forbidden) {
+        throw new LitsError("".concat(symbolName, " is forbidden!"), undefined);
+    }
+    return [symbolMeta[0], ['P_ReservedSymbol', symbolName]];
 };
 var tokenizeP_StringShorthand = function (input, position) {
     if (input[position] !== ':')
@@ -8641,24 +8088,24 @@ var tokenizeP_StringShorthand = function (input, position) {
     return [symbolDescription[0] + 1, ['P_StringShorthand', ":".concat(symbolToken[1])]];
 };
 var tokenizeP_Modifier = function (input, position) {
-    var e_2, _a;
+    var e_1, _a;
     try {
         for (var modifierNames_1 = __values(modifierNames), modifierNames_1_1 = modifierNames_1.next(); !modifierNames_1_1.done; modifierNames_1_1 = modifierNames_1.next()) {
             var modifierName = modifierNames_1_1.value;
-            var length_4 = modifierName.length;
-            var charAfterModifier = input[position + length_4];
-            if (input.substring(position, position + length_4) === modifierName && (!charAfterModifier || !P_symbolRegExp.test(charAfterModifier))) {
+            var length_3 = modifierName.length;
+            var charAfterModifier = input[position + length_3];
+            if (input.substring(position, position + length_3) === modifierName && (!charAfterModifier || !P_symbolRegExp.test(charAfterModifier))) {
                 var value = modifierName;
-                return [length_4, ['P_Modifier', value]];
+                return [length_3, ['P_Modifier', value]];
             }
         }
     }
-    catch (e_2_1) { e_2 = { error: e_2_1 }; }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
     finally {
         try {
             if (modifierNames_1_1 && !modifierNames_1_1.done && (_a = modifierNames_1.return)) _a.call(modifierNames_1);
         }
-        finally { if (e_2) throw e_2.error; }
+        finally { if (e_1) throw e_1.error; }
     }
     return NO_MATCH;
 };
@@ -8695,8 +8142,8 @@ var polishTokenizers = __spreadArray(__spreadArray([
     tokenizeP_StringShorthand,
     tokenizeP_Number,
     tokenizeP_ReservedSymbol,
-    tokenizeP_Symbol,
     tokenizeP_Modifier,
+    tokenizeP_Symbol,
     tokenizeP_RegexpShorthand,
     tokenizeP_FnShorthand,
     tokenizeP_CollectionAccessor,