fez-lisp 1.2.62 → 1.3.0

package/src/utils.js

@@ -1,630 +1,832 @@
-import std from '../lib/baked/std.js'
-import { comp } from './compiler.js'
-import {
-  APPLY,
-  ATOM,
-  FALSE,
-  KEYWORDS,
-  SUGGAR,
-  TRUE,
-  TYPE,
-  VALUE,
-  WORD
-} from './keywords.js'
-import { evaluate, run } from './evaluator.js'
-import { AST, isLeaf, LISP } from './parser.js'
-export const logError = (error) =>
-  console.log('\x1b[31m', `\n${error}\n`, '\x1b[0m')
-export const logSuccess = (output) => console.log(output, '\x1b[0m')
-export const replaceStrings = (source) => {
-  // const quotes = source.match(/"(.*?)"/g)
-  const quotes = source.match(/"(?:.*?(\n|\r))*?.*?"/g)
-  // TODO handle escaping
-  if (quotes)
-    for (const q of quotes)
-      source = source.replaceAll(
-        q,
-        `(array ${[...q.replaceAll('\r', '')]
-          .slice(1, -1)
-          .map((x) => x.charCodeAt(0))
-          .join(' ')})`
-      )
-  return source
-}
-export const replaceQuotes = (source) =>
-  source
-    .replaceAll(/\'\(/g, '(array ')
-    .replaceAll(/\`\(/g, '(list ')
-    .replaceAll(/\(\)/g, '(array)')
-// export const replaceEmptyArrays = (source) =>
-//   source
-export const removeNoCode = (source) =>
-  source
-    .replace(/;.+/g, '')
-    .replace(/[\s\s]/g, ' ')
-    .trim()
-export const isBalancedParenthesis = (sourceCode) => {
-  let count = 0
-  const stack = []
-  const str = sourceCode.match(/[/\(|\)]/g) ?? []
-  for (let i = 0; i < str.length; ++i) {
-    const current = str[i]
-    if (current === '(') stack.push(current)
-    else if (current === ')') if (stack.pop() !== '(') ++count
-  }
-  return count - stack.length
-}
-export const escape = (Char) => {
-  switch (Char) {
-    case '\\':
-      return '\\'
-    case 'n':
-      return '\n'
-    case 'r':
-      return '\r'
-    case 't':
-      return '\t'
-    case 's':
-      return ' '
-    case '"':
-      return '"'
-    default:
-      return ''
-  }
-}
-export const stringifyArrayTypes = (type) =>
-  Array.isArray(type)
-    ? `(array${type.length ? ' ' : ''}${type
-        .map((x) => stringifyArrayTypes(x))
-        .join(' ')
-        .trim()})`
-    : 'number'
-export const stringifyType = (type) => {
-  if (!isLeaf(type)) {
-    const [car] = type
-    if (car == undefined) return '(array)'
-    else if (car[TYPE] === APPLY && car[VALUE] === KEYWORDS.ARRAY_TYPE)
-      return `(array ${type
-        .map((t) => stringifyType(t))
-        .join(' ')
-        .trim()})`
-    return type
-      .map((t) => stringifyType(t))
-      .join(' ')
-      .trim()
-  } else if (type[TYPE] === ATOM) return 'number'
-}
-export const stringifyArgs = (args) =>
-  args
-    .map((x) =>
-      !isLeaf(x)
-        ? `(${stringifyArgs(x)})`
-        : x[TYPE] === APPLY || x[TYPE] === WORD
-        ? x[VALUE]
-        : JSON.stringify(x[VALUE])
-            .replace(new RegExp(/\[/g), '(')
-            .replace(new RegExp(/\]/g), ')')
-            .replace(new RegExp(/\,/g), ' ')
-            .replace(new RegExp(/"/g), '')
-    )
-    .join(' ')
-export const isForbiddenVariableName = (name) => {
-  switch (name) {
-    case '_':
-    case KEYWORDS.DEFINE_VARIABLE:
-    case SUGGAR.RECURSION:
-    case SUGGAR.CACHE:
-      return true
-    default:
-      return !isNaN(name[0])
-  }
-}
-export const isEqual = (a, b) =>
-  +(
-    (Array.isArray(a) &&
-      a.length === b.length &&
-      !a.some((_, i) => !isEqual(a.at(i), b.at(i)))) ||
-    a === b ||
-    0
-  )
-export const isEqualTypes = (a, b) =>
-  (typeof a !== 'object' && typeof b !== 'object' && typeof a === typeof b) ||
-  (Array.isArray(a) &&
-    Array.isArray(b) &&
-    (!a.length ||
-      !b.length ||
-      !(a.length > b.length ? a : b).some(
-        (_, i, bigger) =>
-          !isEqualTypes(
-            bigger.at(i),
-            (a.length > b.length ? b : a).at(
-              i % (a.length > b.length ? b : a).length
-            )
-          )
-      ))) ||
-  false
-export const isPartialTypes = (a, b) =>
-  (typeof a !== 'object' && typeof b !== 'object' && typeof a === typeof b) ||
-  (Array.isArray(a) &&
-    Array.isArray(b) &&
-    (!a.length ||
-      !b.length ||
-      !(a.length < b.length ? a : b).some(
-        (_, i, smaller) =>
-          !isEqualTypes(
-            smaller.at(i),
-            (a.length < b.length ? b : a).at(
-              i % (a.length < b.length ? b : a).length
-            )
-          )
-      ))) ||
-  false
-export const handleUnbalancedParens = (source) => {
-  const diff = isBalancedParenthesis(removeNoCode(source))
-  if (diff !== 0)
-    throw new SyntaxError(
-      `Parenthesis are unbalanced by ${diff > 0 ? '+' : ''}${diff}`
-    )
-  return source
-}
-export const handleUnbalancedQuotes = (source) => {
-  const diff = (source.match(/\"/g) ?? []).length % 2
-  if (diff !== 0) throw new SyntaxError(`Quotes are unbalanced "`)
-  return source
-}
-export const removeMutation = (source) => source.replace(new RegExp(/!/g), 'ǃ')
-const isDefinition = (x) =>
-  x[TYPE] === APPLY && x[VALUE] === KEYWORDS.DEFINE_VARIABLE
-const toDeps = (libs) =>
-  libs.reduce(
-    (a, x, i) => a.set(x.at(1)[VALUE], { value: x, index: i }),
-    new Map()
-  )
-const deepShake = (tree, deps, visited = new Set(), ignored = new Set()) => {
-  const type = tree[TYPE]
-  const value = tree[VALUE]
-  if (!isLeaf(tree)) {
-    const [car, ...rest] = tree
-    if (car == undefined) return
-    if (isDefinition(car)) {
-      if (
-        !isLeaf(rest.at(-1)) &&
-        rest
-          .at(-1)
-          .some(
-            (x) => x[TYPE] === APPLY && x[VALUE] === KEYWORDS.ANONYMOUS_FUNCTION
-          )
-      ) {
-        const args = rest.at(-1).filter((x) => !isDefinition(x))
-        const body = args.pop()
-        // const params = new Set(args.map((x) => x[VALUE])
-        for (const arg of args) ignored.add(arg[VALUE])
-        deepShake(body, deps, visited, ignored)
-      } else rest.forEach((x) => deepShake(x, deps, visited, ignored))
-    } else tree.forEach((x) => deepShake(x, deps, visited, ignored))
-  } else if (
-    (type === APPLY || type === WORD) &&
-    deps.has(value) &&
-    !visited.has(value) &&
-    !ignored.has(value)
-  ) {
-    visited.add(value)
-    deepShake(deps.get(value).value, deps, visited, ignored)
-  }
-}
-const extractDeps = (visited, deps) =>
-  [...visited]
-    .map((x) => deps.get(x))
-    .sort((a, b) => a.index - b.index)
-    .map((x) => x.value)
-const toIgnore = (ast) =>
-  ast.filter(([x]) => isDefinition(x)).map(([_, x]) => x[VALUE])
-export const treeShake = (ast, libs) => {
-  const deps = toDeps(libs)
-  const visited = new Set()
-  const ignored = new Set(toIgnore(ast))
-  deepShake(ast, deps, visited, ignored)
-  return extractDeps(visited, deps)
-}
-export const shakedList = (ast, libs) => {
-  const deps = toDeps(libs)
-  const visited = new Set()
-  const ignored = new Set(toIgnore(ast))
-  deepShake(ast, deps, visited, ignored)
-  const out = []
-  for (const [key] of deps) if (visited.has(key)) out.push(key)
-  return out
-}
-export const dfs = (tree, callback) => {
-  if (!isLeaf(tree)) for (const leaf of tree) dfs(leaf)
-  else callback(tree)
-}
-export const interpret = (ast, keywords) =>
-  ast.reduce((_, x) => evaluate(x, keywords), 0)
-export const fez = (source, options = {}) => {
-  const env = Object.create(null)
-  try {
-    if (typeof source === 'string') {
-      source = replaceQuotes(replaceStrings(source))
-      const valid = handleUnbalancedQuotes(
-        handleUnbalancedParens(removeNoCode(source))
-      )
-      const code = !options.mutation ? removeMutation(valid) : valid
-      if (!code.length && options.throw) throw new Error('Nothing to parse!')
-      const parsed = deSuggar(LISP.parse(code))
-      const ast = [...treeShake(parsed, std), ...parsed]
-      // if (options.check) typeCheck(ast)
-      if (options.compile) return comp(ast)
-      return run(ast, env)
-    } else if (Array.isArray(source)) {
-      const ast = !options.mutation
-        ? AST.parse(AST.stringify(source).replace(new RegExp(/!/g), 'ǃ'))
-        : source
-      if (options.compile) return comp(ast)
-      return run(ast, env)
-    } else {
-      throw new Error('Source has to be either a lisp source code or an AST')
-    }
-  } catch (error) {
-    // console.log(error)
-    const err = error.message.replace("'[object Array]'", '(array)')
-    // .replace('object', '(array)')
-    logError(err)
-    if (options.throw) throw err
-    return err
-  }
-}
-export const compress = (source) => {
-  let { result, occurance } = source.split('').reduce(
-    (acc, item) => {
-      if (item === ')') acc.occurance++
-      else {
-        if (acc.occurance < 3) {
-          acc.result += ')'.repeat(acc.occurance)
-          acc.occurance = 0
-        } else {
-          acc.result += '·' + acc.occurance
-          acc.occurance = 0
-        }
-        acc.result += item
-      }
-      return acc
-    },
-    { result: '', occurance: 0 }
-  )
-  if (occurance > 0) result += '·' + occurance
-  return result
-}
-export const decompress = (raw) => {
-  const suffix = [...new Set(raw.match(/·+?\d+/g))]
-  const runes = suffix.reduce(
-    (acc, m) => acc.split(m).join(')'.repeat(parseInt(m.substring(1)))),
-    raw
-  )
-  let result = ''
-  for (const tok of runes) result += tok
-  return result
-}
-// shake(LISP.parse(removeNoCode(source)), std)
-export const shake = (parsed, std) => [...treeShake(parsed, std), ...parsed]
-export const tree = (source, std) =>
-  std
-    ? shake(
-        LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source)))),
-        std
-      )
-    : LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source))))
-export const minify = (source) =>
-  LISP.source(
-    deSuggar(LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source)))))
-  )
-export const prep = (source) =>
-  deSuggar(LISP.parse(removeNoCode(replaceQuotes(replaceStrings(source)))))
-export const src = (source, deps) => {
-  source = prep(source)
-  return LISP.source([
-    ...treeShake(
-      source,
-      deps.reduce((a, b) => a.concat(b), [])
-    ),
-    ...source
-  ])
-}
-export const ast = (source, deps) => {
-  source = prep(source)
-  return [
-    ...treeShake(
-      source,
-      deps.reduce((a, b) => a.concat(b), [])
-    ),
-    ...source
-  ]
-}
-export const astWithStd = (source) => {
-  const parsed = prep(source)
-  return [...treeShake(parsed, std), ...parsed]
-}
-export const dependencies = (source, deps) => {
-  source = prep(source)
-  return shakedList(
-    source,
-    deps.reduce((a, b) => a.concat(b), [])
-  )
-}
-export const js = (source, deps) => {
-  source = prep(source)
-  const { top, program } = comp([
-    ...treeShake(
-      source,
-      deps.reduce((a, b) => a.concat(b), [])
-    ),
-    ...source
-  ])
-  return `${top}${program}`
-}
-
-export const deSuggar = (ast) => {
-  if (ast.length === 0) throw new SyntaxError(`No expressions to evaluate`)
-  // for (const node of ast)
-  //   if (node[0] && node[0][TYPE] === APPLY && node[0][VALUE] === KEYWORDS.BLOCK)
-  //     throw new SyntaxError(`Top level (${KEYWORDS.BLOCK}) is not allowed`)
-  let prev = undefined
-  const evaluate = (exp) => {
-    const [first, ...rest] = isLeaf(exp) ? [exp] : exp
-    if (first != undefined) {
-      switch (first[TYPE]) {
-        case WORD:
-          {
-            switch (first[VALUE]) {
-              case SUGGAR.POWER:
-                throw new TypeError(
-                  `(${
-                    SUGGAR.POWER
-                  }), can't be used as a word (hint use math:power instead) (${
-                    SUGGAR.POWER
-                  } ${stringifyArgs(rest)})`
-                )
-                break
-              case SUGGAR.INTEGER_DEVISION:
-                exp.length = 0
-                exp.push(
-                  ...[
-                    [APPLY, KEYWORDS.ANONYMOUS_FUNCTION],
-                    [WORD, 'a'],
-                    [WORD, 'b'],
-                    [
-                      [APPLY, KEYWORDS.BITWISE_OR],
-                      [
-                        [APPLY, KEYWORDS.DIVISION],
-                        [WORD, 'a'],
-                        [WORD, 'b']
-                      ],
-                      [ATOM, 0]
-                    ]
-                  ]
-                )
-                break
-            }
-          }
-          break
-        case ATOM:
-          break
-        case APPLY:
-          {
-            switch (first[VALUE]) {
-              case KEYWORDS.BLOCK:
-                {
-                  if (
-                    prev == undefined ||
-                    (prev &&
-                      prev[TYPE] === APPLY &&
-                      prev[VALUE] !== KEYWORDS.ANONYMOUS_FUNCTION)
-                  ) {
-                    exp[0][VALUE] = KEYWORDS.CALL_FUNCTION
-                    exp[0][TYPE] = APPLY
-                    exp.length = 1
-                    exp[1] = [
-                      [APPLY, KEYWORDS.ANONYMOUS_FUNCTION],
-                      [[APPLY, KEYWORDS.BLOCK], ...rest]
-                    ]
-                    deSuggar(exp)
-                  }
-                }
-                break
-              case SUGGAR.PIPE:
-                {
-                  if (rest.length < 1)
-                    throw new RangeError(
-                      `Invalid number of arguments to (${
-                        SUGGAR.PIPE
-                      }) (>= 1 required). (${SUGGAR.PIPE} ${stringifyArgs(
-                        rest
-                      )})`
-                    )
-                  let inp = rest[0]
-                  exp.length = 0
-                  for (let i = 1; i < rest.length; ++i) {
-                    if (!rest[i].length || rest[i][0][TYPE] !== APPLY)
-                      throw new TypeError(
-                        `Argument at position (${i}) of (${
-                          SUGGAR.PIPE
-                        }) is not an invoked (${
-                          KEYWORDS.ANONYMOUS_FUNCTION
-                        }). (${SUGGAR.PIPE} ${stringifyArgs(rest)})`
-                      )
-                    inp = [rest[i].shift(), inp, ...rest[i]]
-                  }
-                  for (let i = 0; i < inp.length; ++i) exp[i] = inp[i]
-                  deSuggar(exp)
-                }
-                break
-              case SUGGAR.CONDITION:
-                {
-                  if (rest.length < 2)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        SUGGAR.CONDITION
-                      }), expected (> 2 required) but got ${rest.length} (${
-                        SUGGAR.CONDITION
-                      } ${stringifyArgs(rest)})`
-                    )
-                  if (rest.length % 2 !== 0)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        SUGGAR.CONDITION
-                      }), expected even number of arguments but got ${
-                        rest.length
-                      } (${SUGGAR.CONDITION} ${stringifyArgs(rest)})`
-                    )
-                  exp.length = 0
-                  let temp = exp
-                  for (let i = 0; i < rest.length; i += 2) {
-                    if (i === rest.length - 2) {
-                      temp.push([APPLY, KEYWORDS.IF], rest[i], rest.at(-1))
-                    } else {
-                      temp.push([APPLY, KEYWORDS.IF], rest[i], rest[i + 1], [])
-                      temp = temp.at(-1)
-                    }
-                  }
-                  deSuggar(exp)
-                }
-                break
-              case SUGGAR.LIST_TYPE:
-                {
-                  exp.length = 0
-                  let temp = exp
-                  for (const item of rest) {
-                    temp.push([APPLY, KEYWORDS.ARRAY_TYPE], item, [])
-                    temp = temp.at(-1)
-                  }
-                  temp.push([APPLY, KEYWORDS.ARRAY_TYPE])
-                  deSuggar(exp)
-                }
-                break
-              case SUGGAR.INTEGER_DEVISION:
-                {
-                  if (rest.length !== 2)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        SUGGAR.INTEGER_DEVISION
-                      }), expected (= 2) but got ${rest.length} (${
-                        SUGGAR.INTEGER_DEVISION
-                      } ${stringifyArgs(rest)})`
-                    )
-                  else if (rest.some((x) => x[TYPE] === APPLY))
-                    throw new TypeError(
-                      `Arguments of (${
-                        SUGGAR.INTEGER_DEVISION
-                      }), must be (or atom word) (hint use (math:floor (${
-                        KEYWORDS.DIVISION
-                      } a b)) instead) (${
-                        SUGGAR.INTEGER_DEVISION
-                      } ${stringifyArgs(rest)})`
-                    )
-                  else {
-                    exp.length = 1
-                    exp[0] = [APPLY, KEYWORDS.BITWISE_OR]
-                    exp.push([[APPLY, KEYWORDS.DIVISION], ...rest])
-                    exp.push([ATOM, 0])
-                  }
-                }
-                break
-              case SUGGAR.POWER:
-                {
-                  if (rest.length !== 2)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        SUGGAR.POWER
-                      }), expected (= 2) but got ${rest.length} (${
-                        SUGGAR.POWER
-                      } ${stringifyArgs(rest)})`
-                    )
-                  const isExponentAtom = exp[1][TYPE] === ATOM
-                  const isPowerAtom = exp[2][TYPE] === ATOM
-                  const isExponentWord = exp[1][TYPE] === WORD
-                  if ((isExponentWord || isExponentAtom) && isPowerAtom) {
-                    exp[0][VALUE] = KEYWORDS.MULTIPLICATION
-                    const exponent = exp[1]
-                    const power = exp[2][VALUE]
-                    exp.length = 1
-                    if (isExponentAtom) {
-                      exp.push(exponent, [ATOM, exponent[VALUE] ** (power - 1)])
-                    } else if (isExponentWord) {
-                      exp.push(
-                        ...Array.from({ length: power })
-                          .fill(0)
-                          .map(() => [exponent[TYPE], exponent[VALUE]])
-                      )
-                    }
-                  } else
-                    throw new TypeError(
-                      `Second Arguments of (${
-                        SUGGAR.POWER
-                      }), must be (atom) (hint use math:power instead) (${
-                        SUGGAR.POWER
-                      } ${stringifyArgs(rest)})`
-                    )
-                }
-                break
-              case KEYWORDS.MULTIPLICATION:
-                if (!rest.length) {
-                  exp[0][TYPE] = ATOM
-                  exp[0][VALUE] = TRUE
-                }
-                break
-              case KEYWORDS.ADDITION:
-              case KEYWORDS.DIVISION:
-                if (!rest.length) {
-                  exp[0][TYPE] = ATOM
-                  exp[0][VALUE] = FALSE
-                }
-                break
-              case SUGGAR.UNLESS:
-                {
-                  if (rest.length > 3 || rest.length < 2)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        SUGGAR.UNLESS
-                      }), expected (or (= 3) (= 2)) but got ${rest.length} (${
-                        SUGGAR.UNLESS
-                      } ${stringifyArgs(rest)})`
-                    )
-                  exp[0][VALUE] = KEYWORDS.IF
-                  const temp = exp[2]
-                  exp[2] = exp[3] ?? [ATOM, FALSE]
-                  exp[3] = temp
-                }
-                deSuggar(exp)
-                break
-
-              case SUGGAR.NOT_EQUAL_1:
-              case SUGGAR.NOT_EQUAL_2:
-                {
-                  if (rest.length > 3 || rest.length < 2)
-                    throw new RangeError(
-                      `Invalid number of arguments for (${
-                        exp[0][1]
-                      }), expected (or (= 3) (= 2)) but got ${rest.length} (${
-                        exp[0][1]
-                      } ${stringifyArgs(rest)})`
-                    )
-                  exp[0][VALUE] = KEYWORDS.NOT
-                  exp[1] = [[APPLY, KEYWORDS.EQUAL], exp[1], exp[2]]
-                  exp.length = 2
-                  deSuggar(exp)
-                }
-                break
-            }
-            prev = first
-          }
-          break
-        default:
-          for (const e of exp) evaluate(e)
-          break
-      }
-      for (const r of rest) evaluate(r)
-    }
-  }
-  evaluate(ast)
-  return ast
-}
+import std from '../lib/baked/std.js'
+import { comp } from './compiler.js'
+import {
+  APPLY,
+  ATOM,
+  FALSE,
+  KEYWORDS,
+  SUGGAR,
+  TRUE,
+  TYPE,
+  VALUE,
+  WORD
+} from './keywords.js'
+import { evaluate, run } from './evaluator.js'
+import { AST, isLeaf, LISP } from './parser.js'
+export const logError = (error) =>
+  console.log('\x1b[31m', `\n${error}\n`, '\x1b[0m')
+export const logSuccess = (output) => console.log(output, '\x1b[0m')
+export const replaceStrings = (source) => {
+  // const quotes = source.match(/"(.*?)"/g)
+  const quotes = source.match(/"(?:.*?(\n|\r))*?.*?"/g)
+  // TODO handle escaping
+  if (quotes)
+    for (const q of quotes)
+      source = source.replaceAll(
+        q,
+        `(array ${[...q.replaceAll('\r', '')]
+          .slice(1, -1)
+          .map((x) => x.charCodeAt(0))
+          .join(' ')})`
+      )
+  return source
+}
+export const replaceQuotes = (source) =>
+  source
+    .replaceAll(/\'\(/g, '(array ')
+    .replaceAll(/\`\(/g, '(list ')
+    .replaceAll(/\(\)/g, '(array)')
+// export const replaceEmptyArrays = (source) =>
+//   source
+export const removeNoCode = (source) =>
+  source
+    .replace(/;.+/g, '')
+    .replace(/[\s\s]/g, ' ')
+    .trim()
+export const isBalancedParenthesis = (sourceCode) => {
+  let count = 0
+  const stack = []
+  const str = sourceCode.match(/[/\(|\)]/g) ?? []
+  for (let i = 0; i < str.length; ++i) {
+    const current = str[i]
+    if (current === '(') stack.push(current)
+    else if (current === ')') if (stack.pop() !== '(') ++count
+  }
+  return count - stack.length
+}
+export const escape = (Char) => {
+  switch (Char) {
+    case '\\':
+      return '\\'
+    case 'n':
+      return '\n'
+    case 'r':
+      return '\r'
+    case 't':
+      return '\t'
+    case 's':
+      return ' '
+    case '"':
+      return '"'
+    default:
+      return ''
+  }
+}
+export const stringifyArrayTypes = (type) =>
+  Array.isArray(type)
+    ? `(array${type.length ? ' ' : ''}${type
+        .map((x) => stringifyArrayTypes(x))
+        .join(' ')
+        .trim()})`
+    : 'number'
+export const stringifyType = (type) => {
+  if (!isLeaf(type)) {
+    const [car] = type
+    if (car == undefined) return '(array)'
+    else if (car[TYPE] === APPLY && car[VALUE] === KEYWORDS.ARRAY_TYPE)
+      return `(array ${type
+        .map((t) => stringifyType(t))
+        .join(' ')
+        .trim()})`
+    return type
+      .map((t) => stringifyType(t))
+      .join(' ')
+      .trim()
+  } else if (type[TYPE] === ATOM) return 'number'
+}
+export const stringifyArgs = (args) =>
+  args
+    .map((x) =>
+      !isLeaf(x)
+        ? `(${stringifyArgs(x)})`
+        : x[TYPE] === APPLY || x[TYPE] === WORD
+        ? x[VALUE]
+        : JSON.stringify(x[VALUE])
+            .replace(new RegExp(/\[/g), '(')
+            .replace(new RegExp(/\]/g), ')')
+            .replace(new RegExp(/\,/g), ' ')
+            .replace(new RegExp(/"/g), '')
+    )
+    .join(' ')
+export const isForbiddenVariableName = (name) => {
+  switch (name) {
+    case '_':
+    case KEYWORDS.DEFINE_VARIABLE:
+    case SUGGAR.RECURSION:
+    case SUGGAR.CACHE:
+      return true
+    default:
+      return !isNaN(name[0])
+  }
+}
+export const isEqual = (a, b) =>
+  +(
+    (Array.isArray(a) &&
+      a.length === b.length &&
+      !a.some((_, i) => !isEqual(a.at(i), b.at(i)))) ||
+    a === b ||
+    0
+  )
+export const isEqualTypes = (a, b) =>
+  (typeof a !== 'object' && typeof b !== 'object' && typeof a === typeof b) ||
+  (Array.isArray(a) &&
+    Array.isArray(b) &&
+    (!a.length ||
+      !b.length ||
+      !(a.length > b.length ? a : b).some(
+        (_, i, bigger) =>
+          !isEqualTypes(
+            bigger.at(i),
+            (a.length > b.length ? b : a).at(
+              i % (a.length > b.length ? b : a).length
+            )
+          )
+      ))) ||
+  false
+export const isPartialTypes = (a, b) =>
+  (typeof a !== 'object' && typeof b !== 'object' && typeof a === typeof b) ||
+  (Array.isArray(a) &&
+    Array.isArray(b) &&
+    (!a.length ||
+      !b.length ||
+      !(a.length < b.length ? a : b).some(
+        (_, i, smaller) =>
+          !isEqualTypes(
+            smaller.at(i),
+            (a.length < b.length ? b : a).at(
+              i % (a.length < b.length ? b : a).length
+            )
+          )
+      ))) ||
+  false
+export const handleUnbalancedParens = (source) => {
+  const diff = isBalancedParenthesis(removeNoCode(source))
+  if (diff !== 0)
+    throw new SyntaxError(
+      `Parenthesis are unbalanced by ${diff > 0 ? '+' : ''}${diff}`
+    )
+  return source
+}
+export const handleUnbalancedQuotes = (source) => {
+  const diff = (source.match(/\"/g) ?? []).length % 2
+  if (diff !== 0) throw new SyntaxError(`Quotes are unbalanced "`)
+  return source
+}
+export const removeMutation = (source) => source.replace(new RegExp(/!/g), 'ǃ')
+const isDefinition = (x) =>
+  x[TYPE] === APPLY && x[VALUE] === KEYWORDS.DEFINE_VARIABLE
+const toDeps = (libs) =>
+  libs.reduce(
+    (a, x, i) => a.set(x.at(1)[VALUE], { value: x, index: i }),
+    new Map()
+  )
+const deepShake = (tree, deps, visited = new Set(), ignored = new Set()) => {
+  const type = tree[TYPE]
+  const value = tree[VALUE]
+  if (!isLeaf(tree)) {
+    const [car, ...rest] = tree
+    if (car == undefined) return
+    if (isDefinition(car)) {
+      if (
+        !isLeaf(rest.at(-1)) &&
+        rest
+          .at(-1)
+          .some(
+            (x) => x[TYPE] === APPLY && x[VALUE] === KEYWORDS.ANONYMOUS_FUNCTION
+          )
+      ) {
+        const args = rest.at(-1).filter((x) => !isDefinition(x))
+        const body = args.pop()
+        // const params = new Set(args.map((x) => x[VALUE])
+        for (const arg of args) ignored.add(arg[VALUE])
+        deepShake(body, deps, visited, ignored)
+      } else rest.forEach((x) => deepShake(x, deps, visited, ignored))
+    } else tree.forEach((x) => deepShake(x, deps, visited, ignored))
+  } else if (
+    (type === APPLY || type === WORD) &&
+    deps.has(value) &&
+    !visited.has(value) &&
+    !ignored.has(value)
+  ) {
+    visited.add(value)
+    deepShake(deps.get(value).value, deps, visited, ignored)
+  }
+}
+const extractDeps = (visited, deps) =>
+  [...visited]
+    .map((x) => deps.get(x))
+    .sort((a, b) => a.index - b.index)
+    .map((x) => x.value)
+const toIgnore = (ast) =>
+  ast.filter(([x]) => isDefinition(x)).map(([_, x]) => x[VALUE])
+export const treeShake = (ast, libs) => {
+  const deps = toDeps(libs)
+  const visited = new Set()
+  const ignored = new Set(toIgnore(ast))
+  deepShake(ast, deps, visited, ignored)
+  return extractDeps(visited, deps)
+}
+export const shakedList = (ast, libs) => {
+  const deps = toDeps(libs)
+  const visited = new Set()
+  const ignored = new Set(toIgnore(ast))
+  deepShake(ast, deps, visited, ignored)
+  const out = []
+  for (const [key] of deps) if (visited.has(key)) out.push(key)
+  return out
+}
+export const dfs = (tree, callback) => {
+  if (!isLeaf(tree)) for (const leaf of tree) dfs(leaf)
+  else callback(tree)
+}
+export const interpret = (ast, keywords) =>
+  ast.reduce((_, x) => evaluate(x, keywords), 0)
+export const fez = (source, options = {}) => {
+  const env = Object.create(null)
+  try {
+    if (typeof source === 'string') {
+      source = replaceQuotes(replaceStrings(source))
+      const valid = handleUnbalancedQuotes(
+        handleUnbalancedParens(removeNoCode(source))
+      )
+      const code = !options.mutation ? removeMutation(valid) : valid
+      if (!code.length && options.throw) throw new Error('Nothing to parse!')
+      const parsed = deSuggar(LISP.parse(code))
+      const ast = [...treeShake(parsed, std), ...parsed]
+      // if (options.check) typeCheck(ast)
+      if (options.compile) return comp(ast)
+      return run(ast, env)
+    } else if (Array.isArray(source)) {
+      const ast = !options.mutation
+        ? AST.parse(AST.stringify(source).replace(new RegExp(/!/g), 'ǃ'))
+        : source
+      if (options.compile) return comp(ast)
+      return run(ast, env)
+    } else {
+      throw new Error('Source has to be either a lisp source code or an AST')
+    }
+  } catch (error) {
+    // console.log(error)
+    const err = error.message.replace("'[object Array]'", '(array)')
+    // .replace('object', '(array)')
+    logError(err)
+    if (options.throw) throw err
+    return err
+  }
+}
+export const compress = (source) => {
+  let { result, occurance } = source.split('').reduce(
+    (acc, item) => {
+      if (item === ')') acc.occurance++
+      else {
+        if (acc.occurance < 3) {
+          acc.result += ')'.repeat(acc.occurance)
+          acc.occurance = 0
+        } else {
+          acc.result += '·' + acc.occurance
+          acc.occurance = 0
+        }
+        acc.result += item
+      }
+      return acc
+    },
+    { result: '', occurance: 0 }
+  )
+  if (occurance > 0) result += '·' + occurance
+  return result
+}
+export const decompress = (raw) => {
+  const suffix = [...new Set(raw.match(/·+?\d+/g))]
+  const runes = suffix.reduce(
+    (acc, m) => acc.split(m).join(')'.repeat(parseInt(m.substring(1)))),
+    raw
+  )
+  let result = ''
+  for (const tok of runes) result += tok
+  return result
+}
+// shake(LISP.parse(removeNoCode(source)), std)
+export const shake = (parsed, std) => [...treeShake(parsed, std), ...parsed]
+export const tree = (source, std) =>
+  std
+    ? shake(
+        LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source)))),
+        std
+      )
+    : LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source))))
+export const minify = (source) =>
+  LISP.source(
+    deSuggar(LISP.parse(replaceQuotes(replaceStrings(removeNoCode(source)))))
+  )
+export const prep = (source) =>
+  deSuggar(LISP.parse(removeNoCode(replaceQuotes(replaceStrings(source)))))
+export const src = (source, deps) => {
+  source = prep(source)
+  return LISP.source([
+    ...treeShake(
+      source,
+      deps.reduce((a, b) => a.concat(b), [])
+    ),
+    ...source
+  ])
+}
+export const ast = (source, deps) => {
+  source = prep(source)
+  return [
+    ...treeShake(
+      source,
+      deps.reduce((a, b) => a.concat(b), [])
+    ),
+    ...source
+  ]
+}
+export const astWithStd = (source) => {
+  const parsed = prep(source)
+  return [...treeShake(parsed, std), ...parsed]
+}
+export const dependencies = (source, deps) => {
+  source = prep(source)
+  return shakedList(
+    source,
+    deps.reduce((a, b) => a.concat(b), [])
+  )
+}
+export const js = (source, deps) => {
+  source = prep(source)
+  const { top, program } = comp([
+    ...treeShake(
+      source,
+      deps.reduce((a, b) => a.concat(b), [])
+    ),
+    ...source
+  ])
+  return `${top}${program}`
+}
+const EXPONENTIATION = [
+  [0, 'lambda'],
+  [1, 'base'],
+  [1, 'exp'],
+  [
+    [0, 'do'],
+    [
+      [0, 'let'],
+      [1, 'power'],
+      [
+        [0, 'lambda'],
+        [1, 'base'],
+        [1, 'exp'],
+        [
+          [0, 'if'],
+          [
+            [0, '<'],
+            [1, 'exp'],
+            [2, 0]
+          ],
+          [
+            [0, 'if'],
+            [
+              [0, '='],
+              [1, 'base'],
+              [2, 0]
+            ],
+            [
+              [0, 'throw'],
+              [
+                [0, 'array'],
+                [2, 66],
+                [2, 97],
+                [2, 115],
+                [2, 101],
+                [2, 32],
+                [2, 99],
+                [2, 97],
+                [2, 110],
+                [2, 39],
+                [2, 116],
+                [2, 32],
+                [2, 98],
+                [2, 101],
+                [2, 32],
+                [2, 48],
+                [2, 32],
+                [2, 105],
+                [2, 102],
+                [2, 32],
+                [2, 101],
+                [2, 120],
+                [2, 112],
+                [2, 111],
+                [2, 110],
+                [2, 101],
+                [2, 110],
+                [2, 116],
+                [2, 32],
+                [2, 105],
+                [2, 115],
+                [2, 32],
+                [2, 60],
+                [2, 32],
+                [2, 48]
+              ]
+            ],
+            [
+              [0, '/'],
+              [
+                [0, '*'],
+                [1, 'base'],
+                [
+                  [0, 'power'],
+                  [1, 'base'],
+                  [
+                    [0, '-'],
+                    [
+                      [0, '*'],
+                      [1, 'exp'],
+                      [2, -1]
+                    ],
+                    [2, 1]
+                  ]
+                ]
+              ]
+            ]
+          ],
+          [
+            [0, 'if'],
+            [
+              [0, '='],
+              [1, 'exp'],
+              [2, 0]
+            ],
+            [2, 1],
+            [
+              [0, 'if'],
+              [
+                [0, '='],
+                [1, 'exp'],
+                [2, 1]
+              ],
+              [1, 'base'],
+              [
+                [0, 'if'],
+                [[2, 1]],
+                [
+                  [0, '*'],
+                  [1, 'base'],
+                  [
+                    [0, 'power'],
+                    [1, 'base'],
+                    [
+                      [0, '-'],
+                      [1, 'exp'],
+                      [2, 1]
+                    ]
+                  ]
+                ]
+              ]
+            ]
+          ]
+        ]
+      ]
+    ],
+    [
+      [0, 'power'],
+      [1, 'base'],
+      [1, 'exp']
+    ]
+  ]
+]
+export const deSuggar = (ast) => {
+  if (ast.length === 0) throw new SyntaxError(`No expressions to evaluate`)
+  // for (const node of ast)
+  //   if (node[0] && node[0][TYPE] === APPLY && node[0][VALUE] === KEYWORDS.BLOCK)
+  //     throw new SyntaxError(`Top level (${KEYWORDS.BLOCK}) is not allowed`)
+  let prev = undefined
+  const evaluate = (exp) => {
+    const [first, ...rest] = isLeaf(exp) ? [exp] : exp
+    if (first != undefined) {
+      switch (first[TYPE]) {
+        case WORD:
+          {
+            switch (first[VALUE]) {
+              case SUGGAR.POWER:
+                exp.length = 0
+                exp.push(...EXPONENTIATION)
+                break
+              case SUGGAR.INTEGER_DEVISION:
+                exp.length = 0
+                exp.push(
+                  ...[
+                    [APPLY, KEYWORDS.ANONYMOUS_FUNCTION],
+                    [WORD, 'a'],
+                    [WORD, 'b'],
+                    [
+                      [APPLY, KEYWORDS.BITWISE_OR],
+                      [
+                        [APPLY, KEYWORDS.DIVISION],
+                        [WORD, 'a'],
+                        [WORD, 'b']
+                      ],
+                      [ATOM, 0]
+                    ]
+                  ]
+                )
+                break
+            }
+          }
+          break
+        case ATOM:
+          break
+        case APPLY:
+          {
+            switch (first[VALUE]) {
+              case KEYWORDS.BLOCK:
+                {
+                  if (
+                    prev == undefined ||
+                    (prev &&
+                      prev[TYPE] === APPLY &&
+                      prev[VALUE] !== KEYWORDS.ANONYMOUS_FUNCTION)
+                  ) {
+                    exp[0][VALUE] = KEYWORDS.CALL_FUNCTION
+                    exp[0][TYPE] = APPLY
+                    exp.length = 1
+                    exp[1] = [
+                      [APPLY, KEYWORDS.ANONYMOUS_FUNCTION],
+                      [[APPLY, KEYWORDS.BLOCK], ...rest]
+                    ]
+                    deSuggar(exp)
+                  }
+                }
+                break
+              case SUGGAR.PIPE:
+                {
+                  if (rest.length < 1)
+                    throw new RangeError(
+                      `Invalid number of arguments to (${
+                        SUGGAR.PIPE
+                      }) (>= 1 required). (${SUGGAR.PIPE} ${stringifyArgs(
+                        rest
+                      )})`
+                    )
+                  let inp = rest[0]
+                  exp.length = 0
+                  for (let i = 1; i < rest.length; ++i) {
+                    if (!rest[i].length || rest[i][0][TYPE] !== APPLY)
+                      throw new TypeError(
+                        `Argument at position (${i}) of (${
+                          SUGGAR.PIPE
+                        }) is not an invoked (${
+                          KEYWORDS.ANONYMOUS_FUNCTION
+                        }). (${SUGGAR.PIPE} ${stringifyArgs(rest)})`
+                      )
+                    inp = [rest[i].shift(), inp, ...rest[i]]
+                  }
+                  for (let i = 0; i < inp.length; ++i) exp[i] = inp[i]
+                  deSuggar(exp)
+                }
+                break
+              case SUGGAR.CONDITION:
+                {
+                  if (rest.length < 2)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        SUGGAR.CONDITION
+                      }), expected (> 2 required) but got ${rest.length} (${
+                        SUGGAR.CONDITION
+                      } ${stringifyArgs(rest)})`
+                    )
+                  if (rest.length % 2 !== 0)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        SUGGAR.CONDITION
+                      }), expected even number of arguments but got ${
+                        rest.length
+                      } (${SUGGAR.CONDITION} ${stringifyArgs(rest)})`
+                    )
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 2) {
+                    if (i === rest.length - 2) {
+                      temp.push([APPLY, KEYWORDS.IF], rest[i], rest.at(-1))
+                    } else {
+                      temp.push([APPLY, KEYWORDS.IF], rest[i], rest[i + 1], [])
+                      temp = temp.at(-1)
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case SUGGAR.LIST_TYPE:
+                {
+                  exp.length = 0
+                  let temp = exp
+                  for (const item of rest) {
+                    temp.push([APPLY, KEYWORDS.ARRAY_TYPE], item, [])
+                    temp = temp.at(-1)
+                  }
+                  temp.push([APPLY, KEYWORDS.ARRAY_TYPE])
+                }
+                deSuggar(exp)
+                break
+              case SUGGAR.INTEGER_DEVISION:
+                {
+                  if (rest.length !== 2)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        SUGGAR.INTEGER_DEVISION
+                      }), expected (= 2) but got ${rest.length} (${
+                        SUGGAR.INTEGER_DEVISION
+                      } ${stringifyArgs(rest)})`
+                    )
+                  else if (rest.some((x) => x[TYPE] === APPLY))
+                    throw new TypeError(
+                      `Arguments of (${
+                        SUGGAR.INTEGER_DEVISION
+                      }), must be (or atom word) (hint use (math:floor (${
+                        KEYWORDS.DIVISION
+                      } a b)) instead) (${
+                        SUGGAR.INTEGER_DEVISION
+                      } ${stringifyArgs(rest)})`
+                    )
+                  else {
+                    exp.length = 1
+                    exp[0] = [APPLY, KEYWORDS.BITWISE_OR]
+                    exp.push([[APPLY, KEYWORDS.DIVISION], ...rest])
+                    exp.push([ATOM, 0])
+                  }
+                }
+                break
+              case SUGGAR.POWER:
+                {
+                  if (rest.length !== 2)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        SUGGAR.POWER
+                      }), expected (= 2) but got ${rest.length} (${
+                        SUGGAR.POWER
+                      } ${stringifyArgs(rest)})`
+                    )
+                  const isExponentAtom = exp[1][TYPE] === ATOM
+                  const isPowerAtom = exp[2][TYPE] === ATOM
+                  const isExponentWord = exp[1][TYPE] === WORD
+                  if ((isExponentWord || isExponentAtom) && isPowerAtom) {
+                    if (isExponentAtom) {
+                      exp[0][VALUE] = KEYWORDS.MULTIPLICATION
+                      const exponent = exp[1]
+                      const power = exp[2][VALUE]
+                      exp.length = 1
+                      exp.push(exponent, [ATOM, exponent[VALUE] ** (power - 1)])
+                    } else if (isExponentWord) {
+                      const exponent = exp[1]
+                      const power = exp[2]
+                      exp.length = 0
+                      exp.push([0, 'apply'], EXPONENTIATION, exponent, power)
+                    }
+                  } else {
+                    const exponent = exp[1]
+                    const power = exp[2]
+                    exp.length = 0
+                    exp.push([0, 'apply'], EXPONENTIATION, exponent, power)
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case KEYWORDS.MULTIPLICATION:
+                if (!rest.length) {
+                  exp[0][TYPE] = ATOM
+                  exp[0][VALUE] = TRUE
+                } else if (rest.length > 2) {
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 1) {
+                    if (i < rest.length - 1) {
+                      temp.push([APPLY, KEYWORDS.MULTIPLICATION], rest[i], [])
+                      temp = temp.at(-1)
+                    } else {
+                      temp.push(...rest[i])
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case KEYWORDS.ADDITION:
+                if (!rest.length) {
+                  exp[0][TYPE] = ATOM
+                  exp[0][VALUE] = FALSE
+                } else if (rest.length > 2) {
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 1) {
+                    if (i < rest.length - 1) {
+                      temp.push([APPLY, KEYWORDS.ADDITION], rest[i], [])
+                      temp = temp.at(-1)
+                    } else {
+                      temp.push(...rest[i])
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case KEYWORDS.DIVISION:
+                if (!rest.length) {
+                  exp[0][TYPE] = ATOM
+                  exp[0][VALUE] = FALSE
+                } else if (rest.length > 2) {
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 1) {
+                    if (i < rest.length - 1) {
+                      temp.push([APPLY, KEYWORDS.DIVISION], rest[i], [])
+                      temp = temp.at(-1)
+                    } else {
+                      temp.push(...rest[i])
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case KEYWORDS.AND:
+                if (!rest.length) {
+                  exp[0][TYPE] = ATOM
+                  exp[0][VALUE] = FALSE
+                } else if (rest.length > 2) {
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 1) {
+                    if (i < rest.length - 1) {
+                      temp.push([APPLY, KEYWORDS.AND], rest[i], [])
+                      temp = temp.at(-1)
+                    } else {
+                      temp.push(...rest[i])
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case KEYWORDS.OR:
+                if (!rest.length) {
+                  exp[0][TYPE] = ATOM
+                  exp[0][VALUE] = FALSE
+                } else if (rest.length > 2) {
+                  exp.length = 0
+                  let temp = exp
+                  for (let i = 0; i < rest.length; i += 1) {
+                    if (i < rest.length - 1) {
+                      temp.push([APPLY, KEYWORDS.OR], rest[i], [])
+                      temp = temp.at(-1)
+                    } else {
+                      temp.push(...rest[i])
+                    }
+                  }
+                  deSuggar(exp)
+                }
+                break
+              case SUGGAR.UNLESS:
+                {
+                  if (rest.length > 3 || rest.length < 2)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        SUGGAR.UNLESS
+                      }), expected (or (= 3) (= 2)) but got ${rest.length} (${
+                        SUGGAR.UNLESS
+                      } ${stringifyArgs(rest)})`
+                    )
+                  exp[0][VALUE] = KEYWORDS.IF
+                  const temp = exp[2]
+                  exp[2] = exp[3] ?? [ATOM, FALSE]
+                  exp[3] = temp
+                }
+                deSuggar(exp)
+                break
+
+              case SUGGAR.NOT_EQUAL_1:
+              case SUGGAR.NOT_EQUAL_2:
+                {
+                  if (rest.length > 3 || rest.length < 2)
+                    throw new RangeError(
+                      `Invalid number of arguments for (${
+                        exp[0][1]
+                      }), expected (or (= 3) (= 2)) but got ${rest.length} (${
+                        exp[0][1]
+                      } ${stringifyArgs(rest)})`
+                    )
+                  exp[0][VALUE] = KEYWORDS.NOT
+                  exp[1] = [[APPLY, KEYWORDS.EQUAL], exp[1], exp[2]]
+                  exp.length = 2
+                  deSuggar(exp)
+                }
+                break
+            }
+            prev = first
+          }
+          break
+        default:
+          for (const e of exp) evaluate(e)
+          break
+      }
+      for (const r of rest) evaluate(r)
+    }
+  }
+  evaluate(ast)
+  return ast
+}