fez-lisp 1.0.51 → 1.0.53

package/src/parser.js

@@ -1,4 +1,4 @@
-import { APPLY, ATOM, TYPE, WORD, VALUE } from './enums.js'
+import { APPLY, ATOM, TYPE, WORD, VALUE } from './keywords.js'
 import { escape, preserveEscape } from './utils.js'
 export const leaf = (type, value) => [type, value]
 export const isLeaf = ([car]) => car === APPLY || car === ATOM || car === WORD

package/src/utils.js

@@ -1,7 +1,7 @@
 import std from '../lib/baked/std.js'
 import { comp } from './compiler.js'
-import { APPLY, KEYWORDS, TYPE, VALUE, WORD } from './enums.js'
-import { run } from './interpreter.js'
+import { APPLY, KEYWORDS, TYPE, VALUE, WORD } from './keywords.js'
+import { run } from './evaluator.js'
 import { AST, isLeaf, LISP } from './parser.js'
 export const logError = (error) => console.log('\x1b[31m', error, '\x1b[0m')
 export const logSuccess = (output) => console.log(output, '\x1b[0m')
@@ -15,10 +15,9 @@ export const isBalancedParenthesis = (sourceCode) => {
   let count = 0
   const stack = []
   const str = sourceCode.match(/[/\(|\)](?=[^"]*(?:"[^"]*"[^"]*)*$)/g) ?? []
-  const pairs = { ')': '(' }
   for (let i = 0; i < str.length; ++i)
     if (str[i] === '(') stack.push(str[i])
-    else if (str[i] in pairs) if (stack.pop() !== pairs[str[i]]) ++count
+    else if (str[i] === ')') if (stack.pop() !== '(') ++count
   return count - stack.length
 }
 export const escape = (Char) => {