subscript 5.0.0 → 5.2.2

package/README.md

@@ -1,4 +1,7 @@
-# <!--<img alt="subscript" src="/subscript2.svg" height=42/>--> sub͘<em>script</em> <!--<sub>SUB͘<em>SCRIPT</em></sub>-->
+# <img alt="subscript" src="/subscript2.svg" height=42/> <!--sub͘<em>script</em>--> <!--<sub>SUB͘<em>SCRIPT</em></sub>--> 
+<a href="https://github.com/spectjs/subscript/actions/workflows/node.js.yml"><img src="https://github.com/spectjs/subscript/actions/workflows/node.js.yml/badge.svg"/></a>
+<a href="http://npmjs.org/subscript"><img src="https://img.shields.io/npm/v/subscript?color=orangered"/></a>
+<a href="http://microjs.com/#subscript"><img src="https://img.shields.io/badge/microjs-subscript-blue?color=darkslateblue"/></a>
 
 _Subscript_ is micro-language with common syntax subset of C++, JS, Java, Python, Go, Rust, Swift, Objective C, Kotlin etc.<br/>
 
@@ -27,28 +30,9 @@ _Subscript_ is designed to be useful for:
 * custom DSL
 
 [_Jsep_](https://github.com/EricSmekens/jsep) is generally fine for the listed tasks, unless you need dependencies as small as possible.
-_Subscript_ has [2.5kb](https://npmfs.com/package/subscript/4.0.0/subscript.min.js) footprint vs [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_, with better performance.
+_Subscript_ has [2.5kb](https://npmfs.com/package/subscript/5.2.0/subscript.min.js) footprint vs [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_, with _jsep+_ test coverage and better performance.
 
 
-## Operators
-
-Default operators include common operators for the listed languages in the following precedence:
-
-* `++ --` unary postfix
-* `! + - ++ --` unary prefix
-* `* / %`
-* `+ -`
-* `<< >> >>>`
-* `< <= > >=`
-* `== !=`
-* `&`
-* `^`
-* `|`
-* `&&`
-* `||`
-
-All other operators can be extended, see [extension](#extension).
-
 ## Evaluation
 
 _Subscript_ parser generates lispy calltree (compatible with [frisk](https://npmjs.com/frisk)), which is compared to esprima AST has:
@@ -66,34 +50,34 @@ import {evaluate} from 'subscript.js'
 evaluate(['+', ['*', 'min', 60], '"sec"'], { min: 5 }) // min*60 + "sec" == "300sec"
 ```
 
-## Extension
-
-Tokens are extensible via `parse.token` list, can be added support of _regex_, _array_, _object_, _interpolated string_ and others.
-Default tokens include:
+## Extending
 
-* `"abc"` strings
-* `1.2e+3` floats
-* `()` expression groups or fn calls
-* `.`, `[]` property access
+### Operators 
 
-Operators can be extended via `parse.operator` to add support for any unary/binary/postfix operators, calls, props or chains.
+Default operators include common operators for the listed languages in the following precedence:
 
-Comments can be added via extending `parse.space`.
+* `++ --` unary postfix
+* `! + - ++ --` unary prefix
+* `* / %`
+* `+ -`
+* `<< >> >>>`
+* `< <= > >=`
+* `== !=`
+* `&`
+* `^`
+* `|`
+* `&&`
+* `||`
 
-For now see justin extension how things can be done.
+Operators can be extended via `parse.operator(str, prec, type)` and `evaluate.operator(str, fn)` functions for any unary/binary/postfix operators, calls, props, groups, arrays, objects etc.
 
-<!--
 ```js
 import { parse, evaluate } from 'subscript.js'
 
-// add precedences
-// TODO
-// parse.operator['=>'] = 10
+parse.operator('=>', 10) // precedence=10, type=default (0 - binary, 1 - postfix, -1 - prefix)
 
-// define evaluators
-// TODO
-// evaluate.operator['=>'] = ( args, body ) => evaluate(body, args)
-// evaluate.operator['|'] = ( a, ...b ) => a.pipe(...b)
+evaluate.operator('=>', ( args, body ) => evaluate(body, args))
+evaluate.operator('|', ( a, ...b ) => a.pipe(...b))
 
 let tree = parse(`
   interval(350)
@@ -103,7 +87,29 @@ let tree = parse(`
 `)
 evaluate(tree, { Math, map, take, interval, gaussian })
 ```
--->
+
+### Tokens
+
+Default tokens include:
+
+* `"abc"` strings
+* `1.2e+3` floats
+* `name` identifiers
+
+Tokens are extensible via `parse.token` list, can be added support of _literals_, _regexes_, _strings_, _numbers_ and others.
+
+```js
+import parse, {char} from 'subscript/parse.js'
+import evaluate from 'subscript/evaluate.js'
+
+conts ctx = {x:1}
+parse.token.unshift(c => char(4) === 'this' ? ctx : null)
+evaluate(parse(`this.x`)) // 1
+```
+
+### Spaces/comments
+
+Comments can be added via extending `parse.space`. See [justin.js](./justin.js) for more examples.
 
 
 ## Justin
@@ -111,6 +117,7 @@ evaluate(tree, { Math, map, take, interval, gaussian })
 _Justin_ extension (original [thread](https://github.com/endojs/Jessie/issues/66)) is minimal JS subset − JSON with JS expressions.<br/>
 It adds support of:
 
++ `===`, `!==` operators
 + `**` binary operator
 + `~` unary operator
 + `'` strings
@@ -122,7 +129,6 @@ It adds support of:
 + unary word operators
 + `//`, `/* */` comments
 + `true`, `false`, `null`, `undefined` literals
-<!-- + `===`, `!==` operators -->
 <!-- + `?` chaining operator -->
 <!-- + `...x` unary operator -->
 <!-- + strings interpolation -->
@@ -279,7 +285,7 @@ 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
 
-subscript: ~200 ms
+subscript: ~230 ms
 jsep: ~280 ms
 expr-eval: ~480 ms
 jexl: ~1200 ms

package/evaluate.js

@@ -4,10 +4,9 @@ export const isCmd = a => Array.isArray(a) && (typeof a[0] === 'string' || isCmd
 evaluate = (s, ctx={}, c, op) => {
   if (isCmd(s)) {
     c = s[0]
-    if (typeof c === 'string') op = operator[c]
+    if (typeof c === 'string') op = lookup[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')
@@ -17,43 +16,10 @@ evaluate = (s, ctx={}, c, op) => {
 
   return s
 },
-
-reducer=fn=>(...a)=>a.reduce(fn),
+lookup = {},
 
 // 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,
-
-  '.':reducer((a,b)=>a?a[b]:a),
-
-  '%':reducer((a,b)=>a%b),
-  '/':reducer((a,b)=>a/b),
-  '*':reducer((a,b)=>a*b),
-
-  '+':reducer((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),
-  ',':reducer((a,b)=>(a,b))
-}
+operator = evaluate.operator = (op, fn) => lookup[op] = fn.length == 2 ? (...a)=>a.reduce(fn) : fn
 
 export default evaluate

package/justin.js

@@ -1,57 +1,56 @@
 // justin lang https://github.com/endojs/Jessie/issues/66
 import {evaluate} from './evaluate.js'
-import {parse, code, char, skip, expr, operator, err} from './parse.js'
+import {parse, code, char, skip, expr, err} from './parse.js'
 
-// ;
-operator(';', 1)
+const PERIOD=46, OPAREN=40, CPAREN=41, CBRACK=93, SPACE=32,
 
-// ===, !==
-operator('===', 9)
-operator('!==', 9)
+PREC_SEQ=1, PREC_TERN=3, PREC_SOME=4, PREC_EVERY=5, PREC_OR=6, PREC_XOR=7, PREC_AND=8,
+PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19,
+PREC_EXP=14, PREC_TOKEN=20
 
-// undefined
+
+// tokens
 const v = v => ({valueOf:()=>v})
-parse.token.splice(2,0, c =>
-  c === 116 && char(4) === 'true' && skip(4) ? v(true) :
-  c === 102 && char(5) === 'false' && skip(5) ? v(false) :
-  c === 110 && char(4) === 'null' && skip(4) ? v(null) :
-  c === 117 && char(9) === 'undefined' && skip(9) ? v(undefined) :
-  null
+parse.token.push(
+  // 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
+  (number) => (
+    (number = skip(c => (c > 47 && c < 58) || c == PERIOD)) && (
+      (code() == 69 || code() == 101) && (number += skip(2) + skip(c => c >= 48 && c <= 57)),
+      isNaN(number = new Number(number)) ? err('Bad number') : number
+    )
+  ),
+
+  // "' with /
+  (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
+  },
+
+  // literal
+  c =>
+    c === 116 && char(4) === 'true' && skip(4) ? v(true) :
+    c === 102 && char(5) === 'false' && skip(5) ? v(false) :
+    c === 110 && char(4) === 'null' && skip(4) ? v(null) :
+    c === 117 && char(9) === 'undefined' && skip(9) ? v(undefined) :
+    null,
+
+  // id
+  c => 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 && c != 215 && c != 247) // any non-ASCII
+  )
 )
 
-// "' with /
-parse.token[1] = (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'}
 
-// **
-evaluate.operator['**'] = (...args)=>args.reduceRight((a,b)=>Math.pow(b,a))
-operator('**', 14)
-
-// ~
-operator('~', 13, -1)
-evaluate.operator['~'] = a=>~a
-
-// TODO ...
-
-// ?:
-evaluate.operator['?:']=(a,b,c)=>a?b:c
-operator('?', 3, (node) => {
-  if (!node) err('Expected expression')
-  let a, b
-  skip(), parse.space(), a = expr()
-  if (code() !== 58) err('Expected :')
-  skip(), parse.space(), b = expr()
-  return ['?:', node, a, b]
-})
-// operator(':')
 
 // /**/, //
 parse.space = cc => {
@@ -66,36 +65,152 @@ parse.space = cc => {
   return cc
 }
 
-// in
-evaluate.operator['in'] = (a,b)=>a in b
-operator('in', 10, (node) => code(2) <= 32 && [skip(2), '"'+node+'"', expr(10)])
-
-// []
-evaluate.operator['['] = (...args) => Array(...args)
-// as operator it's faster to lookup (no need to call extra rule check), smaller and no conflict with word names
-operator('[', 20, (node,arg) => !node && (
-  skip(), arg=expr(0,93), skip(),
-  !arg ? ['['] : arg[0] === ',' ? (arg[0]='[',arg) : ['[',arg]
-))
-
-// {}
-parse.token.unshift((cc, node) => (
-  cc === 123 && (skip(), node = map(['{', expr(0,125)]), skip(), node)
-))
-
-operator('}')
-operator(':', 0)
-evaluate.operator['{'] = (...args)=>Object.fromEntries(args)
-evaluate.operator[':'] = (a,b)=>[a,b]
-
-const map = (n, args) => {
-  if (!n[1]) args = []
-  else if (n[1][0]==':') args = [n[1]]
-  else if (n[1][0]==',') args = n[1].slice(1)
-  return ['{', ...args]
+
+// operators
+const addOps = (add, stride=2, list) => {
+  for (let i = 0; i < list.length; i+=stride) add(list[i], list[i+1], list[i+2])
 }
 
+addOps(parse.operator, 3, [
+  // subscript ones
+  // TODO: add ,, as node here?
+  ',', PREC_SEQ,,
+
+  '|', PREC_OR,,
+  '||', PREC_SOME,,
+
+  '&', PREC_AND,,
+  '&&', PREC_EVERY,,
+
+  '^', PREC_XOR,,
+
+  // ==, !=
+  '==', PREC_EQ,,
+  '!=', PREC_EQ,,
+
+  // > >= >> >>>, < <= <<
+  '>', PREC_COMP,,
+  '>=', PREC_COMP,,
+  '>>', PREC_SHIFT,,
+  '>>>', PREC_SHIFT,,
+  '<', PREC_COMP,,
+  '<=', PREC_COMP,,
+  '<<', PREC_SHIFT,,
+
+  // + ++ - --
+  '+', PREC_SUM,,
+  '+', PREC_UNARY, -1,
+  '++', PREC_UNARY, -1,
+  '++', PREC_UNARY, +1,
+  '-', PREC_SUM,,
+  '-', PREC_UNARY, -1,
+  '--', PREC_UNARY, -1,
+  '--', PREC_UNARY, +1,
+
+  // !
+  '!', PREC_UNARY, -1,
+
+  // * / %
+  '*', PREC_MULT,,
+  '/', PREC_MULT,,
+  '%', PREC_MULT,,
+
+  // a.b
+  '.', PREC_CALL, (node,b) => node && [skip(),node, typeof (b = expr(PREC_CALL)) === 'string' ? '"' + b + '"' : b.valueOf()],
+
+  // a[b]
+  '[', PREC_CALL, (node) => (skip(), node = ['.', node, expr(0,CBRACK).valueOf()], skip(), node),
+  ']',,,
+
+  // a(b)
+  '(', PREC_CALL, (node,b) => ( skip(), b=expr(0,CPAREN), skip(),
+    Array.isArray(b) && b[0]===',' ? (b[0]=node, b) : b ? [node, b.valueOf()] : [node]
+  ),
+  // (a+b)
+  '(', PREC_GROUP, (node,b) => !node && (skip(), b=expr(0,CPAREN) || err(), skip(), b),
+  ')',,,
+
+  // justin extension
+  ';', PREC_SEQ,,
+  '===', PREC_EQ,,
+  '!==', PREC_EQ,,
+  '**', PREC_EXP,,
+  '~', PREC_UNARY, -1,
+  '?', PREC_TERN, (node) => {
+    if (!node) err('Expected expression')
+    let a, b
+    skip(), parse.space(), a = expr()
+    if (code() !== 58) err('Expected :')
+    skip(), parse.space(), b = expr()
+    return ['?:', node, a, b]
+  },
+  '}',,,
+  ':',,,
+  'in', PREC_COMP, (node) => code(2) <= 32 && [skip(2), '"'+node+'"', expr(PREC_COMP)],
+
+  // [a,b,c]
+  '[', PREC_TOKEN, (node,arg) => !node && (
+    skip(), arg=expr(0,93), skip(),
+    !arg ? ['['] : arg[0] == ',' ? (arg[0]='[',arg) : ['[',arg]
+  ),
+
+  // {a:0, b:1}
+  '{', PREC_TOKEN, (node,arg) => !node && (skip(), arg=expr(0,125), skip(),
+    !arg ? ['{'] : arg[0] == ':' ? ['{',arg] : arg[0] == ',' ? (arg[0]='{',arg) : ['[',arg])
+  ,
+])
+
+addOps(evaluate.operator, 2, [
+  // subscript
+  '!', a=>!a,
+  '++', a=>++a,
+  '--', a=>--a,
+
+  '.', (a,b)=>a?a[b]:a,
+
+  '%', (a,b)=>a%b,
+  '/', (a,b)=>a/b,
+  '*', (a,b)=>a*b,
+
+  '+', (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,b)=>(a,b),
+
+  // justin extension
+  '**', (...args)=>args.reduceRight((a,b)=>Math.pow(b,a)),
+  '~', a=>~a,
+  '?:', (a,b,c)=>a?b:c,
+  'in', (a,b)=>a in b,
+
+  // []
+  '[', (...args) => Array(...args),
+  // as operator it's faster to lookup (no need to call extra rule check), smaller and no conflict with word names
+  '{', (...args)=>Object.fromEntries(args),
+  ':', (a,b)=>[a,b]
+])
+
+// TODO ...
 // TODO: strings interpolation
 
-export default parse
 export { parse, evaluate }
+
+// code → evaluator
+export default s => (s = typeof s == 'string' ? parse(s) : s,  ctx => evaluate(s, ctx))

package/justin.min.js

@@ -1 +1 @@
-var e,r,t=e=>Array.isArray(e)&&("string"==typeof e[0]||t(e[0])),a=(e,r={},o,l)=>t(e)?("string"==typeof(o=e[0])&&(l=n[o]),"function"!=typeof(o=l||a(o,r))?o:o.call(...e.map((e=>a(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,o=e=>(...r)=>r.reduce(e),n=a.operator={"!":e=>!e,"++":e=>++e,"--":e=>--e,".":o(((e,r)=>e&&e[r])),"%":o(((e,r)=>e%r)),"/":o(((e,r)=>e/r)),"*":o(((e,r)=>e*r)),"+":o(((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),",":o(((e,r)=>r))},l=15,s=(t,a)=>(r=t,e=0,a=c(),e<r.length?p():a.valueOf()),p=(t="Bad syntax")=>{throw Error(t+" `"+r[e]+"` at "+e)},u=(t=1,a=e)=>{if("number"==typeof t)e+=t;else for(;t(f());)e++;return r.slice(a,e)},f=(t=0)=>r.charCodeAt(e+t),i=(t=1)=>r.substr(e,t),c=(e=0,r,t,a,o=0,n,l)=>{for(;(t=s.space())&&(l=h[t]?.(a,e)||!a&&d(t));)a=l;return r&&t!==r&&p("Unclosed paren"),a},v=(s.space=r=>{for(;(r=f())<=32;)e++;return r},s.token=[e=>(e=u((e=>e>47&&e<58||46==e)))&&((69==f()||101==f())&&(e+=u(2)+u((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?p("Bad number"):e),(e,r)=>34==e&&u()+u((r=>r-e))+u(),e=>u((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e))]),d=(e,r=0,t)=>{for(;r<v.length;)if(t=v[r++](e))return t},h=[],y=(r,t=0,a=0,o,n=r.charCodeAt(0),l=r.length,v=h[n],d=r.toUpperCase()!==r,y)=>(y=l<2?d?e=>f(1)<=32:e=>1:d?e=>i(l)==r&&f(l)<=32:e=>i(l)==r,o=a?a>0?e=>e&&[u(l),e]:a<0?e=>!e&&[u(l),(c(t-1)||p()).valueOf()]:a:a=>{a=[r,a||p()];do{e+=l,a.push((c(t)||p()).valueOf())}while(s.space()==n&&y());return a},h[n]=(e,r)=>r<t&&y()&&o(e)||v&&v(e,r));for(let r=0,t=[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",10,,">=",10,,">>",11,,">>>",11,,"<",10,,"<=",10,,"<<",11,,"+",12,,"+",l,-1,"++",l,-1,"++",l,1,"-",12,,"-",l,-1,"--",l,-1,"--",l,1,"!",l,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[u(),e,"string"==typeof(r=c(18))?'"'+r+'"':r.valueOf()],"[",18,r=>(e++,r=[".",r,c(0,93).valueOf()],e++,r),"]",,,"(",18,(r,t)=>(e++,t=c(0,41),e++,Array.isArray(t)&&","===t[0]?(t[0]=r,t):t?[r,t.valueOf()]:[r]),"(",19,(r,t)=>!r&&(++e,t=c(0,41)||p(),++e,t),")",,,];r<t.length;)y(t[r++],t[r++],t[r++]);y(";",1),y("===",9),y("!==",9);var g=e=>({valueOf:()=>e});s.token.splice(2,0,(e=>116===e&&"true"===i(4)&&u(4)?g(!0):102===e&&"false"===i(5)&&u(5)?g(!1):110===e&&"null"===i(4)&&u(4)?g(null):117===e&&"undefined"===i(9)&&u(9)?g(void 0):null)),s.token[1]=(e,r,t,a)=>{if(34===e||39===e){for(r=i(),u(),a="";(t=f())-e;)92===t?(u(),a+=O[i()]||i()):a+=i(),u();return u(),r+a+r}};var O={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"};a.operator["**"]=(...e)=>e.reduceRight(((e,r)=>Math.pow(r,e))),y("**",14),y("~",13,-1),a.operator["~"]=e=>~e,a.operator["?:"]=(e,r,t)=>e?r:t,y("?",3,(e=>{let r,t;return e||p("Expected expression"),u(),s.space(),r=c(),58!==f()&&p("Expected :"),u(),s.space(),t=c(),["?:",e,r,t]})),s.space=e=>{for(;(e=f())<=32;)u(),47===f()&&(42===f(1)?(u(2),u((e=>42!==e&&47!==f(1))),u(2)):47===f(1)&&(u(2),u((e=>e>=32))));return e},a.operator.in=(e,r)=>e in r,y("in",10,(e=>f(2)<=32&&[u(2),'"'+e+'"',c(10)])),a.operator["["]=(...e)=>Array(...e),y("[",20,((e,r)=>!e&&(u(),r=c(0,93),u(),r?","===r[0]?(r[0]="[",r):["[",r]:["["]))),s.token.unshift(((e,r)=>123===e&&(u(),r=b(["{",c(0,125)]),u(),r))),y("}"),y(":",0),a.operator["{"]=(...e)=>Object.fromEntries(e),a.operator[":"]=(e,r)=>[e,r];var b=(e,r)=>(e[1]?":"==e[1][0]?r=[e[1]]:","==e[1][0]&&(r=e[1].slice(1)):r=[],["{",...r]),A=s;export{A as default,a as evaluate,s as parse};
+var e,r,t=e=>Array.isArray(e)&&("string"==typeof e[0]||t(e[0])),a=(e,r={},o,l)=>t(e)?("string"==typeof(o=e[0])&&(l=n[o]),"function"!=typeof(o=l||a(o,r))?o:o.call(...e.map((e=>a(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,n={},o=(a.operator=(e,r)=>n[e]=2==r.length?(...e)=>e.reduce(r):r,(t,a)=>(r=t,e=0,a=p(),e<r.length?l():a.valueOf())),l=(t="Bad syntax")=>{throw Error(t+" `"+r[e]+"` at "+e)},s=(t=1,a=e)=>{if("number"==typeof t)e+=t;else for(;t(u());)e++;return r.slice(a,e)},u=(t=0)=>r.charCodeAt(e+t),f=(t=1)=>r.substr(e,t),p=(e=0,r,t,a,n=0,s,u)=>{for(;(t=o.space())&&(u=v[t]?.(a,e)||!a&&c(t));)a=u;return r&&t!==r&&l("Unclosed paren"),a},i=(o.space=r=>{for(;(r=u())<=32;)e++;return r},o.token=[]),c=(e,r=0,t)=>{for(;r<i.length;)if(t=i[r++](e))return t},v=[],d=(o.operator=(r,t=0,a=0,n,i=r.charCodeAt(0),c=r.length,d=v[i],h=r.toUpperCase()!==r,y)=>(y=c<2?h?e=>u(1)<=32:e=>1:h?e=>f(c)==r&&u(c)<=32:e=>f(c)==r,n=a?a>0?e=>e&&[s(c),e]:a<0?e=>!e&&[s(c),(p(t-1)||l()).valueOf()]:a:a=>{a=[r,a||l()];do{e+=c,a.push((p(t)||l()).valueOf())}while(o.space()==i&&y());return a},v[i]=(e,r)=>r<t&&y()&&n(e)||d&&d(e,r)),10),h=15,y=e=>({valueOf:()=>e});o.token.push((e=>(e=s((e=>e>47&&e<58||46==e)))&&((69==u()||101==u())&&(e+=s(2)+s((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?l("Bad number"):e)),((e,r,t,a)=>{if(34===e||39===e){for(r=f(),s(),a="";(t=u())-e;)92===t?(s(),a+=g[f()]||f()):a+=f(),s();return s(),r+a+r}}),(e=>116===e&&"true"===f(4)&&s(4)?y(!0):102===e&&"false"===f(5)&&s(5)?y(!1):110===e&&"null"===f(4)&&s(4)?y(null):117===e&&"undefined"===f(9)&&s(9)?y(void 0):null),(e=>s((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e))));var g={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"};o.space=e=>{for(;(e=u())<=32;)s(),47===u()&&(42===u(1)?(s(2),s((e=>42!==e&&47!==u(1))),s(2)):47===u(1)&&(s(2),s((e=>e>=32))));return e};var O=(e,r=2,t)=>{for(let a=0;a<t.length;a+=r)e(t[a],t[a+1],t[a+2])};O(o.operator,3,[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",d,,">=",d,,">>",11,,">>>",11,,"<",d,,"<=",d,,"<<",11,,"+",12,,"+",h,-1,"++",h,-1,"++",h,1,"-",12,,"-",h,-1,"--",h,-1,"--",h,1,"!",h,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[s(),e,"string"==typeof(r=p(18))?'"'+r+'"':r.valueOf()],"[",18,e=>(s(),e=[".",e,p(0,93).valueOf()],s(),e),"]",,,"(",18,(e,r)=>(s(),r=p(0,41),s(),Array.isArray(r)&&","===r[0]?(r[0]=e,r):r?[e,r.valueOf()]:[e]),"(",19,(e,r)=>!e&&(s(),r=p(0,41)||l(),s(),r),")",,,";",1,,"===",9,,"!==",9,,"**",14,,"~",h,-1,"?",3,e=>{let r,t;return e||l("Expected expression"),s(),o.space(),r=p(),58!==u()&&l("Expected :"),s(),o.space(),t=p(),["?:",e,r,t]},"}",,,":",,,"in",d,e=>u(2)<=32&&[s(2),'"'+e+'"',p(d)],"[",20,(e,r)=>!e&&(s(),r=p(0,93),s(),r?","==r[0]?(r[0]="[",r):["[",r]:["["]),"{",20,(e,r)=>!e&&(s(),r=p(0,125),s(),r?":"==r[0]?["{",r]:","==r[0]?(r[0]="{",r):["[",r]:["{"])]),O(a.operator,2,["!",e=>!e,"++",e=>++e,"--",e=>--e,".",(e,r)=>e&&e[r],"%",(e,r)=>e%r,"/",(e,r)=>e/r,"*",(e,r)=>e*r,"+",(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,r)=>r,"**",(...e)=>e.reduceRight(((e,r)=>Math.pow(r,e))),"~",e=>~e,"?:",(e,r,t)=>e?r:t,"in",(e,r)=>e in r,"[",(...e)=>Array(...e),"{",(...e)=>Object.fromEntries(e),":",(e,r)=>[e,r]]);var b=e=>(e="string"==typeof e?o(e):e,r=>a(e,r));export{b as default,a as evaluate,o as parse};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "subscript",
-  "version": "5.0.0",
+  "version": "5.2.2",
   "description": "Microlanguage with common syntax for JS/C++/Python/Rust",
   "main": "subscript.js",
   "type": "module",

package/parse.js

@@ -1,13 +1,9 @@
-const PERIOD=46, OPAREN=40, CPAREN=41, CBRACK=93, SPACE=32,
-
-  PREC_SEQ=1, PREC_SOME=4, PREC_EVERY=5, PREC_OR=6, PREC_XOR=7, PREC_AND=8,
-  PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
-
+const SPACE=32
 
 // current string & index
 let idx, cur
 
-export const parse = (str, tree) => (cur=str, idx=0, tree=expr(), idx<cur.length ? err() : tree.valueOf()),
+export const parse = (str, tree) => (cur=str, idx=0, tree=expr(), idx<cur.length ? err() : val(tree)),
 
 err = (msg='Bad syntax') => { throw Error(msg + ' `' + cur[idx] + '` at ' + idx) },
 
@@ -37,26 +33,7 @@ expr = (prec=0, end, cc, node, i=0, map, newNode) => {
 space = parse.space = cc => { while (cc = code(), cc <= SPACE) idx++; return cc },
 
 // tokens
-tokens = parse.token = [
-  // 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
-  (number) => (
-    (number = skip(c => (c > 47 && c < 58) || c == PERIOD)) && (
-      (code() == 69 || code() == 101) && (number += skip(2) + skip(c => c >= 48 && c <= 57)),
-      isNaN(number = new Number(number)) ? err('Bad number') : number
-    )
-  ),
-  // "a"
-  (q, qc) => q == 34 && (skip() + skip(c => c-q) + skip()),
-  // id
-  c => 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 && c != 215 && c != 247) // any non-ASCII
-  )
-],
-
+tokens = parse.token = [],
 token = (c,i=0,node) => { while(i<tokens.length) if (node = tokens[i++](c)) return node },
 
 // operator lookup table
@@ -66,83 +43,23 @@ lookup = [],
 // @param op is operator string
 // @param prec is operator precedenc to check
 // @param map is either number +1 - postfix unary, -1 prefix unary, 0 binary, else - custom mapper function
-operator = (op, prec=0, type=0, map, c=op.charCodeAt(0), l=op.length, prev=lookup[c], word=op.toUpperCase()!==op, isop) => (
-  isop = l<2 ? // word operator must have space after
-    !word ? c=>1 : c=>code(1)<=SPACE :
-    !word ? c=>char(l)==op : c=>char(l)==op&&code(l)<=SPACE,
-
+operator = parse.operator =  (op, prec=0, type=0, map, c=op.charCodeAt(0), l=op.length, prev=lookup[c], word=op.toUpperCase()!==op, isop) => (
   map = !type ? node => { // binary, consume same-op group
       node = [op, node || err()]
-      // in order to support literal tokens, we call valueOf any time we create or modify calltree node
-      do { idx+=l, node.push((expr(prec) || err()).valueOf()) } while (parse.space()==c && isop())
+      do { idx+=l, node.push(val(expr(prec))) }
+      while (parse.space()==c && (l<2||char(l)==op) && (!word||code(l)<=SPACE)) // word operator must have space after
       return node
     } :
-    type > 0 ? node => node && [skip(l), node] : // postfix unary
-    type < 0 ? node => !node && [skip(l), (expr(prec-1) || err()).valueOf()] : // prefix unary
+    type > 0 ? node => node && [skip(l), val(node)] : // postfix unary
+    type < 0 ? node => !node && [skip(l), val(expr(prec-1))] : // prefix unary
     type,
 
-  lookup[c] = (node, curPrec) => curPrec < prec && isop() && map(node) || (prev && prev(node, curPrec))
-)
-
-// ,
-for (let i = 0, ops = [
-  // TODO: add ,, as node here
-  ',', PREC_SEQ,,
-
-  '|', PREC_OR,,
-  '||', PREC_SOME,,
-
-  '&', PREC_AND,,
-  '&&', PREC_EVERY,,
-
-  '^', PREC_XOR,,
-
-  // ==, !=
-  '==', PREC_EQ,,
-  '!=', PREC_EQ,,
-
-  // > >= >> >>>, < <= <<
-  '>', PREC_COMP,,
-  '>=', PREC_COMP,,
-  '>>', PREC_SHIFT,,
-  '>>>', PREC_SHIFT,,
-  '<', PREC_COMP,,
-  '<=', PREC_COMP,,
-  '<<', PREC_SHIFT,,
-
-  // + ++ - --
-  '+', PREC_SUM,,
-  '+', PREC_UNARY, -1,
-  '++', PREC_UNARY, -1,
-  '++', PREC_UNARY, +1,
-  '-', PREC_SUM,,
-  '-', PREC_UNARY, -1,
-  '--', PREC_UNARY, -1,
-  '--', PREC_UNARY, +1,
-
-  // ! ~
-  '!', PREC_UNARY, -1,
-
-  // * / %
-  '*', PREC_MULT,,
-  '/', PREC_MULT,,
-  '%', PREC_MULT,,
-
-  // a.b
-  '.', PREC_CALL, (node,b) => node && [skip(),node, typeof (b = expr(PREC_CALL)) === 'string' ? '"' + b + '"' : b.valueOf()],
-
-  // a[b]
-  '[', PREC_CALL, (node) => (idx++, node = ['.', node, expr(0,CBRACK).valueOf()], idx++, node),
-  ']',,,
-
-  // a(b)
-  '(', PREC_CALL, (node,b) => ( idx++, b=expr(0,CPAREN), idx++,
-    Array.isArray(b) && b[0]===',' ? (b[0]=node, b) : b ? [node, b.valueOf()] : [node]
-  ),
-  // (a+b)
-  '(', PREC_GROUP, (node,b) => !node && (++idx, b=expr(0,CPAREN) || err(), ++idx, b),
-  ')',,,
-]; i < ops.length;) operator(ops[i++],ops[i++],ops[i++])
+  lookup[c] = (node, curPrec) =>
+    curPrec < prec && (l<2||char(l)==op) && (!word||code(l)<=SPACE) &&
+    map(node) || (prev && prev(node, curPrec))
+),
 
+// in order to support literal tokens, we call valueOf any time we create or modify calltree node
+val = node => Array.isArray(node) ? node : (node || err()).valueOf()
 
 export default parse

package/subscript.js

@@ -1,5 +1,128 @@
-import parse from './parse.js'
-import evaluate from './evaluate.js'
+import parse, {skip, expr, code, tokens, operator as parseOp} from './parse.js'
+import evaluate, {operator as evalOp} from './evaluate.js'
+
+const PERIOD=46, OPAREN=40, CPAREN=41, CBRACK=93, SPACE=32,
+
+PREC_SEQ=1, PREC_SOME=4, PREC_EVERY=5, PREC_OR=6, PREC_XOR=7, PREC_AND=8,
+PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
+
+tokens.push(
+  // 1.2e+3, .5 - fast & small version, but consumes corrupted nums as well
+  (number) => (
+    (number = skip(c => (c > 47 && c < 58) || c == PERIOD)) && (
+      (code() == 69 || code() == 101) && (number += skip(2) + skip(c => c >= 48 && c <= 57)),
+      isNaN(number = new Number(number)) ? err('Bad number') : number
+    )
+  ),
+  // "a"
+  (q, qc) => q == 34 && (skip() + skip(c => c-q) + skip()),
+  // id
+  c => 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
+  )
+)
+
+const addOps = (add, stride=2, list) => {
+  for (let i = 0; i < list.length; i+=stride) add(list[i], list[i+1], list[i+2])
+}
+
+addOps(parseOp, 3, [
+  ',', PREC_SEQ,,
+
+  '|', PREC_OR,,
+  '||', PREC_SOME,,
+
+  '&', PREC_AND,,
+  '&&', PREC_EVERY,,
+
+  '^', PREC_XOR,,
+
+  // ==, !=
+  '==', PREC_EQ,,
+  '!=', PREC_EQ,,
+
+  // > >= >> >>>, < <= <<
+  '>', PREC_COMP,,
+  '>=', PREC_COMP,,
+  '>>', PREC_SHIFT,,
+  '>>>', PREC_SHIFT,,
+  '<', PREC_COMP,,
+  '<=', PREC_COMP,,
+  '<<', PREC_SHIFT,,
+
+  // + ++ - --
+  '+', PREC_SUM,,
+  '+', PREC_UNARY, -1,
+  '++', PREC_UNARY, -1,
+  '++', PREC_UNARY, +1,
+  '-', PREC_SUM,,
+  '-', PREC_UNARY, -1,
+  '--', PREC_UNARY, -1,
+  '--', PREC_UNARY, +1,
+
+  // ! ~
+  '!', PREC_UNARY, -1,
+
+  // * / %
+  '*', PREC_MULT,,
+  '/', PREC_MULT,,
+  '%', PREC_MULT,,
+
+  // a.b
+  '.', PREC_CALL, (node,b) => node && [skip(),node, typeof (b = expr(PREC_CALL)) === 'string' ? '"' + b + '"' : b.valueOf()],
+
+  // a[b]
+  '[', PREC_CALL, (node) => (skip(), node = ['.', node, expr(0,CBRACK).valueOf()], skip(), node),
+  ']',,,
+
+  // a(b)
+  '(', PREC_CALL, (node,b) => ( skip(), b=expr(0,CPAREN), skip(),
+    Array.isArray(b) && b[0]===',' ? (b[0]=node, b) : b ? [node, b.valueOf()] : [node]
+  ),
+  // (a+b)
+  '(', PREC_GROUP, (node,b) => !node && (skip(), b=expr(0,CPAREN) || err(), skip(), b),
+  ')',,,
+])
+
+
+// evaluators
+addOps(evalOp, 2, [
+  '!', a=>!a,
+  '++', a=>++a,
+  '--', a=>--a,
+
+  '.', (a,b)=>a?a[b]:a,
+
+  '%', (a,b)=>a%b,
+  '/', (a,b)=>a/b,
+  '*', (a,b)=>a*b,
+
+  '+', (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,b)=>(a,b)
+])
 
 export { parse, evaluate }
 

package/subscript.min.js

@@ -1 +1 @@
-var e,r,a=15,t=(a,t)=>(r=a,e=0,t=f(),e<r.length?o():t.valueOf()),o=(a="Bad syntax")=>{throw Error(a+" `"+r[e]+"` at "+e)},n=(a=1,t=e)=>{if("number"==typeof a)e+=a;else for(;a(s());)e++;return r.slice(t,e)},s=(a=0)=>r.charCodeAt(e+a),l=(a=1)=>r.substr(e,a),f=(e=0,r,a,n,s=0,l,f)=>{for(;(a=t.space())&&(f=i[a]?.(n,e)||!n&&p(a));)n=f;return r&&a!==r&&o("Unclosed paren"),n},u=(t.space=r=>{for(;(r=s())<=32;)e++;return r},t.token=[e=>(e=n((e=>e>47&&e<58||46==e)))&&((69==s()||101==s())&&(e+=n(2)+n((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?o("Bad number"):e),(e,r)=>34==e&&n()+n((r=>r-e))+n(),e=>n((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e))]),p=(e,r=0,a)=>{for(;r<u.length;)if(a=u[r++](e))return a},i=[],c=(r,a=0,u=0,p,c=r.charCodeAt(0),y=r.length,g=i[c],h=r.toUpperCase()!==r,v)=>(v=y<2?h?e=>s(1)<=32:e=>1:h?e=>l(y)==r&&s(y)<=32:e=>l(y)==r,p=u?u>0?e=>e&&[n(y),e]:u<0?e=>!e&&[n(y),(f(a-1)||o()).valueOf()]:u:n=>{n=[r,n||o()];do{e+=y,n.push((f(a)||o()).valueOf())}while(t.space()==c&&v());return n},i[c]=(e,r)=>r<a&&v()&&p(e)||g&&g(e,r));for(let r=0,t=[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",10,,">=",10,,">>",11,,">>>",11,,"<",10,,"<=",10,,"<<",11,,"+",12,,"+",a,-1,"++",a,-1,"++",a,1,"-",12,,"-",a,-1,"--",a,-1,"--",a,1,"!",a,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[n(),e,"string"==typeof(r=f(18))?'"'+r+'"':r.valueOf()],"[",18,r=>(e++,r=[".",r,f(0,93).valueOf()],e++,r),"]",,,"(",18,(r,a)=>(e++,a=f(0,41),e++,Array.isArray(a)&&","===a[0]?(a[0]=r,a):a?[r,a.valueOf()]:[r]),"(",19,(r,a)=>!r&&(++e,a=f(0,41)||o(),++e,a),")",,,];r<t.length;)c(t[r++],t[r++],t[r++]);var y=t,g=e=>Array.isArray(e)&&("string"==typeof e[0]||g(e[0])),h=(e,r={},a,t)=>g(e)?("string"==typeof(a=e[0])&&(t=d[a]),"function"!=typeof(a=t||h(a,r))?a:a.call(...e.map((e=>h(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=e=>(...r)=>r.reduce(e),d=h.operator={"!":e=>!e,"++":e=>++e,"--":e=>--e,".":v(((e,r)=>e&&e[r])),"%":v(((e,r)=>e%r)),"/":v(((e,r)=>e/r)),"*":v(((e,r)=>e*r)),"+":v(((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),",":v(((e,r)=>r))},A=h,O=e=>(e="string"==typeof e?y(e):e,r=>A(e,r));export{O as default,A as evaluate,y as parse};
+var e,r,a=(a,o)=>(r=a,e=0,o=l(),e<r.length?t():y(o)),t=(a="Bad syntax")=>{throw Error(a+" `"+r[e]+"` at "+e)},o=(a=1,t=e)=>{if("number"==typeof a)e+=a;else for(;a(n());)e++;return r.slice(t,e)},n=(a=0)=>r.charCodeAt(e+a),s=(a=1)=>r.substr(e,a),l=(e=0,r,o,n,s=0,l,f)=>{for(;(o=a.space())&&(f=u[o]?.(n,e)||!n&&p(o));)n=f;return r&&o!==r&&t("Unclosed paren"),n},f=(a.space=r=>{for(;(r=n())<=32;)e++;return r},a.token=[]),p=(e,r=0,a)=>{for(;r<f.length;)if(a=f[r++](e))return a},u=[],i=a.operator=(r,f=0,p=0,i,c=r.charCodeAt(0),h=r.length,g=u[c],d=r.toUpperCase()!==r,v)=>(i=p?p>0?e=>e&&[o(h),y(e)]:p<0?e=>!e&&[o(h),y(l(f-1))]:p:o=>{o=[r,o||t()];do{e+=h,o.push(y(l(f)))}while(a.space()==c&&(h<2||s(h)==r)&&(!d||n(h)<=32));return o},u[c]=(e,a)=>a<f&&(h<2||s(h)==r)&&(!d||n(h)<=32)&&i(e)||g&&g(e,a)),y=e=>Array.isArray(e)?e:(e||t()).valueOf(),c=a,h=e=>Array.isArray(e)&&("string"==typeof e[0]||h(e[0])),g=(e,r={},a,t)=>h(e)?("string"==typeof(a=e[0])&&(t=d[a]),"function"!=typeof(a=t||g(a,r))?a:a.call(...e.map((e=>g(e,r))))):e&&"string"==typeof e?'"'===e[0]?e.slice(1,-1):"@"===e[0]?e.slice(1):e in r?r[e]:e:e,d={},v=g.operator=(e,r)=>d[e]=2==r.length?(...e)=>e.reduce(r):r,A=g,m=15;f.push((e=>(e=o((e=>e>47&&e<58||46==e)))&&((69==n()||101==n())&&(e+=o(2)+o((e=>e>=48&&e<=57))),isNaN(e=new Number(e))?err("Bad number"):e)),((e,r)=>34==e&&o()+o((r=>r-e))+o()),(e=>o((e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192))));var b=(e,r=2,a)=>{for(let t=0;t<a.length;t+=r)e(a[t],a[t+1],a[t+2])};b(i,3,[",",1,,"|",6,,"||",4,,"&",8,,"&&",5,,"^",7,,"==",9,,"!=",9,,">",10,,">=",10,,">>",11,,">>>",11,,"<",10,,"<=",10,,"<<",11,,"+",12,,"+",m,-1,"++",m,-1,"++",m,1,"-",12,,"-",m,-1,"--",m,-1,"--",m,1,"!",m,-1,"*",13,,"/",13,,"%",13,,".",18,(e,r)=>e&&[o(),e,"string"==typeof(r=l(18))?'"'+r+'"':r.valueOf()],"[",18,e=>(o(),e=[".",e,l(0,93).valueOf()],o(),e),"]",,,"(",18,(e,r)=>(o(),r=l(0,41),o(),Array.isArray(r)&&","===r[0]?(r[0]=e,r):r?[e,r.valueOf()]:[e]),"(",19,(e,r)=>!e&&(o(),r=l(0,41)||err(),o(),r),")",,,]),b(v,2,["!",e=>!e,"++",e=>++e,"--",e=>--e,".",(e,r)=>e&&e[r],"%",(e,r)=>e%r,"/",(e,r)=>e/r,"*",(e,r)=>e*r,"+",(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,r)=>r]);var B=e=>(e="string"==typeof e?c(e):e,r=>A(e,r));export{B as default,A as evaluate,c as parse};