subscript 2.0.0 → 3.0.3

package/README.md

@@ -1,12 +1,11 @@
 # <!--<img alt="subscript" src="/subscript2.svg" height=42/>--> sub͘<em>script</em> <!--<sub>SUB͘<em>SCRIPT</em></sub>-->
 
-_Subscript_ is micro-language with common syntax subset of C++, JS, Java, Python, Go, Rust.<br/>
+_Subscript_ is micro-language with common syntax subset of C++, JS, Java, Python, Go, Rust, Swift, Objective C, Kotlin etc.<br/>
 
-* Everyone knows _subscript_ syntax
-* Any _subscript_ fragment can be copy-pasted to a target language and it will work
+* Well-known syntax
+* Any _subscript_ fragment can be copy-pasted to any target language
 * It's tiny <sub>![npm bundle size](https://img.shields.io/bundlephobia/minzip/subscript/latest?color=brightgreen&label=gzip)</sub>
-* It's fast ([see performance](#performance))
-* Enables operators overloading
+* It's very fast ([see performance](#performance))
 * Configurable & extensible
 * Trivial to use...
 
@@ -16,65 +15,33 @@ let fn = subscript(`a.b + c(d - 1)`)
 fn({ a: { b:1 }, c: x => x * 2, d: 3 }) // 5
 ```
 
-## Useful in:
+## Motivation
 
-* templates (awesome match with [template parts](https://github.com/github/template-parts))
-* expressions evaluators (math, arithmetic)
-* subsets of languages (eg. jessie, justin) <!-- see sonr -->
-* prototyping language features (eg. pipe operator)
-* simulating languages (eg. glsl <!--, FORTRAN?, COBOL?-->)
-* sandboxes, playgrounds
-* safe, secure eval
-* custom DSL
+_Subscript_ is designed to be useful for:
 
-```html
-<!-- template-parts proposal -->
-<template id="timer">
-  <time datetime="{{ date.toUTCString() }}">{{ date.toLocaleTimeString() }}</time>
-</template>
-```
-
-## Lispy tree
-
-It compiles code to lispy calltree (compatible with [frisk](https://npmjs.com/frisk)). Why?
+* templates (perfect match with [template parts](https://github.com/github/template-parts))
+* expressions evaluators, calculators
+* subsets of languages (eg. [justin](#justin)) <!-- see sonr, mineural -->
+* mocking language features (eg. pipe operator)
+* sandboxes, playgrounds, safe eval
+* custom DSL
 
-+ minimal possible AST overhead
-+ clear operators precedence
-+ overloading operators by context 
-+ simple manual evaluation, debugging
-+ conventional form
-+ one-liner docs...
+[_Jsep_](https://github.com/EricSmekens/jsep) is generally fine for the listed tasks, unless you design a tiny module and prefer to keep dependencies as small as possible.
+_Subscript_ has [2.5kb](https://npmfs.com/package/subscript/3.0.0/subscript.min.js) footprint vs [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_, with same or better performance. It also has more open API and generates lispy calltree (compatible with [frisk](https://npmjs.com/frisk)), compared to esprima AST: minimal possible overhead, clear precedence, overloading by context, manual evaluation, debugging, conventional form, one-liner docs:
 
 ```js
 import {evaluate} from 'subscript.js'
-evaluate(['+', ['*', 'min', 60], '"sec"'], { min: 5 }) // min*60 + "sec" == "300sec"
-```
 
-## Core primitives
-
-By default subscript reserves:
-
-* `[]`, `()` groups
-* `true`, `false`, `null` literals
-* `"` quotes.
-
-All primitives are extensible via `parse.literal`, `parse.quote`, `parse.group`, `parse.comment` dicts.
-
-```js
-import { parse } from 'subscript.js'
+evaluate(['+', ['*', 'min', 60], '"sec"'], { min: 5 }) // min*60 + "sec" == "300sec"
+``` 
 
-parse.quote["'"] = "'"
-parse.comment["//"] = "\n"
-
-parse(`'a' + 'b' // concat`) // ['+', 'a':String, 'b':String]
-```
 
 ## Operators
 
 Default operators include common operators for the listed languages in the following precedence:
 
-* `.`, `(…)`, `…(…)`, `…[…]`
-* `! + - ++ --` prefix
+* `++ --` unary postfix
+* `! + - ++ --` unary prefix
 * `* / %`
 * `+ -`
 * `<< >> >>>`
@@ -86,7 +53,7 @@ Default operators include common operators for the listed languages in the follo
 * `&&`
 * `||`
 
-All other operators can be extended via `parse.binary`, `parse.prefix`, `parse.postfix` and `evaluate.operator`.
+All other operators can be extended via `parse.binary`, `parse.unary` and `evaluate.operator`.
 
 ```js
 import { parse, evaluate } from 'subscript.js'
@@ -107,24 +74,21 @@ let tree = parse(`
 evaluate(tree, { Math, map, take, interval, gaussian })
 ```
 
-## Transforms
-
-Transform rules are applied to raw parsed calltree groups, eg.:
+## Extending
 
-* 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"']`
+By default subscript detects the following tokens:
 
-That can be used to organize ternary/combining operators:
+* `"` strings
+* `1.2e+3` floats
+* `true`, `false`, `null` literals
+* `()` expression groups or fn calls
+* `.`, `[]` property access
 
-```js
-import { parse, evaluate } from 'subscript.js'
+Literals can be extended via `parse.literal` dict.
 
-evaluate.operator['?:'] = (a,b) => a ? b : c
-parse.binary[':'] = parse.binary['?'] = 5
-parse.map[':'] = node => node[1][0]=='?' ? ['?:',node[1][1],node[1][2],node[2]] : node // [:, [?, a, b], c] → [?:, a, b, c]
+Token parsers are extensible via `parse.token` list, can be added support of _regex_, _array_, _object_, _interpolated string_ and others.
 
-parse('a ? b : c') // ['?:', 'a', 'b', 'c']
-```
+Postfix parsers are applied to parsed tokens and can be used to provide _property chains_, _function calls_, _postfix operators_, _token mapping_, _ternary operators_ and so on. They're extensible via `parse.postfix`.
 
 
 ## Justin
@@ -134,20 +98,24 @@ It adds support for:
 
 + `**` binary operator
 + `~` unary operator
++ `'` strings
 + `?:` ternary operator
 + `[...]` Array literal
 + `{...}` Object literal
 + `in` binary operator
 + `;` expression separator
-+ `//, /* */` comments
-+ `undefined` literal
++ unary word operators
+<!-- + `//, /* */` comments -->
+<!-- + `undefined` literal -->
+<!-- + `?` chaining operator -->
 <!-- + `...x` unary operator -->
 <!-- + strings interpolation -->
 
 ```js
-import { parse } from 'subscript/justin.js'
+import { parse, evaluate } from 'subscript/justin.js'
 
-let tree = parse('{x:1, "y":2+2}["x"]') // ['[', {x:1, y: ['+', 2, 2]}, '"x"']
+let xy = parse('{ x: 1, "y": 2+2 }["x"]') // ['[', {x:1, y: ['+', 2, 2]}, '"x"']
+evaluate(xy)  // 1
 ```
 
 <!--
@@ -155,6 +123,27 @@ let tree = parse('{x:1, "y":2+2}["x"]') // ['[', {x:1, y: ['+', 2, 2]}, '"x"']
 
 These are custom DSL operators snippets for your inspiration:
 
+
+```html
+template-parts proposal
+<template id="timer">
+  <time datetime="{{ date.toUTCString() }}">{{ date.toLocaleTimeString() }}</time>
+</template>
+```
+
+// a.b.c
+// (node, c) => c === PERIOD ? (index++, space(), ['.', node, '"'+id()+'"']) : node,
+
+// a[b][c]
+// (node, c) => c === OBRACK ? (index++, node=['.', node, expr(CBRACK)], index++, node) : node,
+
+// a(b)(c)
+// (node, c, arg) => c === OPAREN ? (
+//   index++, arg=expr(CPAREN),
+//   node = Array.isArray(arg) && arg[0]===',' ? (arg[0]=node, arg) : arg == null ? [node] : [node, arg],
+//   index++, node
+// ) : node,
+
 <details>
   <summary>Keyed arrays <code>[a:1, b:2, c:3]</code></summary>
 
@@ -254,6 +243,16 @@ These are custom DSL operators snippets for your inspiration:
   ```
 
 </details>
+
+like versions, units, hashes, urls, regexes etc
+
+2a as `2*a`
+
+string interpolation ` ${} 1 ${} `
+
+keyed arrays? [a:1, b:2, c:3]
+
+Examples: sonr, template-parts, neural-chunks
 -->
 
 ## Performance
@@ -264,11 +263,11 @@ Subscript shows relatively good performance within other evaluators:
 // 1 + (a * b / c % d) - 2.0 + -3e-3 * +4.4e4 / f.g[0] - i.j(+k == 1)(0)
 // parse 30k times
 
-expr-eval: 712 ms
-subscript: 336 ms
-jsep: 278 ms
+subscript: ~280 ms
+jsep: ~281 ms
+expr-eval: ~480 ms
 jexl: ~1200 ms
-new Function: 1466 ms
+new Function: ~1400 ms
 ```
 
 ## See also
@@ -280,6 +279,6 @@ new Function: 1466 ms
 * [expression-eval](https://github.com/donmccurdy/expression-eval)
 * [jsep](https://github.com/EricSmekens/jsep)
 * [string-math](https://github.com/devrafalko/string-math)
-
+* [nerdamer](https://github.com/jiggzson/nerdamer)
 
 <p align=center>🕉</p>

package/evaluate.js

@@ -0,0 +1,57 @@
+export const isCmd = a => Array.isArray(a) && (typeof a[0] === 'string' || isCmd(a[0])),
+
+// calltree → result
+evaluate = (s, ctx={}, c, op) => {
+  if (isCmd(s)) {
+    c = s[0]
+    if (typeof c === 'string') op = operator[c]
+    c = op || evaluate(c, ctx) // [[a,b], c]
+    if (typeof c !== 'function') return c
+
+    return c.call(...s.map(a => evaluate(a,ctx)))
+  }
+  if (s && typeof s === 'string')
+    return s[0] === '"' ? s.slice(1,-1)
+          : s[0]==='@' ? s.slice(1)
+          : s in ctx ? ctx[s] : s
+
+  return s
+},
+
+// op evaluators
+// multiple args allows shortcuts, lisp compatible, easy manual eval, functions anyways take multiple arguments
+operator = evaluate.operator = {
+  '!':a=>!a,
+  '++':a=>++a,
+  '--':a=>--a,
+
+  '.':(...a)=>a.reduce((a,b)=>a?a[b]:a),
+
+  '%':(...a)=>a.reduce((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)=>a.length < 2 ? -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,
+  '<=':(a,b)=>a<=b,
+  '<':(a,b)=>a<b,
+
+  '!=':(a,b)=>a!=b,
+  '==':(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))
+}
+
+export default evaluate

package/justin.js

@@ -1,68 +1,97 @@
 // justin lang https://github.com/endojs/Jessie/issues/66
-import {binary, unary, transforms, groups, comments, quotes, literals} from './subscript.js'
+import {evaluate, operator} from './evaluate.js'
+import {parse, binary, unary, postfix, token, literal,
+        code, char, skip, space, expr} from './parse.js'
 
 // undefined
-literals['undefined'] = undefined
+literal['undefined'] = undefined
+
+// "' with /
+token[2] = (q, qc, c, str) => {
+  if (q !== 34 && q !== 39) return
+  qc = char(), skip(), str = ''
+  while (c=code(), c-q) {
+    if (c === 92) skip(), str += escape[char()] || char(); else str+=char()
+    skip()
+  }
+  return skip(), qc + str + qc
+}
+const escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'}
+
+// unary word
+postfix.push((node, prec) => typeof node === 'string' && (prec=unary[node]) ? [node, expr(prec)] : node)
+
+// detect custom operators
+token[3] = name => (name = skip(c =>
+  (
+    (c >= 48 && c <= 57) || // 0..9
+    (c >= 65 && c <= 90) || // A...Z
+    (c >= 97 && c <= 122) || // a...z
+    c == 36 || c == 95 || // $, _,
+    c >= 192 // any non-ASCII
+  ) && !binary[String.fromCharCode(c)]
+)),
+
 
 // **
-binary.splice(2,0,{'**': (...args)=>args.reduceRight((a,b)=>Math.pow(b,a))})
+binary['**'] = 16
+operator['**'] = (...args)=>args.reduceRight((a,b)=>Math.pow(b,a))
 
 // ~
-unary[1]['~'] = a=>~a
+unary['~'] = 17
+operator['~'] = a=>~a
 
 // ...
 // unary[1]['...']=true
 
 // ;
-binary[binary.length-1][';'] = binary[binary.length-1][',']
+binary[';'] = 1
 
 // ?:
-binary.splice(binary.length-2,0, {':':(a,b)=>[a,b], '?':(a,b)=>a??b, '?:':(a,b,c)=>a?b:c})
-transforms[':'] = node => node[1][0]=='?' ? ['?:',node[1][1],node[1][2],node[2]] : node // [:, [?, a, b], c] → [?:, a, b, c]
-
-// {}
-groups['{']='}'
+operator['?:']=(a,b,c)=>a?b:c
+postfix.push(node => {
+  let a, b
+  if (code() !== 63) return node
+  skip(), space(), a = expr(-1,58)
+  if (code() !== 58) return node
+  skip(), space(), b = expr()
+  return ['?:',node, a, b]
+})
 
 // /**/, //
-comments['/*']='*/'
-comments['//']='\n'
+// comments['/*']='*/'
+// comments['//']='\n'
 
 // in
-binary[5]['in'] = (a,b)=>a in b
-transforms['in'] = n => (n[1]=`"${n[1]}"`, n)
-
-// {}, []
-unary[0]['['] = binary[0]['['] = (...args) => Array(...args)
-transforms['['] = n => n.length > 2 ? ['.',n[1],n[2]] :
-  n[1]==='' ? [n[0]] : [n[0], ...(n[1][0]===','?n[1].slice(1).map(x=>x===''?undefined:x):[n[1]])]
-
-groups['{']='}'
-unary[0]['{'] = binary[binary.length-2]['{'] = (...args)=>Object.fromEntries(args)
-binary[binary.length-2][':']=(a,b)=>[a,b]
-transforms['{'] = (s, args) => {
-  if (s[1]==='') args = []
-  else if (s[1][0]==':') args = [s[1]]
-  else if (s[1][0]==',') args = s[1].slice(1)
+evaluate.operator['in'] = (a,b)=>a in b
+parse.postfix.unshift(node => (char(2) === 'in' ? (skip(2), ['in', '"' + node + '"', expr()]) : node))
+
+// []
+operator['['] = (...args) => Array(...args)
+token.push((node, arg) =>
+  code() === 91 ?
+  (
+    skip(), arg=expr(-1,93),
+    node = arg==null ? ['['] : arg[0] === ',' ? (arg[0]='[',arg) : ['[',arg],
+    skip(), node
+  ) : null
+)
+
+// {}
+binary[':'] = 2
+token.unshift((node) => code() === 123 ? (skip(), node = map(['{',expr(-1,125)]), skip(), node) : null)
+operator['{'] = (...args)=>Object.fromEntries(args)
+operator[':'] = (a,b)=>[a,b]
+
+const map = (n, args) => {
+  if (n[1]==null) args = []
+  else if (n[1][0]==':') args = [n[1]]
+  else if (n[1][0]==',') args = n[1].slice(1)
   return ['{', ...args]
 }
 
-// groups ['{']='}'
-// binary.unshift({'[':a=>Array(...a), '{':a=>Object.fromEntries(a)})
-// transforms['['] = s => s.length > 2 ? s
-//   : s[1] === undefined
-//   ? [Array]
-//   // ['[',[',',a,[',',b],c]] → ['[',[',',a,,b,c]]
-//   : [Array].concat(isnode(s[1]) ? s[1].slice(1).reduce((a,b)=>a.push(...(isnode(b)&&b[0]==','?(b[0]=undefined,b):[b]))&&a,[])
-//   : s[1])
-// transforms['{'] = (s,entries) => {
-//   if (s[1]===undefined) return {}
-//   if (s[1][0]==':') entries = [s[1].slice(1)]
-//   else entries = s[1].slice(1).map(n=>n.slice(1))
-//   entries = entries.map(n=>quotes[n[0][0]]?[n[0].slice(1,-1),n[1]]:n)
-//   return Object.fromEntries(entries)
-// }
 
 // TODO: strings interpolation
 
 export { default } from './subscript.js';
-export * from './subscript.js'
+export { parse, evaluate }

package/justin.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,o,s)=>{if(e&&"string"==typeof e&&!quotes[e[0]])for(s=operators.length;s--;)if((o=operators[s][e])&&1==r?o.length==r:o)return o},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 o=(n,a="",l,i,p,c,u,f=[])=>{const d=e=>{""!==a&&f.push(l?parseFloat(a):a in literals?literals[a]:a),e&&f.push(e),l=a=i=""};for(;r<=e.length;a+=i)if(c=(p=(i=e[r++])+e[r])+e[r+1],!l||"e"!=i&&"E"!=i)if(space.includes(i))d();else if(u=comments[p]||comments[i])d(),s(e,u);else if(u=quotes[c]||quotes[p]||quotes[i])a=i+e.slice(r,s(e,u)),d();else if(u=blocks[i])d(i),f.push(o(u));else if(!a&&i>="0"&&i<="9"||"."==i&&e[r]>="0"&&e[r]<="9")l=1;else{if(i==n)return d(),t(f);(operator(i=c)||operator(i=p)||operator(i=i[0]))&&(r+=i.length-1,(i.toLowerCase()==i.toUpperCase()||!a&&space.includes(e[r]))&&d(i))}else i+=e[r++]},s=(e,o,s)=>r=(r=e.indexOf(o,r))<0?e.length:r+o.length,t=e=>{if(!e.length)return;let r,o,s,t,n,a,l;const i=()=>{return~s&&(e[s]=(r=e[s],(o=isnode(r)&&transforms[r[0]])?o(r):r),s=-1);var r,o};for(r of operators){for(s=-1,o=1;o<e.length;)t=e[o-2],a=e[o-1],n=e[o],l="string"==typeof a&&r[a],l&&!operator(n)&&o>1&&!operator(t)?1==r[a].length?(i(),o++):s==o-2&&t[0]==a?(t.push(n),e.splice(o-1,2)):(i(),e.splice(s=o-2,3,[a,e[s],n])):l&&!operator(n)?(e.splice(s=o-1,2,[a,n]),o--):(i(),o++);i()}return e.length>1?e:e[0]};return e=o()},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));operators.splice(2,0,{"**":(...e)=>e.reduceRight(((e,r)=>Math.pow(r,e)))}),operators[1]["~"]=e=>~e,operators[operators.length-1][";"]=operators[operators.length-1][","],operators.splice(operators.length-2,0,{":":(e,r)=>[e,r],"?":(e,r)=>e??r,"?:":(e,r,o)=>e?r:o}),transforms[":"]=e=>"?"==e[1][0]?["?:",e[1][1],e[1][2],e[2]]:e,blocks["{"]="}",comments["/*"]="*/",comments["//"]="\n",operators[5].in=(e,r)=>e in r,transforms.in=e=>(e[1]=`"${e[1]}"`,e),blocks["{"]="}",operators.unshift({"[":e=>Array(...e),"{":e=>Object.fromEntries(e)}),transforms["["]=e=>e.length>2?e:void 0===e[1]?[Array]:[Array].concat(isnode(e[1])?e[1].slice(1).reduce(((e,r)=>e.push(...isnode(r)&&","==r[0]?(r[0]=void 0,r):[r])&&e),[]):e[1]),transforms["{"]=(e,r)=>void 0===e[1]?{}:(r=(r=":"==e[1][0]?[e[1].slice(1)]:e[1].slice(1).map((e=>e.slice(1)))).map((e=>quotes[e[0][0]]?[e[0].slice(1,-1),e[1]]:e)),Object.fromEntries(r));
+var r,e,n,t,l=r=>Array.isArray(r)&&("string"==typeof r[0]||l(r[0])),o=(r,e={},n,t)=>l(r)?("string"==typeof(n=r[0])&&(t=u[n]),"function"!=typeof(n=t||o(n,e))?n:n.call(...r.map((r=>o(r,e))))):r&&"string"==typeof r?'"'===r[0]?r.slice(1,-1):"@"===r[0]?r.slice(1):r in e?e[r]:r:r,u=o.operator={"!":r=>!r,"++":r=>++r,"--":r=>--r,".":(...r)=>r.reduce(((r,e)=>r&&r[e])),"%":(...r)=>r.reduce(((r,e)=>r%e)),"/":(...r)=>r.reduce(((r,e)=>r/e)),"*":(...r)=>r.reduce(((r,e)=>r*e)),"+":(...r)=>r.reduce(((r,e)=>r+e)),"-":(...r)=>r.length<2?-r:r.reduce(((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,"&&":(...r)=>r.every(Boolean),"||":(...r)=>r.some(Boolean),",":(...r)=>r.reduce(((r,e)=>e))},i=o,a=(t,l)=>(e=t,r=n=0,l=c(),r<e.length?p():l),s=()=>e.charCodeAt(r),f=(n=1)=>e.substr(r,n),p=(e="Bad syntax "+f())=>{throw Error(e+" at "+r)},d=(n=1,t=r)=>{if("number"==typeof n)r+=n;else for(;n(s());)++r>e.length&&p("End by "+n);return r>t?e.slice(t,r):null},h=()=>{for(;s()<=32;)r++},y=(e,t,l,o=3)=>{if(r&&n&&n[3]===r)return n;for(;o;)if(null!=(l=e[t=f(o--)]))return n=[t,l,t.length,r]},c=(e=-1,n)=>{h();let l,o,u,i,a=s(),d=0,g=r;if(n){if(a===n)return;i=t,t=n}for(;g===r&&d<b.length;)o=b[d++](a);if(g===r)(l=y(m))&&(r+=l[2],o=[l[0],c(l[1])]);else for(h(),a=s(),d=0;d<A.length;)(u=A[d](o,a))!==o?(o=u,h(),a=s()):d++;for(;a=s()&&a!==t&&(l=y(w))&&l[1]>e;){o=[l[0],o];do{r+=l[2],o.push(c(l[1]))}while(f(l[2])===l[0]);h()}return n&&(t=s()!==n?p("Unclosed paren"):i),o},g=r=>d((r=>r>=48&&r<=57||r>=65&&r<=90||r>=97&&r<=122||36==r||95==r||r>=192)),b=a.token=[r=>{if(r=d((r=>r>=48&&r<=57||46===r)))return(69===s()||101===s())&&(r+=d(2)+d((r=>r>=48&&r<=57))),isNaN(r=parseFloat(r))?p("Bad number"):r},(e,n)=>40===e?(r++,n=c(-1,41),r++,n):null,(e,n)=>34===e?(n=f(),r++,n+d((r=>r-e))+(r++,n)):null,g],v=a.literal={true:!0,false:!1,null:null},A=a.postfix=[(n,t,l)=>(46===t?(r++,h(),n=[".",n,'"'+g()+'"']):91===t?(r++,n=[".",n,c(-1,93)],r++):40===t?(r++,l=c(-1,41),n=Array.isArray(l)&&","===l[0]?(l[0]=n,l):null==l?[n]:[n,l],r++):43!==t&&45!==t||e.charCodeAt(r+1)!==t?"string"==typeof n&&v.hasOwnProperty(n)&&(n=v[n]):n=[d(2),n],n)],m=a.unary={"-":17,"!":17,"+":17,"++":17,"--":17},w=a.binary={",":1,"||":6,"&&":7,"|":8,"^":9,"&":10,"==":11,"!=":11,"<":12,">":12,"<=":12,">=":12,"<<":13,">>":13,">>>":13,"+":14,"-":14,"*":15,"/":15,"%":15},x=a,B=r=>(r="string"==typeof r?x(r):r,e=>i(r,e));v.undefined=void 0,b[2]=(r,e,n,t)=>{if(34===r||39===r){for(e=f(),d(),t="";(n=s())-r;)92===n?(d(),t+=C[f()]||f()):t+=f(),d();return d(),e+t+e}};var C={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"};A.push(((r,e)=>"string"==typeof r&&(e=m[r])?[r,c(e)]:r)),b[3]=r=>d((r=>(r>=48&&r<=57||r>=65&&r<=90||r>=97&&r<=122||36==r||95==r||r>=192)&&!w[String.fromCharCode(r)])),w["**"]=16,u["**"]=(...r)=>r.reduceRight(((r,e)=>Math.pow(e,r))),m["~"]=17,u["~"]=r=>~r,w[";"]=1,u["?:"]=(r,e,n)=>r?e:n,A.push((r=>{let e,n;return 63!==s()||(d(),h(),e=c(-1,58),58!==s())?r:(d(),h(),n=c(),["?:",r,e,n])})),o.operator.in=(r,e)=>r in e,a.postfix.unshift((r=>"in"===f(2)?(d(2),["in",'"'+r+'"',c()]):r)),u["["]=(...r)=>Array(...r),b.push(((r,e)=>91===s()?(d(),r=null==(e=c(-1,93))?["["]:","===e[0]?(e[0]="[",e):["[",e],d(),r):null)),w[":"]=2,b.unshift((r=>123===s()?(d(),r=E(["{",c(-1,125)]),d(),r):null)),u["{"]=(...r)=>Object.fromEntries(r),u[":"]=(r,e)=>[r,e];var E=(r,e)=>(null==r[1]?e=[]:":"==r[1][0]?e=[r[1]]:","==r[1][0]&&(e=r[1].slice(1)),["{",...e]);export{B as default,o as evaluate,a as parse};

package/package.json

@@ -1,18 +1,28 @@
 {
   "name": "subscript",
-  "version": "2.0.0",
+  "version": "3.0.3",
   "description": "Microlanguage with common syntax for JS/C++/Python/Rust",
   "main": "subscript.js",
+  "type": "module",
   "files": [
+    "parse.js",
+    "evaluate.js",
+    "subscript.js",
     "subscript.min.js",
     "justin.js",
     "justin.min.js"
   ],
   "directories": {
-    "lib": "lib"
+    "lib": "lib",
+    "src": "src",
+    "test": "test"
   },
   "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1"
+    "build": "esbuild subscript.js --bundle --format=esm --minify --outfile=subscript.min.js",
+    "minify": "terser subscript.min.js -o subscript.min.js --module -c passes=3 -m",
+    "build-justin": "esbuild justin.js --bundle --format=esm --minify --outfile=justin.min.js",
+    "minify-justin": "terser justin.min.js -o justin.min.js --module -c passes=3 -m",
+    "test": "node test"
   },
   "repository": {
     "type": "git",
@@ -33,12 +43,18 @@
     "dsl",
     "json",
     "calculator",
-    "calc"
+    "calc",
+    "lisp",
+    "frisk"
   ],
   "author": "Dmitry Iv.",
   "license": "ISC",
   "bugs": {
     "url": "https://github.com/spectjs/subscript/issues"
   },
-  "homepage": "https://github.com/spectjs/subscript#readme"
+  "homepage": "https://github.com/spectjs/subscript#readme",
+  "devDependencies": {
+    "esbuild": "^0.13.14",
+    "terser": "^5.10.0"
+  }
 }

package/parse.js

@@ -0,0 +1,134 @@
+const PERIOD = 46, OPAREN = 40, CPAREN = 41, OBRACK = 91, CBRACK = 93, PLUS = 43, MINUS = 45
+
+export let index, current, lastOp, end
+
+export const parse = (str, tree) => (current=str, index=lastOp=0, tree=expr(), index < current.length ? err() : tree),
+
+// ------------ util
+code = () => current.charCodeAt(index), // current char code
+char = (n=1) => current.substr(index, n), // skip n chars
+err = (msg='Bad syntax '+char()) => { throw Error(msg + ' at ' + index) },
+skip = (is=1, from=index) => { // consume N or until condition matches
+  if (typeof is === 'number') index += is
+  else while (is(code())) ++index > current.length && err('End by ' + is) // 1 + true === 2;
+  return index > from ? current.slice(from, index) : null
+},
+space = () => { while (code() <= 32) index++ },
+
+// ------------- expr
+// consume operator
+operator = (ops, op, prec, l=3) => {
+  // memoize by index - saves 20% to perf
+  if (index && lastOp && lastOp[3] === index) return lastOp
+
+  // ascending lookup is faster for 1-char operators, longer for 2+ char ops, so we use descending
+  while (l) if ((prec=ops[op=char(l--)])!=null) return lastOp = [op, prec, op.length, index] //opinfo
+},
+
+expr = (prec=-1, curEnd) => {
+  space()
+
+  let cc = code(), op, node, i=0, mapped, from=index, prevEnd
+
+  if (curEnd) if (cc === curEnd) return; else prevEnd = end, end = curEnd // global end marker saves operator lookups
+
+  // parse node by token parsers (direct loop is faster than token.find)
+  while (from===index && i < token.length) node = token[i++](cc)
+
+  // unary prefix
+  if (from===index) (op = operator(unary)) && (index += op[2], node = [op[0], expr(op[1])])
+
+  // postfix handlers
+  else {
+    for (space(), cc=code(), i=0; i < postfix.length;)
+      if ((mapped = postfix[i](node, cc)) !== node) node = mapped, space(), cc=code(); else i++
+  }
+  // ALT: seems to be slower
+  // else do {space(), cc=code()} while (postfix.find((parse, mapped) => (mapped = parse(node, cc)) !== node && (node = mapped)))
+
+  // consume binary expression for current precedence or higher
+  while (cc = code() && (cc !== end) && (op = operator(binary)) && op[1] > prec) {
+    node = [op[0], node]
+    // consume same-op group, do..while both saves op lookups and space
+    do { index += op[2], node.push(expr(op[1])) } while (char(op[2]) === op[0])
+    space()
+  }
+
+  if (curEnd) end = code() !== curEnd ? err('Unclosed paren') : prevEnd
+  // if (node == null) err('Missing argument')
+
+  return node;
+},
+
+// ------------------- tokens
+// 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
+float = (number) => {
+  if (number = skip(c => (c >= 48 && c <= 57) || c === PERIOD)) {
+    if (code() === 69 || code() === 101) number += skip(2) + skip(c => c >= 48 && c <= 57)
+    return isNaN(number = parseFloat(number)) ? err('Bad number') : number
+  }
+},
+
+// "a"
+string = (q, qc) => q === 34 ? (qc = char(), index++, qc) + skip(c => c-q) + (index++, qc) : null,
+
+// (...exp)
+group = (c, node) => c === OPAREN ? (index++, node = expr(-1,CPAREN), index++, node) : null,
+
+// var or literal
+id = name => (name = skip(c =>
+  (
+    (c >= 48 && c <= 57) || // 0..9
+    (c >= 65 && c <= 90) || // A...Z
+    (c >= 97 && c <= 122) || // a...z
+    c == 36 || c == 95 || // $, _,
+    c >= 192 // any non-ASCII
+  )
+)),
+
+// ----------- config
+token = parse.token = [ float, group, string, id ],
+
+literal = parse.literal = {true:true, false:false, null:null},
+
+postfix = parse.postfix = [
+  // postfix parsers merged into 1 for performance & compactness
+  (node, cc, arg) => {
+    // a.b[c](d)
+    if (cc === PERIOD) index++, space(), node = ['.', node, '"'+id()+'"']
+    else if (cc === OBRACK) index++, node = ['.', node, expr(-1,CBRACK)], index++
+    else if (cc === OPAREN)
+      index++, arg=expr(-1,CPAREN),
+      node = Array.isArray(arg) && arg[0]===',' ? (arg[0]=node, arg) : arg == null ? [node] : [node, arg],
+      index++
+
+    // a++, a--
+    else if ((cc===0x2b || cc===0x2d) && current.charCodeAt(index+1)===cc) node = [skip(2), node]
+
+    // literal
+    else if (typeof node === 'string' && literal.hasOwnProperty(node)) node = literal[node]
+
+    return node
+  }
+],
+
+unary = parse.unary = {
+  '-': 17,
+  '!': 17,
+  '+': 17,
+  '++': 17,
+  '--': 17
+},
+
+binary = parse.binary = {
+  ',': 1,
+  '||': 6, '&&': 7, '|': 8, '^': 9, '&': 10,
+  '==': 11, '!=': 11,
+  '<': 12, '>': 12, '<=': 12, '>=': 12,
+  '<<': 13, '>>': 13, '>>>': 13,
+  '+': 14, '-': 14,
+  '*': 15, '/': 15, '%': 15
+}
+
+
+export default parse

package/subscript.js

@@ -1,177 +1,5 @@
-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 => isDigit(c) || isIdentifierStart(c),
-  isSpace = c => c <= 32,
-  isCmd = (a,op) => Array.isArray(a) && a.length && a[0] && (op ? a[0]===op : typeof a[0] === 'string' || isCmd(a[0])),
-  map = (node, t) => isCmd(node) ? (t = parse.map[node[0]], t?t(node):node) : node
-
-const parse = (expr, index=0, curOp, curEnd) => {
-  const char = (n=1) => expr.substr(index, n), // get next n chars (as fast as expr[index])
-  code = () => expr.charCodeAt(index),
-
-  err = msg => {throw Error(msg + ' at ' + index)},
-
-  // skip index until condition matches
-  skip = is => { while (index < expr.length && is(code())) index++ },
-
-  // skip index, return skipped part
-  consume = is => expr.slice(index, (skip(is), index)),
-
-  // consume operator that resides within current group by precedence
-  consumeOp = (ops, op, prec, l=3) => {
-    if (index >= expr.length) return
-
-    // memoize by index - saves 20% to perf
-    if (index && curOp[3] === index) return curOp
-
-    // don't look up for end characters - saves 5-10% to perf
-    if (curEnd && curEnd === char(curEnd.length)) return
-
-    // ascending lookup is faster 1-char operators, longer for 2+ char ops
-    // for (let i=0, prec0, op0; i < l;) if (prec0=ops[op0=char(++i)]) prec=prec0,op=op0; else if (prec) return opinfo(op, prec)
-    while (l) if ((prec=ops[op=char(l--)])!=null) return curOp = [op, prec, parse.group[op], index] //opinfo
-  },
-
-  // `foo.bar(baz)`, `1`, `"abc"`, `(a % 2)`
-  consumeGroup = (group, end=curEnd) => {
-    index += group[0].length // group always starts with an operator +-b, a(b, +(b, a+b+c, so we skip it
-    if (group[2]) curEnd = group[2] // also we write root end marker
-
-    skip(isSpace);
-
-    let cc = code(), op, c = char(),
-        node='' // indicates "nothing", or "empty", as in [a,,b] - impossible to get as result of parsing
-
-    // `.` can start off a numeric literal
-    if (isDigit(cc)) node = parseInt(consume(isDigit));
-    else if (parse.quote[c]) index++, node = c + consume(c=>c!=cc) + c, index++
-    else if (isIdentifierStart(cc)) node = (node = consume(isIdentifierPart)) in parse.literal ? parse.literal[node] : node
-    // unaries can't be mixed in binary expressions loop due to operator names conflict, must be parsed before
-    else if (op = consumeOp(parse.prefix)) node = map([op[0], consumeGroup(op)])
-
-    skip(isSpace)
-
-    // consume expression for current precedence or group (== highest precedence)
-    while ((op = consumeOp(parse.binary)) && (group[2] || op[1] < group[1])) {
-      node = [op[0], node, consumeGroup(op)]
-      // consume same-op group, that also saves op lookups
-      while (char(op[0].length) === op[0]) node.push(consumeGroup(op))
-      node = map(node)
-      skip(isSpace)
-    }
-
-    // if group has end operator eg + a ) or + a ]
-    if (group[2]) index+=group[2].length, curEnd=end
-
-    return node;
-  }
-
-  return consumeGroup(curOp = ['', 108])
-},
-
-// calltree → result
-evaluate = (s, ctx={}, c, op) => {
-  if (isCmd(s)) {
-    c = s[0]
-    if (typeof c === 'string') op = evaluate.operator[c]
-    c = op || evaluate(c, ctx) // [[a,b], c]
-    if (typeof c !== 'function') return c
-
-    return c.call(...s.map(a=>evaluate(a,ctx)))
-  }
-  if (s && typeof s === 'string')
-    return parse.quote[s[0]] ? s.slice(1,-1)
-          : s[0]==='@' ? s.slice(1)
-          : s in ctx ? ctx[s] : s
-
-  return s
-}
-
-Object.assign(parse, {
-  literal: {
-    true: true,
-    false: false,
-    null: null
-  },
-  group: {'(':')','[':']'},
-  quote: {'"':'"'},
-  comment: {},
-  prefix: {
-    '-': 2,
-    '!': 2,
-    '+': 2,
-    '(': 2,
-    '++': 2,
-    '--': 2,
-    '.': 1
-  },
-  postfix: {
-    '++': 2,
-    '--': 2
-  },
-  binary: {
-    ',': 12,
-    '||': 11, '&&': 10, '|': 9, '^': 8, '&': 7,
-    '==': 6, '!=': 6,
-    '<': 5, '>': 5, '<=': 5, '>=': 5,
-    '<<': 4, '>>': 4, '>>>': 4,
-    '+': 3, '-': 3,
-    '*': 2, '/': 2, '%': 2,
-    '.': 1, '(': 1, '[': 1,
-    'e': 1, 'E': 1
-  },
-  map: {
-    '(': n => n.length < 3 ? n[1] : n.slice(1).reduce(
-        (a,b)=>[a].concat(b==='' ? [] : b[0]==',' ? b.slice(1).map(x=>x===''?undefined:x) : [b]),
-      ), // [(,a,args1,args2] → [[a,...args1],...args2]
-    '[': n => (n[0]='.',n),
-    '.': n => typeof n[1] === 'number' ? parseFloat(n.length < 3 ? '.'+n[1] : n[1]+n[0]+n[2]) : // [.,2,1] → 2.1
-      ['.',n[1],...n.slice(2).map(s=>typeof s === 'string' ? '"'+s+'"' : s)], // [.,a,b] → [.,a,"b"]
-    'e': n => parseFloat(n[1]+'e'+(Array.isArray(n[2])?n[2].join(''):n[2])),
-    'E': n => parse.map['e'](n)
-  }
-})
-
-// op evaluators
-// multiple args allows shortcuts, lisp compatible, easy manual eval, functions anyways take multiple arguments
-evaluate.operator = {
-  '!':a=>!a,
-  '++':a=>++a,
-  '--':a=>--a,
-
-  '.':(...a)=>a.reduce((a,b)=>a?a[b]:a),
-  '(':(a,...args)=>a(...args),
-  '[':(a,...args)=>a[args.pop()],
-
-  '%':(...a)=>a.reduce((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)=>a.length < 2 ? -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,
-  '<=':(a,b)=>a<=b,
-  '<':(a,b)=>a<b,
-
-  '!=':(a,b)=>a!=b,
-  '==':(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))
-}
+import parse from './parse.js'
+import evaluate from './evaluate.js'
 
 export { parse, evaluate }
 

package/subscript.min.js

@@ -1 +1 @@
-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));
+var e,r,t,n,l=(n,l)=>(r=n,e=t=0,l=y(),e<r.length?u():l),a=()=>r.charCodeAt(e),o=(t=1)=>r.substr(e,t),u=(r="Bad syntax "+o())=>{throw Error(r+" at "+e)},s=(t=1,n=e)=>{if("number"==typeof t)e+=t;else for(;t(a());)++e>r.length&&u("End by "+t);return e>n?r.slice(n,e):null},f=()=>{for(;a()<=32;)e++},i=(r,n,l,a=3)=>{if(e&&t&&t[3]===e)return t;for(;a;)if(null!=(l=r[n=o(a--)]))return t=[n,l,n.length,e]},y=(r=-1,t)=>{f();let l,s,p,d,b=a(),m=0,B=e;if(t){if(b===t)return;d=n,n=t}for(;B===e&&m<c.length;)s=c[m++](b);if(B===e)(l=i(g))&&(e+=l[2],s=[l[0],y(l[1])]);else for(f(),b=a(),m=0;m<h.length;)(p=h[m](s,b))!==s?(s=p,f(),b=a()):m++;for(;b=a()&&b!==n&&(l=i(A))&&l[1]>r;){s=[l[0],s];do{e+=l[2],s.push(y(l[1]))}while(o(l[2])===l[0]);f()}return t&&(n=a()!==t?u("Unclosed paren"):d),s},p=e=>s((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192)),c=l.token=[e=>{if(e=s((e=>e>=48&&e<=57||46===e)))return(69===a()||101===a())&&(e+=s(2)+s((e=>e>=48&&e<=57))),isNaN(e=parseFloat(e))?u("Bad number"):e},(r,t)=>40===r?(e++,t=y(-1,41),e++,t):null,(r,t)=>34===r?(t=o(),e++,t+s((e=>e-r))+(e++,t)):null,p],d=l.literal={true:!0,false:!1,null:null},h=l.postfix=[(t,n,l)=>(46===n?(e++,f(),t=[".",t,'"'+p()+'"']):91===n?(e++,t=[".",t,y(-1,93)],e++):40===n?(e++,l=y(-1,41),t=Array.isArray(l)&&","===l[0]?(l[0]=t,l):null==l?[t]:[t,l],e++):43!==n&&45!==n||r.charCodeAt(e+1)!==n?"string"==typeof t&&d.hasOwnProperty(t)&&(t=d[t]):t=[s(2),t],t)],g=l.unary={"-":17,"!":17,"+":17,"++":17,"--":17},A=l.binary={",":1,"||":6,"&&":7,"|":8,"^":9,"&":10,"==":11,"!=":11,"<":12,">":12,"<=":12,">=":12,"<<":13,">>":13,">>>":13,"+":14,"-":14,"*":15,"/":15,"%":15},b=l,m=e=>Array.isArray(e)&&("string"==typeof e[0]||m(e[0])),B=(e,r={},t,n)=>m(e)?("string"==typeof(t=e[0])&&(n=v[t]),"function"!=typeof(t=n||B(t,r))?t:t.call(...e.map((e=>B(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,v=B.operator={"!":e=>!e,"++":e=>++e,"--":e=>--e,".":(...e)=>e.reduce(((e,r)=>e&&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.length<2?-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))},w=B,x=e=>(e="string"==typeof e?b(e):e,r=>w(e,r));export{x as default,w as evaluate,b as parse};