subscript 1.0.3 → 1.0.4

package/justin.js

@@ -50,4 +50,5 @@ transforms['{'] = (s,entries) => {
 
 // TODO: strings interpolation
 
+export { default } from './subscript.js';
 export * from './subscript.js'

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "subscript",
-  "version": "1.0.3",
+  "version": "1.0.4",
   "description": "Microlanguage with common syntax for JS/C++/Python/Rust",
   "main": "subscript.js",
   "files": [

package/readme.md

@@ -1,13 +1,13 @@
 # <!--<img alt="subscript" src="/subscript2.svg" height=42/>--> sub͘<em>script</em> <!--<sub>SUB͘<em>SCRIPT</em></sub>-->
 
-Subscript is micro-language, common subset of C++, JS, Java, Python, Go, Rust.<br/>
+_Subscript_ is micro-language with common syntax subset of C++, JS, Java, Python, Go, Rust.<br/>
 
 * Everyone knows _subscript_ syntax
 * Any _subscript_ fragment can be copy-pasted to a target language and it will work
-* It's tiny <sub>![npm bundle size](https://img.shields.io/bundlephobia/minzip/subscript?color=brightgreen&label=gzip)</sub>
-* Enables easy operators overloading
+* It's tiny <sub>![npm bundle size](https://img.shields.io/bundlephobia/minzip/subscript/latest?color=brightgreen&label=gzip)</sub>
+* It's fast ([~10 times faster than eval](#performance))
+* Enables operators overloading
 * Configurable & extensible
-* Performant?
 * Trivial to use...
 
 ```js
@@ -36,12 +36,12 @@ fn({a:{b:1}, c:x=>x*2, d:3}) // 5
 
 ## Lispy tree
 
-It compiles code to lispy calltree (\~[frisk](https://npmjs.com/frisk)). Why?
+It compiles code to lispy calltree (compatible with [frisk](https://npmjs.com/frisk)). Why?
 
 + minimal possible AST overhead
 + clear operators precedence
-+ easy to overload operators, mimic lang subsets
-+ manual evaluation, debugging
++ overloading operators by context 
++ simple manual evaluation, debugging
 + conventional form
 + one-liner docs...
 
@@ -66,14 +66,14 @@ import {quotes, comments, parse} from 'subscript.js'
 quotes["'"] = "'"
 comments["//"] = "\n"
 
-parse(`'a' + 'b' // concat`) // ['+', "'a'", "'b'"]
+parse(`'a' + 'b' // concat`) // ['+', 'a':String, 'b':String]
 ```
 
 ## Operators
 
 Default operators include common operators for the listed languages in the following precedence:
 
-* `. ( [`
+* `.`
 * `! + - ++ --` unary
 * `* / %`
 * `+ -`
@@ -85,16 +85,15 @@ Default operators include common operators for the listed languages in the follo
 * `|`
 * `&&`
 * `||`
-* `,`
 
 All other operators can be extended.
 
 ```js
-import {operators, parse, evaluate} from 'subscript.js'
+import {binary, parse, evaluate} from 'subscript.js'
 
 // add operators to precedence groups
-operators[0]['=>'] = (args, body) => evaluate(body, args)
-operators[5]['|'] = (a,...b) => a.pipe(...b)
+binary[0]['=>'] = (args, body) => evaluate(body, args)
+binary[5]['|'] = (a,...b) => a.pipe(...b)
 
 let tree = parse(`
   interval(350)
@@ -105,20 +104,19 @@ let tree = parse(`
 evaluate(tree, {Math, map, take, interval, gaussian})
 ```
 
-Operator arity is detected from number of arguments:
+Operators are defined in by precedence index.
 
 ```js
-operators[1]['&'] = a=>address(a)   // unary prefix:  &a
-operators[9]['U'] = (a,b)=>a.union(b)  // binary:  a U b
-operators[9]['|'] = (...a)=>a[0].pipe(...)  // also binary: a | b
+unary[0]['&'] = a => address(a)   // unary prefix:  &a
+unary[1]['!'] = a => factorial(a) // TODO: unary postfix: a!
+binary[9]['U'] = (a,b) => a.union(b)  // binary:  a U b
+binary[9]['|'] = (...a) => a[0].pipe(...)  // also binary: a | b
 ```
 
-TODO: postfix unary operators are not yet supported.
-
 
 ## Transforms
 
-Transform rules are applied to raw parsed operator groups, eg.:
+Transform rules are applied to raw parsed calltree groups, eg.:
 
 * Flatten calls `a(b,c)(d)` → `['(', 'a', [',', 'b', 'c'], 'd']` → `[['a', 'b', 'c'], 'd']`
 * Property access `a.b.c` → `['.', 'a', 'b', 'c']` → `['.', 'a', '"b"', '"c"']`
@@ -141,6 +139,7 @@ parse('a ? b') // ['?', 'a', 'b']
 parse('a : b') // [':', 'a', 'b']
 ```
 
+
 ## Justin
 
 _Justin_ extension (original [thread](https://github.com/endojs/Jessie/issues/66)) is minimal JS subset − JSON with JS expressions.<br/>
@@ -272,14 +271,23 @@ These are custom DSL operators snippets for your inspiration:
 
 ## Performance
 
-Compare against js eval, Function, quickjs, SES, jscan, alternatives from see-also
+Subscript shows fastest known performance within other evaluators:
 
+```
+expr-eval: 105.385986328125 ms
+jsep: 71.583251953125 ms
+subscript: 34.6259765625 ms
+jexl: 88.382080078125 ms
+string-math: 107.573974609375 ms
+new Function: 354.0400390625 ms
+```
 
 ## See also
 
 * [Jessie](https://github.com/endojs/Jessie) − Minimal JS subset.
 * [jexl](https://github.com/TomFrost/Jexl)
 * [expr-eval](https://github.com/silentmatt/expr-eval)
+* [expression-eval](https://github.com/donmccurdy/expression-eval)
 * [jsep](https://github.com/EricSmekens/jsep)
 * [string-math](https://github.com/devrafalko/string-math)
 

package/subscript.js

@@ -1,28 +1,60 @@
-export const operators = [
-  {
-    '(':(...a)=>a(...args),
-    '[':(...a)=>a.reduce((a,b)=>a?a[b]:a),
-    '.':(...a)=>a.reduce((a,b)=>a?a[b]:a)
-  },
-  {
-    '!':a=>!a,
-    '+':a=>+a,
-    '-':a=>-a,
-    '++':a=>++a,
-    '--':a=>--a
-  },
-  // {
-  //   '++':a=>a++,
-  //   '--':a=>a--
-  // },
+const isDigit = c => c >= 48 && c <= 57, // 0...9,
+  isIdentifierStart = c => (c >= 65 && c <= 90) || // A...Z
+      (c >= 97 && c <= 122) || // a...z
+      (c == 36 || c == 95) || // $, _,
+      c >= 192, // any non-ASCII
+  isIdentifierPart = c => isIdentifierStart(c) || isDigit(c),
+  isSpace = c => c <= 32,
+  isNotQuote = c => !quotes[String.fromCharCode(c)],
+
+  oper = (op, ops=binary, f, res, i) => { for (i=ops.length;i--;) if (res=ops[i][op]) return f?res:i+1 }, // get precedence
+  isCmd = (a,op) => Array.isArray(a) && a.length && a[0] && (op ? a[0]===op : typeof a[0] === 'string' || isCmd(a[0])), // is calltree node
+
+  unlist = l => l.length<2?l[0]:l,
+  nil = Symbol.for('nil'),
+
+  Err = e => {throw new Error(e)}
+
+export const literals = {
+  true: true,
+  false: false,
+  null: null
+},
+
+blocks = {'(':')','[':']'},
+quotes = {'"':'"'},
+comments = {},
+
+unary = [{ // prefix
+  '!':a=>!a,
+  '+':a=>+a,
+  '-':a=>-a,
+  '++':a=>++a,
+  '--':a=>--a
+}, { // postfix
+}],
+
+// binaries take multiple args because
+// + that allows shortcuts
+// + that's lisp/frisk compatible
+// + that allows simpler manual evaluator calls
+// + functions anyways take multiple arguments
+// parser still generates binary groups - it's safer and clearer
+binary = [
+  {'||':(...a)=>a.some(Boolean)},
+  {'&&':(...a)=>a.every(Boolean)},
+  {'|':(a,b)=>a|b},
+  {'^':(a,b)=>a^b},
+  {'&':(a,b)=>a&b},
   {
-    '%':(...a)=>a.reduce((a,b)=>a%b),
-    '/':(...a)=>a.reduce((a,b)=>a/b),
-    '*':(...a)=>a.reduce((a,b)=>a*b),
+    '!=':(a,b)=>a!=b,
+    '==':(a,b)=>a==b,
   },
   {
-    '+':(...a)=>a.reduce((a,b)=>a+b),
-    '-':(...a)=>a.reduce((a,b)=>a-b),
+    '>=':(a,b)=>a>=b,
+    '>':(a,b)=>a>b,
+    '<=':(a,b)=>a<=b,
+    '<':(a,b)=>a<b,
   },
   {
     '>>>':(a,b)=>a>>>b,
@@ -30,105 +62,157 @@ export const operators = [
     '<<':(a,b)=>a<<b,
   },
   {
-    '>=':(a,b)=>a>=b,
-    '>':(a,b)=>a>b,
-    '<=':(a,b)=>a<=b,
-    '<':(a,b)=>a<b,
+    '+':(...a)=>a.reduce((a,b)=>a+b),
+    '-':(...a)=>a.reduce((a,b)=>a-b),
   },
   {
-    '!=':(a,b)=>a!=b,
-    '==':(a,b)=>a==b,
+    '%':(...a)=>a.reduce((a,b)=>a%b),
+    '/':(...a)=>a.reduce((a,b)=>a/b),
+    '*':(...a)=>a.reduce((a,b)=>a*b),
   },
-  {'&':(a,b)=>a&b},
-  {'^':(a,b)=>a^b},
-  {'|':(a,b)=>a|b},
-  {'&&':(...a)=>a.every(Boolean)},
-  {'||':(...a)=>a.some(Boolean)},
-  {',':(...a)=>a.reduce((a,b)=>(a,b))},
+  {
+    '.':(...a)=>a.reduce((a,b)=>a?a[b]:a)
+  }
 ],
-operator = (s,l,o,i) => {
-  if (!s || typeof s != 'string' || quotes[s[0]]) return
-  for (i=operators.length;i--;) if (o=operators[i][s], o&&l==1?o.length==l:o) return o
-},
-literals = {true:true, false:false, null:null, undefined:undefined},
-blocks = {'(':')','[':']'},
-quotes = {'"':'"'},
-comments = {},
+
 transforms = {
+  // Array literal
+  // Object literal
+  // Ternary
   // [(, a] → a, [(,a,''] → [a], [(,a,[',',b,c],d] → [[a,b,c],d]
-  '(': s => s.length < 2 ? s[1] : s.slice(1).reduce((a,b)=>[a].concat(!b?[]:b[0]==','?b.slice(1):[b])),
-  '.': s => [s[0],s[1], ...s.slice(2).map(a=>typeof a === 'string' ? `"${a}"` : a)] // [.,a,b → [.,a,'"b"'
+  '(': s => s.length < 3 ? s[1] : s // : s.slice(1).reduce((a,b)=>[a].concat(!b?[]:b[0]==','?b.slice(1):[b])),
+  // '.': s => [s[0],s[1], ...s.slice(2).map(a=>typeof a === 'string' ? `"${a}"` : a)] // [.,a,b → [.,a,'"b"'
 },
-transform = (n, t) => (t = isnode(n)&&transforms[n[0]], t?t(n):n),
-
-isnode = a=>Array.isArray(a)&&a.length&&a[0],
-space = ' \r\n\t',
-
-// code → calltree
-parse = (s, i=0) => {
-  const tokenize = (end, buf='', n, c, c2, c3, to, cur=[]) => {
-    const commit = op => {
-      if (buf!=='') cur.push(n ? parseFloat(buf) : buf in literals ? literals[buf] : buf)
-      if (op) cur.push(op)
-      n=buf=c=''
-    }
-    for (; i<=s.length; buf+=c) {
-      c = s[i++], c2=c+s[i], c3=c2+s[i+1]
-      if (n && (c=='e'||c=='E')) c+=s[i++]
-      else if (space.includes(c)) commit()
-      else if (to=comments[c2]||comments[c]) commit(),skip(s,to)
-      else if (to=(quotes[c3]||quotes[c2]||quotes[c])) buf=c+s.slice(i,skip(s,to)),commit()
-      else if (to=blocks[c]) commit(c), cur.push(tokenize(to))
-      else if (!buf && c>='0' && c<='9' || c=='.' && s[i]>='0' && s[i]<='9') n=1
-      else if (c==end) return commit(), group(cur)
-      else if (operator(c=c3)||operator(c=c2)||operator(c=c[0]))
-        if (i+=c.length-1, c.toLowerCase()==c.toUpperCase() || !buf&&space.includes(s[i])) // word operators
-        commit(c)
+transform = (n, t) => (t = isCmd(n)&&transforms[n[0]], t?t(n):n),
+
+
+parse = (expr, index=0, len=expr.length) => {
+  const char = () => expr.charAt(index),
+  code = () => expr.charCodeAt(index),
+  err = message => Err(message + ' at character ' + index),
+
+  // skip index until condition matches
+  skip = (f, c=code()) => { while (index < len && f(c)) c=expr.charCodeAt(++index); return index },
+
+  // skip index, returning skipped part
+  gobble = f => expr.slice(index, skip(f)),
+
+  gobbleSequence = (end) => {
+    let list = [], c;
+    while (index < len && (c=char()) !== end) {
+      if (c === ';' || c === ',') index++; // ignore separators
+      else list.push(gobbleExpression()), skip(isSpace)
     }
+    if (end) index++
+
+    return list;
   },
-  skip = (s,tok,n)=>(i= (i=s.indexOf(tok,i),i)<0 ? s.length : i+tok.length),
-
-  // group into calltree nodes by precedence
-  group = (s) => {
-    if (!s.length) return undefined
-
-    let prec, i, gi, a,b,x, f
-
-    const commit=() => ~gi && (s[gi]=transform(s[gi]), gi=-1)
-
-    for (prec of operators) {
-      for (gi=-1,i=1;i<s.length;) {
-        a=s[i-2],x=s[i-1],b=s[i], f = typeof x === 'string' && prec[x]
-        if (f && !operator(b) && i>1&&!operator(a)) { // binary: a+b
-          if (prec[x].length==1) commit(), i++ // skip non-binary op
-          else if (gi==i-2 && a[0]==x) a.push(b), s.splice(i-1,2) // ,[+,a,b],+,c → ,[+,a,b]
-          else commit(), s.splice(gi=i-2,3,[x,s[gi],b]) // ,a,+,b, → ,[+,a,b],
-        }
-        else if (f && !operator(b)) { // unary prefix: +b, -+b
-          s.splice(gi=i-1,2,[x,b]) // _,-,b → _,[-,b]
-          i-- // (shift left to consume prefix unary or binary)
-        }
-        // TODO: detect postfix unary
-        else commit(),i++
+
+  gobbleOp = (ops=binary, op, l=3) => {
+    skip(isSpace);
+    while (!oper(op=expr.substr(index, l--),ops)) if (!l) return
+    index+=op.length
+    return op
+  },
+
+  // `1`, `1+2`, `a+(b*2)-Math.sqrt(2)`
+  gobbleExpression = () => {
+    let node, op, prec, stack, op_info, left, right, i, curOp;
+
+    if (nil==(left = gobbleToken())) return;
+    if (!(op = gobbleOp())) return left;
+    if (nil==(right = gobbleToken())) err("Expected expression after " + op);
+
+    // Otherwise, start a stack to properly place the binary operations in their precedence structure
+    stack = [left, [ op, oper(op)||0 ], right];
+
+    // Properly deal with precedence using [recursive descent](http://www.engr.mun.ca/~theo/Misc/exp_parsing.htm)
+    // Stripped from jsep, not much mind given optimizing, but good enough
+    while ((curOp = gobbleOp()) && (prec = oper(curOp))) {
+      // Reduce: make a binary expression from the three topmost entries.
+      while ((stack.length > 2) && stack[stack.length-2][1] >= prec) {
+        right = stack.pop(), op = stack.pop()[0], left = stack.pop();
+        stack.push([op, left, right]); // BINARY_EXP
       }
-      commit() // last binary can be hanging
+      if (nil==(node = gobbleToken())) err("Expected expression after " + curOp);
+      stack.push([curOp, prec], node);
     }
 
-    return s.length>1?s:s[0]
+    i = stack.length - 1, node = stack[i];
+    while (i > 1) { node = [stack[i-1][0], stack[i-2], node], i-=2 } // BINARY_EXP
+
+    return node;
+  },
+
+  // `foo.bar(baz)`, `1`, `"abc"`, `(a % 2)`
+  gobbleToken = () => {
+    let cc, c, op, node;
+    skip(isSpace);
+
+    cc = code(), c = char()
+
+    // `.` can start off a numeric literal
+    if (isDigit(cc) || c === '.') node = new Number(gobbleNumber());
+    else if (!isNotQuote(cc)) index++, node = new String(gobble(isNotQuote)), index++
+    else if (blocks[c]) index++, node = transform([c, ...gobbleSequence(blocks[c])])
+    else if (isIdentifierStart(cc)) node = (node = gobble(isIdentifierPart)) in literals ? literals[node] : node
+    else if (op = gobbleOp(unary)) return nil==(node = gobbleToken()) ? err('missing unaryOp argument') : [op, node];
+    else return nil
+
+    // a.b[c](d)
+    // FIXME: that's heuristic of more generic something, like transform
+    // FIXME: optimize condition
+    while (skip(isSpace), c=char(), c === '.' || c === '[' || c === '(') {
+      index++, skip(isSpace)
+      if (c === '[') (node = ['.',node]).push(unlist(gobbleSequence(']'))) // MEMBER_EXP
+      else if (c === '(') node = [node, ...gobbleSequence(')')] // CALL_EXP
+      else if (c === '.') (node = ['.',node]).push(gobble(isIdentifierPart)) // MEMBER_EXP
+    }
+
+    return node;
+  },
+
+  // `12`, `3.4`, `.5`
+  gobbleNumber = () => {
+    let number = '', c = char();
+
+    number += gobble(isDigit)
+    if (char() === '.') number += expr.charAt(index++) + gobble(isDigit) // .1
+
+    c = char();
+    if (c === 'e' || c === 'E') { // exponent marker
+      number += c, index++
+      c = char();
+      if (c === '+' || c === '-') number += c, index++; // exponent sign
+      number += gobble(isDigit)
+    }
+
+    return number //  LITERAL
   }
 
-  s=tokenize()
-  return s
+  return unlist(gobbleSequence())
 },
 
 // calltree → result
-evaluate = (s, ctx={}) => isnode(s)
-  ? (isnode(s[0]) ? evaluate(s[0]) : typeof s[0]==='string' ? ctx[s[0]]||operator(s[0],s.length-1) : s[0])
-    (...s.slice(1).map(a=>evaluate(a,ctx)))
-  : typeof s == 'string'
-  ? quotes[s[0]] ? s.slice(1,-1) : ctx[s]
-  : s
+evaluate = (s, ctx={}, c, op) => {
+  if (isCmd(s)) {
+    // FIXME: move to transforms
+    if ((c=s[0])=='.') return oper(c,binary,true)(evaluate(s[1], ctx),...s.slice(2))
 
-// code → evaluator
-export default s => (s = typeof s == 'string' ? parse(s) : s, ctx => evaluate(s, ctx))
+    if (typeof c === 'string') op = oper(c, s.length<3?unary:binary, true)
+    c = op || evaluate(c, ctx)
+    if (typeof c !== 'function') return c
 
+    return c.call(...s.map(a=>evaluate(a,ctx)))
+  }
+
+  if (s && typeof s === 'string')
+    return quotes[s[0]] ? s.slice(1,-1)
+          : s[0]==='@' ? s.slice(1)
+          : s in ctx ? ctx[s] : s
+
+  return s
+}
+
+// code → evaluator
+export default s => (s = typeof s == 'string' ? parse(s) : s,  ctx => evaluate(s, ctx))

package/subscript.min.js

@@ -1 +1 @@
-export const operators=[{"(":(...e)=>e(...args),"[":(...e)=>e.reduce(((e,r)=>e?e[r]:e)),".":(...e)=>e.reduce(((e,r)=>e?e[r]:e))},{"!":e=>!e,"+":e=>+e,"-":e=>-e,"++":e=>++e,"--":e=>--e},{"%":(...e)=>e.reduce(((e,r)=>e%r)),"/":(...e)=>e.reduce(((e,r)=>e/r)),"*":(...e)=>e.reduce(((e,r)=>e*r))},{"+":(...e)=>e.reduce(((e,r)=>e+r)),"-":(...e)=>e.reduce(((e,r)=>e-r))},{">>>":(e,r)=>e>>>r,">>":(e,r)=>e>>r,"<<":(e,r)=>e<<r},{">=":(e,r)=>e>=r,">":(e,r)=>e>r,"<=":(e,r)=>e<=r,"<":(e,r)=>e<r},{"!=":(e,r)=>e!=r,"==":(e,r)=>e==r},{"&":(e,r)=>e&r},{"^":(e,r)=>e^r},{"|":(e,r)=>e|r},{"&&":(...e)=>e.every(Boolean)},{"||":(...e)=>e.some(Boolean)},{",":(...e)=>e.reduce(((e,r)=>r))}],operator=(e,r,t,s)=>{if(e&&"string"==typeof e&&!quotes[e[0]])for(s=operators.length;s--;)if((t=operators[s][e])&&1==r?t.length==r:t)return t},literals={true:!0,false:!1,null:null,undefined:void 0},blocks={"(":")","[":"]"},quotes={'"':'"'},comments={},transforms={"(":e=>e.length<2?e[1]:e.slice(1).reduce(((e,r)=>[e].concat(r?","==r[0]?r.slice(1):[r]:[]))),".":e=>[e[0],e[1],...e.slice(2).map((e=>"string"==typeof e?`"${e}"`:e))]},transform=(e,r)=>(r=isnode(e)&&transforms[e[0]])?r(e):e,isnode=e=>Array.isArray(e)&&e.length&&e[0],space=" \r\n\t",parse=(e,r=0)=>{const t=(n,l="",a,i,p,u,c,f=[])=>{const d=e=>{""!==l&&f.push(a?parseFloat(l):l in literals?literals[l]:l),e&&f.push(e),a=l=i=""};for(;r<=e.length;l+=i)if(u=(p=(i=e[r++])+e[r])+e[r+1],!a||"e"!=i&&"E"!=i)if(space.includes(i))d();else if(c=comments[p]||comments[i])d(),s(e,c);else if(c=quotes[u]||quotes[p]||quotes[i])l=i+e.slice(r,s(e,c)),d();else if(c=blocks[i])d(i),f.push(t(c));else if(!l&&i>="0"&&i<="9"||"."==i&&e[r]>="0"&&e[r]<="9")a=1;else{if(i==n)return d(),o(f);(operator(i=u)||operator(i=p)||operator(i=i[0]))&&(r+=i.length-1,(i.toLowerCase()==i.toUpperCase()||!l&&space.includes(e[r]))&&d(i))}else i+=e[r++]},s=(e,t,s)=>r=(r=e.indexOf(t,r))<0?e.length:r+t.length,o=e=>{if(!e.length)return;let r,t,s,o,n,l,a;const i=()=>{return~s&&(e[s]=(r=e[s],(t=isnode(r)&&transforms[r[0]])?t(r):r),s=-1);var r,t};for(r of operators){for(s=-1,t=1;t<e.length;)o=e[t-2],l=e[t-1],n=e[t],a="string"==typeof l&&r[l],a&&!operator(n)&&t>1&&!operator(o)?1==r[l].length?(i(),t++):s==t-2&&o[0]==l?(o.push(n),e.splice(t-1,2)):(i(),e.splice(s=t-2,3,[l,e[s],n])):a&&!operator(n)?(e.splice(s=t-1,2,[l,n]),t--):(i(),t++);i()}return e.length>1?e:e[0]};return e=t()},evaluate=(e,r={})=>isnode(e)?(isnode(e[0])?evaluate(e[0]):"string"==typeof e[0]?r[e[0]]||operator(e[0],e.length-1):e[0])(...e.slice(1).map((e=>evaluate(e,r)))):"string"==typeof e?quotes[e[0]]?e.slice(1,-1):r[e]:e;export default e=>(e="string"==typeof e?parse(e):e,r=>evaluate(e,r));
+const e=e=>e>=48&&e<=57,r=e=>e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192,t=t=>r(t)||e(t),n=e=>e<=32,s=e=>!quotes[String.fromCharCode(e)],a=(e,r=binary,t,n,s)=>{for(s=r.length;s--;)if(n=r[s][e])return t?n:s+1},o=(e,r)=>Array.isArray(e)&&e.length&&e[0]&&(r?e[0]===r:"string"==typeof e[0]||o(e[0])),l=e=>e.length<2?e[0]:e,u=Symbol.for("nil");export const literals={true:!0,false:!1,null:null},blocks={"(":")","[":"]"},quotes={'"':'"'},comments={},unary=[{"!":e=>!e,"+":e=>+e,"-":e=>-e,"++":e=>++e,"--":e=>--e},{}],binary=[{"||":(...e)=>e.some(Boolean)},{"&&":(...e)=>e.every(Boolean)},{"|":(e,r)=>e|r},{"^":(e,r)=>e^r},{"&":(e,r)=>e&r},{"!=":(e,r)=>e!=r,"==":(e,r)=>e==r},{">=":(e,r)=>e>=r,">":(e,r)=>e>r,"<=":(e,r)=>e<=r,"<":(e,r)=>e<r},{">>>":(e,r)=>e>>>r,">>":(e,r)=>e>>r,"<<":(e,r)=>e<<r},{"+":(...e)=>e.reduce(((e,r)=>e+r)),"-":(...e)=>e.reduce(((e,r)=>e-r))},{"%":(...e)=>e.reduce(((e,r)=>e%r)),"/":(...e)=>e.reduce(((e,r)=>e/r)),"*":(...e)=>e.reduce(((e,r)=>e*r))},{".":(...e)=>e.reduce(((e,r)=>e?e[r]:e))}],transforms={"(":e=>e.length<3?e[1]:e},transform=(e,r)=>(r=o(e)&&transforms[e[0]])?r(e):e,parse=(i,f=0,c=i.length)=>{const p=()=>i.charAt(f),h=()=>i.charCodeAt(f),g=e=>(e=>{throw new Error(e)})(e+" at character "+f),y=(e,r=h())=>{for(;f<c&&e(r);)r=i.charCodeAt(++f);return f},m=e=>i.slice(f,y(e)),d=e=>{let r,t=[];for(;f<c&&(r=p())!==e;)";"===r||","===r?f++:(t.push(v()),y(n));return e&&f++,t},b=(e=binary,r,t=3)=>{for(y(n);!a(r=i.substr(f,t--),e);)if(!t)return;return f+=r.length,r},v=()=>{let e,r,t,n,s,o,l,i;if(u!=(s=x())){if(!(r=b()))return s;for(u==(o=x())&&g("Expected expression after "+r),n=[s,[r,a(r)||0],o];(i=b())&&(t=a(i));){for(;n.length>2&&n[n.length-2][1]>=t;)o=n.pop(),r=n.pop()[0],s=n.pop(),n.push([r,s,o]);u==(e=x())&&g("Expected expression after "+i),n.push([i,t],e)}for(l=n.length-1,e=n[l];l>1;)e=[n[l-1][0],n[l-2],e],l-=2;return e}},x=()=>{let a,i,c,v;if(y(n),a=h(),i=p(),e(a)||"."===i)v=new Number(A());else if(s(a))if(blocks[i])f++,w=[i,...d(blocks[i])],v=(C=o(w)&&transforms[w[0]])?C(w):w;else{if(!r(a))return(c=b(unary))?u==(v=x())?g("missing unaryOp argument"):[c,v]:u;v=(v=m(t))in literals?literals[v]:v}else f++,v=new String(m(s)),f++;for(var w,C;y(n),i=p(),"."===i||"["===i||"("===i;)f++,y(n),"["===i?(v=[".",v]).push(l(d("]"))):"("===i?v=[v,...d(")")]:"."===i&&(v=[".",v]).push(m(t));return v},A=()=>{let r="",t=p();return r+=m(e),"."===p()&&(r+=i.charAt(f++)+m(e)),t=p(),"e"!==t&&"E"!==t||(r+=t,f++,t=p(),"+"!==t&&"-"!==t||(r+=t,f++),r+=m(e)),r};return l(d())},evaluate=(e,r={},t,n)=>o(e)?"."==(t=e[0])?a(t,binary,!0)(evaluate(e[1],r),...e.slice(2)):("string"==typeof t&&(n=a(t,e.length<3?unary:binary,!0)),"function"!=typeof(t=n||evaluate(t,r))?t:t.call(...e.map((e=>evaluate(e,r))))):e&&"string"==typeof e?quotes[e[0]]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e;export default e=>(e="string"==typeof e?parse(e):e,r=>evaluate(e,r));