subscript 6.3.1 → 7.0.2

package/README.md

@@ -1,32 +1,41 @@
 # <img alt="subscript" src="/subscript2.svg" height=28/> <!--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"/></a> <a href="http://microjs.com/#subscript"><img src="https://img.shields.io/badge/microjs-subscript-blue?color=darkslateblue"/></a>
 
-_Subscript_ is expression evaluator / microlanguage with standard syntax<br/>
+_Subscript_ is expression evaluator / microlanguage with [common syntax](https://en.wikipedia.org/wiki/Comparison_of_programming_languages_(syntax)).<br/>
 
-* Any fragment can be copy-pasted to any language: C++, JS, Java, Python, Go, Rust etc. 
+* Any fragment can be copy-pasted to any language: C++, JS, Java, Python, Go, Rust etc.
 * Tiny size <sub><a href="https://bundlephobia.com/package/subscript@6.0.0"><img alt="npm bundle size" src="https://img.shields.io/bundlephobia/minzip/subscript/latest?color=brightgreen&label=gzip"/></a></sub>
 * :rocket: Fast [performance](#performance)
 * Configurable & extensible
 * Trivial to use
 
 ```js
-import script from './subscript.js'
-let fn = script`a.b + c(d - 1)`
+import script, { parse, compile } from './subscript.js'
+
+// create expression evaluator
+let fn = script('a.b + c(d - 1)')
 fn({ a: { b:1 }, c: x => x * 2, d: 3 }) // 5
-fn.args // ['a', 'c', 'd']
+
+// or
+// parse expression tree
+let tree = parse('a.b + c')
+tree // ['+', ['.', 'a', 'b'], 'c']
+
+// compile tree to evaluable function
+let evaluate = compile(tree)
 ```
 
 ## Motivation
 
 _Subscript_ is designed to be useful for:
 
-* templates (perfect match with [template parts](https://github.com/github/template-parts), [templize](https://github.com/spectjs/templize))
+* templates (perfect match with [template parts](https://github.com/github/template-parts), see [templize](https://github.com/spectjs/templize))
 * expressions evaluators, calculators
-* configurable subsets of languages (eg. [justin](#justin)) <!-- see sonr, mineural -->
+* configurable subsets of languages (eg. [justin](#justin))
 * pluggable/mock language features (eg. pipe operator)
 * sandboxes, playgrounds, safe eval
-* custom DSL
+* custom DSL <!-- see sonr, mineural -->
 
-_Subscript_ has [2kb](https://npmfs.com/package/subscript/6.0.0/subscript.min.js) footprint, compared to [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_ + [4.5kb](https://npmfs.com/package/expression-eval/5.0.0/dist/expression-eval.module.js) _expression-eval_, with better test coverage and better performance.
+_Subscript_ has [2.8kb](https://npmfs.com/package/subscript/7.0.0/subscript.min.js) footprint, compared to [11.4kb](https://npmfs.com/package/jsep/1.2.0/dist/jsep.min.js) _jsep_ + [4.5kb](https://npmfs.com/package/expression-eval/5.0.0/dist/expression-eval.module.js) _expression-eval_, with better test coverage and better performance.
 
 
 ## Design
@@ -54,26 +63,47 @@ Default literals:
 * `"abc"` strings
 * `1.2e+3` numbers
 
-Everything else can be extended via `parse.set(token, precedence, operator)` for unary or binary operators (detected by number of arguments in `operator`), or via `parse.set(token, parse, precedence)` for custom tokens.
+Everything else can be extended via `subscript.set(str, prec, fn)` for unary, binary or n-ary operators (detected by number of arguments in `fn`), or via `subscript.set(str, prec, [parse, compile])` for custom tokens.
 
 ```js
-import script from './subscript.js'
+import script, { compile } from './subscript.js'
 
 // add ~ unary operator with precedence 15
 script.set('~', 15, a => ~a)
 
-// add === binary operator
+// add === binary operator with precedence 9
 script.set('===', 9, (a, b) => a===b)
 
 // add literals
-script.set('true', a => ()=>true)
-script.set('false', a => ()=>false)
+script.set('true', 20, [a => ['',true], a => ctx => a[1]])
+script.set('false', 20, [a => ['',false], a => ctx => a[1]])
 
-script`true === false`() // false
+script(`true === false`)() // false
 ```
 
 See [subscript.js](subscript.js) or [justin.js](./justin.js) for examples.
 
+
+## Parser & Compiler
+
+Subscript exposes separate `./parse.js` and `./compile.js` entries. Parser builds AST, compiler converts it to evaluable function.
+
+AST has simplified lispy calltree structure (inspired by [frisk](https://ghub.io/frisk)), opposed to [ESTree](https://github.com/estree/estree):
+
+* is not limited to particular language, can be cross-compiled;
+* reflects execution sequence, rather than code layout;
+* has minimal possible overhead, better fits for directly mapping to operators;
+* simplifies manual evaluation and debugging;
+* has conventional form and one-liner docs:
+
+```js
+import { compile } from 'subscript.js'
+
+const fn = compile(['+', ['*', 'min', ['',60]], ['','sec']])
+
+fn({min: 5}) // min*60 + "sec" == "300sec"
+```
+
 <!--
 Operators can be extended via .
 
@@ -286,8 +316,9 @@ Subscript shows relatively good performance within other evaluators:
 Parse 30k times:
 
 ```
-subscript: ~170 ms 🥇
-justin: ~183 ms 🥈
+es-module-lexer: 50ms 🥇
+subscript: ~150 ms 🥈
+justin: ~183 ms
 jsep: ~270 ms 🥉
 jexpr: ~297 ms
 mr-parser: ~420 ms
@@ -302,8 +333,8 @@ new Function: ~1154 ms
 Eval 30k times:
 ```
 new Function: ~7 ms 🥇
-subscript: ~17 ms 🥈
-justin: ~17 ms 🥈
+subscript: ~15 ms 🥈
+justin: ~17 ms
 jexpr: ~23 ms 🥉
 jsep (expression-eval): ~30 ms
 math-expression-evaluator: ~50ms
@@ -328,7 +359,7 @@ math-parser: -
 * [math-parser](https://www.npmjs.com/package/math-parser)
 * [math.js](https://mathjs.org/docs/expressions/parsing.html)
 
-## Next door
+## JS engines
 
 * [engine262](https://github.com/engine262/engine262)
 * [Jessie](https://github.com/endojs/Jessie)

package/compile.js

@@ -0,0 +1,9 @@
+// build optimized evaluator for the tree
+export const compile = (node) => !Array.isArray(node) ? ctx => ctx?.[node] : operator[node[0]](...node.slice(1)),
+
+set = compile.set = (op, fn, prev=operator[op]) => operator[op] = (...args) => fn(...args) || prev && prev(...args),
+
+operator = {}
+
+
+export default compile

package/justin.js

@@ -1,238 +1,94 @@
-const SPACE=32;
-
-// current string, index and collected ids
-let idx, cur, args,
-
-// no handling tagged literals since easily done on user side with cache, if needed
-parse = (s, fn) => (
-  idx=0, args=[], cur=s.trim(),
-  !(s = cur ? expr() : ctx=>fn) || cur[idx] ? err() :
-  fn = ctx=>s(ctx||{}), fn.args = args, fn
-),
-
-isId = 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
-
-err = (msg='Bad syntax',c=cur[idx]) => { throw SyntaxError(msg + ' `' + c + '` at ' + idx) },
-
-skip = (is=1, from=idx, l) => {
-  if (typeof is == 'number') idx += is;
-  else while (is(cur.charCodeAt(idx))) idx++;
-  return cur.slice(from, idx)
-},
-
-// a + b - c
-expr = (prec=0, end, cc, token, newNode, fn) => {
-  // chunk/token parser
-  while (
-    ( cc=space() ) && // till not end
-    // FIXME: extra work is happening here, when lookup bails out due to lower precedence -
-    // it makes extra `space` call for parent exprs on the same character to check precedence again
-    ( newNode =
-      (fn=lookup[cc]) && fn(token, prec) || // if operator with higher precedence isn't found
-      (!token && id()) // parse literal or quit. token seqs are forbidden: `a b`, `a "b"`, `1.32 a`
-    )
-  ) token = newNode;
-
-  // check end character
-  // FIXME: can't show "Unclose paren", because can be unknown operator within group as well
-  if (end) cc==end?idx++:err();
-
-  return token
-},
-
-// skip space chars, return first non-space character
-space = cc => { while ((cc = cur.charCodeAt(idx)) <= SPACE) idx++; return cc },
-
-// variable identifier
-id = (name=skip(isId), fn) => name ? (fn=ctx => ctx[name], args.push(name), fn.id=()=>name, fn) : 0,
-
-// operator/token lookup table
-lookup = [],
-
-// create operator checker/mapper (see examples)
-set = parse.set = (
-  op,
-  opPrec, fn=SPACE, // if opPrec & fn come in reverse order - consider them raw parse fn case, still precedence possible
-  c=op.charCodeAt(0),
-  l=op.length,
-  prev=lookup[c],
-  arity=fn.length || ([fn,opPrec]=[opPrec,fn], 0),
-  word=op.toUpperCase()!==op, // make sure word boundary comes after word operator
-  map=
-    // binary
-    arity>1 ? (a,b) => a && (b=expr(opPrec)) && (
-      !a.length && !b.length ? (a=fn(a(),b()), ()=>a) : // static pre-eval like `"a"+"b"`
-      ctx => fn(a(ctx),b(ctx),a.id?.(ctx),b.id?.(ctx))
-    ) :
-    // unary prefix (0 args)
-    arity ? a => !a && (a=expr(opPrec-1)) && (ctx => fn(a(ctx))) :
-    fn // custom parser
-) =>
-lookup[c] = (a, curPrec, from=idx) => curPrec<opPrec && (l<2||cur.substr(idx,l)==op) && (!word||!isId(cur.charCodeAt(idx+l))) && (idx+=l, map(a, curPrec)) || (idx=from, prev&&prev(a, curPrec));
-
-const PERIOD=46, CPAREN=41, CBRACK$1=93, DQUOTE$1=34, _0=48, _9=57,
-PREC_SEQ=1, PREC_SOME=4, PREC_EVERY=5, PREC_OR$1=6, PREC_XOR=7, PREC_AND=8,
-PREC_EQ$1=9, PREC_COMP$1=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY$1=15, PREC_CALL=18;
-
-let list$1, op$1, prec$1, fn$1,
-    isNum = c => c>=_0 && c<=_9,
-    // 1.2e+3, .5
-    num = n => (
-      n&&err('Unexpected number'),
-      n = skip(c=>c == PERIOD || isNum(c)),
-      (cur.charCodeAt(idx) == 69 || cur.charCodeAt(idx) == 101) && (n += skip(2) + skip(isNum)),
-      n=+n, n!=n ? err('Bad number') : () => n // 0 args means token is static
-    ),
-
-    inc = (a,fn) => ctx => fn(a.of?a.of(ctx):ctx, a.id(ctx));
-
-// numbers
-for (op$1=_0;op$1<=_9;) lookup[op$1++] = num;
-
-// operators
-for (list$1=[
-  // "a"
-  '"', a => (a=a?err('Unexpected string'):skip(c => c-DQUOTE$1), skip()||err('Bad string'), ()=>a),,
-
-  // a.b
-  '.', (a,id) => (space(), id=skip(isId)||err(), fn$1=ctx=>a(ctx)[id], fn$1.id=()=>id, fn$1.of=a, fn$1), PREC_CALL,
-
-  // .2
-  // FIXME: .123 is not operator, so we skip back, but mb reorganizing num would be better
-  '.', a => !a && num(skip(-1)),,
-
-  // a[b]
-  '[', (a,b,fn) => a && (b=expr(0,CBRACK$1)||err(), fn=ctx=>a(ctx)[b(ctx)], fn.id=b, fn.of=a, fn), PREC_CALL,
-
-  // a(), a(b), (a,b), (a+b)
-  '(', (a,b,fn) => (
-    b=expr(0,CPAREN),
-    // a(), a(b), a(b,c,d)
-    a ? ctx => a(ctx).apply(a.of?.(ctx), b ? b.all ? b.all(ctx) : [b(ctx)] : []) :
-    // (a+b)
-    b || err()
-  ), PREC_CALL,
-
-  // [a,b,c] or (a,b,c)
-  ',', (a,prec,b=expr(PREC_SEQ),fn=ctx => (a(ctx), b(ctx))) => (
-    b ? (fn.all = a.all ? ctx => [...a.all(ctx),b(ctx)] : ctx => [a(ctx),b(ctx)]) : err('Skipped argument',),
-    fn
-  ), PREC_SEQ,
-
-  '|', PREC_OR$1, (a,b)=>a|b,
-  '||', PREC_SOME, (a,b)=>a||b,
-
-  '&', PREC_AND, (a,b)=>a&b,
-  '&&', PREC_EVERY, (a,b)=>a&&b,
-
-  '^', PREC_XOR, (a,b)=>a^b,
-
-  // ==, !=
-  '==', PREC_EQ$1, (a,b)=>a==b,
-  '!=', PREC_EQ$1, (a,b)=>a!=b,
-
-  // > >= >> >>>, < <= <<
-  '>', PREC_COMP$1, (a,b)=>a>b,
-  '>=', PREC_COMP$1, (a,b)=>a>=b,
-  '>>', PREC_SHIFT, (a,b)=>a>>b,
-  '>>>', PREC_SHIFT, (a,b)=>a>>>b,
-  '<', PREC_COMP$1, (a,b)=>a<b,
-  '<=', PREC_COMP$1, (a,b)=>a<=b,
-  '<<', PREC_SHIFT, (a,b)=>a<<b,
-
-  // + ++ - --
-  '+', PREC_SUM, (a,b)=>a+b,
-  '+', PREC_UNARY$1, (a)=>+a,
-  '++', a => inc(a||expr(PREC_UNARY$1-1), a ? (a,b)=>a[b]++ : (a,b)=>++a[b]), PREC_UNARY$1,
-
-  '-', PREC_SUM, (a,b)=>a-b,
-  '-', PREC_UNARY$1, (a)=>-a,
-  '--', a => inc(a||expr(PREC_UNARY$1-1), a ? (a,b)=>a[b]-- : (a,b)=>--a[b]), PREC_UNARY$1,
-
-  // ! ~
-  '!', PREC_UNARY$1, (a)=>!a,
-
-  // * / %
-  '*', PREC_MULT, (a,b)=>a*b,
-  '/', PREC_MULT, (a,b)=>a/b,
-  '%', PREC_MULT, (a,b)=>a%b
-]; [op$1,prec$1,fn$1,...list$1]=list$1, op$1;) set(op$1,prec$1,fn$1);
-
 // justin lang https://github.com/endojs/Jessie/issues/66
+import { skip, cur, idx, err, expr } from './parse.js'
+import compile from './compile.js'
+import subscript from './subscript.js'
+
+const PERIOD=46, OPAREN=40, CPAREN=41, OBRACK=91, CBRACK=93, SPACE=32, DQUOTE=34, QUOTE=39, _0=48, _9=57, BSLASH=92,
+PREC_SEQ=1, PREC_COND=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_EXP=14, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
+
+let escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'},
+  string = q => (qc, c, str='') => {
+    qc&&err('Unexpected string') // must not follow another token
+    skip()
+    while (c=cur.charCodeAt(idx), c-q) {
+      if (c === BSLASH) skip(), c=skip(), str += escape[c] || c
+      else str += skip()
+    }
+    skip()
+    return ['', str]
+  },
+
+list = [
+  // operators
+  '===',  PREC_EQ, (a,b) => a===b,
+  '!==',  PREC_EQ, (a,b) => a!==b,
+  '~',  PREC_UNARY, (a) => ~a,
+
+  // ?:
+  '?', PREC_COND, [
+    (a, b, c) => a && (b=expr(2,58)) && (c=expr(3), ['?', a, b, c]),
+    (a, b, c) => (a=compile(a),b=compile(b),c=compile(c), ctx => a(ctx) ? b(ctx) : c(ctx))
+  ],
 
-const CBRACK=93, DQUOTE=34, QUOTE=39, BSLASH=92,
-PREC_OR=6, PREC_EQ=9, PREC_COMP=10, PREC_EXP=14, PREC_UNARY=15;
+  '??', PREC_OR, (a,b) => a ?? b,
 
+  // a?.[, a?.( - postfix operator
+  '?.', PREC_CALL, [a => a && ['?.', a], a => (a=compile(a), ctx => a(ctx)||(()=>{})) ],
+  // a?.b - optional chain operator
+  '?.', PREC_CALL, [
+    (a,b) => a && (b=expr(PREC_CALL),!b?.map) && ['?.',a,b],
+    (a,b) => b && (a=compile(a), ctx => a(ctx)?.[b])
+  ],
 
-let list, op, prec, fn,
-    escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'},
-    string = q => (qc, c, str='') => {
-      qc&&err('Unexpected string'); // must not follow another token
-      while (c=cur.charCodeAt(idx), c-q) {
-        if (c === BSLASH) skip(), c=skip(), str += escape[c] || c;
-        else str += skip();
-      }
-      return skip()||err('Bad string'), () => str
-    };
+  'in', PREC_COMP , (a,b) => a in b,
 
-// operators
-for (list=[
   // "' with /
-  '"', string(DQUOTE),,
-  "'", string(QUOTE),,
+  '"', , [string(DQUOTE)],
+  "'", , [string(QUOTE)],
 
   // /**/, //
-  '/*', (a, prec) => (skip(c => c !== 42 && cur.charCodeAt(idx+1) !== 47), skip(2), a||expr(prec)),,
-  '//', (a, prec) => (skip(c => c >= 32), a||expr(prec)),,
+  '/*', 20, [(a, prec) => (skip(c => c !== 42 && cur.charCodeAt(idx+1) !== 47), skip(2), a||expr(prec))],
+  '//', 20, [(a, prec) => (skip(c => c >= 32), a||expr(prec))],
 
   // literals
-  'null', a => a ? err('Unexpected literal') : ()=>null,,
-  'true', a => a ? err('Unexpected literal') : ()=>true,,
-  'false', a => a ? err('Unexpected literal') : ()=>false,,
-  'undefined', a => a ? err('Unexpected literal') : ()=>undefined,,
+  'null', 20, [a => a ? err() : ['',null]],
+  'true', 20, [a => a ? err() : ['',true]],
+  'false', 20, [a => a ? err() : ['',false]],
+  'undefined', 20, [a => a ? err() : ['',undefined]],
 
-  ';', a => expr()||(()=>{}),,
-
-  // operators
-  '===', PREC_EQ, (a,b) => a===b,
-  '!==', PREC_EQ, (a,b) => a!==b,
-  '~', PREC_UNARY, (a) => ~a,
+  // FIXME: make sure that is right
+  ';', 20, [a => expr()||['']],
 
   // right order
-  '**', (a,prec,b=expr(PREC_EXP-1)) => ctx=>a(ctx)**b(ctx), PREC_EXP,
-
-  // ?:
-  ':', 3.1, (a,b) => [a,b],
-  '?', 3, (a,b) => a ? b[0] : b[1],
-
-  '??', PREC_OR, (a,b) => a??b,
-
-  // a?.[, a?.( - postfix operator
-  '?.', a => a && (ctx => a(ctx)||(()=>{})),,//(a) => a||(()=>{}),
-  // a?.b - optional chain operator
-  '?.', (a,id) => (space(), id=skip(isId)) && (ctx => a(ctx)?.[id]),,
-
-  'in', PREC_COMP, (a,b) => a in b,
+  // '**', (a,prec,b=expr(PREC_EXP-1)) => ctx=>a(ctx)**b(ctx), PREC_EXP,
+  '**', -PREC_EXP, (a,b)=>a**b,
 
   // [a,b,c]
-  '[', (a) => !a && (
-    a=expr(0,CBRACK),
-    !a ? ctx => [] : a.all ? ctx => a.all(ctx) : ctx => [a(ctx)]
-  ),,
+  '[', 20, [
+    (a) => !a && ['[', expr(0,93)||''],
+    (a,b) => !b && (
+      !a ? () => [] : // []
+        a[0] === ',' ? (a=a.slice(1).map(compile), ctx => a.map(a=>a(ctx))) : // [a,b,c]
+        (a=compile(a), ctx => [a(ctx)]) // [a]
+    )],
 
   // {a:1, b:2, c:3}
-  '{', (a, entries) => !a && (
-      a=expr(0,125),
-      !a ? ctx => ({}) : ctx => (entries=(a.all||a)(ctx), Object.fromEntries(a.all?entries:[entries]))
-    ),,
-  // for JSON case we should not collect arg (different evaluator than ternary)
-  ':', (a, prec, b) => (b=expr(1.1)||err(), a.id&&args.pop(), ctx => [(a.id||a)(ctx), b(ctx)]), 1.1
-
-]; [op,prec,fn,...list]=list, op;) set(op,prec,fn);
-
-export { parse as default };
+  '{', 20, [
+    a => !a && (['{', expr(0,125)||'']),
+    (a,b) => (
+      !a ? ctx => ({}) : // {}
+      a[0] === ',' ? (a=a.slice(1).map(compile), ctx=>Object.fromEntries(a.map(a=>a(ctx)))) : // {a:1,b:2}
+      a[0] === ':' ? (a=compile(a), ctx => Object.fromEntries([a(ctx)])) : // {a:1}
+      (b=compile(a), ctx=>({[a]:b(ctx)}))
+    )
+  ],
+  ':', 1.1, [
+    (a, b) => (b=expr(1.1)||err(), [':',a,b]),
+    (a,b) => (b=compile(b),a=Array.isArray(a)?compile(a):(a=>a).bind(0,a), ctx=>[a(ctx),b(ctx)])
+  ]
+]
+for (;list[2];) subscript.set(...list.splice(0,3))
+
+export default subscript
+export * from './subscript.js'

package/justin.min.js

@@ -1 +1 @@
-let e,t,r,l,a,n,d,o=(l,a)=>(e=0,r=[],t=l.trim(),!(l=t?c():e=>a)||t[e]?f():a=e=>l(e||{}),a.args=r,a),i=e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e,f=(r="Bad syntax",l=t[e])=>{throw SyntaxError(r+" `"+l+"` at "+e)},p=(r=1,l=e,a)=>{if("number"==typeof r)e+=r;else for(;r(t.charCodeAt(e));)e++;return t.slice(l,e)},c=(t=0,r,l,a,n,d)=>{for(;(l=s())&&(n=(d=h[l])&&d(a,t)||!a&&u());)a=n;return r&&(l==r?e++:f()),a},s=r=>{for(;(r=t.charCodeAt(e))<=32;)e++;return r},u=(e=p(i),t)=>e?(t=t=>t[e],r.push(e),t.id=()=>e,t):0,h=[],g=o.set=(r,l,a=32,n=r.charCodeAt(0),d=r.length,o=h[n],f=a.length||([a,l]=[l,a],0),p=r.toUpperCase()!==r,s=(f>1?(e,t)=>e&&(t=c(l))&&(e.length||t.length?r=>a(e(r),t(r),e.id?.(r),t.id?.(r)):(e=a(e(),t()),()=>e)):f?e=>!e&&(e=c(l-1))&&(t=>a(e(t))):a))=>h[n]=(a,n,f=e)=>n<l&&(d<2||t.substr(e,d)==r)&&(!p||!i(t.charCodeAt(e+d)))&&(e+=d,s(a,n))||(e=f,o&&o(a,n)),x=e=>e>=48&&e<=57,C=r=>(r&&f("Unexpected number"),r=p((e=>46==e||x(e))),(69==t.charCodeAt(e)||101==t.charCodeAt(e))&&(r+=p(2)+p(x)),(r=+r)!=r?f("Bad number"):()=>r),A=(e,t)=>r=>t(e.of?e.of(r):r,e.id(r));for(a=48;a<=57;)h[a++]=C;for(l=['"',e=>(e=e?f("Unexpected string"):p((e=>e-34)),p()||f("Bad string"),()=>e),,".",(e,t)=>(s(),t=p(i)||f(),d=r=>e(r)[t],d.id=()=>t,d.of=e,d),18,".",e=>!e&&C(p(-1)),,"[",(e,t,r)=>e&&(t=c(0,93)||f(),(r=r=>e(r)[t(r)]).id=t,r.of=e,r),18,"(",(e,t,r)=>(t=c(0,41),e?r=>e(r).apply(e.of?.(r),t?t.all?t.all(r):[t(r)]:[]):t||f()),18,",",(e,t,r=c(1),l=(t=>(e(t),r(t))))=>(r?l.all=e.all?t=>[...e.all(t),r(t)]:t=>[e(t),r(t)]:f("Skipped argument"),l),1,"|",6,(e,t)=>e|t,"||",4,(e,t)=>e||t,"&",8,(e,t)=>e&t,"&&",5,(e,t)=>e&&t,"^",7,(e,t)=>e^t,"==",9,(e,t)=>e==t,"!=",9,(e,t)=>e!=t,">",10,(e,t)=>e>t,">=",10,(e,t)=>e>=t,">>",11,(e,t)=>e>>t,">>>",11,(e,t)=>e>>>t,"<",10,(e,t)=>e<t,"<=",10,(e,t)=>e<=t,"<<",11,(e,t)=>e<<t,"+",12,(e,t)=>e+t,"+",15,e=>+e,"++",e=>A(e||c(14),e?(e,t)=>e[t]++:(e,t)=>++e[t]),15,"-",12,(e,t)=>e-t,"-",15,e=>-e,"--",e=>A(e||c(14),e?(e,t)=>e[t]--:(e,t)=>--e[t]),15,"!",15,e=>!e,"*",13,(e,t)=>e*t,"/",13,(e,t)=>e/t,"%",13,(e,t)=>e%t];[a,n,d,...l]=l,a;)g(a,n,d);let U,b,m,y,B={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"},v=r=>(l,a,n="")=>{for(l&&f("Unexpected string");(a=t.charCodeAt(e))-r;)92===a?(p(),a=p(),n+=B[a]||a):n+=p();return p()||f("Bad string"),()=>n};for((U=['"',v(34),,"'",v(39),,"/*",(r,l)=>(p((r=>42!==r&&47!==t.charCodeAt(e+1))),p(2),r||c(l)),,"//",(e,t)=>(p((e=>e>=32)),e||c(t)),,"null",e=>e?f("Unexpected literal"):()=>null,,"true",e=>e?f("Unexpected literal"):()=>!0,,"false",e=>e?f("Unexpected literal"):()=>!1,,"undefined",e=>e?f("Unexpected literal"):()=>{},,";",e=>c()||(()=>{}),,"===",9,(e,t)=>e===t,"!==",9,(e,t)=>e!==t,"~",15,e=>~e,"**",(e,t,r=c(13))=>t=>e(t)**r(t),14,":",3.1,(e,t)=>[e,t],"?",3,(e,t)=>e?t[0]:t[1],"??",6,(e,t)=>e??t,"?.",e=>e&&(t=>e(t)||(()=>{})),,"?.",(e,t)=>(s(),(t=p(i))&&(r=>e(r)?.[t])),,"in",10,(e,t)=>e in t,"[",e=>!e&&((e=c(0,93))?e.all?t=>e.all(t):t=>[e(t)]:e=>[]),,"{",(e,t)=>!e&&((e=c(0,125))?r=>(t=(e.all||e)(r),Object.fromEntries(e.all?t:[t])):e=>({})),,":",(e,t,l)=>(l=c(1.1)||f(),e.id&&r.pop(),t=>[(e.id||e)(t),l(t)]),1.1]);[b,m,y,...U]=U,b;)g(b,m,y);export{o as default};
+let e,r,t=t=>(e=0,r=t,t=a(),r[e]?l():t||""),l=(t="Bad syntax",l=r[e])=>{throw SyntaxError(t+" `"+l+"` at "+e)},n=(t=1,l=e,n)=>{if("number"==typeof t)e+=t;else for(;n=t(r.charCodeAt(e));)e+=n;return r.slice(l,e)},a=(r=0,t,n,a,o,i)=>{for(;(n=s())&&(o=(i=c[n])&&i(a,r)||!a&&c[0]());)a=o;return t&&(n==t?e++:l()),a},s=t=>{for(;(t=r.charCodeAt(e))<=32;)e++;return t},o=e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e,c=[e=>n(o)];t.set=(t,l=32,n,a=t.charCodeAt(0),s=t.length,i=c[a],f=t.toUpperCase()!==t)=>c[a]=(a,c,p=e)=>c<l&&(s<2||r.substr(e,s)==t)&&(!f||!o(r.charCodeAt(e+s)))&&(e+=s,n(a,c))||(e=p,i&&i(a,c));const i=e=>Array.isArray(e)?f[e[0]](...e.slice(1)):r=>r?.[e];i.set=(e,r,t=f[e])=>f[e]=(...e)=>r(...e)||t&&t(...e);const f={},p=e=>(e=t(e),r=>(e.call?e:e=i(e))(r)),h=p.set=(e,r,l,n=r<0,s=l[0],o=l[1],f=!s&&l.length)=>(s||=f?f>1?(t,l)=>t&&(l=a(r-n))&&[e,t,l]:t=>!t&&(t=a(r-1))&&[e,t]:(t,l)=>t&&(l=a(r))&&(t[0]===e&&t[2]?(t.push(l),t):[e,t,l]),o||=f?f>1?(e,r)=>r&&(e=i(e),r=i(r),e.length||r.length?t=>l(e(t),r(t)):(e=l(e(),r()),()=>e)):(e,r)=>!r&&((e=i(e)).length?r=>l(e(r)):(e=l(e()),()=>e)):(...e)=>(e=e.map(i),r=>l(...e.map((e=>e(r))))),(r=n?-r:r)?t.set(e,r,s):c[e.charCodeAt(0)||1]=s,i.set(e,o)),d=e=>e?l():["",(e=+n((e=>46===e||e>=48&&e<=57||(69===e||101===e?2:0))))!=e?l():e],u=(e,r,t,l)=>[e,r,[t=>t?["++"===e?"-":"+",[e,t],["",1]]:[e,a(r-1)],l=(e,r)=>"("===e[0]?l(e[1]):"."===e[0]?(r=e[2],e=i(e[1]),l=>t(e(l),r)):"["===e[0]?([,e,r]=e,e=i(e),r=i(r),l=>t(e(l),r(l))):r=>t(r,e)]],m=["",,[,e=>()=>e],'"',,[e=>e?l():["",(n()+n((e=>e-34?1:0))+(n()||l("Bad string"))).slice(1,-1)]],".",,[e=>!e&&d()],...Array(10).fill(0).flatMap(((e,r)=>[""+r,0,[d]])),",",1,(...e)=>e[e.length-1],"||",4,(...e)=>{let r,t=0;for(;!r&&t<e.length;)r=e[t++];return r},"&&",5,(...e)=>{let r=0,t=!0;for(;t&&r<e.length;)t=e[r++];return t},"+",12,(e,r)=>e+r,"-",12,(e,r)=>e-r,"*",13,(e,r)=>e*r,"/",13,(e,r)=>e/r,"%",13,(e,r)=>e%r,"|",6,(e,r)=>e|r,"&",8,(e,r)=>e&r,"^",7,(e,r)=>e^r,"==",9,(e,r)=>e==r,"!=",9,(e,r)=>e!=r,">",10,(e,r)=>e>r,">=",10,(e,r)=>e>=r,"<",10,(e,r)=>e<r,"<=",10,(e,r)=>e<=r,">>",11,(e,r)=>e>>r,">>>",11,(e,r)=>e>>>r,"<<",11,(e,r)=>e<<r,"+",15,e=>+e,"-",15,e=>-e,"!",15,e=>!e,...u("++",15,((e,r)=>++e[r])),...u("--",15,((e,r)=>--e[r])),"[",18,[e=>e&&["[",e,a(0,93)||l()],(e,r)=>r&&(e=i(e),r=i(r),t=>e(t)[r(t)])],".",18,[(e,r)=>e&&(r=a(18))&&[".",e,r],(e,r)=>(e=i(e),r=r[0]?r:r[1],t=>e(t)[r])],"(",18,[e=>!e&&["(",a(0,41)||l()],i],"(",18,[e=>e&&["(",e,a(0,41)||""],(e,r,t,l)=>null!=r&&(l=""==r?()=>[]:","===r[0]?(r=r.slice(1).map(i),e=>r.map((r=>r(e)))):(r=i(r),e=>[r(e)]),"."===e[0]?(t=e[2],e=i(e[1]),r=>e(r)[t](...l(r))):"["===e[0]?(t=i(e[2]),e=i(e[1]),r=>e(r)[t(r)](...l(r))):(e=i(e),r=>e(r)(...l(r))))]];for(;m[2];)h(...m.splice(0,3));let A={n:"\n",r:"\r",t:"\t",b:"\b",f:"\f",v:"\v"},g=t=>(a,s,o="")=>{for(a&&l("Unexpected string"),n();(s=r.charCodeAt(e))-t;)92===s?(n(),s=n(),o+=A[s]||s):o+=n();return n(),["",o]},y=["===",9,(e,r)=>e===r,"!==",9,(e,r)=>e!==r,"~",15,e=>~e,"?",3,[(e,r,t)=>e&&(r=a(2,58))&&["?",e,r,a(3)],(e,r,t)=>(e=i(e),r=i(r),t=i(t),l=>e(l)?r(l):t(l))],"??",6,(e,r)=>e??r,"?.",18,[e=>e&&["?.",e],e=>(e=i(e),r=>e(r)||(()=>{}))],"?.",18,[(e,r)=>e&&!(r=a(18))?.map&&["?.",e,r],(e,r)=>r&&(e=i(e),t=>e(t)?.[r])],"in",10,(e,r)=>e in r,'"',,[g(34)],"'",,[g(39)],"/*",20,[(t,l)=>(n((t=>42!==t&&47!==r.charCodeAt(e+1))),n(2),t||a(l))],"//",20,[(e,r)=>(n((e=>e>=32)),e||a(r))],"null",20,[e=>e?l():["",null]],"true",20,[e=>e?l():["",!0]],"false",20,[e=>e?l():["",!1]],"undefined",20,[e=>e?l():["",void 0]],";",20,[e=>a()||[""]],"**",-14,(e,r)=>e**r,"[",20,[e=>!e&&["[",a(0,93)||""],(e,r)=>!r&&(e?","===e[0]?(e=e.slice(1).map(i),r=>e.map((e=>e(r)))):(e=i(e),r=>[e(r)]):()=>[])],"{",20,[e=>!e&&["{",a(0,125)||""],(e,r)=>e?","===e[0]?(e=e.slice(1).map(i),r=>Object.fromEntries(e.map((e=>e(r))))):":"===e[0]?(e=i(e),r=>Object.fromEntries([e(r)])):(r=i(e),t=>({[e]:r(t)})):e=>({})],":",1.1,[(e,r)=>[":",e,a(1.1)||l()],(e,r)=>(r=i(r),e=Array.isArray(e)?i(e):(e=>e).bind(0,e),t=>[e(t),r(t)])]];for(;y[2];)p.set(...y.splice(0,3));export{i as compile,p as default,t as parse};

package/package.json

@@ -1,13 +1,20 @@
 {
   "name": "subscript",
-  "version": "6.3.1",
+  "version": "7.0.2",
   "description": "Fast and tiny expression evaluator with common syntax microlanguage.",
-  "main": "src/subscript.js",
-  "module": "src/subscript.js",
+  "main": "subscript.js",
+  "module": "subscript.js",
   "browser": "subscript.js",
+  "exports": {
+    ".": "./subscript.js",
+    "./parse": "./parse.js",
+    "./subscript": "./subscript.js",
+    "./justin": "./justin.js"
+  },
   "type": "module",
   "files": [
-    "src",
+    "parse.js",
+    "compile.js",
     "subscript.js",
     "subscript.min.js",
     "justin.js",
@@ -19,12 +26,13 @@
     "test": "test"
   },
   "scripts": {
-    "build": "npm run build-subscript && npm run minify-subscript && npm run build-justin && npm run minify-justin",
-    "build-subscript": "rollup src/subscript.js --file subscript.js --format esm --name \"Subscript\"",
-    "minify-subscript": "terser subscript.js -o subscript.min.js --module -c passes=3 -m",
-    "build-justin": "rollup src/justin.js --file justin.js --format esm --name \"Justin\"",
-    "minify-justin": "terser justin.js -o justin.min.js --module -c passes=3 -m",
-    "test": "node test"
+    "build": "npm run build-subscript && npm run build-justin",
+    "minify": "npm run minify-subscript && npm run minify-justin",
+    "build-subscript": "rollup subscript.js --file subscript.min.js --format esm --name \"Subscript\"",
+    "minify-subscript": "terser subscript.min.js -o subscript.min.js --module -c passes=3 -m",
+    "build-justin": "rollup justin.js --file justin.min.js --format esm --name \"Justin\"",
+    "minify-justin": "terser justin.min.js -o justin.min.js --module -c passes=3 -m",
+    "test": "node test && node test/jsep && node test/perf"
   },
   "repository": {
     "type": "git",

package/{src/index.js → parse.js}

@@ -1,40 +1,30 @@
-const SPACE=32, CPAREN=41
+const SPACE=32
 
 // current string, index and collected ids
-export let idx, cur, args,
+export let idx, cur,
 
 // no handling tagged literals since easily done on user side with cache, if needed
-parse = (s, fn) => (
-  idx=0, args=[], cur=s.trim(),
-  !(s = cur ? expr() : ctx=>{}) || cur[idx] ? err() :
-  fn = ctx=>s(ctx||{}), fn.args = args, fn
-),
-
-isId = 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
+parse = s => (idx=0, cur=s, s = expr(), cur[idx] ? err() : s || ''),
 
 err = (msg='Bad syntax',c=cur[idx]) => { throw SyntaxError(msg + ' `' + c + '` at ' + idx) },
 
 skip = (is=1, from=idx, l) => {
   if (typeof is == 'number') idx += is
-  else while (is(cur.charCodeAt(idx))) idx++
+  else while (l=is(cur.charCodeAt(idx))) idx+=l
   return cur.slice(from, idx)
 },
 
 // a + b - c
 expr = (prec=0, end, cc, token, newNode, fn) => {
+
   // chunk/token parser
   while (
     ( cc=space() ) && // till not end
     // FIXME: extra work is happening here, when lookup bails out due to lower precedence -
     // it makes extra `space` call for parent exprs on the same character to check precedence again
-    ( newNode =
+    (newNode =
       (fn=lookup[cc]) && fn(token, prec) || // if operator with higher precedence isn't found
-      (!token && id()) // parse literal or quit. token seqs are forbidden: `a b`, `a "b"`, `1.32 a`
+      (!token && lookup[0]()) // parse literal or quit. token seqs are forbidden: `a b`, `a "b"`, `1.32 a`
     )
   ) token = newNode;
 
@@ -48,29 +38,28 @@ expr = (prec=0, end, cc, token, newNode, fn) => {
 // skip space chars, return first non-space character
 space = cc => { while ((cc = cur.charCodeAt(idx)) <= SPACE) idx++; return cc },
 
-// variable identifier
-id = (name=skip(isId), fn) => name ? (fn=ctx => ctx[name], args.push(name), fn.id=()=>name, fn) : 0,
+isId = 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
 
 // operator/token lookup table
-lookup = [],
+// lookup[0] is id parser to let configs redefine it
+lookup = [n=>skip(isId)],
 
 // create operator checker/mapper (see examples)
 set = parse.set = (
   op,
-  opPrec, fn=SPACE, // if opPrec & fn come in reverse order - consider them raw parse fn case, still precedence possible
+  prec=SPACE,
+  map,
   c=op.charCodeAt(0),
   l=op.length,
   prev=lookup[c],
-  arity=fn.length || ([fn,opPrec]=[opPrec,fn], 0),
-  word=op.toUpperCase()!==op, // make sure word boundary comes after word operator
-  map=
-    // binary
-    arity>1 ? (a,b) => a && (b=expr(opPrec)) && (
-      !a.length && !b.length ? (a=fn(a(),b()), ()=>a) : // static pre-eval like `"a"+"b"`
-      ctx => fn(a(ctx),b(ctx),a.id?.(ctx),b.id?.(ctx))
-    ) :
-    // unary prefix (0 args)
-    arity ? a => !a && (a=expr(opPrec-1)) && (ctx => fn(a(ctx))) :
-    fn // custom parser
-) =>
-lookup[c] = (a, curPrec, from=idx) => curPrec<opPrec && (l<2||cur.substr(idx,l)==op) && (!word||!isId(cur.charCodeAt(idx+l))) && (idx+=l, map(a, curPrec)) || (idx=from, prev&&prev(a, curPrec))
+  word=op.toUpperCase()!==op // make sure word boundary comes after word operator
+) => lookup[c] = (a, curPrec, from=idx) =>
+  curPrec<prec && (l<2||cur.substr(idx,l)==op) && (!word||!isId(cur.charCodeAt(idx+l))) && (idx+=l, map(a, curPrec)) ||
+  (idx=from, prev&&prev(a, curPrec))
+
+export default parse

package/subscript.js

@@ -1,166 +1,122 @@
-const SPACE=32;
+import parse, { lookup, skip, cur, idx, err, expr } from './parse.js'
+import compile from './compile.js'
 
-// current string, index and collected ids
-let idx, cur, args,
-
-// no handling tagged literals since easily done on user side with cache, if needed
-parse = (s, fn) => (
-  idx=0, args=[], cur=s.trim(),
-  !(s = cur ? expr() : ctx=>fn) || cur[idx] ? err() :
-  fn = ctx=>s(ctx||{}), fn.args = args, fn
-),
-
-isId = 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
-
-err = (msg='Bad syntax',c=cur[idx]) => { throw SyntaxError(msg + ' `' + c + '` at ' + idx) },
-
-skip = (is=1, from=idx, l) => {
-  if (typeof is == 'number') idx += is;
-  else while (is(cur.charCodeAt(idx))) idx++;
-  return cur.slice(from, idx)
-},
-
-// a + b - c
-expr = (prec=0, end, cc, token, newNode, fn) => {
-  // chunk/token parser
-  while (
-    ( cc=space() ) && // till not end
-    // FIXME: extra work is happening here, when lookup bails out due to lower precedence -
-    // it makes extra `space` call for parent exprs on the same character to check precedence again
-    ( newNode =
-      (fn=lookup[cc]) && fn(token, prec) || // if operator with higher precedence isn't found
-      (!token && id()) // parse literal or quit. token seqs are forbidden: `a b`, `a "b"`, `1.32 a`
-    )
-  ) token = newNode;
-
-  // check end character
-  // FIXME: can't show "Unclose paren", because can be unknown operator within group as well
-  if (end) cc==end?idx++:err();
-
-  return token
-},
-
-// skip space chars, return first non-space character
-space = cc => { while ((cc = cur.charCodeAt(idx)) <= SPACE) idx++; return cc },
-
-// variable identifier
-id = (name=skip(isId), fn) => name ? (fn=ctx => ctx[name], args.push(name), fn.id=()=>name, fn) : 0,
-
-// operator/token lookup table
-lookup = [],
-
-// create operator checker/mapper (see examples)
-set = parse.set = (
-  op,
-  opPrec, fn=SPACE, // if opPrec & fn come in reverse order - consider them raw parse fn case, still precedence possible
-  c=op.charCodeAt(0),
-  l=op.length,
-  prev=lookup[c],
-  arity=fn.length || ([fn,opPrec]=[opPrec,fn], 0),
-  word=op.toUpperCase()!==op, // make sure word boundary comes after word operator
-  map=
-    // binary
-    arity>1 ? (a,b) => a && (b=expr(opPrec)) && (
-      !a.length && !b.length ? (a=fn(a(),b()), ()=>a) : // static pre-eval like `"a"+"b"`
-      ctx => fn(a(ctx),b(ctx),a.id?.(ctx),b.id?.(ctx))
-    ) :
-    // unary prefix (0 args)
-    arity ? a => !a && (a=expr(opPrec-1)) && (ctx => fn(a(ctx))) :
-    fn // custom parser
-) =>
-lookup[c] = (a, curPrec, from=idx) => curPrec<opPrec && (l<2||cur.substr(idx,l)==op) && (!word||!isId(cur.charCodeAt(idx+l))) && (idx+=l, map(a, curPrec)) || (idx=from, prev&&prev(a, curPrec));
-
-const PERIOD=46, CPAREN=41, CBRACK=93, DQUOTE=34, _0=48, _9=57,
+const OPAREN=40, CPAREN=41, OBRACK=91, CBRACK=93, SPACE=32, DQUOTE=34, PERIOD=46, _0=48, _9=57,
 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_CALL=18;
-
-let list, op, prec, fn,
-    isNum = c => c>=_0 && c<=_9,
-    // 1.2e+3, .5
-    num = n => (
-      n&&err('Unexpected number'),
-      n = skip(c=>c == PERIOD || isNum(c)),
-      (cur.charCodeAt(idx) == 69 || cur.charCodeAt(idx) == 101) && (n += skip(2) + skip(isNum)),
-      n=+n, n!=n ? err('Bad number') : () => n // 0 args means token is static
-    ),
-
-    inc = (a,fn) => ctx => fn(a.of?a.of(ctx):ctx, a.id(ctx));
-
-// numbers
-for (op=_0;op<=_9;) lookup[op++] = num;
-
-// operators
-for (list=[
-  // "a"
-  '"', a => (a=a?err('Unexpected string'):skip(c => c-DQUOTE), skip()||err('Bad string'), ()=>a),,
-
-  // a.b
-  '.', (a,id) => (space(), id=skip(isId)||err(), fn=ctx=>a(ctx)[id], fn.id=()=>id, fn.of=a, fn), PREC_CALL,
-
-  // .2
-  // FIXME: .123 is not operator, so we skip back, but mb reorganizing num would be better
-  '.', a => !a && num(skip(-1)),,
-
-  // a[b]
-  '[', (a,b,fn) => a && (b=expr(0,CBRACK)||err(), fn=ctx=>a(ctx)[b(ctx)], fn.id=b, fn.of=a, fn), PREC_CALL,
-
-  // a(), a(b), (a,b), (a+b)
-  '(', (a,b,fn) => (
-    b=expr(0,CPAREN),
-    // a(), a(b), a(b,c,d)
-    a ? ctx => a(ctx).apply(a.of?.(ctx), b ? b.all ? b.all(ctx) : [b(ctx)] : []) :
-    // (a+b)
-    b || err()
-  ), PREC_CALL,
-
-  // [a,b,c] or (a,b,c)
-  ',', (a,prec,b=expr(PREC_SEQ),fn=ctx => (a(ctx), b(ctx))) => (
-    b ? (fn.all = a.all ? ctx => [...a.all(ctx),b(ctx)] : ctx => [a(ctx),b(ctx)]) : err('Skipped argument',),
-    fn
-  ), PREC_SEQ,
+PREC_EQ=9, PREC_COMP=10, PREC_SHIFT=11, PREC_SUM=12, PREC_MULT=13, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18
+
+const subscript = s => (s=parse(s), ctx => (s.call?s:(s=compile(s)))(ctx)),
+
+// set any operator
+// right assoc is indicated by negative precedence (meaning go from right to left)
+set = subscript.set = (op, prec, fn, right=prec<0, parseFn=fn[0], evalFn=fn[1], arity=!parseFn&&fn.length) => (
+  parseFn ||=
+    !arity ? (a, b) => a && (b=expr(prec)) && (a[0] === op && a[2] ? (a.push(b), a) : [op,a,b]) :
+    arity > 1 ? (a, b) => a && (b=expr(prec-right)) && [op,a,b] :
+    a => !a && (a=expr(prec-1)) && [op, a]
+  ,
+  evalFn ||=
+    !arity ? (...args) => (args=args.map(compile), ctx => fn(...args.map(arg=>arg(ctx)))) :
+    arity > 1 ? (a,b) => b && (a=compile(a),b=compile(b), !a.length&&!b.length ? (a=fn(a(),b()),()=>a) : ctx => fn(a(ctx),b(ctx))) :
+    (a,b) => !b && (a=compile(a), !a.length ? (a=fn(a()),()=>a) : ctx => fn(a(ctx)))
+  ,
+  (prec=right?-prec:prec) ? parse.set(op,prec,parseFn) : (lookup[op.charCodeAt(0)||1]=parseFn),
+  compile.set(op, evalFn)
+),
 
+// create increment-assign pair from fn
+num = a => a ? err() : ['', (a=+skip(c => c === PERIOD || (c>=_0 && c<=_9) || (c===69||c===101?2:0)))!=a?err():a],
+inc = (op, prec, fn, ev) => [op, prec, [
+  a => a ? [op==='++'?'-':'+',[op,a],['',1]] : [op,expr(prec-1)], // ++a → [++, a], a++ → [-,[++,a],1]
+  ev = (a,b) => (
+    a[0] === '(' ? ev(a[1]) : // ++(((a)))
+    a[0] === '.' ? (b=a[2], a=compile(a[1]), ctx => fn(a(ctx), b)) : // ++a.b
+    a[0] === '[' ? ([,a,b]=a, a=compile(a),b=compile(b), ctx => fn(a(ctx),b(ctx))) : // ++a[b]
+    (ctx => fn(ctx,a)) // ++a
+  )
+]],
+list = [
+  // literals
+  // null operator returns first value (needed for direct literals)
+  '',, [,v => () => v],
+
+  '"',, [
+    (a) => a ? err() : ['', (skip() + skip(c => c - DQUOTE ? 1 : 0) + (skip()||err('Bad string'))).slice(1,-1)],
+  ],
+
+  // .1
+  '.',, [a=>!a && num()],
+
+  // 0-9
+  ...Array(10).fill(0).flatMap((_,i)=>[''+i,0,[num]]),
+
+  // sequences
+  ',', PREC_SEQ, (...args) => args[args.length-1],
+  '||', PREC_SOME, (...args) => { let i=0, v; for (; !v && i < args.length; ) v = args[i++]; return v },
+  '&&', PREC_EVERY, (...args) => { let i=0, v=true; for (; v && i < args.length; ) v = args[i++]; return v },
+
+  // binaries
+  '+', PREC_SUM, (a,b)=>a+b,
+  '-', PREC_SUM, (a,b)=>a-b,
+  '*', PREC_MULT, (a,b)=>a*b,
+  '/', PREC_MULT, (a,b)=>a/b,
+  '%', PREC_MULT, (a,b)=>a%b,
   '|', PREC_OR, (a,b)=>a|b,
-  '||', PREC_SOME, (a,b)=>a||b,
-
   '&', PREC_AND, (a,b)=>a&b,
-  '&&', PREC_EVERY, (a,b)=>a&&b,
-
   '^', PREC_XOR, (a,b)=>a^b,
-
-  // ==, !=
   '==', PREC_EQ, (a,b)=>a==b,
   '!=', PREC_EQ, (a,b)=>a!=b,
-
-  // > >= >> >>>, < <= <<
   '>', PREC_COMP, (a,b)=>a>b,
   '>=', PREC_COMP, (a,b)=>a>=b,
-  '>>', PREC_SHIFT, (a,b)=>a>>b,
-  '>>>', PREC_SHIFT, (a,b)=>a>>>b,
   '<', PREC_COMP, (a,b)=>a<b,
   '<=', PREC_COMP, (a,b)=>a<=b,
+  '>>', PREC_SHIFT, (a,b)=>a>>b,
+  '>>>', PREC_SHIFT, (a,b)=>a>>>b,
   '<<', PREC_SHIFT, (a,b)=>a<<b,
 
-  // + ++ - --
-  '+', PREC_SUM, (a,b)=>a+b,
-  '+', PREC_UNARY, (a)=>+a,
-  '++', a => inc(a||expr(PREC_UNARY-1), a ? (a,b)=>a[b]++ : (a,b)=>++a[b]), PREC_UNARY,
+  // unaries
+  '+', PREC_UNARY, a => +a,
+  '-', PREC_UNARY, a => -a,
+  '!', PREC_UNARY, a => !a,
 
-  '-', PREC_SUM, (a,b)=>a-b,
-  '-', PREC_UNARY, (a)=>-a,
-  '--', a => inc(a||expr(PREC_UNARY-1), a ? (a,b)=>a[b]-- : (a,b)=>--a[b]), PREC_UNARY,
+  // increments
+  ...inc('++', PREC_UNARY, (a,b) => ++a[b]),
+  ...inc('--', PREC_UNARY, (a,b) => --a[b]),
 
-  // ! ~
-  '!', PREC_UNARY, (a)=>!a,
+  // a[b]
+  '[', PREC_CALL, [
+    a => a && ['[', a, expr(0,CBRACK)||err()],
+    (a,b) => b && (a=compile(a), b=compile(b), ctx => a(ctx)[b(ctx)])
+  ],
 
-  // * / %
-  '*', PREC_MULT, (a,b)=>a*b,
-  '/', PREC_MULT, (a,b)=>a/b,
-  '%', PREC_MULT, (a,b)=>a%b
-]; [op,prec,fn,...list]=list, op;) set(op,prec,fn);
-
-export { parse as default };
+  // a.b
+  '.', PREC_CALL, [
+    (a,b) => a && (b=expr(PREC_CALL)) && ['.',a,b],
+    (a,b) => (a=compile(a),b=!b[0]?b[1]:b, ctx => a(ctx)[b]) // a.true, a.1 → needs to work fine
+  ],
+
+  // (a,b,c), (a)
+  '(', PREC_CALL, [
+    a => !a && ['(', expr(0,CPAREN)||err()],
+    compile
+  ],
+
+  // a(b,c,d), a()
+  '(', PREC_CALL, [
+    a => a && ['(', a, expr(0,CPAREN)||''],
+    (a,b,path,args) => b!=null && (
+      args = b=='' ? () => [] : // a()
+      b[0] === ',' ? (b=b.slice(1).map(compile), ctx => b.map(a=>a(ctx))) : // a(b,c)
+      (b=compile(b), ctx => [b(ctx)]), // a(b)
+
+      a[0] === '.' ? (path=a[2], a=compile(a[1]), ctx => a(ctx)[path](...args(ctx))) : // a.b(...args)
+      a[0] === '[' ? (path=compile(a[2]), a=compile(a[1]), ctx => a(ctx)[path(ctx)](...args(ctx))) : // a[b](...args)
+      (a=compile(a), ctx => a(ctx)(...args(ctx))) // a(...args)
+    )
+  ]
+]
+
+for (;list[2];) set(...list.splice(0,3))
+
+export default subscript
+export {compile, parse}

package/subscript.min.js

@@ -1 +1 @@
-let e,r,t,a,o,d,l,n=(a,o)=>(e=0,t=[],r=a.trim(),!(a=r?s():e=>o)||r[e]?h():o=e=>a(e||{}),o.args=t,o),f=e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e,h=(t="Bad syntax",a=r[e])=>{throw SyntaxError(t+" `"+a+"` at "+e)},i=(t=1,a=e,o)=>{if("number"==typeof t)e+=t;else for(;t(r.charCodeAt(e));)e++;return r.slice(a,e)},s=(r=0,t,a,o,d,l)=>{for(;(a=p())&&(d=(l=c[a])&&l(o,r)||!o&&u());)o=d;return t&&(a==t?e++:h()),o},p=t=>{for(;(t=r.charCodeAt(e))<=32;)e++;return t},u=(e=i(f),r)=>e?(r=r=>r[e],t.push(e),r.id=()=>e,r):0,c=[],g=n.set=(t,a,o=32,d=t.charCodeAt(0),l=t.length,n=c[d],h=o.length||([o,a]=[a,o],0),i=t.toUpperCase()!==t,p=(h>1?(e,r)=>e&&(r=s(a))&&(e.length||r.length?t=>o(e(t),r(t),e.id?.(t),r.id?.(t)):(e=o(e(),r()),()=>e)):h?e=>!e&&(e=s(a-1))&&(r=>o(e(r))):o))=>c[d]=(o,d,h=e)=>d<a&&(l<2||r.substr(e,l)==t)&&(!i||!f(r.charCodeAt(e+l)))&&(e+=l,p(o,d))||(e=h,n&&n(o,d)),C=e=>e>=48&&e<=57,A=t=>(t&&h("Unexpected number"),t=i((e=>46==e||C(e))),(69==r.charCodeAt(e)||101==r.charCodeAt(e))&&(t+=i(2)+i(C)),(t=+t)!=t?h("Bad number"):()=>t),m=(e,r)=>t=>r(e.of?e.of(t):t,e.id(t));for(o=48;o<=57;)c[o++]=A;for(a=['"',e=>(e=e?h("Unexpected string"):i((e=>e-34)),i()||h("Bad string"),()=>e),,".",(e,r)=>(p(),r=i(f)||h(),l=t=>e(t)[r],l.id=()=>r,l.of=e,l),18,".",e=>!e&&A(i(-1)),,"[",(e,r,t)=>e&&(r=s(0,93)||h(),(t=t=>e(t)[r(t)]).id=r,t.of=e,t),18,"(",(e,r,t)=>(r=s(0,41),e?t=>e(t).apply(e.of?.(t),r?r.all?r.all(t):[r(t)]:[]):r||h()),18,",",(e,r,t=s(1),a=(r=>(e(r),t(r))))=>(t?a.all=e.all?r=>[...e.all(r),t(r)]:r=>[e(r),t(r)]:h("Skipped argument"),a),1,"|",6,(e,r)=>e|r,"||",4,(e,r)=>e||r,"&",8,(e,r)=>e&r,"&&",5,(e,r)=>e&&r,"^",7,(e,r)=>e^r,"==",9,(e,r)=>e==r,"!=",9,(e,r)=>e!=r,">",10,(e,r)=>e>r,">=",10,(e,r)=>e>=r,">>",11,(e,r)=>e>>r,">>>",11,(e,r)=>e>>>r,"<",10,(e,r)=>e<r,"<=",10,(e,r)=>e<=r,"<<",11,(e,r)=>e<<r,"+",12,(e,r)=>e+r,"+",15,e=>+e,"++",e=>m(e||s(14),e?(e,r)=>e[r]++:(e,r)=>++e[r]),15,"-",12,(e,r)=>e-r,"-",15,e=>-e,"--",e=>m(e||s(14),e?(e,r)=>e[r]--:(e,r)=>--e[r]),15,"!",15,e=>!e,"*",13,(e,r)=>e*r,"/",13,(e,r)=>e/r,"%",13,(e,r)=>e%r];[o,d,l,...a]=a,o;)g(o,d,l);export{n as default};
+let e,t,r=r=>(e=0,t=r,r=s(),t[e]?l():r||""),l=(r="Bad syntax",l=t[e])=>{throw SyntaxError(r+" `"+l+"` at "+e)},a=(r=1,l=e,a)=>{if("number"==typeof r)e+=r;else for(;a=r(t.charCodeAt(e));)e+=a;return t.slice(l,e)},s=(t=0,r,a,s,o,c)=>{for(;(a=n())&&(o=(c=h[a])&&c(s,t)||!s&&h[0]());)s=o;return r&&(a==r?e++:l()),s},n=r=>{for(;(r=t.charCodeAt(e))<=32;)e++;return r},o=e=>e>=48&&e<=57||e>=65&&e<=90||e>=97&&e<=122||36==e||95==e||e>=192&&215!=e&&247!=e,h=[e=>a(o)];r.set=(r,l=32,a,s=r.charCodeAt(0),n=r.length,c=h[s],f=r.toUpperCase()!==r)=>h[s]=(s,h,p=e)=>h<l&&(n<2||t.substr(e,n)==r)&&(!f||!o(t.charCodeAt(e+n)))&&(e+=n,a(s,h))||(e=p,c&&c(s,h));const c=e=>Array.isArray(e)?f[e[0]](...e.slice(1)):t=>t?.[e];c.set=(e,t,r=f[e])=>f[e]=(...e)=>t(...e)||r&&r(...e);const f={},p=e=>(e=r(e),t=>(e.call?e:e=c(e))(t)),u=p.set=(e,t,l,a=t<0,n=l[0],o=l[1],f=!n&&l.length)=>(n||=f?f>1?(r,l)=>r&&(l=s(t-a))&&[e,r,l]:r=>!r&&(r=s(t-1))&&[e,r]:(r,l)=>r&&(l=s(t))&&(r[0]===e&&r[2]?(r.push(l),r):[e,r,l]),o||=f?f>1?(e,t)=>t&&(e=c(e),t=c(t),e.length||t.length?r=>l(e(r),t(r)):(e=l(e(),t()),()=>e)):(e,t)=>!t&&((e=c(e)).length?t=>l(e(t)):(e=l(e()),()=>e)):(...e)=>(e=e.map(c),t=>l(...e.map((e=>e(t))))),(t=a?-t:t)?r.set(e,t,n):h[e.charCodeAt(0)||1]=n,c.set(e,o)),g=e=>e?l():["",(e=+a((e=>46===e||e>=48&&e<=57||(69===e||101===e?2:0))))!=e?l():e],i=(e,t,r,l)=>[e,t,[r=>r?["++"===e?"-":"+",[e,r],["",1]]:[e,s(t-1)],l=(e,t)=>"("===e[0]?l(e[1]):"."===e[0]?(t=e[2],e=c(e[1]),l=>r(e(l),t)):"["===e[0]?([,e,t]=e,e=c(e),t=c(t),l=>r(e(l),t(l))):t=>r(t,e)]],d=["",,[,e=>()=>e],'"',,[e=>e?l():["",(a()+a((e=>e-34?1:0))+(a()||l("Bad string"))).slice(1,-1)]],".",,[e=>!e&&g()],...Array(10).fill(0).flatMap(((e,t)=>[""+t,0,[g]])),",",1,(...e)=>e[e.length-1],"||",4,(...e)=>{let t,r=0;for(;!t&&r<e.length;)t=e[r++];return t},"&&",5,(...e)=>{let t=0,r=!0;for(;r&&t<e.length;)r=e[t++];return r},"+",12,(e,t)=>e+t,"-",12,(e,t)=>e-t,"*",13,(e,t)=>e*t,"/",13,(e,t)=>e/t,"%",13,(e,t)=>e%t,"|",6,(e,t)=>e|t,"&",8,(e,t)=>e&t,"^",7,(e,t)=>e^t,"==",9,(e,t)=>e==t,"!=",9,(e,t)=>e!=t,">",10,(e,t)=>e>t,">=",10,(e,t)=>e>=t,"<",10,(e,t)=>e<t,"<=",10,(e,t)=>e<=t,">>",11,(e,t)=>e>>t,">>>",11,(e,t)=>e>>>t,"<<",11,(e,t)=>e<<t,"+",15,e=>+e,"-",15,e=>-e,"!",15,e=>!e,...i("++",15,((e,t)=>++e[t])),...i("--",15,((e,t)=>--e[t])),"[",18,[e=>e&&["[",e,s(0,93)||l()],(e,t)=>t&&(e=c(e),t=c(t),r=>e(r)[t(r)])],".",18,[(e,t)=>e&&(t=s(18))&&[".",e,t],(e,t)=>(e=c(e),t=t[0]?t:t[1],r=>e(r)[t])],"(",18,[e=>!e&&["(",s(0,41)||l()],c],"(",18,[e=>e&&["(",e,s(0,41)||""],(e,t,r,l)=>null!=t&&(l=""==t?()=>[]:","===t[0]?(t=t.slice(1).map(c),e=>t.map((t=>t(e)))):(t=c(t),e=>[t(e)]),"."===e[0]?(r=e[2],e=c(e[1]),t=>e(t)[r](...l(t))):"["===e[0]?(r=c(e[2]),e=c(e[1]),t=>e(t)[r(t)](...l(t))):(e=c(e),t=>e(t)(...l(t))))]];for(;d[2];)u(...d.splice(0,3));export{c as compile,p as default,r as parse};

package/src/justin.js

@@ -1,74 +0,0 @@
-// justin lang https://github.com/endojs/Jessie/issues/66
-import {set, lookup, skip, cur, idx, err, expr, isId, space, args} from './index.js'
-export { default } from './subscript.js'
-
-const PERIOD=46, OPAREN=40, CPAREN=41, OBRACK=91, CBRACK=93, SPACE=32, DQUOTE=34, QUOTE=39, _0=48, _9=57, BSLASH=92,
-PREC_SEQ=1, PREC_COND=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_EXP=14, PREC_UNARY=15, PREC_POSTFIX=16, PREC_CALL=18, PREC_GROUP=19
-
-
-let u, list, op, prec, fn,
-    escape = {n:'\n', r:'\r', t:'\t', b:'\b', f:'\f', v:'\v'},
-    string = q => (qc, c, str='') => {
-      qc&&err('Unexpected string') // must not follow another token
-      while (c=cur.charCodeAt(idx), c-q) {
-        if (c === BSLASH) skip(), c=skip(), str += escape[c] || c
-        else str += skip()
-      }
-      return skip()||err('Bad string'), () => str
-    }
-
-// operators
-for (list=[
-  // "' with /
-  '"', string(DQUOTE),,
-  "'", string(QUOTE),,
-
-  // /**/, //
-  '/*', (a, prec) => (skip(c => c !== 42 && cur.charCodeAt(idx+1) !== 47), skip(2), a||expr(prec)),,
-  '//', (a, prec) => (skip(c => c >= 32), a||expr(prec)),,
-
-  // literals
-  'null', a => a ? err('Unexpected literal') : ()=>null,,
-  'true', a => a ? err('Unexpected literal') : ()=>true,,
-  'false', a => a ? err('Unexpected literal') : ()=>false,,
-  'undefined', a => a ? err('Unexpected literal') : ()=>undefined,,
-
-  ';', a => expr()||(()=>{}),,
-
-  // operators
-  '===', PREC_EQ, (a,b) => a===b,
-  '!==', PREC_EQ, (a,b) => a!==b,
-  '~', PREC_UNARY, (a) => ~a,
-
-  // right order
-  '**', (a,prec,b=expr(PREC_EXP-1)) => ctx=>a(ctx)**b(ctx), PREC_EXP,
-
-  // ?:
-  ':', 3.1, (a,b) => [a,b],
-  '?', 3, (a,b) => a ? b[0] : b[1],
-
-  '??', PREC_OR, (a,b) => a??b,
-
-  // a?.[, a?.( - postfix operator
-  '?.', a => a && (ctx => a(ctx)||(()=>{})),,//(a) => a||(()=>{}),
-  // a?.b - optional chain operator
-  '?.', (a,id) => (space(), id=skip(isId)) && (ctx => a(ctx)?.[id]),,
-
-  'in', PREC_COMP, (a,b) => a in b,
-
-  // [a,b,c]
-  '[', (a) => !a && (
-    a=expr(0,CBRACK),
-    !a ? ctx => [] : a.all ? ctx => a.all(ctx) : ctx => [a(ctx)]
-  ),,
-
-  // {a:1, b:2, c:3}
-  '{', (a, entries) => !a && (
-      a=expr(0,125),
-      !a ? ctx => ({}) : ctx => (entries=(a.all||a)(ctx), Object.fromEntries(a.all?entries:[entries]))
-    ),,
-  // for JSON case we should not collect arg (different evaluator than ternary)
-  ':', (a, prec, b) => (b=expr(1.1)||err(), a.id&&args.pop(), ctx => [(a.id||a)(ctx), b(ctx)]), 1.1
-
-]; [op,prec,fn,...list]=list, op;) set(op,prec,fn)

package/src/subscript.js

@@ -1,91 +0,0 @@
-import {parse, set, lookup, skip, cur, idx, err, expr, isId, args, space} from './index.js'
-
-const PERIOD=46, OPAREN=40, CPAREN=41, OBRACK=91, CBRACK=93, SPACE=32, DQUOTE=34, _0=48, _9=57,
-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
-
-let u, list, op, prec, fn,
-    isNum = c => c>=_0 && c<=_9,
-    // 1.2e+3, .5
-    num = n => (
-      n&&err('Unexpected number'),
-      n = skip(c=>c == PERIOD || isNum(c)),
-      (cur.charCodeAt(idx) == 69 || cur.charCodeAt(idx) == 101) && (n += skip(2) + skip(isNum)),
-      n=+n, n!=n ? err('Bad number') : () => n // 0 args means token is static
-    ),
-
-    inc = (a,fn) => ctx => fn(a.of?a.of(ctx):ctx, a.id(ctx))
-
-// numbers
-for (op=_0;op<=_9;) lookup[op++] = num
-
-// operators
-for (list=[
-  // "a"
-  '"', a => (a=a?err('Unexpected string'):skip(c => c-DQUOTE), skip()||err('Bad string'), ()=>a),,
-
-  // a.b
-  '.', (a,id) => (space(), id=skip(isId)||err(), fn=ctx=>a(ctx)[id], fn.id=()=>id, fn.of=a, fn), PREC_CALL,
-
-  // .2
-  // FIXME: .123 is not operator, so we skip back, but mb reorganizing num would be better
-  '.', a => !a && num(skip(-1)),,
-
-  // a[b]
-  '[', (a,b,fn) => a && (b=expr(0,CBRACK)||err(), fn=ctx=>a(ctx)[b(ctx)], fn.id=b, fn.of=a, fn), PREC_CALL,
-
-  // a(), a(b), (a,b), (a+b)
-  '(', (a,b,fn) => (
-    b=expr(0,CPAREN),
-    // a(), a(b), a(b,c,d)
-    a ? ctx => a(ctx).apply(a.of?.(ctx), b ? b.all ? b.all(ctx) : [b(ctx)] : []) :
-    // (a+b)
-    b || err()
-  ), PREC_CALL,
-
-  // [a,b,c] or (a,b,c)
-  ',', (a,prec,b=expr(PREC_SEQ),fn=ctx => (a(ctx), b(ctx))) => (
-    b ? (fn.all = a.all ? ctx => [...a.all(ctx),b(ctx)] : ctx => [a(ctx),b(ctx)]) : err('Skipped argument',),
-    fn
-  ), PREC_SEQ,
-
-  '|', PREC_OR, (a,b)=>a|b,
-  '||', PREC_SOME, (a,b)=>a||b,
-
-  '&', PREC_AND, (a,b)=>a&b,
-  '&&', PREC_EVERY, (a,b)=>a&&b,
-
-  '^', PREC_XOR, (a,b)=>a^b,
-
-  // ==, !=
-  '==', PREC_EQ, (a,b)=>a==b,
-  '!=', PREC_EQ, (a,b)=>a!=b,
-
-  // > >= >> >>>, < <= <<
-  '>', PREC_COMP, (a,b)=>a>b,
-  '>=', PREC_COMP, (a,b)=>a>=b,
-  '>>', PREC_SHIFT, (a,b)=>a>>b,
-  '>>>', PREC_SHIFT, (a,b)=>a>>>b,
-  '<', PREC_COMP, (a,b)=>a<b,
-  '<=', PREC_COMP, (a,b)=>a<=b,
-  '<<', PREC_SHIFT, (a,b)=>a<<b,
-
-  // + ++ - --
-  '+', PREC_SUM, (a,b)=>a+b,
-  '+', PREC_UNARY, (a)=>+a,
-  '++', a => inc(a||expr(PREC_UNARY-1), a ? (a,b)=>a[b]++ : (a,b)=>++a[b]), PREC_UNARY,
-
-  '-', PREC_SUM, (a,b)=>a-b,
-  '-', PREC_UNARY, (a)=>-a,
-  '--', a => inc(a||expr(PREC_UNARY-1), a ? (a,b)=>a[b]-- : (a,b)=>--a[b]), PREC_UNARY,
-
-  // ! ~
-  '!', PREC_UNARY, (a)=>!a,
-
-  // * / %
-  '*', PREC_MULT, (a,b)=>a*b,
-  '/', PREC_MULT, (a,b)=>a/b,
-  '%', PREC_MULT, (a,b)=>a%b
-]; [op,prec,fn,...list]=list, op;) set(op,prec,fn)
-
-export default parse