@sheetxl/studio-vanilla 0.4.20 → 0.4.22

package/cdn/assets/{SsQFeDXfmfXHyy1R.js → B_gWDLoUXJ58kUTF.js}

@@ -1,22 +1,22 @@
-import { d as Gs, Y as D, k as ft, n as Ye, r as Ks, D as Xt, B as jn, c as zs, _ as Vs, f as Xe, e as Hs, K as se, g as Ue, y as Fe } from "./BFvB3zk5mbav2VDI.js";
+import { H as $s, n as D, Y as ft, T as Ye, N as Ws, K as Xt, b as jn, r as Gs, f as Ks, t as Xe, W as zs, M as se, Z as Ue, c as Fe } from "./CVgQlKevn28IBavQ.js";
 /**
- * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.4.20
+ * @license @sheetxl/studio-vanilla - SheetXL Studio - Vanilla entry point for integrating SheetXL UI. - v0.4.22
  *
  * (C) 2025-present SheetXL Inc. & Michael T. Ford
  * License: The license can be found at https://www.sheetxl.com/license.
  */
-var Fo = typeof global == "object" && global && global.Object === Object && global, Ys = typeof self == "object" && self && self.Object === Object && self, wt = Fo || Ys || Function("return this")(), It = wt.Symbol, Do = Object.prototype, Xs = Do.hasOwnProperty, qs = Do.toString, ye = It ? It.toStringTag : void 0, Zs = Object.prototype.toString, Jr = It ? It.toStringTag : void 0;
+var Mo = typeof global == "object" && global && global.Object === Object && global, Vs = typeof self == "object" && self && self.Object === Object && self, wt = Mo || Vs || Function("return this")(), It = wt.Symbol, Uo = Object.prototype, Hs = Uo.hasOwnProperty, Ys = Uo.toString, ye = It ? It.toStringTag : void 0, Xs = Object.prototype.toString, Zr = It ? It.toStringTag : void 0;
 function Jt(t) {
-  return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Jr && Jr in Object(t) ? function(n) {
-    var r = Xs.call(n, ye), i = n[ye];
+  return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Zr && Zr in Object(t) ? function(n) {
+    var r = Hs.call(n, ye), i = n[ye];
     try {
       n[ye] = void 0;
       var o = !0;
     } catch {
     }
-    var s = qs.call(n);
+    var s = Ys.call(n);
     return o && (r ? n[ye] = i : delete n[ye]), s;
-  }(t) : (e = t, Zs.call(e));
+  }(t) : (e = t, Xs.call(e));
   var e;
 }
 function Ot(t) {
@@ -29,21 +29,21 @@ function Sn(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length, i = Array(r); ++n < r; ) i[n] = e(t[n], n, t);
   return i;
 }
-var B = Array.isArray, ti = It ? It.prototype : void 0, ei = ti ? ti.toString : void 0;
-function jo(t) {
+var B = Array.isArray, Qr = It ? It.prototype : void 0, Jr = Qr ? Qr.toString : void 0;
+function Fo(t) {
   if (typeof t == "string") return t;
-  if (B(t)) return Sn(t, jo) + "";
-  if (On(t)) return ei ? ei.call(t) : "";
+  if (B(t)) return Sn(t, Fo) + "";
+  if (On(t)) return Jr ? Jr.call(t) : "";
   var e = t + "";
   return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
 }
-var Qs = /\s/, Js = /^\s+/;
+var qs = /\s/, Zs = /^\s+/;
 function Nt(t) {
   var e = typeof t;
   return t != null && (e == "object" || e == "function");
 }
-var ta = /^[-+]0x[0-9a-f]+$/i, ea = /^0b[01]+$/i, na = /^0o[0-7]+$/i, ra = parseInt, ia = 1 / 0;
-function oa(t) {
+var Qs = /^[-+]0x[0-9a-f]+$/i, Js = /^0b[01]+$/i, ta = /^0o[0-7]+$/i, ea = parseInt, na = 1 / 0;
+function ra(t) {
   return t ? (t = function(e) {
     if (typeof e == "number") return e;
     if (On(e)) return NaN;
@@ -54,16 +54,16 @@ function oa(t) {
     if (typeof e != "string") return e === 0 ? e : +e;
     e = function(i) {
       return i && i.slice(0, function(o) {
-        for (var s = o.length; s-- && Qs.test(o.charAt(s)); ) ;
+        for (var s = o.length; s-- && qs.test(o.charAt(s)); ) ;
         return s;
-      }(i) + 1).replace(Js, "");
+      }(i) + 1).replace(Zs, "");
     }(e);
-    var r = ea.test(e);
-    return r || na.test(e) ? ra(e.slice(2), r ? 2 : 8) : ta.test(e) ? NaN : +e;
-  }(t)) === ia || t === -1 / 0 ? 17976931348623157e292 * (t < 0 ? -1 : 1) : t == t ? t : 0 : t === 0 ? t : 0;
+    var r = Js.test(e);
+    return r || ta.test(e) ? ea(e.slice(2), r ? 2 : 8) : Qs.test(e) ? NaN : +e;
+  }(t)) === na || t === -1 / 0 ? 17976931348623157e292 * (t < 0 ? -1 : 1) : t == t ? t : 0 : t === 0 ? t : 0;
 }
 function _n(t) {
-  var e = oa(t), n = e % 1;
+  var e = ra(t), n = e % 1;
   return e == e ? n ? e - n : e : 0;
 }
 function Ee(t) {
@@ -74,11 +74,11 @@ function Yt(t) {
   var e = Jt(t);
   return e == "[object Function]" || e == "[object GeneratorFunction]" || e == "[object AsyncFunction]" || e == "[object Proxy]";
 }
-var ni, Bn = wt["__core-js_shared__"], ri = (ni = /[^.]+$/.exec(Bn && Bn.keys && Bn.keys.IE_PROTO || "")) ? "Symbol(src)_1." + ni : "", sa = Function.prototype.toString;
+var ti, Bn = wt["__core-js_shared__"], ei = (ti = /[^.]+$/.exec(Bn && Bn.keys && Bn.keys.IE_PROTO || "")) ? "Symbol(src)_1." + ti : "", ia = Function.prototype.toString;
 function ae(t) {
   if (t != null) {
     try {
-      return sa.call(t);
+      return ia.call(t);
     } catch {
     }
     try {
@@ -88,20 +88,20 @@ function ae(t) {
   }
   return "";
 }
-var aa = /^\[object .+?Constructor\]$/, ca = Function.prototype, ua = Object.prototype, la = ca.toString, ha = ua.hasOwnProperty, fa = RegExp("^" + la.call(ha).replace(/[\\^$.*+?()[\]{}|]/g, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$");
+var oa = /^\[object .+?Constructor\]$/, sa = Function.prototype, aa = Object.prototype, ca = sa.toString, ua = aa.hasOwnProperty, la = RegExp("^" + ca.call(ua).replace(/[\\^$.*+?()[\]{}|]/g, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$");
 function ce(t, e) {
   var n, r, i = (n = t, r = e, n?.[r]);
   return function(o) {
-    return !(!Nt(o) || (s = o, ri && ri in s)) && (Yt(o) ? fa : aa).test(ae(o));
+    return !(!Nt(o) || (s = o, ei && ei in s)) && (Yt(o) ? la : oa).test(ae(o));
     var s;
   }(i) ? i : void 0;
 }
-var mr = ce(wt, "WeakMap"), ii = Object.create, da = /* @__PURE__ */ function() {
+var dr = ce(wt, "WeakMap"), ni = Object.create, ha = /* @__PURE__ */ function() {
   function t() {
   }
   return function(e) {
     if (!Nt(e)) return {};
-    if (ii) return ii(e);
+    if (ni) return ni(e);
     t.prototype = e;
     var n = new t();
     return t.prototype = void 0, n;
@@ -109,115 +109,116 @@ var mr = ce(wt, "WeakMap"), ii = Object.create, da = /* @__PURE__ */ function()
 }();
 function Z() {
 }
-var oi, $n, Wn, pa = Date.now, pn = function() {
+var ri, $n, Wn, fa = Date.now, pn = function() {
   try {
     var t = ce(Object, "defineProperty");
     return t({}, "", {}), t;
   } catch {
   }
-}(), ma = pn ? function(t, e) {
+}(), da = pn ? function(t, e) {
   return pn(t, "toString", { configurable: !0, enumerable: !1, value: (n = e, function() {
     return n;
   }), writable: !0 });
   var n;
-} : Ee, Ea = (oi = ma, $n = 0, Wn = 0, function() {
-  var t = pa(), e = 16 - (t - Wn);
+} : Ee, pa = (ri = da, $n = 0, Wn = 0, function() {
+  var t = fa(), e = 16 - (t - Wn);
   if (Wn = t, e > 0) {
     if (++$n >= 800) return arguments[0];
   } else $n = 0;
-  return oi.apply(void 0, arguments);
+  return ri.apply(void 0, arguments);
 });
-function Bo(t, e) {
+function Do(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length; ++n < r && e(t[n], n, t) !== !1; ) ;
   return t;
 }
-function $o(t, e, n, r) {
+function jo(t, e, n, r) {
   for (var i = t.length, o = n + -1; ++o < i; ) if (e(t[o], o, t)) return o;
   return -1;
 }
-function ga(t) {
+function ma(t) {
   return t != t;
 }
-function Dr(t, e, n) {
+function Ur(t, e, n) {
   return e == e ? function(r, i, o) {
     for (var s = o - 1, a = r.length; ++s < a; ) if (r[s] === i) return s;
     return -1;
-  }(t, e, n) : $o(t, ga, n);
+  }(t, e, n) : jo(t, ma, n);
 }
-function Wo(t, e) {
-  return !(t == null || !t.length) && Dr(t, e, 0) > -1;
+function Bo(t, e) {
+  return !(t == null || !t.length) && Ur(t, e, 0) > -1;
 }
-var Ta = /^(?:0|[1-9]\d*)$/;
+var Ea = /^(?:0|[1-9]\d*)$/;
 function Ln(t, e) {
   var n = typeof t;
-  return !!(e = e ?? 9007199254740991) && (n == "number" || n != "symbol" && Ta.test(t)) && t > -1 && t % 1 == 0 && t < e;
+  return !!(e = e ?? 9007199254740991) && (n == "number" || n != "symbol" && Ea.test(t)) && t > -1 && t % 1 == 0 && t < e;
 }
-function jr(t, e, n) {
+function Fr(t, e, n) {
   e == "__proto__" && pn ? pn(t, e, { configurable: !0, enumerable: !0, value: n, writable: !0 }) : t[e] = n;
 }
 function ze(t, e) {
   return t === e || t != t && e != e;
 }
-var Aa = Object.prototype.hasOwnProperty;
+var ga = Object.prototype.hasOwnProperty;
 function xn(t, e, n) {
   var r = t[e];
-  Aa.call(t, e) && ze(r, n) && (n !== void 0 || e in t) || jr(t, e, n);
+  ga.call(t, e) && ze(r, n) && (n !== void 0 || e in t) || Fr(t, e, n);
 }
-function Er(t, e, n, r) {
+function pr(t, e, n, r) {
   var i = !n;
   n || (n = {});
   for (var o = -1, s = e.length; ++o < s; ) {
     var a = e[o], c = void 0;
-    c === void 0 && (c = t[a]), i ? jr(n, a, c) : xn(n, a, c);
+    c === void 0 && (c = t[a]), i ? Fr(n, a, c) : xn(n, a, c);
   }
   return n;
 }
-var si = Math.max;
-function Br(t, e) {
-  return Ea((n = t, i = Ee, r = si((r = e) === void 0 ? n.length - 1 : r, 0), function() {
-    for (var o = arguments, s = -1, a = si(o.length - r, 0), c = Array(a); ++s < a; ) c[s] = o[r + s];
-    s = -1;
-    for (var u = Array(r + 1); ++s < r; ) u[s] = o[s];
-    return u[r] = i(c), function(l, h, N) {
-      switch (N.length) {
-        case 0:
-          return l.call(h);
-        case 1:
-          return l.call(h, N[0]);
-        case 2:
-          return l.call(h, N[0], N[1]);
-        case 3:
-          return l.call(h, N[0], N[1], N[2]);
-      }
-      return l.apply(h, N);
-    }(n, this, u);
-  }), t + "");
-  var n, r, i;
+var ii = Math.max;
+function Dr(t, e) {
+  return pa(function(n, r, i) {
+    return r = ii(r === void 0 ? n.length - 1 : r, 0), function() {
+      for (var o = arguments, s = -1, a = ii(o.length - r, 0), c = Array(a); ++s < a; ) c[s] = o[r + s];
+      s = -1;
+      for (var u = Array(r + 1); ++s < r; ) u[s] = o[s];
+      return u[r] = i(c), function(l, h, N) {
+        switch (N.length) {
+          case 0:
+            return l.call(h);
+          case 1:
+            return l.call(h, N[0]);
+          case 2:
+            return l.call(h, N[0], N[1]);
+          case 3:
+            return l.call(h, N[0], N[1], N[2]);
+        }
+        return l.apply(h, N);
+      }(n, this, u);
+    };
+  }(t, e, Ee), t + "");
 }
-function $r(t) {
+function jr(t) {
   return typeof t == "number" && t > -1 && t % 1 == 0 && t <= 9007199254740991;
 }
 function Mt(t) {
-  return t != null && $r(t.length) && !Yt(t);
+  return t != null && jr(t.length) && !Yt(t);
 }
-function Go(t, e, n) {
+function $o(t, e, n) {
   if (!Nt(n)) return !1;
   var r = typeof e;
   return !!(r == "number" ? Mt(n) && Ln(e, n.length) : r == "string" && e in n) && ze(n[e], t);
 }
-var Ia = Object.prototype;
+var Ta = Object.prototype;
 function Ve(t) {
   var e = t && t.constructor;
-  return t === (typeof e == "function" && e.prototype || Ia);
+  return t === (typeof e == "function" && e.prototype || Ta);
 }
-function ai(t) {
+function oi(t) {
   return Ot(t) && Jt(t) == "[object Arguments]";
 }
-var Ko = Object.prototype, Na = Ko.hasOwnProperty, ya = Ko.propertyIsEnumerable, Cn = ai(/* @__PURE__ */ function() {
+var Wo = Object.prototype, Aa = Wo.hasOwnProperty, Ia = Wo.propertyIsEnumerable, Cn = oi(/* @__PURE__ */ function() {
   return arguments;
-}()) ? ai : function(t) {
-  return Ot(t) && Na.call(t, "callee") && !ya.call(t, "callee");
-}, zo = typeof exports == "object" && exports && !exports.nodeType && exports, ci = zo && typeof module == "object" && module && !module.nodeType && module, ui = ci && ci.exports === zo ? wt.Buffer : void 0, De = (ui ? ui.isBuffer : void 0) || function() {
+}()) ? oi : function(t) {
+  return Ot(t) && Aa.call(t, "callee") && !Ia.call(t, "callee");
+}, Go = typeof exports == "object" && exports && !exports.nodeType && exports, si = Go && typeof module == "object" && module && !module.nodeType && module, ai = si && si.exports === Go ? wt.Buffer : void 0, De = (ai ? ai.isBuffer : void 0) || function() {
   return !1;
 }, z = {};
 function kn(t) {
@@ -226,67 +227,67 @@ function kn(t) {
   };
 }
 z["[object Float32Array]"] = z["[object Float64Array]"] = z["[object Int8Array]"] = z["[object Int16Array]"] = z["[object Int32Array]"] = z["[object Uint8Array]"] = z["[object Uint8ClampedArray]"] = z["[object Uint16Array]"] = z["[object Uint32Array]"] = !0, z["[object Arguments]"] = z["[object Array]"] = z["[object ArrayBuffer]"] = z["[object Boolean]"] = z["[object DataView]"] = z["[object Date]"] = z["[object Error]"] = z["[object Function]"] = z["[object Map]"] = z["[object Number]"] = z["[object Object]"] = z["[object RegExp]"] = z["[object Set]"] = z["[object String]"] = z["[object WeakMap]"] = !1;
-var Vo = typeof exports == "object" && exports && !exports.nodeType && exports, ke = Vo && typeof module == "object" && module && !module.nodeType && module, Gn = ke && ke.exports === Vo && Fo.process, Zt = function() {
+var Ko = typeof exports == "object" && exports && !exports.nodeType && exports, ke = Ko && typeof module == "object" && module && !module.nodeType && module, Gn = ke && ke.exports === Ko && Mo.process, Zt = function() {
   try {
     return ke && ke.require && ke.require("util").types || Gn && Gn.binding && Gn.binding("util");
   } catch {
   }
-}(), li = Zt && Zt.isTypedArray, Wr = li ? kn(li) : function(t) {
-  return Ot(t) && $r(t.length) && !!z[Jt(t)];
-}, Ra = Object.prototype.hasOwnProperty;
-function Ho(t, e) {
-  var n = B(t), r = !n && Cn(t), i = !n && !r && De(t), o = !n && !r && !i && Wr(t), s = n || r || i || o, a = s ? function(l, h) {
+}(), ci = Zt && Zt.isTypedArray, Br = ci ? kn(ci) : function(t) {
+  return Ot(t) && jr(t.length) && !!z[Jt(t)];
+}, Na = Object.prototype.hasOwnProperty;
+function zo(t, e) {
+  var n = B(t), r = !n && Cn(t), i = !n && !r && De(t), o = !n && !r && !i && Br(t), s = n || r || i || o, a = s ? function(l, h) {
     for (var N = -1, S = Array(l); ++N < l; ) S[N] = h(N);
     return S;
   }(t.length, String) : [], c = a.length;
-  for (var u in t) !e && !Ra.call(t, u) || s && (u == "length" || i && (u == "offset" || u == "parent") || o && (u == "buffer" || u == "byteLength" || u == "byteOffset") || Ln(u, c)) || a.push(u);
+  for (var u in t) !e && !Na.call(t, u) || s && (u == "length" || i && (u == "offset" || u == "parent") || o && (u == "buffer" || u == "byteLength" || u == "byteOffset") || Ln(u, c)) || a.push(u);
   return a;
 }
-function Yo(t, e) {
+function Vo(t, e) {
   return function(n) {
     return t(e(n));
   };
 }
-var va = Yo(Object.keys, Object), Oa = Object.prototype.hasOwnProperty;
-function Xo(t) {
-  if (!Ve(t)) return va(t);
+var ya = Vo(Object.keys, Object), Ra = Object.prototype.hasOwnProperty;
+function Ho(t) {
+  if (!Ve(t)) return ya(t);
   var e = [];
-  for (var n in Object(t)) Oa.call(t, n) && n != "constructor" && e.push(n);
+  for (var n in Object(t)) Ra.call(t, n) && n != "constructor" && e.push(n);
   return e;
 }
 function yt(t) {
-  return Mt(t) ? Ho(t) : Xo(t);
+  return Mt(t) ? zo(t) : Ho(t);
 }
-var Kn, Sa = Object.prototype.hasOwnProperty, pt = (Kn = function(t, e) {
-  if (Ve(e) || Mt(e)) Er(e, yt(e), t);
-  else for (var n in e) Sa.call(e, n) && xn(t, n, e[n]);
-}, Br(function(t, e) {
+var Kn, va = Object.prototype.hasOwnProperty, pt = (Kn = function(t, e) {
+  if (Ve(e) || Mt(e)) pr(e, yt(e), t);
+  else for (var n in e) va.call(e, n) && xn(t, n, e[n]);
+}, Dr(function(t, e) {
   var n = -1, r = e.length, i = r > 1 ? e[r - 1] : void 0, o = r > 2 ? e[2] : void 0;
-  for (i = Kn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && Go(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
+  for (i = Kn.length > 3 && typeof i == "function" ? (r--, i) : void 0, o && $o(e[0], e[1], o) && (i = r < 3 ? void 0 : i, r = 1), t = Object(t); ++n < r; ) {
     var s = e[n];
     s && Kn(t, s);
   }
   return t;
-})), _a = Object.prototype.hasOwnProperty;
-function qo(t) {
-  return Mt(t) ? Ho(t, !0) : function(e) {
+})), Oa = Object.prototype.hasOwnProperty;
+function Yo(t) {
+  return Mt(t) ? zo(t, !0) : function(e) {
     if (!Nt(e)) return function(o) {
       var s = [];
       if (o != null) for (var a in Object(o)) s.push(a);
       return s;
     }(e);
     var n = Ve(e), r = [];
-    for (var i in e) (i != "constructor" || !n && _a.call(e, i)) && r.push(i);
+    for (var i in e) (i != "constructor" || !n && Oa.call(e, i)) && r.push(i);
     return r;
   }(t);
 }
-var La = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, xa = /^\w*$/;
-function gr(t, e) {
+var Sa = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, _a = /^\w*$/;
+function mr(t, e) {
   if (B(t)) return !1;
   var n = typeof t;
-  return !(n != "number" && n != "symbol" && n != "boolean" && t != null && !On(t)) || xa.test(t) || !La.test(t) || e != null && t in Object(e);
+  return !(n != "number" && n != "symbol" && n != "boolean" && t != null && !On(t)) || _a.test(t) || !Sa.test(t) || e != null && t in Object(e);
 }
-var Re = ce(Object, "create"), Ca = Object.prototype.hasOwnProperty, ka = Object.prototype.hasOwnProperty;
+var Re = ce(Object, "create"), La = Object.prototype.hasOwnProperty, xa = Object.prototype.hasOwnProperty;
 function re(t) {
   var e = -1, n = t == null ? 0 : t.length;
   for (this.clear(); ++e < n; ) {
@@ -309,15 +310,15 @@ re.prototype.clear = function() {
     var n = e[t];
     return n === "__lodash_hash_undefined__" ? void 0 : n;
   }
-  return Ca.call(e, t) ? e[t] : void 0;
+  return La.call(e, t) ? e[t] : void 0;
 }, re.prototype.has = function(t) {
   var e = this.__data__;
-  return Re ? e[t] !== void 0 : ka.call(e, t);
+  return Re ? e[t] !== void 0 : xa.call(e, t);
 }, re.prototype.set = function(t, e) {
   var n = this.__data__;
   return this.size += this.has(t) ? 0 : 1, n[t] = Re && e === void 0 ? "__lodash_hash_undefined__" : e, this;
 };
-var ba = Array.prototype.splice;
+var Ca = Array.prototype.splice;
 function Vt(t) {
   var e = -1, n = t == null ? 0 : t.length;
   for (this.clear(); ++e < n; ) {
@@ -329,7 +330,7 @@ Vt.prototype.clear = function() {
   this.__data__ = [], this.size = 0;
 }, Vt.prototype.delete = function(t) {
   var e = this.__data__, n = qe(e, t);
-  return !(n < 0 || (n == e.length - 1 ? e.pop() : ba.call(e, n, 1), --this.size, 0));
+  return !(n < 0 || (n == e.length - 1 ? e.pop() : Ca.call(e, n, 1), --this.size, 0));
 }, Vt.prototype.get = function(t) {
   var e = this.__data__, n = qe(e, t);
   return n < 0 ? void 0 : e[n][1];
@@ -351,7 +352,7 @@ function Gt(t) {
     this.set(r[0], r[1]);
   }
 }
-function Gr(t, e) {
+function $r(t, e) {
   if (typeof t != "function" || e != null && typeof e != "function") throw new TypeError("Expected a function");
   var n = function() {
     var r = arguments, i = e ? e.apply(this, r) : r[0], o = n.cache;
@@ -359,7 +360,7 @@ function Gr(t, e) {
     var s = t.apply(this, r);
     return n.cache = o.set(i, s) || o, s;
   };
-  return n.cache = new (Gr.Cache || Gt)(), n;
+  return n.cache = new ($r.Cache || Gt)(), n;
 }
 Gt.prototype.clear = function() {
   this.size = 0, this.__data__ = { hash: new re(), map: new (je || Vt)(), string: new re() };
@@ -373,18 +374,21 @@ Gt.prototype.clear = function() {
 }, Gt.prototype.set = function(t, e) {
   var n = Ze(this, t), r = n.size;
   return n.set(t, e), this.size += n.size == r ? 0 : 1, this;
-}, Gr.Cache = Gt;
-var zn, Vn, Pa = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, wa = /\\(\\)?/g, Ma = (zn = Gr(function(t) {
-  var e = [];
-  return t.charCodeAt(0) === 46 && e.push(""), t.replace(Pa, function(n, r, i, o) {
-    e.push(i ? o.replace(wa, "$1") : r || n);
-  }), e;
-}, function(t) {
-  return Vn.size === 500 && Vn.clear(), t;
-}), Vn = zn.cache, zn);
+}, $r.Cache = Gt;
+var ka = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, ba = /\\(\\)?/g, Pa = function() {
+  var t = $r(function(n) {
+    var r = [];
+    return n.charCodeAt(0) === 46 && r.push(""), n.replace(ka, function(i, o, s, a) {
+      r.push(s ? a.replace(ba, "$1") : o || i);
+    }), r;
+  }, function(n) {
+    return e.size === 500 && e.clear(), n;
+  }), e = t.cache;
+  return t;
+}();
 function bn(t, e) {
-  return B(t) ? t : gr(t, e) ? [t] : Ma(function(n) {
-    return n == null ? "" : jo(n);
+  return B(t) ? t : mr(t, e) ? [t] : Pa(function(n) {
+    return n == null ? "" : Fo(n);
   }(t));
 }
 function Be(t) {
@@ -392,37 +396,37 @@ function Be(t) {
   var e = t + "";
   return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
 }
-function Tr(t, e) {
+function Er(t, e) {
   for (var n = 0, r = (e = bn(e, t)).length; t != null && n < r; ) t = t[Be(e[n++])];
   return n && n == r ? t : void 0;
 }
-function Kr(t, e) {
+function Wr(t, e) {
   for (var n = -1, r = e.length, i = t.length; ++n < r; ) t[i + n] = e[n];
   return t;
 }
-var hi = It ? It.isConcatSpreadable : void 0;
-function Ua(t) {
-  return B(t) || Cn(t) || !!(hi && t && t[hi]);
+var ui = It ? It.isConcatSpreadable : void 0;
+function wa(t) {
+  return B(t) || Cn(t) || !!(ui && t && t[ui]);
 }
-function zr(t, e, n, r, i) {
+function Gr(t, e, n, r, i) {
   var o = -1, s = t.length;
-  for (n || (n = Ua), i || (i = []); ++o < s; ) {
+  for (n || (n = wa), i || (i = []); ++o < s; ) {
     var a = t[o];
-    n(a) ? Kr(i, a) : r || (i[i.length] = a);
+    n(a) ? Wr(i, a) : r || (i[i.length] = a);
   }
   return i;
 }
 function Rt(t) {
-  return t != null && t.length ? zr(t) : [];
+  return t != null && t.length ? Gr(t) : [];
 }
-var Zo = Yo(Object.getPrototypeOf, Object);
-function Qo(t, e, n) {
+var Xo = Vo(Object.getPrototypeOf, Object);
+function qo(t, e, n) {
   var r = -1, i = t.length;
   e < 0 && (e = -e > i ? 0 : i + e), (n = n > i ? i : n) < 0 && (n += i), i = e > n ? 0 : n - e >>> 0, e >>>= 0;
   for (var o = Array(i); ++r < i; ) o[r] = t[r + e];
   return o;
 }
-function Fa(t, e, n, r) {
+function Ma(t, e, n, r) {
   var i = -1, o = t == null ? 0 : t.length;
   for (r && o && (n = t[++i]); ++i < o; ) n = e(n, t[i], i, t);
   return n;
@@ -449,75 +453,75 @@ bt.prototype.clear = function() {
   }
   return n.set(t, e), this.size = n.size, this;
 };
-var Jo = typeof exports == "object" && exports && !exports.nodeType && exports, fi = Jo && typeof module == "object" && module && !module.nodeType && module, di = fi && fi.exports === Jo ? wt.Buffer : void 0, pi = di ? di.allocUnsafe : void 0;
-function Vr(t, e) {
+var Zo = typeof exports == "object" && exports && !exports.nodeType && exports, li = Zo && typeof module == "object" && module && !module.nodeType && module, hi = li && li.exports === Zo ? wt.Buffer : void 0, fi = hi ? hi.allocUnsafe : void 0;
+function Kr(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length, i = 0, o = []; ++n < r; ) {
     var s = t[n];
     e(s, n, t) && (o[i++] = s);
   }
   return o;
 }
-function ts() {
+function Qo() {
   return [];
 }
-var Da = Object.prototype.propertyIsEnumerable, mi = Object.getOwnPropertySymbols, Hr = mi ? function(t) {
-  return t == null ? [] : (t = Object(t), Vr(mi(t), function(e) {
-    return Da.call(t, e);
+var Ua = Object.prototype.propertyIsEnumerable, di = Object.getOwnPropertySymbols, zr = di ? function(t) {
+  return t == null ? [] : (t = Object(t), Kr(di(t), function(e) {
+    return Ua.call(t, e);
   }));
-} : ts, ja = Object.getOwnPropertySymbols ? function(t) {
-  for (var e = []; t; ) Kr(e, Hr(t)), t = Zo(t);
+} : Qo, Fa = Object.getOwnPropertySymbols ? function(t) {
+  for (var e = []; t; ) Wr(e, zr(t)), t = Xo(t);
   return e;
-} : ts;
-function es(t, e, n) {
+} : Qo;
+function Jo(t, e, n) {
   var r = e(t);
-  return B(t) ? r : Kr(r, n(t));
+  return B(t) ? r : Wr(r, n(t));
 }
-function Ar(t) {
-  return es(t, yt, Hr);
+function gr(t) {
+  return Jo(t, yt, zr);
 }
-var Ir = ce(wt, "DataView"), Nr = ce(wt, "Promise"), pe = ce(wt, "Set"), Ei = "[object Map]", gi = "[object Promise]", Ti = "[object Set]", Ai = "[object WeakMap]", Ii = "[object DataView]", Ba = ae(Ir), $a = ae(je), Wa = ae(Nr), Ga = ae(pe), Ka = ae(mr), At = Jt;
-(Ir && At(new Ir(new ArrayBuffer(1))) != Ii || je && At(new je()) != Ei || Nr && At(Nr.resolve()) != gi || pe && At(new pe()) != Ti || mr && At(new mr()) != Ai) && (At = function(t) {
+var Tr = ce(wt, "DataView"), Ar = ce(wt, "Promise"), pe = ce(wt, "Set"), pi = "[object Map]", mi = "[object Promise]", Ei = "[object Set]", gi = "[object WeakMap]", Ti = "[object DataView]", Da = ae(Tr), ja = ae(je), Ba = ae(Ar), $a = ae(pe), Wa = ae(dr), At = Jt;
+(Tr && At(new Tr(new ArrayBuffer(1))) != Ti || je && At(new je()) != pi || Ar && At(Ar.resolve()) != mi || pe && At(new pe()) != Ei || dr && At(new dr()) != gi) && (At = function(t) {
   var e = Jt(t), n = e == "[object Object]" ? t.constructor : void 0, r = n ? ae(n) : "";
   if (r) switch (r) {
+    case Da:
+      return Ti;
+    case ja:
+      return pi;
     case Ba:
-      return Ii;
+      return mi;
     case $a:
       return Ei;
     case Wa:
       return gi;
-    case Ga:
-      return Ti;
-    case Ka:
-      return Ai;
   }
   return e;
 });
-var za = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Va = /\w*$/, Ni = It ? It.prototype : void 0, yi = Ni ? Ni.valueOf : void 0, Ri = Zt && Zt.isMap, Ha = Ri ? kn(Ri) : function(t) {
+var Ga = Object.prototype.hasOwnProperty, mn = wt.Uint8Array, Ka = /\w*$/, Ai = It ? It.prototype : void 0, Ii = Ai ? Ai.valueOf : void 0, Ni = Zt && Zt.isMap, za = Ni ? kn(Ni) : function(t) {
   return Ot(t) && At(t) == "[object Map]";
-}, vi = Zt && Zt.isSet, Ya = vi ? kn(vi) : function(t) {
+}, yi = Zt && Zt.isSet, Va = yi ? kn(yi) : function(t) {
   return Ot(t) && At(t) == "[object Set]";
-}, ns = "[object Arguments]", rs = "[object Function]", is = "[object Object]", G = {};
+}, ts = "[object Arguments]", es = "[object Function]", ns = "[object Object]", G = {};
 function sn(t, e, n, r, i, o) {
   var s;
   if (s !== void 0) return s;
   if (!Nt(t)) return t;
   var a, c, u, l = B(t);
-  if (l) return c = (a = t).length, u = new a.constructor(c), c && typeof a[0] == "string" && za.call(a, "index") && (u.index = a.index, u.input = a.input), function(m, y) {
+  if (l) return c = (a = t).length, u = new a.constructor(c), c && typeof a[0] == "string" && Ga.call(a, "index") && (u.index = a.index, u.input = a.input), function(m, y) {
     var p = -1, T = m.length;
     for (y || (y = Array(T)); ++p < T; ) y[p] = m[p];
     return y;
   }(t, s = u);
-  var h = At(t), N = h == rs || h == "[object GeneratorFunction]";
+  var h = At(t), N = h == es || h == "[object GeneratorFunction]";
   if (De(t)) return function(m) {
-    var y = m.length, p = pi ? pi(y) : new m.constructor(y);
+    var y = m.length, p = fi ? fi(y) : new m.constructor(y);
     return m.copy(p), p;
   }(t);
-  if (h == is || h == ns || N && !i) return s = N ? {} : function(m) {
-    return typeof m.constructor != "function" || Ve(m) ? {} : da(Zo(m));
+  if (h == ns || h == ts || N && !i) return s = N ? {} : function(m) {
+    return typeof m.constructor != "function" || Ve(m) ? {} : ha(Xo(m));
   }(t), function(m, y) {
-    return Er(m, Hr(m), y);
+    return pr(m, zr(m), y);
   }(t, function(m, y) {
-    return m && Er(y, yt(y), m);
+    return m && pr(y, yt(y), m);
   }(s, t));
   if (!G[h]) return i ? t : {};
   s = function(m, y) {
@@ -548,22 +552,22 @@ function sn(t, e, n, r, i, o) {
         return new I(m);
       case "[object RegExp]":
         return function(E) {
-          var R = new E.constructor(E.source, Va.exec(E));
+          var R = new E.constructor(E.source, Ka.exec(E));
           return R.lastIndex = E.lastIndex, R;
         }(m);
       case "[object Symbol]":
-        return p = m, yi ? Object(yi.call(p)) : {};
+        return p = m, Ii ? Object(Ii.call(p)) : {};
     }
   }(t, h), o || (o = new bt());
   var S = o.get(t);
   if (S) return S;
-  o.set(t, s), Ya(t) ? t.forEach(function(m) {
+  o.set(t, s), Va(t) ? t.forEach(function(m) {
     s.add(sn(m, e, n, m, t, o));
-  }) : Ha(t) && t.forEach(function(m, y) {
+  }) : za(t) && t.forEach(function(m, y) {
     s.set(y, sn(m, e, n, y, t, o));
   });
-  var _ = l ? void 0 : Ar(t);
-  return Bo(_ || t, function(m, y) {
+  var _ = l ? void 0 : gr(t);
+  return Do(_ || t, function(m, y) {
     _ && (m = t[y = m]), xn(s, y, sn(m, e, n, y, t, o));
   }), s;
 }
@@ -581,14 +585,14 @@ function me(t) {
   var e = -1, n = t == null ? 0 : t.length;
   for (this.__data__ = new Gt(); ++e < n; ) this.add(t[e]);
 }
-function os(t, e) {
+function rs(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length; ++n < r; ) if (e(t[n], n, t)) return !0;
   return !1;
 }
-function Yr(t, e) {
+function Vr(t, e) {
   return t.has(e);
 }
-function Oi(t, e, n, r, i, o) {
+function Ri(t, e, n, r, i, o) {
   var s = 1 & n, a = t.length, c = e.length;
   if (a != c && !(s && c > a)) return !1;
   var u = o.get(t), l = o.get(e);
@@ -603,8 +607,8 @@ function Oi(t, e, n, r, i, o) {
       break;
     }
     if (S) {
-      if (!os(e, function(p, T) {
-        if (!Yr(S, T) && (_ === p || i(_, p, n, r, o))) return S.push(T);
+      if (!rs(e, function(p, T) {
+        if (!Vr(S, T) && (_ === p || i(_, p, n, r, o))) return S.push(T);
       })) {
         N = !1;
         break;
@@ -616,32 +620,32 @@ function Oi(t, e, n, r, i, o) {
   }
   return o.delete(t), o.delete(e), N;
 }
-function Xa(t) {
+function Ha(t) {
   var e = -1, n = Array(t.size);
   return t.forEach(function(r, i) {
     n[++e] = [i, r];
   }), n;
 }
-function Xr(t) {
+function Hr(t) {
   var e = -1, n = Array(t.size);
   return t.forEach(function(r) {
     n[++e] = r;
   }), n;
 }
-G[ns] = G["[object Array]"] = G["[object ArrayBuffer]"] = G["[object DataView]"] = G["[object Boolean]"] = G["[object Date]"] = G["[object Float32Array]"] = G["[object Float64Array]"] = G["[object Int8Array]"] = G["[object Int16Array]"] = G["[object Int32Array]"] = G["[object Map]"] = G["[object Number]"] = G[is] = G["[object RegExp]"] = G["[object Set]"] = G["[object String]"] = G["[object Symbol]"] = G["[object Uint8Array]"] = G["[object Uint8ClampedArray]"] = G["[object Uint16Array]"] = G["[object Uint32Array]"] = !0, G["[object Error]"] = G[rs] = G["[object WeakMap]"] = !1, me.prototype.add = me.prototype.push = function(t) {
+G[ts] = G["[object Array]"] = G["[object ArrayBuffer]"] = G["[object DataView]"] = G["[object Boolean]"] = G["[object Date]"] = G["[object Float32Array]"] = G["[object Float64Array]"] = G["[object Int8Array]"] = G["[object Int16Array]"] = G["[object Int32Array]"] = G["[object Map]"] = G["[object Number]"] = G[ns] = G["[object RegExp]"] = G["[object Set]"] = G["[object String]"] = G["[object Symbol]"] = G["[object Uint8Array]"] = G["[object Uint8ClampedArray]"] = G["[object Uint16Array]"] = G["[object Uint32Array]"] = !0, G["[object Error]"] = G[es] = G["[object WeakMap]"] = !1, me.prototype.add = me.prototype.push = function(t) {
   return this.__data__.set(t, "__lodash_hash_undefined__"), this;
 }, me.prototype.has = function(t) {
   return this.__data__.has(t);
 };
-var Si = It ? It.prototype : void 0, Hn = Si ? Si.valueOf : void 0, qa = Object.prototype.hasOwnProperty, _i = "[object Arguments]", Li = "[object Array]", Qe = "[object Object]", xi = Object.prototype.hasOwnProperty;
-function yr(t, e, n, r, i) {
+var vi = It ? It.prototype : void 0, zn = vi ? vi.valueOf : void 0, Ya = Object.prototype.hasOwnProperty, Oi = "[object Arguments]", Si = "[object Array]", Qe = "[object Object]", _i = Object.prototype.hasOwnProperty;
+function Ir(t, e, n, r, i) {
   return t === e || (t == null || e == null || !Ot(t) && !Ot(e) ? t != t && e != e : function(o, s, a, c, u, l) {
-    var h = B(o), N = B(s), S = h ? Li : At(o), _ = N ? Li : At(s), m = (S = S == _i ? Qe : S) == Qe, y = (_ = _ == _i ? Qe : _) == Qe, p = S == _;
+    var h = B(o), N = B(s), S = h ? Si : At(o), _ = N ? Si : At(s), m = (S = S == Oi ? Qe : S) == Qe, y = (_ = _ == Oi ? Qe : _) == Qe, p = S == _;
     if (p && De(o)) {
       if (!De(s)) return !1;
       h = !0, m = !1;
     }
-    if (p && !m) return l || (l = new bt()), h || Wr(o) ? Oi(o, s, a, c, u, l) : function(f, d, I, E, R, M, L) {
+    if (p && !m) return l || (l = new bt()), h || Br(o) ? Ri(o, s, a, c, u, l) : function(f, d, I, E, R, M, L) {
       switch (I) {
         case "[object DataView]":
           if (f.byteLength != d.byteLength || f.byteOffset != d.byteOffset) return !1;
@@ -658,33 +662,33 @@ function yr(t, e, n, r, i) {
         case "[object String]":
           return f == d + "";
         case "[object Map]":
-          var O = Xa;
+          var O = Ha;
         case "[object Set]":
           var P = 1 & E;
-          if (O || (O = Xr), f.size != d.size && !P) return !1;
+          if (O || (O = Hr), f.size != d.size && !P) return !1;
           var x = L.get(f);
           if (x) return x == d;
           E |= 2, L.set(f, d);
-          var C = Oi(O(f), O(d), E, R, M, L);
+          var C = Ri(O(f), O(d), E, R, M, L);
           return L.delete(f), C;
         case "[object Symbol]":
-          if (Hn) return Hn.call(f) == Hn.call(d);
+          if (zn) return zn.call(f) == zn.call(d);
       }
       return !1;
     }(o, s, S, a, c, u, l);
     if (!(1 & a)) {
-      var T = m && xi.call(o, "__wrapped__"), g = y && xi.call(s, "__wrapped__");
+      var T = m && _i.call(o, "__wrapped__"), g = y && _i.call(s, "__wrapped__");
       if (T || g) {
         var A = T ? o.value() : o, v = g ? s.value() : s;
         return l || (l = new bt()), u(A, v, a, c, l);
       }
     }
     return !!p && (l || (l = new bt()), function(f, d, I, E, R, M) {
-      var L = 1 & I, O = Ar(f), P = O.length;
-      if (P != Ar(d).length && !L) return !1;
+      var L = 1 & I, O = gr(f), P = O.length;
+      if (P != gr(d).length && !L) return !1;
       for (var x = P; x--; ) {
         var C = O[x];
-        if (!(L ? C in d : qa.call(d, C))) return !1;
+        if (!(L ? C in d : Ya.call(d, C))) return !1;
       }
       var $ = M.get(f), X = M.get(d);
       if ($ && X) return $ == d && X == f;
@@ -705,44 +709,44 @@ function yr(t, e, n, r, i) {
       }
       return M.delete(f), M.delete(d), W;
     }(o, s, a, c, u, l));
-  }(t, e, n, r, yr, i));
+  }(t, e, n, r, Ir, i));
 }
-function Ci(t) {
+function Li(t) {
   return t == t && !Nt(t);
 }
-function ki(t, e) {
+function xi(t, e) {
   return function(n) {
     return n != null && n[t] === e && (e !== void 0 || t in Object(n));
   };
 }
-function Za(t, e) {
+function Xa(t, e) {
   return t != null && e in Object(t);
 }
-function ss(t, e, n) {
+function is(t, e, n) {
   for (var r = -1, i = (e = bn(e, t)).length, o = !1; ++r < i; ) {
     var s = Be(e[r]);
     if (!(o = t != null && n(t, s))) break;
     t = t[s];
   }
-  return o || ++r != i ? o : !!(i = t == null ? 0 : t.length) && $r(i) && Ln(s, i) && (B(t) || Cn(t));
+  return o || ++r != i ? o : !!(i = t == null ? 0 : t.length) && jr(i) && Ln(s, i) && (B(t) || Cn(t));
 }
 function Pt(t) {
   return typeof t == "function" ? t : t == null ? Ee : typeof t == "object" ? B(t) ? function(e, n) {
-    return gr(e) && Ci(n) ? ki(Be(e), n) : function(r) {
-      var i, o, s = (o = (i = r) == null ? void 0 : Tr(i, e)) === void 0 ? void 0 : o;
+    return mr(e) && Li(n) ? xi(Be(e), n) : function(r) {
+      var i, o, s = (o = (i = r) == null ? void 0 : Er(i, e)) === void 0 ? void 0 : o;
       return s === void 0 && s === n ? function(a, c) {
-        return a != null && ss(a, c, Za);
-      }(r, e) : yr(n, s, 3);
+        return a != null && is(a, c, Xa);
+      }(r, e) : Ir(n, s, 3);
     };
   }(t[0], t[1]) : function(e) {
     var n = function(r) {
       for (var i = yt(r), o = i.length; o--; ) {
         var s = i[o], a = r[s];
-        i[o] = [s, a, Ci(a)];
+        i[o] = [s, a, Li(a)];
       }
       return i;
     }(e);
-    return n.length == 1 && n[0][2] ? ki(n[0][0], n[0][1]) : function(r) {
+    return n.length == 1 && n[0][2] ? xi(n[0][0], n[0][1]) : function(r) {
       return r === e || function(i, o, s) {
         var a = s.length, c = a;
         if (i == null) return !c;
@@ -754,30 +758,30 @@ function Pt(t) {
           var l = (u = s[a])[0], h = i[l], N = u[1];
           if (u[2]) {
             if (h === void 0 && !(l in i)) return !1;
-          } else if (!yr(N, h, 3, void 0, new bt())) return !1;
+          } else if (!Ir(N, h, 3, void 0, new bt())) return !1;
         }
         return !0;
       }(r, 0, n);
     };
   }(t) : function(e) {
-    return gr(e) ? (n = Be(e), function(r) {
+    return mr(e) ? (n = Be(e), function(r) {
       return r?.[n];
     }) : /* @__PURE__ */ function(r) {
       return function(i) {
-        return Tr(i, r);
+        return Er(i, r);
       };
     }(e);
     var n;
   }(t);
 }
-function Qa(t, e, n, r) {
+function qa(t, e, n, r) {
   for (var i = -1, o = t == null ? 0 : t.length; ++i < o; ) {
     var s = t[i];
     e(r, s, n(s), t);
   }
   return r;
 }
-var bi, ue = (bi = function(t, e) {
+var Ci, ue = (Ci = function(t, e) {
   return t && function(n, r, i) {
     for (var o = -1, s = Object(n), a = i(n), c = a.length; c--; ) {
       var u = a[++o];
@@ -787,32 +791,32 @@ var bi, ue = (bi = function(t, e) {
   }(t, e, yt);
 }, function(t, e) {
   if (t == null) return t;
-  if (!Mt(t)) return bi(t, e);
+  if (!Mt(t)) return Ci(t, e);
   for (var n = t.length, r = -1, i = Object(t); ++r < n && e(i[r], r, i) !== !1; ) ;
   return t;
 });
-function Ja(t, e, n, r) {
+function Za(t, e, n, r) {
   return ue(t, function(i, o, s) {
     e(r, i, n(i), s);
   }), r;
 }
-var as = Object.prototype, tc = as.hasOwnProperty, Rr = Br(function(t, e) {
+var os = Object.prototype, Qa = os.hasOwnProperty, Nr = Dr(function(t, e) {
   t = Object(t);
   var n = -1, r = e.length, i = r > 2 ? e[2] : void 0;
-  for (i && Go(e[0], e[1], i) && (r = 1); ++n < r; ) for (var o = e[n], s = qo(o), a = -1, c = s.length; ++a < c; ) {
+  for (i && $o(e[0], e[1], i) && (r = 1); ++n < r; ) for (var o = e[n], s = Yo(o), a = -1, c = s.length; ++a < c; ) {
     var u = s[a], l = t[u];
-    (l === void 0 || ze(l, as[u]) && !tc.call(t, u)) && (t[u] = o[u]);
+    (l === void 0 || ze(l, os[u]) && !Qa.call(t, u)) && (t[u] = o[u]);
   }
   return t;
 });
-function Pi(t) {
+function ki(t) {
   return Ot(t) && Mt(t);
 }
-var En = Br(function(t, e) {
-  return Pi(t) ? function(n, r) {
-    var i = -1, o = Wo, s = !0, a = n.length, c = [], u = r.length;
+var En = Dr(function(t, e) {
+  return ki(t) ? function(n, r) {
+    var i = -1, o = Bo, s = !0, a = n.length, c = [], u = r.length;
     if (!a) return c;
-    r.length >= 200 && (o = Yr, s = !1, r = new me(r));
+    r.length >= 200 && (o = Vr, s = !1, r = new me(r));
     t: for (; ++i < a; ) {
       var l = n[i], h = l;
       if (l = l !== 0 ? l : 0, s && h == h) {
@@ -821,7 +825,7 @@ var En = Br(function(t, e) {
       } else o(r, h, void 0) || c.push(l);
     }
     return c;
-  }(t, zr(e, 0, Pi, !0)) : [];
+  }(t, Gr(e, 0, ki, !0)) : [];
 });
 function ge(t) {
   var e = t == null ? 0 : t.length;
@@ -829,43 +833,43 @@ function ge(t) {
 }
 function tt(t, e, n) {
   var r = t == null ? 0 : t.length;
-  return r ? Qo(t, (e = e === void 0 ? 1 : _n(e)) < 0 ? 0 : e, r) : [];
+  return r ? qo(t, (e = e === void 0 ? 1 : _n(e)) < 0 ? 0 : e, r) : [];
 }
 function We(t, e, n) {
   var r = t == null ? 0 : t.length;
-  return r ? Qo(t, 0, (e = r - (e = e === void 0 ? 1 : _n(e))) < 0 ? 0 : e) : [];
+  return r ? qo(t, 0, (e = r - (e = e === void 0 ? 1 : _n(e))) < 0 ? 0 : e) : [];
 }
 function w(t, e) {
   var n;
-  return (B(t) ? Bo : ue)(t, typeof (n = e) == "function" ? n : Ee);
+  return (B(t) ? Do : ue)(t, typeof (n = e) == "function" ? n : Ee);
 }
-function ec(t, e) {
+function Ja(t, e) {
   for (var n = -1, r = t == null ? 0 : t.length; ++n < r; ) if (!e(t[n], n, t)) return !1;
   return !0;
 }
-function nc(t, e) {
+function tc(t, e) {
   var n = !0;
   return ue(t, function(r, i, o) {
     return n = !!e(r, i, o);
   }), n;
 }
 function vt(t, e, n) {
-  return (B(t) ? ec : nc)(t, Pt(e));
+  return (B(t) ? Ja : tc)(t, Pt(e));
 }
-function cs(t, e) {
+function ss(t, e) {
   var n = [];
   return ue(t, function(r, i, o) {
     e(r, i, o) && n.push(r);
   }), n;
 }
 function gt(t, e) {
-  return (B(t) ? Vr : cs)(t, Pt(e));
+  return (B(t) ? Kr : ss)(t, Pt(e));
 }
-var wi, rc = Math.max, Te = (wi = function(t, e, n) {
+var bi, ec = Math.max, Te = (bi = function(t, e, n) {
   var r = t == null ? 0 : t.length;
   if (!r) return -1;
   var i = n == null ? 0 : _n(n);
-  return i < 0 && (i = rc(r + i, 0)), $o(t, Pt(e), i);
+  return i < 0 && (i = ec(r + i, 0)), jo(t, Pt(e), i);
 }, function(t, e, n) {
   var r = Object(t);
   if (!Mt(t)) {
@@ -874,34 +878,34 @@ var wi, rc = Math.max, Te = (wi = function(t, e, n) {
       return i(r[s], s, r);
     };
   }
-  var o = wi(t, e, n);
+  var o = bi(t, e, n);
   return o > -1 ? r[i ? t[o] : o] : void 0;
 });
 function St(t) {
   return t && t.length ? t[0] : void 0;
 }
-function ic(t, e) {
+function nc(t, e) {
   var n = -1, r = Mt(t) ? Array(t.length) : [];
   return ue(t, function(i, o, s) {
     r[++n] = e(i, o, s);
   }), r;
 }
 function k(t, e) {
-  return (B(t) ? Sn : ic)(t, Pt(e));
+  return (B(t) ? Sn : nc)(t, Pt(e));
 }
 function Tt(t, e) {
-  return zr(k(t, e));
+  return Gr(k(t, e));
 }
-var Mi, oc = Object.prototype.hasOwnProperty, sc = (Mi = function(t, e, n) {
-  oc.call(t, n) ? t[n].push(e) : jr(t, n, [e]);
+var Pi, rc = Object.prototype.hasOwnProperty, ic = (Pi = function(t, e, n) {
+  rc.call(t, n) ? t[n].push(e) : Fr(t, n, [e]);
 }, function(t, e) {
-  return (B(t) ? Qa : Ja)(t, Mi, Pt(e), {});
-}), ac = Object.prototype.hasOwnProperty;
-function cc(t, e) {
-  return t != null && ac.call(t, e);
+  return (B(t) ? qa : Za)(t, Pi, Pt(e), {});
+}), oc = Object.prototype.hasOwnProperty;
+function sc(t, e) {
+  return t != null && oc.call(t, e);
 }
 function b(t, e) {
-  return t != null && ss(t, e, cc);
+  return t != null && is(t, e, sc);
 }
 function ut(t) {
   return typeof t == "string" || !B(t) && Ot(t) && Jt(t) == "[object String]";
@@ -913,32 +917,32 @@ function Q(t) {
     });
   }(t, yt(t));
 }
-var uc = Math.max;
+var ac = Math.max;
 function at(t, e, n, r) {
   t = Mt(t) ? t : Q(t), n = n ? _n(n) : 0;
   var i = t.length;
-  return n < 0 && (n = uc(i + n, 0)), ut(t) ? n <= i && t.indexOf(e, n) > -1 : !!i && Dr(t, e, n) > -1;
+  return n < 0 && (n = ac(i + n, 0)), ut(t) ? n <= i && t.indexOf(e, n) > -1 : !!i && Ur(t, e, n) > -1;
 }
-function Ui(t, e, n) {
-  return t != null && t.length ? Dr(t, e, 0) : -1;
+function wi(t, e, n) {
+  return t != null && t.length ? Ur(t, e, 0) : -1;
 }
-var lc = Object.prototype.hasOwnProperty;
+var cc = Object.prototype.hasOwnProperty;
 function K(t) {
   if (t == null) return !0;
-  if (Mt(t) && (B(t) || typeof t == "string" || typeof t.splice == "function" || De(t) || Wr(t) || Cn(t))) return !t.length;
+  if (Mt(t) && (B(t) || typeof t == "string" || typeof t.splice == "function" || De(t) || Br(t) || Cn(t))) return !t.length;
   var e = At(t);
   if (e == "[object Map]" || e == "[object Set]") return !t.size;
-  if (Ve(t)) return !Xo(t).length;
-  for (var n in t) if (lc.call(t, n)) return !1;
+  if (Ve(t)) return !Ho(t).length;
+  for (var n in t) if (cc.call(t, n)) return !1;
   return !0;
 }
-var Fi = Zt && Zt.isRegExp, Kt = Fi ? kn(Fi) : function(t) {
+var Mi = Zt && Zt.isRegExp, Kt = Mi ? kn(Mi) : function(t) {
   return Ot(t) && Jt(t) == "[object RegExp]";
 };
 function Ht(t) {
   return t === void 0;
 }
-function hc(t, e, n, r) {
+function uc(t, e, n, r) {
   if (!Nt(t)) return t;
   for (var i = -1, o = (e = bn(e, t)).length, s = o - 1, a = t; a != null && ++i < o; ) {
     var c = Be(e[i]), u = n;
@@ -953,30 +957,30 @@ function hc(t, e, n, r) {
 }
 function _t(t, e) {
   if (t == null) return {};
-  var n = Sn(es(t, qo, ja), function(r) {
+  var n = Sn(Jo(t, Yo, Fa), function(r) {
     return [r];
   });
   return e = Pt(e), function(r, i, o) {
     for (var s = -1, a = i.length, c = {}; ++s < a; ) {
-      var u = i[s], l = Tr(r, u);
-      o(l, u) && hc(c, bn(u, r), l);
+      var u = i[s], l = Er(r, u);
+      o(l, u) && uc(c, bn(u, r), l);
     }
     return c;
   }(t, n, function(r, i) {
     return e(r, i[0]);
   });
 }
-function fc(t, e, n, r, i) {
+function lc(t, e, n, r, i) {
   return i(t, function(o, s, a) {
     n = r ? (r = !1, o) : e(n, o, s, a);
   }), n;
 }
 function dt(t, e, n) {
-  var r = B(t) ? Fa : fc, i = arguments.length < 3;
+  var r = B(t) ? Ma : lc, i = arguments.length < 3;
   return r(t, Pt(e), n, i, ue);
 }
 function an(t, e) {
-  return (B(t) ? Vr : cs)(t, function(n) {
+  return (B(t) ? Kr : ss)(t, function(n) {
     if (typeof n != "function") throw new TypeError("Expected a function");
     return function() {
       var r = arguments;
@@ -994,25 +998,25 @@ function an(t, e) {
     };
   }(Pt(e)));
 }
-function dc(t, e) {
+function hc(t, e) {
   var n;
   return ue(t, function(r, i, o) {
     return !(n = e(r, i, o));
   }), !!n;
 }
-function us(t, e, n) {
-  return (B(t) ? os : dc)(t, Pt(e));
+function as(t, e, n) {
+  return (B(t) ? rs : hc)(t, Pt(e));
 }
-var pc = pe && 1 / Xr(new pe([, -0]))[1] == 1 / 0 ? function(t) {
+var fc = pe && 1 / Hr(new pe([, -0]))[1] == 1 / 0 ? function(t) {
   return new pe(t);
 } : Z;
-function vr(t) {
+function yr(t) {
   return t && t.length ? function(e) {
-    var n = -1, r = Wo, i = e.length, o = !0, s = [], a = s;
+    var n = -1, r = Bo, i = e.length, o = !0, s = [], a = s;
     if (i >= 200) {
-      var c = pc(e);
-      if (c) return Xr(c);
-      o = !1, r = Yr, a = new me();
+      var c = fc(e);
+      if (c) return Hr(c);
+      o = !1, r = Vr, a = new me();
     } else a = s;
     t: for (; ++n < i; ) {
       var u = e[n], l = u;
@@ -1024,17 +1028,17 @@ function vr(t) {
     return s;
   }(t) : [];
 }
-function Or(t) {
+function Rr(t) {
   console && console.error && console.error(`Error: ${t}`);
 }
-function ls(t) {
+function cs(t) {
   console && console.warn && console.warn(`Warning: ${t}`);
 }
-function hs(t) {
+function us(t) {
   const e = (/* @__PURE__ */ new Date()).getTime(), n = t();
   return { time: (/* @__PURE__ */ new Date()).getTime() - e, value: n };
 }
-function fs(t) {
+function ls(t) {
   function e() {
   }
   e.prototype = t;
@@ -1044,7 +1048,7 @@ function fs(t) {
   }
   return r(), r(), t;
 }
-function mc(t) {
+function dc(t) {
   return ut((e = t).LABEL) && e.LABEL !== "" ? t.LABEL : t.name;
   var e;
 }
@@ -1147,7 +1151,7 @@ function cn(t) {
   if (t instanceof J) return { type: "Repetition", idx: t.idx, definition: e(t.definition) };
   if (t instanceof xt) return { type: "Alternation", idx: t.idx, definition: e(t.definition) };
   if (t instanceof V) {
-    const n = { type: "Terminal", name: t.terminalType.name, label: mc(t.terminalType), idx: t.idx };
+    const n = { type: "Terminal", name: t.terminalType.name, label: dc(t.terminalType), idx: t.idx };
     ut(t.label) && (n.terminalLabel = t.label);
     const r = t.terminalType.PATTERN;
     return t.terminalType.PATTERN && (n.pattern = Kt(r) ? r.source : r), n;
@@ -1205,7 +1209,7 @@ class Ie {
   }
 }
 function gn(t, e = []) {
-  return t instanceof lt || t instanceof J || t instanceof Lt || (t instanceof xt ? us(t.definition, (n) => gn(n, e)) : !(t instanceof mt && at(e, t)) && t instanceof Ut && (t instanceof mt && e.push(t), vt(t.definition, (n) => gn(n, e))));
+  return t instanceof lt || t instanceof J || t instanceof Lt || (t instanceof xt ? as(t.definition, (n) => gn(n, e)) : !(t instanceof mt && at(e, t)) && t instanceof Ut && (t instanceof mt && e.push(t), vt(t.definition, (n) => gn(n, e))));
 }
 function kt(t) {
   if (t instanceof mt) return "SUBRULE";
@@ -1253,7 +1257,7 @@ class Pn {
     this.walk(e, i);
   }
   walkAtLeastOneSep(e, n, r) {
-    const i = Di(e, n, r);
+    const i = Ui(e, n, r);
     this.walk(e, i);
   }
   walkMany(e, n, r) {
@@ -1261,7 +1265,7 @@ class Pn {
     this.walk(e, i);
   }
   walkManySep(e, n, r) {
-    const i = Di(e, n, r);
+    const i = Ui(e, n, r);
     this.walk(e, i);
   }
   walkOr(e, n, r) {
@@ -1272,30 +1276,29 @@ class Pn {
     });
   }
 }
-function Di(t, e, n) {
+function Ui(t, e, n) {
   return [new lt({ definition: [new V({ terminalType: t.separator })].concat(t.definition) })].concat(e, n);
 }
 function be(t) {
   if (t instanceof mt) return be(t.referencedRule);
   if (t instanceof V) return [t.terminalType];
-  if (function(e) {
-    return e instanceof ht || e instanceof lt || e instanceof J || e instanceof Ft || e instanceof Dt || e instanceof Lt || e instanceof V || e instanceof Ae;
-  }(t)) return function(e) {
-    let n = [];
-    const r = e.definition;
-    let i, o = 0, s = r.length > o, a = !0;
-    for (; s && a; ) i = r[o], a = gn(i), n = n.concat(be(i)), o += 1, s = r.length > o;
-    return vr(n);
+  if ((e = t) instanceof ht || e instanceof lt || e instanceof J || e instanceof Ft || e instanceof Dt || e instanceof Lt || e instanceof V || e instanceof Ae) return function(n) {
+    let r = [];
+    const i = n.definition;
+    let o, s = 0, a = i.length > s, c = !0;
+    for (; a && c; ) o = i[s], c = gn(o), r = r.concat(be(o)), s += 1, a = i.length > s;
+    return yr(r);
   }(t);
-  if (function(e) {
-    return e instanceof xt;
-  }(t)) return function(e) {
-    return vr(Rt(k(e.definition, (n) => be(n))));
+  var e;
+  if (function(n) {
+    return n instanceof xt;
+  }(t)) return function(n) {
+    return yr(Rt(k(n.definition, (r) => be(r))));
   }(t);
   throw Error("non exhaustive match");
 }
-const ds = "_~IN~_";
-class Ec extends Pn {
+const hs = "_~IN~_";
+class pc extends Pn {
   constructor(e) {
     super(), this.topProd = e, this.follows = {};
   }
@@ -1305,7 +1308,7 @@ class Ec extends Pn {
   walkTerminal(e, n, r) {
   }
   walkProdRef(e, n, r) {
-    const i = (o = e.referencedRule, s = e.idx, o.name + s + ds + this.topProd.name);
+    const i = (o = e.referencedRule, s = e.idx, o.name + s + hs + this.topProd.name);
     var o, s;
     const a = n.concat(r), c = be(new ht({ definition: a }));
     this.follows[i] = c;
@@ -1314,7 +1317,7 @@ class Ec extends Pn {
 function U(t) {
   return t.charCodeAt(0);
 }
-function Yn(t, e) {
+function Vn(t, e) {
   Array.isArray(t) ? t.forEach(function(n) {
     e.push(n);
   }) : e.push(t);
@@ -1327,7 +1330,7 @@ function le(t) {
   if (t === void 0) throw Error("Internal Error - Should never get here!");
   return !0;
 }
-function ji(t) {
+function Fi(t) {
   return t.type === "Character";
 }
 const Tn = [];
@@ -1335,9 +1338,9 @@ for (let t = U("0"); t <= U("9"); t++) Tn.push(t);
 const An = [U("_")].concat(Tn);
 for (let t = U("a"); t <= U("z"); t++) An.push(t);
 for (let t = U("A"); t <= U("Z"); t++) An.push(t);
-const Bi = [U(" "), U("\f"), U(`
-`), U("\r"), U("	"), U("\v"), U("	"), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U("\u2028"), U("\u2029"), U(" "), U(" "), U("　"), U("\uFEFF")], gc = /[0-9a-fA-F]/, Je = /[0-9]/, Tc = /[1-9]/;
-class Sr {
+const Di = [U(" "), U("\f"), U(`
+`), U("\r"), U("	"), U("\v"), U("	"), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U(" "), U("\u2028"), U("\u2029"), U(" "), U(" "), U("　"), U("\uFEFF")], mc = /[0-9a-fA-F]/, Je = /[0-9]/, Ec = /[1-9]/;
+class vr {
   visitChildren(e) {
     for (const n in e) {
       const r = e[n];
@@ -1427,7 +1430,7 @@ class Sr {
   }
 }
 let un = {};
-const Ac = new class {
+const gc = new class {
   constructor() {
     this.idx = 0, this.input = "", this.groupIdx = 0;
   }
@@ -1606,10 +1609,10 @@ const Ac = new class {
         t = Tn, e = !0;
         break;
       case "s":
-        t = Bi;
+        t = Di;
         break;
       case "S":
-        t = Bi, e = !0;
+        t = Di, e = !0;
         break;
       case "w":
         t = An;
@@ -1677,14 +1680,14 @@ const Ac = new class {
     let e = !1;
     for (this.consumeChar("["), this.peekChar(0) === "^" && (this.consumeChar("^"), e = !0); this.isClassAtom(); ) {
       const n = this.classAtom();
-      if (n.type, ji(n) && this.isRangeDash()) {
+      if (n.type, Fi(n) && this.isRangeDash()) {
         this.consumeChar("-");
         const r = this.classAtom();
-        if (r.type, ji(r)) {
+        if (r.type, Fi(r)) {
           if (r.value < n.value) throw Error("Range out of order in character class");
           t.push({ from: n.value, to: r.value });
-        } else Yn(n.value, t), t.push(U("-")), Yn(r.value, t);
-      } else Yn(n.value, t);
+        } else Vn(n.value, t), t.push(U("-")), Vn(r.value, t);
+      } else Vn(n.value, t);
     }
     return this.consumeChar("]"), { type: "Set", complement: e, value: t };
   }
@@ -1742,7 +1745,7 @@ const Ac = new class {
   }
   positiveInteger() {
     let t = this.popChar();
-    if (Tc.test(t) === !1) throw Error("Expecting a positive integer");
+    if (Ec.test(t) === !1) throw Error("Expecting a positive integer");
     for (; Je.test(this.peekChar(0)); ) t += this.popChar();
     return parseInt(t, 10);
   }
@@ -1879,7 +1882,7 @@ const Ac = new class {
     let e = "";
     for (let n = 0; n < t; n++) {
       const r = this.popChar();
-      if (gc.test(r) === !1) throw Error("Expecting a HexDecimal digits");
+      if (mc.test(r) === !1) throw Error("Expecting a HexDecimal digits");
       e += r;
     }
     return { type: "Character", value: parseInt(e, 16) };
@@ -1904,18 +1907,18 @@ function In(t) {
   const e = t.toString();
   if (un.hasOwnProperty(e)) return un[e];
   {
-    const n = Ac.pattern(e);
+    const n = gc.pattern(e);
     return un[e] = n, n;
   }
 }
-const ps = "Complement Sets are not supported for first char optimization", Nn = `Unable to use "first char" lexer optimizations:
+const fs = "Complement Sets are not supported for first char optimization", Nn = `Unable to use "first char" lexer optimizations:
 `;
-function Ic(t, e = !1) {
+function Tc(t, e = !1) {
   try {
     const n = In(t);
-    return _r(n.value, {}, n.flags.ignoreCase);
+    return Or(n.value, {}, n.flags.ignoreCase);
   } catch (n) {
-    if (n.message === ps) e && ls(`${Nn}	Unable to optimize: < ${t.toString()} >
+    if (n.message === fs) e && cs(`${Nn}	Unable to optimize: < ${t.toString()} >
 	Complement Sets cannot be automatically optimized.
 	This will disable the lexer's first char optimizations.
 	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.`);
@@ -1923,7 +1926,7 @@ function Ic(t, e = !1) {
       let r = "";
       e && (r = `
 	This will disable the lexer's first char optimizations.
-	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.`), Or(`${Nn}
+	See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.`), Rr(`${Nn}
 	Failed parsing: < ${t.toString()} >
 	Using the @chevrotain/regexp-to-ast library
 	Please open an issue at: https://github.com/chevrotain/chevrotain/issues` + r);
@@ -1931,10 +1934,10 @@ function Ic(t, e = !1) {
   }
   return [];
 }
-function _r(t, e, n) {
+function Or(t, e, n) {
   switch (t.type) {
     case "Disjunction":
-      for (let i = 0; i < t.value.length; i++) _r(t.value[i], e, n);
+      for (let i = 0; i < t.value.length; i++) Or(t.value[i], e, n);
       break;
     case "Alternative":
       const r = t.value;
@@ -1956,7 +1959,7 @@ function _r(t, e, n) {
             tn(s.value, e, n);
             break;
           case "Set":
-            if (s.complement === !0) throw Error(ps);
+            if (s.complement === !0) throw Error(fs);
             w(s.value, (c) => {
               if (typeof c == "number") tn(c, e, n);
               else {
@@ -1973,13 +1976,13 @@ function _r(t, e, n) {
             });
             break;
           case "Group":
-            _r(s.value, e, n);
+            Or(s.value, e, n);
             break;
           default:
             throw Error("Non Exhaustive Match");
         }
         const a = s.quantifier !== void 0 && s.quantifier.atLeast === 0;
-        if (s.type === "Group" && Lr(s) === !1 || s.type !== "Group" && a === !1) break;
+        if (s.type === "Group" && Sr(s) === !1 || s.type !== "Group" && a === !1) break;
       }
       break;
     default:
@@ -2003,7 +2006,7 @@ function tn(t, e, n) {
     }
   }(t, e);
 }
-function $i(t, e) {
+function ji(t, e) {
   return Te(t.value, (n) => {
     if (typeof n == "number") return at(e, n);
     {
@@ -2012,11 +2015,11 @@ function $i(t, e) {
     }
   });
 }
-function Lr(t) {
+function Sr(t) {
   const e = t.quantifier;
-  return !(!e || e.atLeast !== 0) || !!t.value && (B(t.value) ? vt(t.value, Lr) : Lr(t.value));
+  return !(!e || e.atLeast !== 0) || !!t.value && (B(t.value) ? vt(t.value, Sr) : Sr(t.value));
 }
-class Nc extends Sr {
+class Ac extends vr {
   constructor(e) {
     super(), this.targetCharCodes = e, this.found = !1;
   }
@@ -2035,38 +2038,38 @@ class Nc extends Sr {
     at(this.targetCharCodes, e.value) && (this.found = !0);
   }
   visitSet(e) {
-    e.complement ? $i(e, this.targetCharCodes) === void 0 && (this.found = !0) : $i(e, this.targetCharCodes) !== void 0 && (this.found = !0);
+    e.complement ? ji(e, this.targetCharCodes) === void 0 && (this.found = !0) : ji(e, this.targetCharCodes) !== void 0 && (this.found = !0);
   }
 }
-function xr(t, e) {
+function _r(t, e) {
   if (e instanceof RegExp) {
-    const n = In(e), r = new Nc(t);
+    const n = In(e), r = new Ac(t);
     return r.visit(n), r.found;
   }
   return Te(e, (n) => at(t, n.charCodeAt(0))) !== void 0;
 }
-const ne = "PATTERN", Oe = "defaultMode", Xn = "modes";
-let Wi = typeof new RegExp("(?:)").sticky == "boolean";
-const yc = /[^\\][$]/, Rc = /[^\\[][\^]|^\^/;
-function Gi(t) {
+const ne = "PATTERN", Oe = "defaultMode", Hn = "modes";
+let Bi = typeof new RegExp("(?:)").sticky == "boolean";
+const Ic = /[^\\][$]/, Nc = /[^\\[][\^]|^\^/;
+function $i(t) {
   const e = t.ignoreCase ? "i" : "";
   return new RegExp(`^(?:${t.source})`, e);
 }
-function Ki(t) {
+function Wi(t) {
   const e = t.ignoreCase ? "iy" : "y";
   return new RegExp(`${t.source}`, e);
 }
-function ms(t) {
+function ds(t) {
   const e = t.PATTERN;
   if (Kt(e)) return !1;
   if (Yt(e) || b(e, "exec")) return !0;
   if (ut(e)) return !1;
   throw Error("non exhaustive match");
 }
-function vc(t) {
+function yc(t) {
   return !(!ut(t) || t.length !== 1) && t.charCodeAt(0);
 }
-const Oc = { test: function(t) {
+const Rc = { test: function(t) {
   const e = t.length;
   for (let n = this.lastIndex; n < e; n++) {
     const r = t.charCodeAt(n);
@@ -2075,24 +2078,24 @@ const Oc = { test: function(t) {
   }
   return !1;
 }, lastIndex: 0 };
-function zi(t, e) {
+function Gi(t, e) {
   if (b(t, "LINE_BREAKS")) return !1;
   if (Kt(t.PATTERN)) {
     try {
-      xr(e, t.PATTERN);
+      _r(e, t.PATTERN);
     } catch (n) {
       return { issue: H.IDENTIFY_TERMINATOR, errMsg: n.message };
     }
     return !1;
   }
   if (ut(t.PATTERN)) return !1;
-  if (ms(t)) return { issue: H.CUSTOM_LINE_BREAK };
+  if (ds(t)) return { issue: H.CUSTOM_LINE_BREAK };
   throw Error("non exhaustive match");
 }
-function Vi(t) {
+function Ki(t) {
   return k(t, (e) => ut(e) ? e.charCodeAt(0) : e);
 }
-function qn(t, e, n) {
+function Yn(t, e, n) {
   t[e] === void 0 ? t[e] = [n] : t[e].push(n);
 }
 const Le = 256;
@@ -2107,8 +2110,8 @@ function Pe(t, e) {
 function yn(t, e) {
   return t.tokenTypeIdx === e.tokenTypeIdx;
 }
-let Hi = 1;
-const Yi = {};
+let zi = 1;
+const Vi = {};
 function He(t) {
   const e = function(n) {
     let r = et(n), i = n, o = !0;
@@ -2121,37 +2124,37 @@ function He(t) {
   }(t);
   (function(n) {
     w(n, (r) => {
-      gs(r) || (Yi[Hi] = r, r.tokenTypeIdx = Hi++), Xi(r) && !B(r.CATEGORIES) && (r.CATEGORIES = [r.CATEGORIES]), Xi(r) || (r.CATEGORIES = []), b(r, "categoryMatches") || (r.categoryMatches = []), b(r, "categoryMatchesMap") || (r.categoryMatchesMap = {});
+      ms(r) || (Vi[zi] = r, r.tokenTypeIdx = zi++), Hi(r) && !B(r.CATEGORIES) && (r.CATEGORIES = [r.CATEGORIES]), Hi(r) || (r.CATEGORIES = []), b(r, "categoryMatches") || (r.categoryMatches = []), b(r, "categoryMatchesMap") || (r.categoryMatchesMap = {});
     });
   })(e), function(n) {
     w(n, (r) => {
-      Es([], r);
+      ps([], r);
     });
   }(e), function(n) {
     w(n, (r) => {
       r.categoryMatches = [], w(r.categoryMatchesMap, (i, o) => {
-        r.categoryMatches.push(Yi[o].tokenTypeIdx);
+        r.categoryMatches.push(Vi[o].tokenTypeIdx);
       });
     });
   }(e), w(e, (n) => {
     n.isParent = n.categoryMatches.length > 0;
   });
 }
-function Es(t, e) {
+function ps(t, e) {
   w(t, (n) => {
     e.categoryMatchesMap[n.tokenTypeIdx] = !0;
   }), w(e.CATEGORIES, (n) => {
     const r = t.concat(e);
-    at(r, n) || Es(r, n);
+    at(r, n) || ps(r, n);
   });
 }
-function gs(t) {
+function ms(t) {
   return b(t, "tokenTypeIdx");
 }
-function Xi(t) {
+function Hi(t) {
   return b(t, "CATEGORIES");
 }
-function Sc(t) {
+function vc(t) {
   return b(t, "tokenTypeIdx");
 }
 var H, j;
@@ -2166,7 +2169,7 @@ class ot {
         this.traceInitIndent++;
         const s = new Array(this.traceInitIndent + 1).join("	");
         this.traceInitIndent < this.traceInitMaxIdent && console.log(`${s}--> <${i}>`);
-        const { time: a, value: c } = hs(o), u = a > 10 ? console.warn : console.log;
+        const { time: a, value: c } = us(o), u = a > 10 ? console.warn : console.log;
         return this.traceInitIndent < this.traceInitMaxIdent && u(`${s}<-- <${i}> time: ${a}ms`), this.traceInitIndent--, c;
       }
       return o();
@@ -2177,7 +2180,7 @@ a boolean 2nd argument is no longer supported`);
     r === !0 ? (this.traceInitMaxIdent = 1 / 0, this.traceInitPerf = !0) : typeof r == "number" && (this.traceInitMaxIdent = r, this.traceInitPerf = !0), this.traceInitIndent = -1, this.TRACE_INIT("Lexer Constructor", () => {
       let i, o = !0;
       this.TRACE_INIT("Lexer Config handling", () => {
-        if (this.config.lineTerminatorsPattern === xe.lineTerminatorsPattern) this.config.lineTerminatorsPattern = Oc;
+        if (this.config.lineTerminatorsPattern === xe.lineTerminatorsPattern) this.config.lineTerminatorsPattern = Rc;
         else if (this.config.lineTerminatorCharacters === xe.lineTerminatorCharacters) throw Error(`Error: Missing <lineTerminatorCharacters> property on the Lexer config.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS`);
         if (n.safeMode && n.ensureOptimizations) throw Error('"safeMode" and "ensureOptimizations" flags are mutually exclusive.');
@@ -2186,9 +2189,9 @@ a boolean 2nd argument is no longer supported`);
         this.lexerDefinitionErrors = this.lexerDefinitionErrors.concat(function(a) {
           const c = [];
           return b(a, Oe) || c.push({ message: "A MultiMode Lexer cannot be initialized without a <" + Oe + `> property in its definition
-`, type: H.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE }), b(a, Xn) || c.push({ message: `A MultiMode Lexer cannot be initialized without a <modes> property in its definition
-`, type: H.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY }), b(a, Xn) && b(a, Oe) && !b(a.modes, a.defaultMode) && c.push({ message: `A MultiMode Lexer cannot be initialized with a ${Oe}: <${a.defaultMode}>which does not exist
-`, type: H.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST }), b(a, Xn) && w(a.modes, (u, l) => {
+`, type: H.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE }), b(a, Hn) || c.push({ message: `A MultiMode Lexer cannot be initialized without a <modes> property in its definition
+`, type: H.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY }), b(a, Hn) && b(a, Oe) && !b(a.modes, a.defaultMode) && c.push({ message: `A MultiMode Lexer cannot be initialized with a ${Oe}: <${a.defaultMode}>which does not exist
+`, type: H.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST }), b(a, Hn) && w(a.modes, (u, l) => {
             w(u, (h, N) => {
               Ht(h) ? c.push({ message: `A Lexer cannot be initialized using an undefined Token Type. Mode:<${l}> at index: <${N}>
 `, type: H.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED }) : b(h, "LONGER_ALT") && w(B(h.LONGER_ALT) ? h.LONGER_ALT : [h.LONGER_ALT], (S) => {
@@ -2202,9 +2205,9 @@ a boolean 2nd argument is no longer supported`);
         this.lexerDefinitionWarning = this.lexerDefinitionWarning.concat(function(a, c, u) {
           const l = [];
           let h = !1;
-          const N = an($e(Rt(Q(a.modes))), (_) => _[ne] === ot.NA), S = Vi(u);
+          const N = an($e(Rt(Q(a.modes))), (_) => _[ne] === ot.NA), S = Ki(u);
           return c && w(N, (_) => {
-            const m = zi(_, S);
+            const m = Gi(_, S);
             if (m !== !1) {
               const y = { message: function(p, T) {
                 if (T.issue === H.IDENTIFY_TERMINATOR) return `Warning: unable to identify line terminator usage in pattern.
@@ -2217,7 +2220,7 @@ a boolean 2nd argument is no longer supported`);
                 throw Error("non exhaustive match");
               }(_, m), type: m.issue, tokenType: _ };
               l.push(y);
-            } else b(_, "LINE_BREAKS") ? _.LINE_BREAKS === !0 && (h = !0) : xr(S, _.PATTERN) && (h = !0);
+            } else b(_, "LINE_BREAKS") ? _.LINE_BREAKS === !0 && (h = !0) : _r(S, _.PATTERN) && (h = !0);
           }), c && !h && l.push({ message: `Warning: No LINE_BREAKS Found.
 	This Lexer has been defined to track line and column information,
 	But none of the Token Types can be identified as matching a line terminator.
@@ -2249,7 +2252,7 @@ a boolean 2nd argument is no longer supported`);
                 let y = [];
                 const p = gt(m, (T) => Kt(T[ne]));
                 return y = y.concat(function(T) {
-                  class g extends Sr {
+                  class g extends vr {
                     constructor() {
                       super(...arguments), this.found = !1;
                     }
@@ -2263,13 +2266,13 @@ a boolean 2nd argument is no longer supported`);
                       const f = In(v), d = new g();
                       return d.visit(f), d.found;
                     } catch {
-                      return yc.test(v.source);
+                      return Ic.test(v.source);
                     }
                   }), (A) => ({ message: `Unexpected RegExp Anchor Error:
 	Token Type: ->` + A.name + `<- static 'PATTERN' cannot contain end of input anchor '$'
 	See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS	for details.`, type: H.EOI_ANCHOR_FOUND, tokenTypes: [A] }));
                 }(p)), y = y.concat(function(T) {
-                  class g extends Sr {
+                  class g extends vr {
                     constructor() {
                       super(...arguments), this.found = !1;
                     }
@@ -2283,7 +2286,7 @@ a boolean 2nd argument is no longer supported`);
                       const f = In(v), d = new g();
                       return d.visit(f), d.found;
                     } catch {
-                      return Rc.test(v.source);
+                      return Nc.test(v.source);
                     }
                   }), (A) => ({ message: `Unexpected RegExp Anchor Error:
 	Token Type: ->` + A.name + `<- static 'PATTERN' cannot contain start of input anchor '^'
@@ -2336,7 +2339,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
             let u;
             He(a), this.TRACE_INIT("analyzeTokenTypes", () => {
               u = function(l, h) {
-                const N = (h = Rr(h, { useSticky: Wi, debug: !1, safeMode: !1, positionTracking: "full", lineTerminatorCharacters: ["\r", `
+                const N = (h = Nr(h, { useSticky: Bi, debug: !1, safeMode: !1, positionTracking: "full", lineTerminatorCharacters: ["\r", `
 `], tracer: (L, O) => O() })).tracer;
                 let S;
                 N("initCharCodeToOptimizedIndexMap", () => {
@@ -2355,7 +2358,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                     const O = L[ne];
                     if (Kt(O)) {
                       const P = O.source;
-                      return P.length !== 1 || P === "^" || P === "$" || P === "." || O.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? Ki(O) : Gi(O) : P[1] : P;
+                      return P.length !== 1 || P === "^" || P === "$" || P === "." || O.ignoreCase ? P.length !== 2 || P[0] !== "\\" || at(["d", "D", "s", "S", "t", "r", "n", "t", "0", "c", "b", "B", "f", "v", "w", "W"], P[1]) ? h.useSticky ? Wi(O) : $i(O) : P[1] : P;
                     }
                     if (Yt(O)) return E = !0, { exec: O };
                     if (typeof O == "object") return E = !0, O;
@@ -2363,7 +2366,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                       if (O.length === 1) return O;
                       {
                         const P = O.replace(/[\\^$.*+?()[\]{}|]/g, "\\$&"), x = new RegExp(P);
-                        return h.useSticky ? Ki(x) : Gi(x);
+                        return h.useSticky ? Wi(x) : $i(x);
                       }
                     }
                     throw Error("non exhaustive match");
@@ -2378,13 +2381,13 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                     }
                   }), p = k(S, (L) => {
                     const O = L.LONGER_ALT;
-                    if (O) return B(O) ? k(O, (P) => Ui(S, P)) : [Ui(S, O)];
+                    if (O) return B(O) ? k(O, (P) => wi(S, P)) : [wi(S, O)];
                   }), T = k(S, (L) => L.PUSH_MODE), g = k(S, (L) => b(L, "POP_MODE"));
                 }), N("Line Terminator Handling", () => {
-                  const L = Vi(h.lineTerminatorCharacters);
-                  A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : zi(O, L) === !1 && xr(L, O.PATTERN)));
+                  const L = Ki(h.lineTerminatorCharacters);
+                  A = k(S, (O) => !1), h.positionTracking !== "onlyOffset" && (A = k(S, (O) => b(O, "LINE_BREAKS") ? !!O.LINE_BREAKS : Gi(O, L) === !1 && _r(L, O.PATTERN)));
                 }), N("Misc Mapping #2", () => {
-                  v = k(S, ms), f = k(_, vc), d = dt(S, (L, O) => {
+                  v = k(S, ds), f = k(_, yc), d = dt(S, (L, O) => {
                     const P = O.GROUP;
                     return ut(P) && P !== ot.SKIPPED && (L[P] = []), L;
                   }, {}), I = k(_, (L, O) => ({ pattern: _[O], longerAlt: p[O], canLineTerminator: A[O], isCustom: v[O], short: f[O], group: y[O], push: T[O], pop: g[O], tokenTypeIdx: m[O], tokenType: S[O] }));
@@ -2394,24 +2397,24 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
                   M = dt(S, (L, O, P) => {
                     if (typeof O.PATTERN == "string") {
                       const x = qt(O.PATTERN.charCodeAt(0));
-                      qn(L, x, I[P]);
+                      Yn(L, x, I[P]);
                     } else if (B(O.START_CHARS_HINT)) {
                       let x;
                       w(O.START_CHARS_HINT, (C) => {
                         const $ = qt(typeof C == "string" ? C.charCodeAt(0) : C);
-                        x !== $ && (x = $, qn(L, $, I[P]));
+                        x !== $ && (x = $, Yn(L, $, I[P]));
                       });
-                    } else if (Kt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Or(`${Nn}	Unable to analyze < ${O.PATTERN.toString()} > pattern.
+                    } else if (Kt(O.PATTERN)) if (O.PATTERN.unicode) R = !1, h.ensureOptimizations && Rr(`${Nn}	Unable to analyze < ${O.PATTERN.toString()} > pattern.
 	The regexp unicode flag is not currently supported by the regexp-to-ast library.
 	This will disable the lexer's first char optimizations.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);
                     else {
-                      const x = Ic(O.PATTERN, h.ensureOptimizations);
+                      const x = Tc(O.PATTERN, h.ensureOptimizations);
                       K(x) && (R = !1), w(x, (C) => {
-                        qn(L, C, I[P]);
+                        Yn(L, C, I[P]);
                       });
                     }
-                    else h.ensureOptimizations && Or(`${Nn}	TokenType: <${O.name}> is using a custom token pattern without providing <start_chars_hint> parameter.
+                    else h.ensureOptimizations && Rr(`${Nn}	TokenType: <${O.name}> is using a custom token pattern without providing <start_chars_hint> parameter.
 	This will disable the lexer's first char optimizations.
 	For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`), R = !1;
                     return L;
@@ -2428,9 +2431,9 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
 ` + a);
       }
       w(this.lexerDefinitionWarning, (a) => {
-        ls(a.message);
+        cs(a.message);
       }), this.TRACE_INIT("Choosing sub-methods implementations", () => {
-        if (Wi ? (this.chopInput = Ee, this.match = this.matchWithTest) : (this.updateLastIndex = Z, this.match = this.matchWithExec), o && (this.handleModes = Z), this.trackStartLines === !1 && (this.computeNewColumn = Ee), this.trackEndLines === !1 && (this.updateTokenEndLineColumnLocation = Z), /full/i.test(this.config.positionTracking)) this.createTokenInstance = this.createFullToken;
+        if (Bi ? (this.chopInput = Ee, this.match = this.matchWithTest) : (this.updateLastIndex = Z, this.match = this.matchWithExec), o && (this.handleModes = Z), this.trackStartLines === !1 && (this.computeNewColumn = Ee), this.trackEndLines === !1 && (this.updateTokenEndLineColumnLocation = Z), /full/i.test(this.config.positionTracking)) this.createTokenInstance = this.createFullToken;
         else if (/onlyStart/i.test(this.config.positionTracking)) this.createTokenInstance = this.createStartOnlyToken;
         else {
           if (!/onlyOffset/i.test(this.config.positionTracking)) throw Error(`Invalid <positionTracking> config option: "${this.config.positionTracking}"`);
@@ -2445,7 +2448,7 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
       }), this.TRACE_INIT("clearRegExpParserCache", () => {
         un = {};
       }), this.TRACE_INIT("toFastProperties", () => {
-        fs(this);
+        ls(this);
       });
     });
   }
@@ -2539,8 +2542,8 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
         const ct = A, Bt = E, $t = R;
         let Wt = te === !1;
         for (; Wt === !1 && A < g; ) for (e = this.chopInput(e, 1), A++, i = 0; i < P; i++) {
-          const ee = x[i], Dn = ee.pattern, Qr = ee.short;
-          if (Qr !== !1 ? T.charCodeAt(A) === Qr && (Wt = !0) : ee.isCustom === !0 ? Wt = Dn.exec(T, A, d, M) !== null : (this.updateLastIndex(Dn, A), Wt = Dn.exec(e) !== null), Wt === !0) break;
+          const ee = x[i], Dn = ee.pattern, qr = ee.short;
+          if (qr !== !1 ? T.charCodeAt(A) === qr && (Wt = !0) : ee.isCustom === !0 ? Wt = Dn.exec(T, A, d, M) !== null : (this.updateLastIndex(Dn, A), Wt = Dn.exec(e) !== null), Wt === !0) break;
         }
         if (m = A - ct, R = this.computeNewColumn(R, m), y = this.config.errorMessageProvider.buildUnexpectedCharactersMessage(T, ct, m, Bt, $t), I.push({ offset: ct, line: Bt, column: $t, length: m, message: y }), te === !1) break;
       }
@@ -2595,27 +2598,27 @@ See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;
   }
 }
 function we(t) {
-  return Ts(t) ? t.LABEL : t.name;
+  return Es(t) ? t.LABEL : t.name;
 }
-function Ts(t) {
+function Es(t) {
   return ut(t.LABEL) && t.LABEL !== "";
 }
 ot.SKIPPED = "This marks a skipped Token pattern, this means each token identified by it willbe consumed and then thrown into oblivion, this can be used to for example to completely ignore whitespace.", ot.NA = /NOT_APPLICABLE/;
-const qi = "categories", Zi = "label", Qi = "group", Ji = "push_mode", to = "pop_mode", eo = "longer_alt", no = "line_breaks", ro = "start_chars_hint";
+const Yi = "categories", Xi = "label", qi = "group", Zi = "push_mode", Qi = "pop_mode", Ji = "longer_alt", to = "line_breaks", eo = "start_chars_hint";
 function F(t) {
   return function(e) {
     const n = e.pattern, r = {};
     if (r.name = e.name, Ht(n) || (r.PATTERN = n), b(e, "parent")) throw `The parent property is no longer supported.
 See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.`;
-    return b(e, qi) && (r.CATEGORIES = e[qi]), He([r]), b(e, Zi) && (r.LABEL = e[Zi]), b(e, Qi) && (r.GROUP = e[Qi]), b(e, to) && (r.POP_MODE = e[to]), b(e, Ji) && (r.PUSH_MODE = e[Ji]), b(e, eo) && (r.LONGER_ALT = e[eo]), b(e, no) && (r.LINE_BREAKS = e[no]), b(e, ro) && (r.START_CHARS_HINT = e[ro]), r;
+    return b(e, Yi) && (r.CATEGORIES = e[Yi]), He([r]), b(e, Xi) && (r.LABEL = e[Xi]), b(e, qi) && (r.GROUP = e[qi]), b(e, Qi) && (r.POP_MODE = e[Qi]), b(e, Zi) && (r.PUSH_MODE = e[Zi]), b(e, Ji) && (r.LONGER_ALT = e[Ji]), b(e, to) && (r.LINE_BREAKS = e[to]), b(e, eo) && (r.START_CHARS_HINT = e[eo]), r;
   }(t);
 }
 const ie = F({ name: "EOF", pattern: ot.NA });
-function qr(t, e, n, r, i, o, s, a) {
+function Yr(t, e, n, r, i, o, s, a) {
   return { image: e, startOffset: n, endOffset: r, startLine: i, endLine: o, startColumn: s, endColumn: a, tokenTypeIdx: t.tokenTypeIdx, tokenType: t };
 }
 He([ie]);
-const As = { buildMismatchTokenMessage: ({ expected: t, actual: e, previous: n, ruleName: r }) => `Expecting ${Ts(t) ? `--> ${we(t)} <--` : `token of type --> ${t.name} <--`} but found --> '${e.image}' <--`, buildNotAllInputParsedMessage: ({ firstRedundant: t, ruleName: e }) => "Redundant input, expecting EOF but found: " + t.image, buildNoViableAltMessage({ expectedPathsPerAlt: t, actual: e, previous: n, customUserDescription: r, ruleName: i }) {
+const gs = { buildMismatchTokenMessage: ({ expected: t, actual: e, previous: n, ruleName: r }) => `Expecting ${Es(t) ? `--> ${we(t)} <--` : `token of type --> ${t.name} <--`} but found --> '${e.image}' <--`, buildNotAllInputParsedMessage: ({ firstRedundant: t, ruleName: e }) => "Redundant input, expecting EOF but found: " + t.image, buildNoViableAltMessage({ expectedPathsPerAlt: t, actual: e, previous: n, customUserDescription: r, ruleName: i }) {
   const o = "Expecting: ", s = `
 but found: '` + St(e).image + "'";
   if (r) return o + r + s;
@@ -2631,8 +2634,8 @@ but found: '` + St(e).image + "'";
   return n ? i + n + o : i + `expecting at least one iteration which starts with one of these possible Token sequences::
   <${k(t, (s) => `[${k(s, (a) => we(a)).join(",")}]`).join(" ,")}>` + o;
 } };
-Object.freeze(As);
-const _c = { buildRuleNotFoundError: (t, e) => "Invalid grammar, reference to a rule which is not defined: ->" + e.nonTerminalName + `<-
+Object.freeze(gs);
+const Oc = { buildRuleNotFoundError: (t, e) => "Invalid grammar, reference to a rule which is not defined: ->" + e.nonTerminalName + `<-
 inside top level rule: ->` + t.name + "<-" }, oe = { buildDuplicateFoundError(t, e) {
   const n = t.name, r = St(e), i = r.idx, o = kt(r), s = (a = r) instanceof V ? a.terminalType.name : a instanceof mt ? a.nonTerminalName : "";
   var a;
@@ -2679,7 +2682,7 @@ see: https://en.wikipedia.org/wiki/LL_parser#Left_factoring.`;
   let e;
   return e = t.topLevelRule instanceof Ae ? t.topLevelRule.name : t.topLevelRule, `Duplicate definition, rule: ->${e}<- is already defined in the grammar: ->${t.grammarName}<-`;
 } };
-class Lc extends Ie {
+class Sc extends Ie {
   constructor(e, n) {
     super(), this.nameToTopRule = e, this.errMsgProvider = n, this.errors = [];
   }
@@ -2697,7 +2700,7 @@ class Lc extends Ie {
     }
   }
 }
-class xc extends Pn {
+class _c extends Pn {
   constructor(e, n) {
     super(), this.topProd = e, this.path = n, this.possibleTokTypes = [], this.nextProductionName = "", this.nextProductionOccurrence = 0, this.found = !1, this.isAtEndOfPath = !1;
   }
@@ -2718,7 +2721,7 @@ class xc extends Pn {
     K(this.ruleStack) ? (this.nextProductionName = "", this.nextProductionOccurrence = 0, this.isAtEndOfPath = !0) : (this.nextProductionName = this.ruleStack.pop(), this.nextProductionOccurrence = this.occurrenceStack.pop());
   }
 }
-class Cc extends xc {
+class Lc extends _c {
   constructor(e, n) {
     super(e, n), this.path = n, this.nextTerminalName = "", this.nextTerminalOccurrence = 0, this.nextTerminalName = this.path.lastTok.name, this.nextTerminalOccurrence = this.path.lastTokOccurrence;
   }
@@ -2737,7 +2740,7 @@ class wn extends Pn {
     return this.walk(this.topRule), this.result;
   }
 }
-class kc extends wn {
+class xc extends wn {
   walkMany(e, n, r) {
     if (e.idx === this.occurrence) {
       const i = St(n.concat(r));
@@ -2745,7 +2748,7 @@ class kc extends wn {
     } else super.walkMany(e, n, r);
   }
 }
-class io extends wn {
+class no extends wn {
   walkManySep(e, n, r) {
     if (e.idx === this.occurrence) {
       const i = St(n.concat(r));
@@ -2753,7 +2756,7 @@ class io extends wn {
     } else super.walkManySep(e, n, r);
   }
 }
-class bc extends wn {
+class Cc extends wn {
   walkAtLeastOne(e, n, r) {
     if (e.idx === this.occurrence) {
       const i = St(n.concat(r));
@@ -2761,7 +2764,7 @@ class bc extends wn {
     } else super.walkAtLeastOne(e, n, r);
   }
 }
-class oo extends wn {
+class ro extends wn {
   walkAtLeastOneSep(e, n, r) {
     if (e.idx === this.occurrence) {
       const i = St(n.concat(r));
@@ -2769,11 +2772,11 @@ class oo extends wn {
     } else super.walkAtLeastOneSep(e, n, r);
   }
 }
-function Cr(t, e, n = []) {
+function Lr(t, e, n = []) {
   n = et(n);
   let r = [], i = 0;
   function o(s) {
-    const a = Cr(s.concat(tt(t, i + 1)), e, n);
+    const a = Lr(s.concat(tt(t, i + 1)), e, n);
     return r.concat(a);
   }
   for (; n.length < e && i < t.length; ) {
@@ -2801,7 +2804,7 @@ function Cr(t, e, n = []) {
   }
   return r.push({ partialPath: n, suffixDef: tt(t, i) }), r;
 }
-function Is(t, e, n, r) {
+function Ts(t, e, n, r) {
   const i = "EXIT_NONE_TERMINAL", o = [i], s = "EXIT_ALTERNATIVE";
   let a = !1;
   const c = e.length, u = c - r - 1, l = [], h = [];
@@ -2862,19 +2865,19 @@ function Is(t, e, n, r) {
     else if (p instanceof ht) h.push({ idx: _, def: p.definition.concat(tt(S)), ruleStack: m, occurrenceStack: y });
     else {
       if (!(p instanceof Ae)) throw Error("non exhaustive match");
-      h.push(Pc(p, _, m, y));
+      h.push(kc(p, _, m, y));
     }
   }
   return l;
 }
-function Pc(t, e, n, r) {
+function kc(t, e, n, r) {
   const i = et(n);
   i.push(t.name);
   const o = et(r);
   return o.push(1), { idx: e, def: t.definition, ruleStack: i, occurrenceStack: o };
 }
 var Y;
-function so(t) {
+function io(t) {
   if (t instanceof lt || t === "Option") return Y.OPTION;
   if (t instanceof J || t === "Repetition") return Y.REPETITION;
   if (t instanceof Ft || t === "RepetitionMandatory") return Y.REPETITION_MANDATORY;
@@ -2883,7 +2886,7 @@ function so(t) {
   if (t instanceof xt || t === "Alternation") return Y.ALTERNATION;
   throw Error("non exhaustive match");
 }
-function wc(t, e, n, r) {
+function bc(t, e, n, r) {
   const i = t.length, o = vt(t, (s) => vt(s, (a) => a.length === 1));
   if (e) return function(s) {
     const a = k(s, (c) => c.GATE);
@@ -2924,7 +2927,7 @@ function wc(t, e, n, r) {
     }
   };
 }
-function Mc(t, e, n) {
+function Pc(t, e, n) {
   const r = vt(t, (o) => o.length === 1), i = t.length;
   if (r && !n) {
     const o = Rt(t);
@@ -2959,7 +2962,7 @@ function Mc(t, e, n) {
 (function(t) {
   t[t.OPTION = 0] = "OPTION", t[t.REPETITION = 1] = "REPETITION", t[t.REPETITION_MANDATORY = 2] = "REPETITION_MANDATORY", t[t.REPETITION_MANDATORY_WITH_SEPARATOR = 3] = "REPETITION_MANDATORY_WITH_SEPARATOR", t[t.REPETITION_WITH_SEPARATOR = 4] = "REPETITION_WITH_SEPARATOR", t[t.ALTERNATION = 5] = "ALTERNATION";
 })(Y || (Y = {}));
-class Uc extends Pn {
+class wc extends Pn {
   constructor(e, n, r) {
     super(), this.topProd = e, this.targetOccurrence = n, this.targetProdType = r;
   }
@@ -2985,7 +2988,7 @@ class Uc extends Pn {
     this.checkIsTarget(e, Y.REPETITION_WITH_SEPARATOR, n, r) || super.walkOption(e, n, r);
   }
 }
-class Ns extends Ie {
+class As extends Ie {
   constructor(e, n, r) {
     super(), this.targetOccurrence = e, this.targetProdType = n, this.targetRef = r, this.result = [];
   }
@@ -3011,12 +3014,12 @@ class Ns extends Ie {
     this.checkIsTarget(e, Y.ALTERNATION);
   }
 }
-function ao(t) {
+function oo(t) {
   const e = new Array(t);
   for (let n = 0; n < t; n++) e[n] = [];
   return e;
 }
-function Zn(t) {
+function Xn(t) {
   let e = [""];
   for (let n = 0; n < t.length; n++) {
     const r = t[n], i = [];
@@ -3032,7 +3035,7 @@ function Zn(t) {
   }
   return e;
 }
-function Fc(t, e, n) {
+function Mc(t, e, n) {
   for (let r = 0; r < t.length; r++) {
     if (r === n) continue;
     const i = t[r];
@@ -3040,11 +3043,11 @@ function Fc(t, e, n) {
   }
   return !0;
 }
-function ys(t, e) {
-  const n = k(t, (s) => Cr([s], 1)), r = ao(n.length), i = k(n, (s) => {
+function Is(t, e) {
+  const n = k(t, (s) => Lr([s], 1)), r = oo(n.length), i = k(n, (s) => {
     const a = {};
     return w(s, (c) => {
-      w(Zn(c.partialPath), (u) => {
+      w(Xn(c.partialPath), (u) => {
         a[u] = !0;
       });
     }), a;
@@ -3052,14 +3055,14 @@ function ys(t, e) {
   let o = n;
   for (let s = 1; s <= e; s++) {
     const a = o;
-    o = ao(a.length);
+    o = oo(a.length);
     for (let c = 0; c < a.length; c++) {
       const u = a[c];
       for (let l = 0; l < u.length; l++) {
-        const h = u[l].partialPath, N = u[l].suffixDef, S = Zn(h);
-        if (Fc(i, S, c) || K(N) || h.length === e) {
+        const h = u[l].partialPath, N = u[l].suffixDef, S = Xn(h);
+        if (Mc(i, S, c) || K(N) || h.length === e) {
           const _ = r[c];
-          if (Pr(_, h) === !1) {
+          if (kr(_, h) === !1) {
             _.push(h);
             for (let m = 0; m < S.length; m++) {
               const y = S[m];
@@ -3067,9 +3070,9 @@ function ys(t, e) {
             }
           }
         } else {
-          const _ = Cr(N, s + 1, h);
+          const _ = Lr(N, s + 1, h);
           o[c] = o[c].concat(_), w(_, (m) => {
-            w(Zn(m.partialPath), (y) => {
+            w(Xn(m.partialPath), (y) => {
               i[c][y] = !0;
             });
           });
@@ -3079,17 +3082,17 @@ function ys(t, e) {
   }
   return r;
 }
-function kr(t, e, n, r) {
-  const i = new Ns(t, Y.ALTERNATION, r);
-  return e.accept(i), ys(i.result, n);
+function xr(t, e, n, r) {
+  const i = new As(t, Y.ALTERNATION, r);
+  return e.accept(i), Is(i.result, n);
 }
-function br(t, e, n, r) {
-  const i = new Ns(t, n);
+function Cr(t, e, n, r) {
+  const i = new As(t, n);
   e.accept(i);
-  const o = i.result, s = new Uc(e, t, n).startWalking();
-  return ys([new ht({ definition: o }), new ht({ definition: s })], r);
+  const o = i.result, s = new wc(e, t, n).startWalking();
+  return Is([new ht({ definition: o }), new ht({ definition: s })], r);
 }
-function Pr(t, e) {
+function kr(t, e) {
   t: for (let n = 0; n < t.length; n++) {
     const r = t[n];
     if (r.length === e.length) {
@@ -3102,16 +3105,16 @@ function Pr(t, e) {
   }
   return !1;
 }
-function co(t) {
+function so(t) {
   return vt(t, (e) => vt(e, (n) => vt(n, (r) => K(r.categoryMatches))));
 }
-function Dc(t) {
-  return `${kt(t)}_#_${t.idx}_#_${Rs(t)}`;
+function Uc(t) {
+  return `${kt(t)}_#_${t.idx}_#_${Ns(t)}`;
 }
-function Rs(t) {
+function Ns(t) {
   return t instanceof V ? t.terminalType.name : t instanceof mt ? t.nonTerminalName : "";
 }
-class jc extends Ie {
+class Fc extends Ie {
   constructor() {
     super(...arguments), this.allProductions = [];
   }
@@ -3140,7 +3143,7 @@ class jc extends Ie {
     this.allProductions.push(e);
   }
 }
-function vs(t, e, n, r = []) {
+function ys(t, e, n, r = []) {
   const i = [], o = hn(e.definition);
   if (K(o)) return [];
   {
@@ -3148,7 +3151,7 @@ function vs(t, e, n, r = []) {
     at(o, t) && i.push({ message: n.buildLeftRecursionError({ topLevelRule: t, leftRecursionPath: r }), type: st.LEFT_RECURSION, ruleName: s });
     const a = Tt(En(o, r.concat([t])), (c) => {
       const u = et(r);
-      return u.push(c), vs(t, c, n, u);
+      return u.push(c), ys(t, c, n, u);
     });
     return i.concat(a);
   }
@@ -3168,7 +3171,7 @@ function hn(t) {
   }
   return e;
 }
-class wr extends Ie {
+class br extends Ie {
   constructor() {
     super(...arguments), this.alternations = [];
   }
@@ -3176,7 +3179,7 @@ class wr extends Ie {
     this.alternations.push(e);
   }
 }
-class Bc extends Ie {
+class Dc extends Ie {
   constructor() {
     super(...arguments), this.allProductions = [];
   }
@@ -3193,43 +3196,43 @@ class Bc extends Ie {
     this.allProductions.push(e);
   }
 }
-const Os = "MismatchedTokenException", Ss = "NoViableAltException", _s = "EarlyExitException", Ls = "NotAllInputParsedException", xs = [Os, Ss, _s, Ls];
+const Rs = "MismatchedTokenException", vs = "NoViableAltException", Os = "EarlyExitException", Ss = "NotAllInputParsedException", _s = [Rs, vs, Os, Ss];
 function en(t) {
-  return at(xs, t.name);
+  return at(_s, t.name);
 }
-Object.freeze(xs);
+Object.freeze(_s);
 class Mn extends Error {
   constructor(e, n) {
     super(e), this.token = n, this.resyncedTokens = [], Object.setPrototypeOf(this, new.target.prototype), Error.captureStackTrace && Error.captureStackTrace(this, this.constructor);
   }
 }
-class uo extends Mn {
+class ao extends Mn {
   constructor(e, n, r) {
-    super(e, n), this.previousToken = r, this.name = Os;
+    super(e, n), this.previousToken = r, this.name = Rs;
   }
 }
-class $c extends Mn {
+class jc extends Mn {
   constructor(e, n, r) {
-    super(e, n), this.previousToken = r, this.name = Ss;
+    super(e, n), this.previousToken = r, this.name = vs;
   }
 }
-class Wc extends Mn {
+class Bc extends Mn {
   constructor(e, n) {
-    super(e, n), this.name = Ls;
+    super(e, n), this.name = Ss;
   }
 }
-class Gc extends Mn {
+class $c extends Mn {
   constructor(e, n, r) {
-    super(e, n), this.previousToken = r, this.name = _s;
+    super(e, n), this.previousToken = r, this.name = Os;
   }
 }
-const Qn = {}, Cs = "InRuleRecoveryException";
-class Kc extends Error {
+const qn = {}, Ls = "InRuleRecoveryException";
+class Wc extends Error {
   constructor(e) {
-    super(e), this.name = Cs;
+    super(e), this.name = Ls;
   }
 }
-function zc(t, e, n, r, i, o, s) {
+function Gc(t, e, n, r, i, o, s) {
   const a = this.getKeyForAutomaticLookahead(r, i);
   let c = this.firstAfterRepMap[a];
   if (c === void 0) {
@@ -3240,11 +3243,11 @@ function zc(t, e, n, r, i, o, s) {
   const h = c.isEndOfRule;
   this.RULE_STACK.length === 1 && h && u === void 0 && (u = ie, l = 1), u !== void 0 && l !== void 0 && this.shouldInRepetitionRecoveryBeTried(u, l, s) && this.tryInRepetitionRecovery(t, e, n, u);
 }
-const Jn = 1024, tr = 1280, nn = 1536;
-function er(t, e, n) {
+const Zn = 1024, Qn = 1280, nn = 1536;
+function Jn(t, e, n) {
   return n | e | t;
 }
-class Vc {
+class Kc {
   constructor(e) {
     var n;
     this.maxLookahead = (n = e?.maxLookahead) !== null && n !== void 0 ? n : zt.maxLookahead;
@@ -3258,27 +3261,27 @@ class Vc {
     return n;
   }
   validateNoLeftRecursion(e) {
-    return Tt(e, (n) => vs(n, n, oe));
+    return Tt(e, (n) => ys(n, n, oe));
   }
   validateEmptyOrAlternatives(e) {
     return Tt(e, (n) => function(r, i) {
-      const o = new wr();
-      return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => K(Is([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
+      const o = new br();
+      return r.accept(o), Tt(o.alternations, (s) => Tt(We(s.definition), (a, c) => K(Ts([a], [], Pe, 1)) ? [{ message: i.buildEmptyAlternationError({ topLevelRule: r, alternation: s, emptyChoiceIdx: c }), type: st.NONE_LAST_EMPTY_ALT, ruleName: r.name, occurrence: s.idx, alternative: c + 1 }] : []));
     }(n, oe));
   }
   validateAmbiguousAlternationAlternatives(e, n) {
     return Tt(e, (r) => function(i, o, s) {
-      const a = new wr();
+      const a = new br();
       i.accept(a);
       let c = a.alternations;
       return c = an(c, (u) => u.ignoreAmbiguities === !0), Tt(c, (u) => {
-        const l = u.idx, h = u.maxLookahead || o, N = kr(l, i, h, u), S = function(m, y, p, T) {
+        const l = u.idx, h = u.maxLookahead || o, N = xr(l, i, h, u), S = function(m, y, p, T) {
           const g = [];
           return k(dt(m, (A, v, f) => (y.definition[f].ignoreAmbiguities === !0 || w(v, (d) => {
             const I = [f];
             w(m, (E, R) => {
-              f !== R && Pr(E, d) && y.definition[R].ignoreAmbiguities !== !0 && I.push(R);
-            }), I.length > 1 && !Pr(g, d) && (g.push(d), A.push({ alts: I, path: d }));
+              f !== R && kr(E, d) && y.definition[R].ignoreAmbiguities !== !0 && I.push(R);
+            }), I.length > 1 && !kr(g, d) && (g.push(d), A.push({ alts: I, path: d }));
           }), A), []), (A) => {
             const v = k(A.alts, (f) => f + 1);
             return { message: T.buildAlternationAmbiguityError({ topLevelRule: p, alternation: y, ambiguityIndices: v, prefixPath: A.path }), type: st.AMBIGUOUS_ALTS, ruleName: p.name, occurrence: y.idx, alternatives: A.alts };
@@ -3311,10 +3314,10 @@ class Vc {
     return function(r, i, o) {
       const s = [];
       return w(r, (a) => {
-        const c = new Bc();
+        const c = new Dc();
         a.accept(c), w(c.allProductions, (u) => {
-          const l = so(u), h = u.maxLookahead || i;
-          if (K(Rt(br(u.idx, a, l, h)[0]))) {
+          const l = io(u), h = u.maxLookahead || i;
+          if (K(Rt(Cr(u.idx, a, l, h)[0]))) {
             const N = o.buildEmptyRepetitionError({ topLevelRule: a, repetition: u });
             s.push({ message: N, type: st.NO_NON_EMPTY_LOOKAHEAD, ruleName: a.name });
           }
@@ -3324,15 +3327,15 @@ class Vc {
   }
   buildLookaheadForAlternation(e) {
     return function(n, r, i, o, s, a) {
-      const c = kr(n, r, i);
-      return a(c, o, co(c) ? yn : Pe, s);
-    }(e.prodOccurrence, e.rule, e.maxLookahead, e.hasPredicates, e.dynamicTokensEnabled, wc);
+      const c = xr(n, r, i);
+      return a(c, o, so(c) ? yn : Pe, s);
+    }(e.prodOccurrence, e.rule, e.maxLookahead, e.hasPredicates, e.dynamicTokensEnabled, bc);
   }
   buildLookaheadForOptional(e) {
     return function(n, r, i, o, s, a) {
-      const c = br(n, r, s, i), u = co(c) ? yn : Pe;
+      const c = Cr(n, r, s, i), u = so(c) ? yn : Pe;
       return a(c[0], u, o);
-    }(e.prodOccurrence, e.rule, e.maxLookahead, e.dynamicTokensEnabled, so(e.prodType), Mc);
+    }(e.prodOccurrence, e.rule, e.maxLookahead, e.dynamicTokensEnabled, io(e.prodType), Pc);
   }
 }
 const rn = new class extends Ie {
@@ -3361,16 +3364,16 @@ const rn = new class extends Ie {
     this.dslMethods.alternation.push(t);
   }
 }();
-function lo(t, e) {
+function co(t, e) {
   isNaN(t.startOffset) === !0 ? (t.startOffset = e.startOffset, t.endOffset = e.endOffset) : t.endOffset < e.endOffset && (t.endOffset = e.endOffset);
 }
-function ho(t, e) {
+function uo(t, e) {
   isNaN(t.startOffset) === !0 ? (t.startOffset = e.startOffset, t.startColumn = e.startColumn, t.startLine = e.startLine, t.endOffset = e.endOffset, t.endColumn = e.endColumn, t.endLine = e.endLine) : t.endOffset < e.endOffset && (t.endOffset = e.endOffset, t.endColumn = e.endColumn, t.endLine = e.endLine);
 }
-function fo(t, e) {
+function lo(t, e) {
   Object.defineProperty(t, "name", { enumerable: !1, configurable: !0, writable: !1, value: e });
 }
-function Hc(t, e) {
+function zc(t, e) {
   const n = yt(t), r = n.length;
   for (let i = 0; i < r; i++) {
     const o = t[n[i]], s = o.length;
@@ -3380,49 +3383,49 @@ function Hc(t, e) {
     }
   }
 }
-var Mr;
+var Pr;
 (function(t) {
   t[t.REDUNDANT_METHOD = 0] = "REDUNDANT_METHOD", t[t.MISSING_METHOD = 1] = "MISSING_METHOD";
-})(Mr || (Mr = {}));
+})(Pr || (Pr = {}));
 const Un = { description: "This Object indicates the Parser is during Recording Phase" };
 Object.freeze(Un);
-const po = !0, mo = Math.pow(2, 8) - 1, ks = F({ name: "RECORDING_PHASE_TOKEN", pattern: ot.NA });
-He([ks]);
-const bs = qr(ks, `This IToken indicates the Parser is in Recording Phase
+const ho = !0, fo = Math.pow(2, 8) - 1, xs = F({ name: "RECORDING_PHASE_TOKEN", pattern: ot.NA });
+He([xs]);
+const Cs = Yr(xs, `This IToken indicates the Parser is in Recording Phase
 	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`, -1, -1, -1, -1, -1, -1);
-Object.freeze(bs);
-const Yc = { name: `This CSTNode indicates the Parser is in Recording Phase
+Object.freeze(Cs);
+const Vc = { name: `This CSTNode indicates the Parser is in Recording Phase
 	See: https://chevrotain.io/docs/guide/internals.html#grammar-recording for details`, children: {} };
 function Se(t, e, n, r = !1) {
   Rn(n);
   const i = ge(this.recordingProdStack), o = Yt(e) ? e : e.DEF, s = new t({ definition: [], idx: n });
   return r && (s.separator = e.SEP), b(e, "MAX_LOOKAHEAD") && (s.maxLookahead = e.MAX_LOOKAHEAD), this.recordingProdStack.push(s), o.call(this), i.definition.push(s), this.recordingProdStack.pop(), Un;
 }
-function Xc(t, e) {
+function Hc(t, e) {
   Rn(e);
   const n = ge(this.recordingProdStack), r = B(t) === !1, i = r === !1 ? t : t.DEF, o = new xt({ definition: [], idx: e, ignoreAmbiguities: r && t.IGNORE_AMBIGUITIES === !0 });
   b(t, "MAX_LOOKAHEAD") && (o.maxLookahead = t.MAX_LOOKAHEAD);
-  const s = us(i, (a) => Yt(a.GATE));
+  const s = as(i, (a) => Yt(a.GATE));
   return o.hasPredicates = s, n.definition.push(o), w(i, (a) => {
     const c = new ht({ definition: [] });
     o.definition.push(c), b(a, "IGNORE_AMBIGUITIES") ? c.ignoreAmbiguities = a.IGNORE_AMBIGUITIES : b(a, "GATE") && (c.ignoreAmbiguities = !0), this.recordingProdStack.push(c), a.ALT.call(this), this.recordingProdStack.pop();
   }), Un;
 }
-function Eo(t) {
+function po(t) {
   return t === 0 ? "" : `${t}`;
 }
 function Rn(t) {
-  if (t < 0 || t > mo) {
+  if (t < 0 || t > fo) {
     const e = new Error(`Invalid DSL Method idx value: <${t}>
-	Idx value must be a none negative value smaller than ${mo + 1}`);
+	Idx value must be a none negative value smaller than ${fo + 1}`);
     throw e.KNOWN_RECORDER_ERROR = !0, e;
   }
 }
-const fn = qr(ie, "", NaN, NaN, NaN, NaN, NaN, NaN);
+const fn = Yr(ie, "", NaN, NaN, NaN, NaN, NaN, NaN);
 Object.freeze(fn);
-const zt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: As, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
+const zt = Object.freeze({ recoveryEnabled: !1, maxLookahead: 3, dynamicTokensEnabled: !1, outputCst: !0, errorMessageProvider: gs, nodeLocationTracking: "none", traceInitPerf: !1, skipValidations: !1 }), on = Object.freeze({ recoveryValueFunc: () => {
 }, resyncEnabled: !0 });
-var st, nr;
+var st, tr;
 (function(t) {
   t[t.INVALID_RULE_NAME = 0] = "INVALID_RULE_NAME", t[t.DUPLICATE_RULE_NAME = 1] = "DUPLICATE_RULE_NAME", t[t.INVALID_RULE_OVERRIDE = 2] = "INVALID_RULE_OVERRIDE", t[t.DUPLICATE_PRODUCTIONS = 3] = "DUPLICATE_PRODUCTIONS", t[t.UNRESOLVED_SUBRULE_REF = 4] = "UNRESOLVED_SUBRULE_REF", t[t.LEFT_RECURSION = 5] = "LEFT_RECURSION", t[t.NONE_LAST_EMPTY_ALT = 6] = "NONE_LAST_EMPTY_ALT", t[t.AMBIGUOUS_ALTS = 7] = "AMBIGUOUS_ALTS", t[t.CONFLICT_TOKENS_RULES_NAMESPACE = 8] = "CONFLICT_TOKENS_RULES_NAMESPACE", t[t.INVALID_TOKEN_NAME = 9] = "INVALID_TOKEN_NAME", t[t.NO_NON_EMPTY_LOOKAHEAD = 10] = "NO_NON_EMPTY_LOOKAHEAD", t[t.AMBIGUOUS_PREFIX_ALTS = 11] = "AMBIGUOUS_PREFIX_ALTS", t[t.TOO_MANY_ALTS = 12] = "TOO_MANY_ALTS", t[t.CUSTOM_LOOKAHEAD_VALIDATION = 13] = "CUSTOM_LOOKAHEAD_VALIDATION";
 })(st || (st = {}));
@@ -3436,7 +3439,7 @@ class Ge {
       this.selfAnalysisDone = !0;
       const n = this.className;
       this.TRACE_INIT("toFastProps", () => {
-        fs(this);
+        ls(this);
       }), this.TRACE_INIT("Grammar Recording", () => {
         try {
           this.enableRecording(), w(this.definedRulesNames, (i) => {
@@ -3453,11 +3456,11 @@ class Ge {
       let r = [];
       if (this.TRACE_INIT("Grammar Resolving", () => {
         r = function(i) {
-          const o = Rr(i, { errMsgProvider: _c }), s = {};
+          const o = Nr(i, { errMsgProvider: Oc }), s = {};
           return w(i.rules, (a) => {
             s[a.name] = a;
           }), function(a, c) {
-            const u = new Lc(a, c);
+            const u = new Sc(a, c);
             return u.resolveRefs(), u.errors;
           }(s, o.errMsgProvider);
         }({ rules: Q(this.gastProductionsCache) }), this.definitionErrors = this.definitionErrors.concat(r);
@@ -3465,11 +3468,11 @@ class Ge {
         if (K(r) && this.skipValidations === !1) {
           const s = (o = { rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), errMsgProvider: oe, grammarName: n }, function(c, u, l, h) {
             const N = Tt(c, (y) => function(p, T) {
-              const g = new jc();
+              const g = new Fc();
               p.accept(g);
               const A = g.allProductions;
-              return k(Q(_t(sc(A, Dc), (v) => v.length > 1)), (v) => {
-                const f = St(v), d = T.buildDuplicateFoundError(p, v), I = kt(f), E = { message: d, type: st.DUPLICATE_PRODUCTIONS, ruleName: p.name, dslName: I, occurrence: f.idx }, R = Rs(f);
+              return k(Q(_t(ic(A, Uc), (v) => v.length > 1)), (v) => {
+                const f = St(v), d = T.buildDuplicateFoundError(p, v), I = kt(f), E = { message: d, type: st.DUPLICATE_PRODUCTIONS, ruleName: p.name, dslName: I, occurrence: f.idx }, R = Ns(f);
                 return R && (E.parameter = R), E;
               });
             }(y, l)), S = function(y, p, T) {
@@ -3482,7 +3485,7 @@ class Ge {
                 }
               }), g;
             }(c, u, l), _ = Tt(c, (y) => function(p, T) {
-              const g = new wr();
+              const g = new br();
               return p.accept(g), Tt(g.alternations, (A) => A.definition.length > 255 ? [{ message: T.buildTooManyAlternativesError({ topLevelRule: p, alternation: A }), type: st.TOO_MANY_ALTS, ruleName: p.name, occurrence: A.idx }] : []);
             }(y, l)), m = Tt(c, (y) => function(p, T, g, A) {
               const v = [];
@@ -3493,7 +3496,7 @@ class Ge {
               return v;
             }(y, c, h, l));
             return N.concat(S, _, m);
-          }((o = Rr(o, { errMsgProvider: oe })).rules, o.tokenTypes, o.errMsgProvider, o.grammarName)), a = k((i = { lookaheadStrategy: this.lookaheadStrategy, rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), grammarName: n }).lookaheadStrategy.validate({ rules: i.rules, tokenTypes: i.tokenTypes, grammarName: i.grammarName }), (c) => Object.assign({ type: st.CUSTOM_LOOKAHEAD_VALIDATION }, c));
+          }((o = Nr(o, { errMsgProvider: oe })).rules, o.tokenTypes, o.errMsgProvider, o.grammarName)), a = k((i = { lookaheadStrategy: this.lookaheadStrategy, rules: Q(this.gastProductionsCache), tokenTypes: Q(this.tokensMap), grammarName: n }).lookaheadStrategy.validate({ rules: i.rules, tokenTypes: i.tokenTypes, grammarName: i.grammarName }), (c) => Object.assign({ type: st.CUSTOM_LOOKAHEAD_VALIDATION }, c));
           this.definitionErrors = this.definitionErrors.concat(s, a);
         }
         var i, o;
@@ -3501,7 +3504,7 @@ class Ge {
         const i = function(o) {
           const s = {};
           return w(o, (a) => {
-            const c = new Ec(a).startWalking();
+            const c = new pc(a).startWalking();
             pt(s, c);
           }), s;
         }(Q(this.gastProductionsCache));
@@ -3525,12 +3528,12 @@ class Ge {
     this.skipValidations = b(n, "skipValidations") ? n.skipValidations : zt.skipValidations;
   }
 }
-Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
+Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, tr = Ge, [class {
   initRecoverable(t) {
-    this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : zt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = zc);
+    this.firstAfterRepMap = {}, this.resyncFollows = {}, this.recoveryEnabled = b(t, "recoveryEnabled") ? t.recoveryEnabled : zt.recoveryEnabled, this.recoveryEnabled && (this.attemptInRepetitionRecovery = Gc);
   }
   getTokenToInsert(t) {
-    const e = qr(t, "", NaN, NaN, NaN, NaN, NaN, NaN);
+    const e = Yr(t, "", NaN, NaN, NaN, NaN, NaN, NaN);
     return e.isInsertedInRecovery = !0, e;
   }
   canTokenTypeBeInsertedInRecovery(t) {
@@ -3545,7 +3548,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
     const c = this.LA(1);
     let u = this.LA(1);
     const l = () => {
-      const h = this.LA(0), N = this.errorMessageProvider.buildMismatchTokenMessage({ expected: r, actual: c, previous: h, ruleName: this.getCurrRuleFullName() }), S = new uo(N, c, this.LA(0));
+      const h = this.LA(0), N = this.errorMessageProvider.buildMismatchTokenMessage({ expected: r, actual: c, previous: h, ruleName: this.getCurrRuleFullName() }), S = new ao(N, c, this.LA(0));
       S.resyncedTokens = We(s), this.SAVE_ERROR(S);
     };
     for (; !a; ) {
@@ -3568,7 +3571,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
       const n = this.SKIP_TOKEN();
       return this.consumeToken(), n;
     }
-    throw new Kc("sad sad panda");
+    throw new Wc("sad sad panda");
   }
   canPerformInRuleRecovery(t, e) {
     return this.canRecoverWithSingleTokenInsertion(t, e) || this.canRecoverWithSingleTokenDeletion(t);
@@ -3595,20 +3598,20 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
     }
   }
   getCurrFollowKey() {
-    if (this.RULE_STACK.length === 1) return Qn;
+    if (this.RULE_STACK.length === 1) return qn;
     const t = this.getLastExplicitRuleShortName(), e = this.getLastExplicitRuleOccurrenceIndex(), n = this.getPreviousExplicitRuleShortName();
     return { ruleName: this.shortRuleNameToFullName(t), idxInCallingRule: e, inRule: this.shortRuleNameToFullName(n) };
   }
   buildFullFollowKeyStack() {
     const t = this.RULE_STACK, e = this.RULE_OCCURRENCE_STACK;
-    return k(t, (n, r) => r === 0 ? Qn : { ruleName: this.shortRuleNameToFullName(n), idxInCallingRule: e[r], inRule: this.shortRuleNameToFullName(t[r - 1]) });
+    return k(t, (n, r) => r === 0 ? qn : { ruleName: this.shortRuleNameToFullName(n), idxInCallingRule: e[r], inRule: this.shortRuleNameToFullName(t[r - 1]) });
   }
   flattenFollowSet() {
     return Rt(k(this.buildFullFollowKeyStack(), (t) => this.getFollowSetFromFollowKey(t)));
   }
   getFollowSetFromFollowKey(t) {
-    if (t === Qn) return [ie];
-    const e = t.ruleName + t.idxInCallingRule + ds + t.inRule;
+    if (t === qn) return [ie];
+    const e = t.ruleName + t.idxInCallingRule + hs + t.inRule;
     return this.resyncFollows[e];
   }
   addToResyncTokens(t, e) {
@@ -3630,7 +3633,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
   }
 }, class {
   initLooksAhead(t) {
-    this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : zt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : zt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new Vc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
+    this.dynamicTokensEnabled = b(t, "dynamicTokensEnabled") ? t.dynamicTokensEnabled : zt.dynamicTokensEnabled, this.maxLookahead = b(t, "maxLookahead") ? t.maxLookahead : zt.maxLookahead, this.lookaheadStrategy = b(t, "lookaheadStrategy") ? t.lookaheadStrategy : new Kc({ maxLookahead: this.maxLookahead }), this.lookAheadFuncsCache = /* @__PURE__ */ new Map();
   }
   preComputeLookaheadFunctions(t) {
     w(t, (e) => {
@@ -3643,7 +3646,7 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
         w(n, (c) => {
           const u = c.idx === 0 ? "" : c.idx;
           this.TRACE_INIT(`${kt(c)}${u}`, () => {
-            const l = this.lookaheadStrategy.buildLookaheadForAlternation({ prodOccurrence: c.idx, rule: e, maxLookahead: c.maxLookahead || this.maxLookahead, hasPredicates: c.hasPredicates, dynamicTokensEnabled: this.dynamicTokensEnabled }), h = er(this.fullRuleNameToShort[e.name], 256, c.idx);
+            const l = this.lookaheadStrategy.buildLookaheadForAlternation({ prodOccurrence: c.idx, rule: e, maxLookahead: c.maxLookahead || this.maxLookahead, hasPredicates: c.hasPredicates, dynamicTokensEnabled: this.dynamicTokensEnabled }), h = Jn(this.fullRuleNameToShort[e.name], 256, c.idx);
             this.setLaFuncCache(h, l);
           });
         }), w(r, (c) => {
@@ -3651,23 +3654,23 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
         }), w(i, (c) => {
           this.computeLookaheadFunc(e, c.idx, 512, "Option", c.maxLookahead, kt(c));
         }), w(o, (c) => {
-          this.computeLookaheadFunc(e, c.idx, Jn, "RepetitionMandatory", c.maxLookahead, kt(c));
+          this.computeLookaheadFunc(e, c.idx, Zn, "RepetitionMandatory", c.maxLookahead, kt(c));
         }), w(s, (c) => {
           this.computeLookaheadFunc(e, c.idx, nn, "RepetitionMandatoryWithSeparator", c.maxLookahead, kt(c));
         }), w(a, (c) => {
-          this.computeLookaheadFunc(e, c.idx, tr, "RepetitionWithSeparator", c.maxLookahead, kt(c));
+          this.computeLookaheadFunc(e, c.idx, Qn, "RepetitionWithSeparator", c.maxLookahead, kt(c));
         });
       });
     });
   }
   computeLookaheadFunc(t, e, n, r, i, o) {
     this.TRACE_INIT(`${o}${e === 0 ? "" : e}`, () => {
-      const s = this.lookaheadStrategy.buildLookaheadForOptional({ prodOccurrence: e, rule: t, maxLookahead: i || this.maxLookahead, dynamicTokensEnabled: this.dynamicTokensEnabled, prodType: r }), a = er(this.fullRuleNameToShort[t.name], n, e);
+      const s = this.lookaheadStrategy.buildLookaheadForOptional({ prodOccurrence: e, rule: t, maxLookahead: i || this.maxLookahead, dynamicTokensEnabled: this.dynamicTokensEnabled, prodType: r }), a = Jn(this.fullRuleNameToShort[t.name], n, e);
       this.setLaFuncCache(a, s);
     });
   }
   getKeyForAutomaticLookahead(t, e) {
-    return er(this.getLastExplicitRuleShortName(), t, e);
+    return Jn(this.getLastExplicitRuleShortName(), t, e);
   }
   getLaFuncFromCache(t) {
     return this.lookAheadFuncsCache.get(t);
@@ -3677,8 +3680,8 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
   }
 }, class {
   initTreeBuilder(t) {
-    if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : zt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = ho, this.setNodeLocationFromNode = ho, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
-    else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = lo, this.setNodeLocationFromNode = lo, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
+    if (this.CST_STACK = [], this.outputCst = t.outputCst, this.nodeLocationTracking = b(t, "nodeLocationTracking") ? t.nodeLocationTracking : zt.nodeLocationTracking, this.outputCst) if (/full/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = uo, this.setNodeLocationFromNode = uo, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationFullRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleFull, this.setInitialNodeLocation = this.setInitialNodeLocationFullRegular);
+    else if (/onlyOffset/i.test(this.nodeLocationTracking)) this.recoveryEnabled ? (this.setNodeLocationFromToken = co, this.setNodeLocationFromNode = co, this.cstPostRule = Z, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRecovery) : (this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = this.cstPostRuleOnlyOffset, this.setInitialNodeLocation = this.setInitialNodeLocationOnlyOffsetRegular);
     else {
       if (!/none/i.test(this.nodeLocationTracking)) throw Error(`Invalid <nodeLocationTracking> config option: "${t.nodeLocationTracking}"`);
       this.setNodeLocationFromToken = Z, this.setNodeLocationFromNode = Z, this.cstPostRule = Z, this.setInitialNodeLocation = Z;
@@ -3728,10 +3731,10 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
       const t = function(e, n) {
         const r = function() {
         };
-        return fo(r, e + "BaseSemantics"), (r.prototype = { visit: function(i, o) {
+        return lo(r, e + "BaseSemantics"), (r.prototype = { visit: function(i, o) {
           if (B(i) && (i = i[0]), !Ht(i)) return this[i.name](i.children, o);
         }, validateVisitor: function() {
-          const i = (o = this, $e(k(gt(n, (s) => Yt(o[s]) === !1), (s) => ({ msg: `Missing visitor method: <${s}> on ${o.constructor.name} CST Visitor.`, type: Mr.MISSING_METHOD, methodName: s }))));
+          const i = (o = this, $e(k(gt(n, (s) => Yt(o[s]) === !1), (s) => ({ msg: `Missing visitor method: <${s}> on ${o.constructor.name} CST Visitor.`, type: Pr.MISSING_METHOD, methodName: s }))));
           var o;
           if (!K(i)) {
             const s = k(i, (a) => a.msg);
@@ -3752,10 +3755,10 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
       const t = function(e, n, r) {
         const i = function() {
         };
-        fo(i, e + "BaseSemanticsWithDefaults");
+        lo(i, e + "BaseSemanticsWithDefaults");
         const o = Object.create(r.prototype);
         return w(n, (s) => {
-          o[s] = Hc;
+          o[s] = zc;
         }), (i.prototype = o).constructor = i, i;
       }(this.className, yt(this.gastProductionsCache), this.getBaseCstVisitorConstructor());
       return this.baseCstVisitorWithDefaultsConstructor = t, t;
@@ -3824,8 +3827,8 @@ Ge.DEFER_DEFINITION_ERRORS_HANDLING = !1, nr = Ge, [class {
 	For Further details.`);
     }
     if (B(t)) this.tokensMap = dt(t, (r, i) => (r[i.name] = i, r), {});
-    else if (b(t, "modes") && vt(Rt(Q(t.modes)), Sc)) {
-      const r = vr(Rt(Q(t.modes)));
+    else if (b(t, "modes") && vt(Rt(Q(t.modes)), vc)) {
+      const r = yr(Rt(Q(t.modes)));
       this.tokensMap = dt(r, (i, o) => (i[o.name] = o, i), {});
     } else {
       if (!Nt(t)) throw new Error("<tokensDictionary> argument must be An Array of Token constructors, A dictionary of Token constructors or an IMultiModeLexerDefinition");
@@ -3901,7 +3904,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     if (i.call(this) === !0) return r.call(this);
   }
   atLeastOneInternal(t, e) {
-    const n = this.getKeyForAutomaticLookahead(Jn, t);
+    const n = this.getKeyForAutomaticLookahead(Zn, t);
     return this.atLeastOneInternalLogic(t, e, n);
   }
   atLeastOneInternalLogic(t, e, n) {
@@ -3919,7 +3922,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       let o = this.doSingleRepetition(r);
       for (; i.call(this) === !0 && o === !0; ) o = this.doSingleRepetition(r);
     }
-    this.attemptInRepetitionRecovery(this.atLeastOneInternal, [t, e], i, Jn, t, bc);
+    this.attemptInRepetitionRecovery(this.atLeastOneInternal, [t, e], i, Zn, t, Cc);
   }
   atLeastOneSepFirstInternal(t, e) {
     const n = this.getKeyForAutomaticLookahead(nn, t);
@@ -3932,7 +3935,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       r.call(this);
       const o = () => this.tokenMatcher(this.LA(1), i);
       for (; this.tokenMatcher(this.LA(1), i) === !0; ) this.CONSUME(i), r.call(this);
-      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [t, i, o, r, oo], o, nn, t, oo);
+      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [t, i, o, r, ro], o, nn, t, ro);
     }
   }
   manyInternal(t, e) {
@@ -3951,10 +3954,10 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     } else r = e;
     let o = !0;
     for (; i.call(this) === !0 && o === !0; ) o = this.doSingleRepetition(r);
-    this.attemptInRepetitionRecovery(this.manyInternal, [t, e], i, 768, t, kc, o);
+    this.attemptInRepetitionRecovery(this.manyInternal, [t, e], i, 768, t, xc, o);
   }
   manySepFirstInternal(t, e) {
-    const n = this.getKeyForAutomaticLookahead(tr, t);
+    const n = this.getKeyForAutomaticLookahead(Qn, t);
     this.manySepFirstInternalLogic(t, e, n);
   }
   manySepFirstInternalLogic(t, e, n) {
@@ -3963,7 +3966,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       r.call(this);
       const o = () => this.tokenMatcher(this.LA(1), i);
       for (; this.tokenMatcher(this.LA(1), i) === !0; ) this.CONSUME(i), r.call(this);
-      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [t, i, o, r, io], o, tr, t, io);
+      this.attemptInRepetitionRecovery(this.repetitionSepSecondInternal, [t, i, o, r, no], o, Qn, t, no);
     }
   }
   repetitionSepSecondInternal(t, e, n, r, i) {
@@ -3982,7 +3985,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   ruleFinallyStateUpdate() {
     if (this.RULE_STACK.pop(), this.RULE_OCCURRENCE_STACK.pop(), this.cstFinallyStateUpdate(), this.RULE_STACK.length === 0 && this.isAtEndOfInput() === !1) {
       const t = this.LA(1), e = this.errorMessageProvider.buildNotAllInputParsedMessage({ firstRedundant: t, ruleName: this.getCurrRuleFullName() });
-      this.SAVE_ERROR(new Wc(e, t));
+      this.SAVE_ERROR(new Bc(e, t));
     }
   }
   subruleInternal(t, e, n) {
@@ -4010,7 +4013,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   consumeInternalError(t, e, n) {
     let r;
     const i = this.LA(0);
-    throw r = n !== void 0 && n.ERR_MSG ? n.ERR_MSG : this.errorMessageProvider.buildMismatchTokenMessage({ expected: t, actual: e, previous: i, ruleName: this.getCurrRuleFullName() }), this.SAVE_ERROR(new uo(r, e, i));
+    throw r = n !== void 0 && n.ERR_MSG ? n.ERR_MSG : this.errorMessageProvider.buildMismatchTokenMessage({ expected: t, actual: e, previous: i, ruleName: this.getCurrRuleFullName() }), this.SAVE_ERROR(new ao(r, e, i));
   }
   consumeInternalRecovery(t, e, n) {
     if (!this.recoveryEnabled || n.name !== "MismatchedTokenException" || this.isBackTracking()) throw n;
@@ -4019,7 +4022,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       try {
         return this.tryInRuleRecovery(t, r);
       } catch (i) {
-        throw i.name === Cs ? n : i;
+        throw i.name === Ls ? n : i;
       }
     }
   }
@@ -4365,16 +4368,16 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     this._errors = t;
   }
   raiseEarlyExitException(t, e, n) {
-    const r = this.getCurrRuleFullName(), i = br(t, this.getGAstProductions()[r], e, this.maxLookahead)[0], o = [];
+    const r = this.getCurrRuleFullName(), i = Cr(t, this.getGAstProductions()[r], e, this.maxLookahead)[0], o = [];
     for (let a = 1; a <= this.maxLookahead; a++) o.push(this.LA(a));
     const s = this.errorMessageProvider.buildEarlyExitMessage({ expectedIterationPaths: i, actual: o, previous: this.LA(0), customUserDescription: n, ruleName: r });
-    throw this.SAVE_ERROR(new Gc(s, this.LA(1), this.LA(0)));
+    throw this.SAVE_ERROR(new $c(s, this.LA(1), this.LA(0)));
   }
   raiseNoAltException(t, e) {
-    const n = this.getCurrRuleFullName(), r = kr(t, this.getGAstProductions()[n], this.maxLookahead), i = [];
+    const n = this.getCurrRuleFullName(), r = xr(t, this.getGAstProductions()[n], this.maxLookahead), i = [];
     for (let a = 1; a <= this.maxLookahead; a++) i.push(this.LA(a));
     const o = this.LA(0), s = this.errorMessageProvider.buildNoViableAltMessage({ expectedPathsPerAlt: r, actual: i, previous: o, customUserDescription: e, ruleName: this.getCurrRuleFullName() });
-    throw this.SAVE_ERROR(new $c(s, this.LA(1), o));
+    throw this.SAVE_ERROR(new jc(s, this.LA(1), o));
   }
 }, class {
   initContentAssist() {
@@ -4382,11 +4385,11 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   computeContentAssist(t, e) {
     const n = this.gastProductionsCache[t];
     if (Ht(n)) throw Error(`Rule ->${t}<- does not exist in this grammar.`);
-    return Is([n], e, this.tokenMatcher, this.maxLookahead);
+    return Ts([n], e, this.tokenMatcher, this.maxLookahead);
   }
   getNextPossibleTokenTypes(t) {
     const e = St(t.ruleStack), n = this.getGAstProductions()[e];
-    return new Cc(n, t).startWalking();
+    return new Lc(n, t).startWalking();
   }
 }, class {
   initGastRecorder(t) {
@@ -4469,34 +4472,34 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
     Se.call(this, Ft, e, t);
   }
   atLeastOneSepFirstInternalRecord(t, e) {
-    Se.call(this, Dt, e, t, po);
+    Se.call(this, Dt, e, t, ho);
   }
   manyInternalRecord(t, e) {
     Se.call(this, J, e, t);
   }
   manySepFirstInternalRecord(t, e) {
-    Se.call(this, Lt, e, t, po);
+    Se.call(this, Lt, e, t, ho);
   }
   orInternalRecord(t, e) {
-    return Xc.call(this, t, e);
+    return Hc.call(this, t, e);
   }
   subruleInternalRecord(t, e, n) {
     if (Rn(e), !t || b(t, "ruleName") === !1) {
-      const s = new Error(`<SUBRULE${Eo(e)}> argument is invalid expecting a Parser method reference but got: <${JSON.stringify(t)}>
+      const s = new Error(`<SUBRULE${po(e)}> argument is invalid expecting a Parser method reference but got: <${JSON.stringify(t)}>
  inside top level rule: <${this.recordingProdStack[0].name}>`);
       throw s.KNOWN_RECORDER_ERROR = !0, s;
     }
     const r = ge(this.recordingProdStack), i = t.ruleName, o = new mt({ idx: e, nonTerminalName: i, label: n?.LABEL, referencedRule: void 0 });
-    return r.definition.push(o), this.outputCst ? Yc : Un;
+    return r.definition.push(o), this.outputCst ? Vc : Un;
   }
   consumeInternalRecord(t, e, n) {
-    if (Rn(e), !gs(t)) {
-      const o = new Error(`<CONSUME${Eo(e)}> argument is invalid expecting a TokenType reference but got: <${JSON.stringify(t)}>
+    if (Rn(e), !ms(t)) {
+      const o = new Error(`<CONSUME${po(e)}> argument is invalid expecting a TokenType reference but got: <${JSON.stringify(t)}>
  inside top level rule: <${this.recordingProdStack[0].name}>`);
       throw o.KNOWN_RECORDER_ERROR = !0, o;
     }
     const r = ge(this.recordingProdStack), i = new V({ idx: e, terminalType: t, label: n?.LABEL });
-    return r.definition.push(i), bs;
+    return r.definition.push(i), Cs;
   }
 }, class {
   initPerformanceTracer(t) {
@@ -4511,7 +4514,7 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
       this.traceInitIndent++;
       const n = new Array(this.traceInitIndent + 1).join("	");
       this.traceInitIndent < this.traceInitMaxIdent && console.log(`${n}--> <${t}>`);
-      const { time: r, value: i } = hs(e), o = r > 10 ? console.warn : console.log;
+      const { time: r, value: i } = us(e), o = r > 10 ? console.warn : console.log;
       return this.traceInitIndent < this.traceInitMaxIdent && o(`${n}<-- <${t}> time: ${r}ms`), this.traceInitIndent--, i;
     }
     return e();
@@ -4521,18 +4524,18 @@ Make sure that all grammar rule definitions are done before 'performSelfAnalysis
   Object.getOwnPropertyNames(e).forEach((n) => {
     if (n === "constructor") return;
     const r = Object.getOwnPropertyDescriptor(e, n);
-    r && (r.get || r.set) ? Object.defineProperty(nr.prototype, n, r) : nr.prototype[n] = t.prototype[n];
+    r && (r.get || r.set) ? Object.defineProperty(tr.prototype, n, r) : tr.prototype[n] = t.prototype[n];
   });
 });
-class qc extends Ge {
+class Yc extends Ge {
   constructor(e, n = zt) {
     const r = et(n);
     r.outputCst = !1, super(e, r);
   }
 }
-const Zc = F({ name: "WhiteSpace", pattern: /\s+/, group: ot.SKIPPED }), Ps = F({ name: "String", pattern: /"(""|[^"])*"/ }), Qc = F({ name: "SingleQuotedString", pattern: /'(''|[^'])*'/ }), Jc = F({ name: "SheetQuoted", pattern: /'((?![\\/[\]*?:]).)+?'!/ }), tu = F({ name: "FunctionToken", pattern: /[A-Za-z_]+[A-Za-z_0-9.]*\(/ }), ws = F({ name: "NamedTableReference", pattern: /[A-Za-z_]+[A-Za-z_0-9.]*\[/ }), eu = F({ name: "BracketedString", pattern: /\[([^[\]]*)\]/, longer_alt: [ws, Ps] }), Ms = F({ name: "LiteralError", pattern: /#PARSE!|#NULL!|#DIV\/0!|#VALUE!|#NUM!|#FIELD!|#N\/A|#GETTING_DATA|#SPILL!|#CONNECT!|#BLOCKED!|#UNKNOWN!|#FIELD!|#CALC!|#BUSY!|#PYTHON!|#TIMEOUT!/ }), Us = F({ name: "RefError", pattern: /#REF!|#NAME\?/ }), nu = F({ name: "Sheet", pattern: /[A-Za-z_.\d\u007F-\uFFFF]+!/ }), ru = /^[a-zA-Z_][a-zA-Z0-9_.?]*:?/, Fn = F({ name: "Name", pattern: { exec: (t, e) => {
+const Xc = F({ name: "WhiteSpace", pattern: /\s+/, group: ot.SKIPPED }), ks = F({ name: "String", pattern: /"(""|[^"])*"/ }), qc = F({ name: "SingleQuotedString", pattern: /'(''|[^'])*'/ }), Zc = F({ name: "SheetQuoted", pattern: /'((?![\\/[\]*?:]).)+?'!/ }), Qc = F({ name: "FunctionToken", pattern: /[A-Za-z_]+[A-Za-z_0-9.]*\(/ }), bs = F({ name: "NamedTableReference", pattern: /[A-Za-z_]+[A-Za-z_0-9.]*\[/ }), Jc = F({ name: "BracketedString", pattern: /\[([^[\]]*)\]/, longer_alt: [bs, ks] }), Ps = F({ name: "LiteralError", pattern: /#PARSE!|#NULL!|#DIV\/0!|#VALUE!|#NUM!|#FIELD!|#N\/A|#GETTING_DATA|#SPILL!|#CONNECT!|#BLOCKED!|#UNKNOWN!|#FIELD!|#CALC!|#BUSY!|#PYTHON!|#TIMEOUT!/ }), ws = F({ name: "RefError", pattern: /#REF!|#NAME\?/ }), tu = F({ name: "Sheet", pattern: /[A-Za-z_.\d\u007F-\uFFFF]+!/ }), eu = /^[a-zA-Z_][a-zA-Z0-9_.?]*:?/, Fn = F({ name: "Name", pattern: { exec: (t, e) => {
   try {
-    const n = ru.exec(t.substring(e));
+    const n = eu.exec(t.substring(e));
     if (n) {
       const r = n[0];
       if (r.endsWith(":")) {
@@ -4551,60 +4554,60 @@ const Zc = F({ name: "WhiteSpace", pattern: /\s+/, group: ot.SKIPPED }), Ps = F(
   for (let e = 97; e <= 122; e++) t.push(e);
   for (let e = 48; e <= 57; e++) t.push(e);
   return t;
-})() }), iu = F({ name: "Cell", pattern: /[$]?[A-Za-z]{1,3}[$]?[1-9][0-9]*/, longer_alt: Fn }), ou = F({ name: "Column", pattern: /[$]?[A-Za-z]{1,3}/, longer_alt: Fn }), su = F({ name: "AbsRow", pattern: /[$][0-9]+/, longer_alt: Fn }), au = F({ name: "NumberToken", pattern: /[0-9]+[.]?[0-9]*([eE][+-][0-9]+)?/ }), cu = F({ name: "Boolean", pattern: /TRUE|FALSE/i }), uu = F({ name: "Comma", pattern: /,/ }), lu = F({ name: "RangeUnion", pattern: /:/ }), hu = F({ name: "RangeTrimFull", pattern: /\.:\./ }), fu = F({ name: "RangeTrimLeading", pattern: /\.:/ }), du = F({ name: "RangeTrimTrailing", pattern: /:\./ }), pu = F({ name: "Semicolon", pattern: /;/ }), mu = F({ name: "OpenParen", pattern: /\(/ }), Eu = F({ name: "CloseParen", pattern: /\)/ }), gu = F({ name: "OpenSquareParen", pattern: /\[/ }), Tu = F({ name: "CloseSquareParen", pattern: /]/ });
+})() }), nu = F({ name: "Cell", pattern: /[$]?[A-Za-z]{1,3}[$]?[1-9][0-9]*/, longer_alt: Fn }), ru = F({ name: "Column", pattern: /[$]?[A-Za-z]{1,3}/, longer_alt: Fn }), iu = F({ name: "AbsRow", pattern: /[$][0-9]+/, longer_alt: Fn }), ou = F({ name: "NumberToken", pattern: /[0-9]+[.]?[0-9]*([eE][+-][0-9]+)?/ }), su = F({ name: "Boolean", pattern: /TRUE|FALSE/i }), au = F({ name: "Comma", pattern: /,/ }), cu = F({ name: "RangeUnion", pattern: /:/ }), uu = F({ name: "RangeTrimFull", pattern: /\.:\./ }), lu = F({ name: "RangeTrimLeading", pattern: /\.:/ }), hu = F({ name: "RangeTrimTrailing", pattern: /:\./ }), fu = F({ name: "Semicolon", pattern: /;/ }), du = F({ name: "OpenParen", pattern: /\(/ }), pu = F({ name: "CloseParen", pattern: /\)/ }), mu = F({ name: "OpenSquareParen", pattern: /\[/ }), Eu = F({ name: "CloseSquareParen", pattern: /]/ });
 F({ name: "exclamationMark", pattern: /!/ });
-const Au = F({ name: "OpenCurlyParen", pattern: /{/ }), Iu = F({ name: "CloseCurlyParen", pattern: /}/ }), Nu = F({ name: "QuoteS", pattern: /'/ }), go = F({ name: "MulOp", pattern: /\*/ }), yu = F({ name: "PlusOp", pattern: /\+/ }), Ru = F({ name: "DivOp", pattern: /\// }), vu = F({ name: "MinOp", pattern: /-/ }), Ou = F({ name: "ImplicitIntersectOp", pattern: /@/ }), Su = F({ name: "ConcatOp", pattern: /&/ }), _u = F({ name: "ExOp", pattern: /\^/ }), Lu = F({ name: "PercentOp", pattern: /%/ }), Fs = F({ name: "TableSpecifier", pattern: /#(All|Data|Headers|Totals|This Row)/i }), xu = F({ name: "ArrayAnchorOp", pattern: /#/, longer_alt: [Fs, Ms, Us] }), Cu = F({ name: "GtOp", pattern: />/ }), ku = F({ name: "EqOp", pattern: /=/ }), bu = F({ name: "LtOp", pattern: /</ }), Ds = [Zc, Ps, Jc, Qc, tu, ws, eu, Ms, Us, nu, iu, cu, ou, su, Fs, xu, Ou, Fn, au, uu, hu, fu, du, lu, pu, mu, Eu, gu, Tu, Au, Iu, Nu, go, yu, Ru, vu, Su, _u, go, Lu, F({ name: "NeqOp", pattern: /<>/ }), F({ name: "GteOp", pattern: />=/ }), F({ name: "LteOp", pattern: /<=/ }), Cu, ku, bu], Pu = new ot(Ds, { ensureOptimizations: !0 }), Zr = {};
-Ds.forEach((t) => {
-  Zr[t.name] = t;
+const gu = F({ name: "OpenCurlyParen", pattern: /{/ }), Tu = F({ name: "CloseCurlyParen", pattern: /}/ }), Au = F({ name: "QuoteS", pattern: /'/ }), mo = F({ name: "MulOp", pattern: /\*/ }), Iu = F({ name: "PlusOp", pattern: /\+/ }), Nu = F({ name: "DivOp", pattern: /\// }), yu = F({ name: "MinOp", pattern: /-/ }), Ru = F({ name: "ImplicitIntersectOp", pattern: /@/ }), vu = F({ name: "ConcatOp", pattern: /&/ }), Ou = F({ name: "ExOp", pattern: /\^/ }), Su = F({ name: "PercentOp", pattern: /%/ }), Ms = F({ name: "TableSpecifier", pattern: /#(All|Data|Headers|Totals|This Row)/i }), _u = F({ name: "ArrayAnchorOp", pattern: /#/, longer_alt: [Ms, Ps, ws] }), Lu = F({ name: "GtOp", pattern: />/ }), xu = F({ name: "EqOp", pattern: /=/ }), Cu = F({ name: "LtOp", pattern: /</ }), Us = [Xc, ks, Zc, qc, Qc, bs, Jc, Ps, ws, tu, nu, su, ru, iu, Ms, _u, Ru, Fn, ou, au, uu, lu, hu, cu, fu, du, pu, mu, Eu, gu, Tu, Au, mo, Iu, Nu, yu, vu, Ou, mo, Su, F({ name: "NeqOp", pattern: /<>/ }), F({ name: "GteOp", pattern: />=/ }), F({ name: "LteOp", pattern: /<=/ }), Lu, xu, Cu], ku = new ot(Us, { ensureOptimizations: !0 }), Xr = {};
+Us.forEach((t) => {
+  Xr[t.name] = t;
 });
-const Qt = { boolean: 3, string: 2, number: 1 }, wu = (t, e) => {
+const Qt = { boolean: 3, string: 2, number: 1 }, bu = (t, e) => {
   let n = t + e;
   return n = Math.abs(n) < 99e-14 ? 0 : n, isFinite(n) ? n : Number.NaN;
-}, Mu = (t, e) => {
+}, Pu = (t, e) => {
   let n = t - e;
   return n = Math.abs(n) < 99e-14 ? 0 : n, isFinite(n) ? n : Number.NaN;
-}, js = (t, e) => {
+}, Fs = (t, e) => {
   let n = t * e;
   return n = Math.abs(n) < 99e-14 ? 0 : n, isFinite(n) ? n : Number.NaN;
-}, Bs = (t, e) => {
+}, Ds = (t, e) => {
   if (e === 0) return 1 / 0;
   let n = t / e;
   return n = Math.abs(n) < 99e-14 ? 0 : n, isFinite(n) ? n : Number.NaN;
-}, Uu = (t, e) => {
+}, wu = (t, e) => {
   const n = t ** e;
   return isFinite(n) ? n : Number.NaN;
-}, Fu = (t = "", e = "") => (t === null && (t = ""), e === null && (e = ""), typeof t == "boolean" && (t = t ? "TRUE" : "FALSE"), typeof e == "boolean" && (e = e ? "TRUE" : "FALSE"), "" + t + e), Du = (t = null, e = null) => typeof t == typeof e && t === e, ju = (t = null, e = null) => typeof t != typeof e || t !== e, Bu = (t = null, e = null) => {
+}, Mu = (t = "", e = "") => (t === null && (t = ""), e === null && (e = ""), typeof t == "boolean" && (t = t ? "TRUE" : "FALSE"), typeof e == "boolean" && (e = e ? "TRUE" : "FALSE"), "" + t + e), Uu = (t = null, e = null) => typeof t == typeof e && t === e, Fu = (t = null, e = null) => typeof t != typeof e || t !== e, Du = (t = null, e = null) => {
   const n = typeof t, r = typeof e;
   return n === r ? t > e : Qt[n] > Qt[r];
-}, $u = (t = null, e = null) => {
+}, ju = (t = null, e = null) => {
   const n = typeof t, r = typeof e;
   return n === r ? t >= e : Qt[n] >= Qt[r];
-}, Wu = (t = null, e = null) => {
+}, Bu = (t = null, e = null) => {
   const n = typeof t, r = typeof e;
   return n === r ? t < e : Qt[n] < Qt[r];
-}, Gu = (t = null, e = null) => {
+}, $u = (t = null, e = null) => {
   const n = typeof t, r = typeof e;
   return n === r ? t <= e : Qt[n] <= Qt[r];
-}, Ku = { type: se.Number, coerce: !0, includeBoolean: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, zu = { type: se.String, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, $s = { type: null, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, de = (t, e, n, r) => {
+}, Wu = { type: se.Number, coerce: !0, includeBoolean: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, Gu = { type: se.String, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, js = { type: null, coerce: !0, includeMistyped: !0, mismatchFill: D.BuiltIn.NA }, de = (t, e, n, r) => {
   if (e !== null && e.colStart !== void 0 && (e = t.getValueAt(e.rowStart, e.colStart)), n !== null && n.colStart !== void 0 && (n = t.getValueAt(n.rowStart, n.colStart)), typeof e == "number" && typeof n == "number") return r(e, n);
   let i, o;
-  return e?.isIRange ? i = e : n?.isIRange && (o = n), i || o ? (i || (i = t.getRange(e)), i.broadcast(n, r, Ku).fillEmpty(0)) : (e = Ue(e, Fe(e, !0), se.Number, !0, !1), n = Ue(n, Fe(n, !0), se.Number, !0, !1), e instanceof D.Value ? e : n instanceof D.Value ? n : r(e, n));
+  return e?.isIRange ? i = e : n?.isIRange && (o = n), i || o ? (i || (i = t.getRange(e)), i.broadcast(n, r, Wu).fillEmpty(0)) : (e = Ue(e, Fe(e, !0), se.Number, !0, !1), n = Ue(n, Fe(n, !0), se.Number, !0, !1), e instanceof D.Value ? e : n instanceof D.Value ? n : r(e, n));
 }, he = (t, e, n, r) => {
   let i, o;
-  return e !== null && e.colStart !== void 0 && (e = t.getValueAt(e.rowStart, e.colStart)), n !== null && n.colStart !== void 0 && (n = t.getValueAt(n.rowStart, n.colStart)), e?.isIRange ? (i = e, o = n) : n?.isIRange && (i = n, o = e), i ? i.broadcast(o, r, $s) : r(e, n);
-}, To = (t, e) => {
+  return e !== null && e.colStart !== void 0 && (e = t.getValueAt(e.rowStart, e.colStart)), n !== null && n.colStart !== void 0 && (n = t.getValueAt(n.rowStart, n.colStart)), e?.isIRange ? (i = e, o = n) : n?.isIRange && (i = n, o = e), i ? i.broadcast(o, r, js) : r(e, n);
+}, Eo = (t, e) => {
   e == null && (e = 0);
   let n, r = 1;
   if (t === "+") return e;
   if (t !== "-") throw new D.Value(`Unrecognized prefix: ${t}`);
-  return r = -r, e?.isIRange && (n = e), n ? n.broadcast(r, js, $s) : typeof (e = Ue(e, Fe(e, !0), se.Number)) != "number" || isNaN(e) ? D.BuiltIn.Value : e * r;
+  return r = -r, e?.isIRange && (n = e), n ? n.broadcast(r, Fs, js) : typeof (e = Ue(e, Fe(e, !0), se.Number)) != "number" || isNaN(e) ? D.BuiltIn.Value : e * r;
 }, _e = (t, e, n, r) => {
   if (!e) return D.BuiltIn.Ref;
   if (e.isIReferenceRange && (e = e.getCoords()), e.colStart === void 0) return D.BuiltIn.Ref;
   if (n.isIReferenceRange && (n = n.getCoords()), n.colStart === void 0) return D.BuiltIn.Ref;
   const i = r(e, n);
   return i ? t.getReference(i) : D.BuiltIn.Null;
-}, Vu = { "+": (t, e, n) => de(t, e, n, wu), "-": (t, e, n) => de(t, e, n, Mu), "*": (t, e, n) => de(t, e, n, js), "/": (t, e, n) => de(t, e, n, Bs), "^": (t, e, n) => de(t, e, n, Uu), " ": (t, e, n, r) => _e(t, e, n, Xt.intersectRanges), ":": (t, e, n, r) => _e(t, e, n, Xt.unionRanges), ".:.": (t, e, n, r) => {
+}, Ku = { "+": (t, e, n) => de(t, e, n, bu), "-": (t, e, n) => de(t, e, n, Pu), "*": (t, e, n) => de(t, e, n, Fs), "/": (t, e, n) => de(t, e, n, Ds), "^": (t, e, n) => de(t, e, n, wu), " ": (t, e, n, r) => _e(t, e, n, Xt.intersectRanges), ":": (t, e, n, r) => _e(t, e, n, Xt.unionRanges), ".:.": (t, e, n, r) => {
   const i = _e(t, e, n, Xt.unionRanges);
   return t.getFunction("TRIMRANGE").execute(i, 3, 3);
 }, ".:": (t, e, n, r) => {
@@ -4616,8 +4619,8 @@ const Qt = { boolean: 3, string: 2, number: 1 }, wu = (t, e) => {
 }, "&": (t, e, n) => ((r, i, o, s) => {
   if (i !== null && i.colStart !== void 0 && (i = r.getValueAt(i.rowStart, i.colStart)), o !== null && o.colStart !== void 0 && (o = r.getValueAt(o.rowStart, o.colStart)), typeof i == "string" && typeof o == "string") return s(i, o);
   let a, c;
-  return i?.isIRange ? a = i : o?.isIRange && (c = o), a || c ? (a || (a = r.getRange(i)), a.broadcast(o, s, zu)) : s(i = Ue(i, Fe(i, !0), se.String), o = Ue(o, Fe(o, !0), se.String));
-})(t, e, n, Fu), "=": (t, e, n) => he(t, e, n, Du), "<>": (t, e, n) => he(t, e, n, ju), ">": (t, e, n) => he(t, e, n, Bu), "<": (t, e, n) => he(t, e, n, Wu), ">=": (t, e, n) => he(t, e, n, $u), "<=": (t, e, n) => he(t, e, n, Gu) }, Hu = { "-": (t, e) => To("-", e), "+": (t, e) => To("+", e), "@": (t, e) => {
+  return i?.isIRange ? a = i : o?.isIRange && (c = o), a || c ? (a || (a = r.getRange(i)), a.broadcast(o, s, Gu)) : s(i = Ue(i, Fe(i, !0), se.String), o = Ue(o, Fe(o, !0), se.String));
+})(t, e, n, Mu), "=": (t, e, n) => he(t, e, n, Uu), "<>": (t, e, n) => he(t, e, n, Fu), ">": (t, e, n) => he(t, e, n, Du), "<": (t, e, n) => he(t, e, n, Bu), ">=": (t, e, n) => he(t, e, n, ju), "<=": (t, e, n) => he(t, e, n, $u) }, zu = { "-": (t, e) => Eo("-", e), "+": (t, e) => Eo("+", e), "@": (t, e) => {
   if (!e || !e.isIReferenceRange) return e;
   const n = e.getCoords(), r = e, i = t.getPosition(), o = r.getHeight(), s = r.getWidth();
   if (s > 1 && o > 1) return D.BuiltIn.Value;
@@ -4632,8 +4635,8 @@ const Qt = { boolean: 3, string: 2, number: 1 }, wu = (t, e) => {
     }
   }
   return D.BuiltIn.Value;
-} }, Yu = { "%": (t, e) => de(t, e, 100, Bs), "#": (t, e) => t.getSpillAt(e.rowStart, e.colStart) || D.BuiltIn.Ref };
-function Ao(t) {
+} }, Vu = { "%": (t, e) => de(t, e, 100, Ds), "#": (t, e) => t.getSpillAt(e.rowStart, e.colStart) || D.BuiltIn.Ref };
+function go(t) {
   const e = (t = t.toUpperCase()).length;
   let n = 0;
   for (let r = 0; r < e; r++) {
@@ -4642,29 +4645,29 @@ function Ao(t) {
   }
   return n;
 }
-function rr(t) {
+function er(t) {
   return { type: "cell", value: Object.freeze({ colIndex: t.colIndex, rowIndex: t.rowIndex, $colIndex: t.$colIndex || !1, $rowIndex: t.$rowIndex || !1 }), inputs: null, isReference: !0 };
 }
-function Io(t, e) {
+function To(t, e) {
   const n = t.startsWith("$");
   n && (t = t.substring(1));
   let r = parseInt(t) - 1;
   return n || r === Number.MIN_SAFE_INTEGER || (r -= e.colIndex), { type: "cell", value: Object.freeze({ colIndex: Number.MIN_SAFE_INTEGER, $colIndex: !1, rowIndex: r, $rowIndex: n }), inputs: null, isReference: !0 };
 }
-function No(t, e) {
+function Ao(t, e) {
   return { type: "function", value: t = t.toUpperCase(), inputs: e };
 }
-function ir(t, e) {
+function nr(t, e) {
   return { type: "tableReference", value: t, inputs: e };
 }
-function or(t) {
+function rr(t) {
   return { type: "tableSpecifier", value: t, inputs: null, isReference: !0 };
 }
-function Ur(t, e, n, r = !1) {
+function wr(t, e, n, r = !1) {
   const i = { type: "infix", value: t, inputs: [e, n] };
   return r && (i.isReference = !0), i;
 }
-function sr(t, e, n = !1) {
+function ir(t, e, n = !1) {
   const r = { type: "postfix", value: t, inputs: [e] };
   return n && (r.isReference = !0), r;
 }
@@ -4672,21 +4675,21 @@ function Ce(t, e, n = !1) {
   const r = { type: "prefix", value: t, inputs: [e] };
   return n && (r.isReference = !0), r;
 }
-function ar(t) {
+function or(t) {
   return { type: "named", value: t, inputs: null, isReference: !0 };
 }
-function yo(t) {
+function Io(t) {
   return { type: "number", value: Number(t), isLiteral: !0 };
 }
-function cr(t) {
+function sr(t) {
   let e = t;
   const n = t && t.length > 1 && t[0] === '"' && t[t.length - 1] === '"';
   return n && (e = t.substring(1, t.length - 1)), { type: n ? "quotedString" : "string", value: e, isLiteral: !0 };
 }
-function Ro(t) {
+function No(t) {
   return { type: "boolean", value: t === "TRUE" || t.toUpperCase() === "TRUE", isLiteral: !0 };
 }
-function vo(t) {
+function yo(t) {
   return { type: "error", value: D.getBuiltInByLabel(t.toUpperCase()), isLiteral: !0 };
 }
 function vn(t) {
@@ -4732,7 +4735,7 @@ function dn(t, e) {
           const P = E[O], x = c.get(P);
           x && (x.hasHorizontalAbs && (I.hasHorizontalAbs = !0), x.hasVerticalAbs && (I.hasVerticalAbs = !0)), L[O] = x ? x.index : -1, o.delete(x);
         }
-        if (o.add(I), Ws.includes(M)) {
+        if (o.add(I), Bs.includes(M)) {
           const O = E[0], P = !!O && O.type === "cell", x = E[1], C = !!x && x.type === "cell";
           P && C && (l.splice(x.refIndex, 1), x.refIndex = O.refIndex, g.refIndex = O.refIndex, l[O.refIndex] = I.index);
         } else M === "#" && (g.refIndex = E[0].refIndex);
@@ -4765,7 +4768,7 @@ function dn(t, e) {
         }
         E[R] = O;
       }
-      i[f] = Hs(E);
+      i[f] = zs(E);
     }
     else {
       if (v !== "empty") return u.push(g), g;
@@ -4795,13 +4798,13 @@ function dn(t, e) {
     const A = u[g], v = A.type;
     if (v === "infix") {
       const f = A.value;
-      A.fn = Vu[f];
+      A.fn = Ku[f];
     } else if (v === "prefix") {
       const f = A.value;
-      A.fn = Hu[f];
+      A.fn = zu[f];
     } else if (v === "postfix") {
       const f = A.value;
-      A.fn = Yu[f];
+      A.fn = Vu[f];
     }
   }
   const T = function(g) {
@@ -4892,7 +4895,7 @@ function dn(t, e) {
   }(r);
   return { ast: r, evaluations: i, executions: u, precedentsAbsolute: S, precedentsExecute: _, precedentsNamed: m, precedentsRelative: h, precedentsRoot: y, references: l, tokens: T, error: e };
 }
-function Oo(t, e) {
+function Ro(t, e) {
   let n, r = -1, i = "";
   Number.isSafeInteger(t.previousToken?.startLine) ? (r = t.previousToken.startLine, n = t.previousToken.endColumn + 1) : Number.isSafeInteger(t.token?.startLine) && (r = t.token.startLine, n = t.token.startColumn), r !== -1 ? (i += `
 ` + e.split(`
@@ -4904,12 +4907,12 @@ function Oo(t, e) {
   const o = new D.Parse(i);
   return o.details = t, o;
 }
-const ur = function(t, e) {
+const ar = function(t, e) {
   return e.wsBefore && (t.wsBefore = e.wsBefore), e.wsAfter && (t.wsAfter = e.wsAfter), e.image && (t.image = e.image), t;
-}, So = Object.freeze([[":", ".:.", ".:", , ":."], ["^"], ["*", "/"], ["+", "-"], ["&"], ["<", ">", "=", "<>", "<=", ">="]]), Ws = Object.freeze([":", ".:.", ".:", , ":."]), Xu = Object.freeze([":", " ", ".:.", ".:", , ":."]), qu = Object.freeze(["@"]), Zu = Object.freeze(["#"]), lr = Object.freeze(Xu.concat(qu).concat(Zu)), { String: _o, SheetQuoted: Qu, SingleQuotedString: Ju, FunctionToken: tl, NamedTableReference: el, LiteralError: Lo, RefError: xo, Cell: nl, Sheet: rl, Name: Co, NumberToken: ko, Boolean: bo, Column: il, AbsRow: ol, ImplicitIntersectOp: hr, Comma: fe, RangeUnion: sl, RangeTrimFull: al, RangeTrimLeading: cl, RangeTrimTrailing: ul, Semicolon: ll, OpenParen: hl, CloseParen: fr, OpenSquareParen: Po, CloseSquareParen: wo, OpenCurlyParen: fl, CloseCurlyParen: dl, MulOp: pl, PlusOp: dr, DivOp: ml, MinOp: pr, ConcatOp: El, ExOp: gl, PercentOp: Tl, ArrayAnchorOp: Mo, TableSpecifier: Al, BracketedString: Uo, NeqOp: Il, GteOp: Nl, LteOp: yl, GtOp: Rl, EqOp: vl, LtOp: Ol } = Zr;
-class Sl extends qc {
+}, vo = Object.freeze([[":", ".:.", ".:", , ":."], ["^"], ["*", "/"], ["+", "-"], ["&"], ["<", ">", "=", "<>", "<=", ">="]]), Bs = Object.freeze([":", ".:.", ".:", , ":."]), Hu = Object.freeze([":", " ", ".:.", ".:", , ":."]), Yu = Object.freeze(["@"]), Xu = Object.freeze(["#"]), cr = Object.freeze(Hu.concat(Yu).concat(Xu)), { String: Oo, SheetQuoted: qu, SingleQuotedString: Zu, FunctionToken: Qu, NamedTableReference: Ju, LiteralError: So, RefError: _o, Cell: tl, Sheet: el, Name: Lo, NumberToken: xo, Boolean: Co, Column: nl, AbsRow: rl, ImplicitIntersectOp: ur, Comma: fe, RangeUnion: il, RangeTrimFull: ol, RangeTrimLeading: sl, RangeTrimTrailing: al, Semicolon: cl, OpenParen: ul, CloseParen: lr, OpenSquareParen: ko, CloseSquareParen: bo, OpenCurlyParen: ll, CloseCurlyParen: hl, MulOp: fl, PlusOp: hr, DivOp: dl, MinOp: fr, ConcatOp: pl, ExOp: ml, PercentOp: El, ArrayAnchorOp: Po, TableSpecifier: gl, BracketedString: wo, NeqOp: Tl, GteOp: Al, LteOp: Il, GtOp: Nl, EqOp: yl, LtOp: Rl } = Xr;
+class vl extends Yc {
   constructor() {
-    super(Zr, { nodeLocationTracking: "full", maxLookahead: 1, skipValidations: !0, recoveryEnabled: !0 }), this.position = { colIndex: 0, rowIndex: 0 }, this.astErrors = [];
+    super(Xr, { nodeLocationTracking: "full", maxLookahead: 1, skipValidations: !0, recoveryEnabled: !0 }), this.position = { colIndex: 0, rowIndex: 0 }, this.astErrors = [];
     const e = this, n = (r, i, o) => {
       let s;
       e.CONSUME(i);
@@ -4926,41 +4929,41 @@ class Sl extends qc {
     e.RULE("infixOp", () => {
       const r = [], i = [e.SUBRULE(e.postfixOp)];
       return e.MANY(() => {
-        const o = e.OR(e.c1 || (e.c1 = [{ ALT: () => e.CONSUME(sl).image }, { ALT: () => e.CONSUME(dr).image }, { ALT: () => e.CONSUME(pr).image }, { ALT: () => e.CONSUME(pl).image }, { ALT: () => e.CONSUME(ml).image }, { ALT: () => e.CONSUME(gl).image }, { ALT: () => e.CONSUME(El).image }, { ALT: () => e.CONSUME(Rl).image }, { ALT: () => e.CONSUME(vl).image }, { ALT: () => e.CONSUME(Ol).image }, { ALT: () => e.CONSUME(Il).image }, { ALT: () => e.CONSUME(Nl).image }, { ALT: () => e.CONSUME(yl).image }, { ALT: () => e.CONSUME(al).image }, { ALT: () => e.CONSUME(cl).image }, { ALT: () => e.CONSUME(ul).image }]));
-        r.push([o, e.getLexerPosition(), lr.includes(o)]), i.push(e.SUBRULE2(e.postfixOp));
+        const o = e.OR(e.c1 || (e.c1 = [{ ALT: () => e.CONSUME(il).image }, { ALT: () => e.CONSUME(hr).image }, { ALT: () => e.CONSUME(fr).image }, { ALT: () => e.CONSUME(fl).image }, { ALT: () => e.CONSUME(dl).image }, { ALT: () => e.CONSUME(ml).image }, { ALT: () => e.CONSUME(pl).image }, { ALT: () => e.CONSUME(Nl).image }, { ALT: () => e.CONSUME(yl).image }, { ALT: () => e.CONSUME(Rl).image }, { ALT: () => e.CONSUME(Tl).image }, { ALT: () => e.CONSUME(Al).image }, { ALT: () => e.CONSUME(Il).image }, { ALT: () => e.CONSUME(ol).image }, { ALT: () => e.CONSUME(sl).image }, { ALT: () => e.CONSUME(al).image }]));
+        r.push([o, e.getLexerPosition(), cr.includes(o)]), i.push(e.SUBRULE2(e.postfixOp));
       }), e.ACTION(() => {
         let o = r.length;
-        const s = So.length;
+        const s = vo.length;
         for (let a = 0; o > 0 && a < s; a++) {
-          const c = So[a];
+          const c = vo[a];
           let u = r.length;
           for (let l = 0; l < u; l++) {
             const h = r[l], N = h[0];
             if (!c.includes(N)) continue;
-            let S = Ur(N, i[l], i[l + 1], h[2]);
+            let S = wr(N, i[l], i[l + 1], h[2]);
             S = this._ensureWhitespace(S, h[1]), r.splice(l, 1), i.splice(l, 2, S), l--, u--, o--;
           }
         }
       }), i[0];
-    }), e.RULE("plusMinusOp", () => e.OR([{ ALT: () => e.CONSUME(dr).image }, { ALT: () => e.CONSUME(pr).image }])), e.RULE("postfixOp", () => {
+    }), e.RULE("plusMinusOp", () => e.OR([{ ALT: () => e.CONSUME(hr).image }, { ALT: () => e.CONSUME(fr).image }])), e.RULE("postfixOp", () => {
       let r = e.SUBRULE(e.prefixOp);
       const i = [];
       return e.MANY(() => {
-        const o = e.OR([{ ALT: () => e.CONSUME(Tl).image }, { ALT: () => e.CONSUME(Mo).image }]);
+        const o = e.OR([{ ALT: () => e.CONSUME(El).image }, { ALT: () => e.CONSUME(Po).image }]);
         e.ACTION(() => {
           i.push([o, e.getLexerPosition()]);
         });
       }), e.ACTION(() => {
         const o = i.length;
         if (o !== 0) for (let s = 0; s < o; s++) {
-          const a = i[s], c = a[0], u = a[1], l = lr.includes(c);
-          r = sr(c, r, l), r = this._ensureWhitespace(r, u);
+          const a = i[s], c = a[0], u = a[1], l = cr.includes(c);
+          r = ir(c, r, l), r = this._ensureWhitespace(r, u);
         }
       }), r;
     }), e.RULE("prefixOp", () => {
       const r = [];
       e.MANY(() => {
-        const o = e.OR([{ ALT: () => e.CONSUME(dr).image }, { ALT: () => e.CONSUME(pr).image }, { ALT: () => e.CONSUME(hr).image }]);
+        const o = e.OR([{ ALT: () => e.CONSUME(hr).image }, { ALT: () => e.CONSUME(fr).image }, { ALT: () => e.CONSUME(ur).image }]);
         e.ACTION(() => {
           r.push([o, e.getLexerPosition()]);
         });
@@ -4969,7 +4972,7 @@ class Sl extends qc {
       return e.ACTION(() => {
         const o = r.length;
         if (o !== 0) for (let s = o - 1; s >= 0; s--) {
-          const a = r[s], c = a[0], u = a[1], l = lr.includes(c);
+          const a = r[s], c = a[0], u = a[1], l = cr.includes(c);
           i = Ce(c, i, l), i = this._ensureWhitespace(i, u);
         }
       }), i;
@@ -4986,7 +4989,7 @@ class Sl extends qc {
         for (; r.length > 1; ) {
           let i = r.length - 1;
           for (let o = 0; o < i; o++) {
-            const s = r[o], a = r[o + 1], c = Ur(" ", s, a, !0);
+            const s = r[o], a = r[o + 1], c = wr(" ", s, a, !0);
             if (delete s.wsAfter, a.wsBefore) {
               const u = a.wsBefore.slice(0, -1), l = u.length;
               delete a.wsBefore, l > 0 && (c.wsBefore = u);
@@ -5004,55 +5007,55 @@ class Sl extends qc {
           r.push(i);
         });
       }), r;
-    }), e.RULE("paren", () => n("paren", hl, fr)), e.RULE("literalArray", () => {
+    }), e.RULE("paren", () => n("paren", ul, lr)), e.RULE("literalArray", () => {
       let r = { type: "row", value: [], isLiteral: !0 };
-      e.CONSUME(fl);
+      e.CONSUME(ll);
       const i = e.getLexerPosition();
       let o = e.ACTION(() => this._ensureWhitespace({ type: "array", value: [r], isLiteral: !0 }, i, !0));
       const s = e.SUBRULE(e.literalForArray);
       e.ACTION(() => {
         r.value.push(s);
       }), e.MANY(() => {
-        const c = e.OR([{ ALT: () => e.CONSUME(fe).image }, { ALT: () => e.CONSUME(ll).image }]), u = e.SUBRULE2(e.literalForArray);
+        const c = e.OR([{ ALT: () => e.CONSUME(fe).image }, { ALT: () => e.CONSUME(cl).image }]), u = e.SUBRULE2(e.literalForArray);
         e.ACTION(() => {
           c === "," || (r = { type: "row", value: [], isLiteral: !0 }, o.value.push(r)), r.value.push(u);
         });
       });
-      const a = e.OPTION(() => this.CONSUME(dl));
+      const a = e.OPTION(() => this.CONSUME(hl));
       return o = e.ACTION(() => (a || this._reportError(o, "Missing closing parenthesis '}'", i), this._ensureWhitespace(o, e.getLexerPosition(), !1, !0))), o;
     }), e.RULE("literalForArray", () => e.OR([{ ALT: () => {
-      const r = e.OPTION(() => e.SUBRULE(e.plusMinusOp)), i = e.CONSUME(ko), o = e.ACTION(() => this._ensureWhitespace(yo(i.image), e.getLexerPosition()));
+      const r = e.OPTION(() => e.SUBRULE(e.plusMinusOp)), i = e.CONSUME(xo), o = e.ACTION(() => this._ensureWhitespace(Io(i.image), e.getLexerPosition()));
       return r ? e.ACTION(() => /* @__PURE__ */ function(s, a) {
         return { type: "prefix", value: s, inputs: [a] };
       }(r, o)) : o;
     } }, { ALT: () => {
-      const r = e.CONSUME(_o);
-      return e.ACTION(() => this._ensureWhitespace(cr(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(Oo);
+      return e.ACTION(() => this._ensureWhitespace(sr(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(bo);
-      return e.ACTION(() => this._ensureWhitespace(Ro(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(Co);
+      return e.ACTION(() => this._ensureWhitespace(No(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(Lo);
-      return e.ACTION(() => this._ensureWhitespace(vo(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(So);
+      return e.ACTION(() => this._ensureWhitespace(yo(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(xo);
+      const r = e.CONSUME(_o);
       return e.ACTION(() => this._ensureWhitespace(vn(r.image), e.getLexerPosition()));
     } }])), e.RULE("literal", () => e.OR([{ ALT: () => {
-      const r = e.CONSUME(ko);
-      return e.ACTION(() => this._ensureWhitespace(yo(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(xo);
+      return e.ACTION(() => this._ensureWhitespace(Io(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(_o);
-      return e.ACTION(() => this._ensureWhitespace(cr(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(Oo);
+      return e.ACTION(() => this._ensureWhitespace(sr(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(bo);
-      return e.ACTION(() => this._ensureWhitespace(Ro(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(Co);
+      return e.ACTION(() => this._ensureWhitespace(No(r.image), e.getLexerPosition()));
     } }, { ALT: () => {
-      const r = e.CONSUME(Lo);
-      return e.ACTION(() => this._ensureWhitespace(vo(r.image), e.getLexerPosition()));
+      const r = e.CONSUME(So);
+      return e.ACTION(() => this._ensureWhitespace(yo(r.image), e.getLexerPosition()));
     } }])), e.RULE("function", () => {
-      const r = e.CONSUME(tl).image.slice(0, -1), i = e.getLexerPosition(), o = e.SUBRULE(e.functionArguments);
-      let s = e.ACTION(() => this._ensureWhitespace(No(r, o), i, !0));
-      const a = e.OPTION(() => this.CONSUME(fr));
+      const r = e.CONSUME(Qu).image.slice(0, -1), i = e.getLexerPosition(), o = e.SUBRULE(e.functionArguments);
+      let s = e.ACTION(() => this._ensureWhitespace(Ao(r, o), i, !0));
+      const a = e.OPTION(() => this.CONSUME(lr));
       return s = e.ACTION(() => (a || this._reportError(s, "Missing closing parenthesis ')'", i), this._ensureWhitespace(s, e.getLexerPosition(), !1, !0))), s;
     }), e.RULE("functionArguments", () => {
       const r = [];
@@ -5068,24 +5071,24 @@ class Sl extends qc {
         });
       }), r;
     }), e.RULE("bracketedString", () => {
-      const r = e.CONSUME(Uo), i = e.getLexerPosition();
+      const r = e.CONSUME(wo), i = e.getLexerPosition();
       return e.ACTION(() => {
         const o = r.image;
-        let s = ir("", [or(o.substring(1, o.length - 1))]);
+        let s = nr("", [rr(o.substring(1, o.length - 1))]);
         return s = this._ensureWhitespace(s, i, !0, !1), s = this._ensureWhitespace(s, e.getLexerPosition(), !1, !0), s;
       });
     }), e.RULE("squareParen", () => {
-      e.CONSUME(Po);
+      e.CONSUME(ko);
       const r = e.getLexerPosition();
-      let i = ir("", [e.SUBRULE(e.structuredArgument)]);
-      const o = e.OPTION(() => this.CONSUME(wo));
+      let i = nr("", [e.SUBRULE(e.structuredArgument)]);
+      const o = e.OPTION(() => this.CONSUME(bo));
       return e.ACTION(() => {
         o || this._reportError(i, "Missing closing parenthesis ']'", r), i = this._ensureWhitespace(i, r, !0, !1), i = this._ensureWhitespace(i, e.getLexerPosition(), !1, !0);
       }), i;
     }), e.RULE("namedTableReference", () => {
-      const r = e.CONSUME(el).image.slice(0, -1), i = e.getLexerPosition(), o = e.SUBRULE(e.structuredArguments);
-      let s = e.ACTION(() => this._ensureWhitespace(ir(r, o), i, !0));
-      const a = e.OPTION(() => this.CONSUME(wo));
+      const r = e.CONSUME(Ju).image.slice(0, -1), i = e.getLexerPosition(), o = e.SUBRULE(e.structuredArguments);
+      let s = e.ACTION(() => this._ensureWhitespace(nr(r, o), i, !0));
+      const a = e.OPTION(() => this.CONSUME(bo));
       return s = e.ACTION(() => (a || this._reportError(s, "Missing closing parenthesis ']'", i), this._ensureWhitespace(s, e.getLexerPosition(), !1, !0))), s;
     }), e.RULE("structuredArguments", () => {
       const r = [];
@@ -5107,22 +5110,22 @@ class Sl extends qc {
         });
       }), r;
     }), e.RULE("structuredArgument", () => {
-      const r = e.OPTION(() => e.CONSUME(hr)), i = e.getLexerPosition(), o = e.OPTION2(() => this.CONSUME(Po));
+      const r = e.OPTION(() => e.CONSUME(ur)), i = e.getLexerPosition(), o = e.OPTION2(() => this.CONSUME(ko));
       let s = e.OR([{ ALT: () => {
-        const a = e.CONSUME(Al);
-        return e.ACTION(() => this._ensureWhitespace(or(a.image), e.getLexerPosition()));
+        const a = e.CONSUME(gl);
+        return e.ACTION(() => this._ensureWhitespace(rr(a.image), e.getLexerPosition()));
       } }, { ALT: () => {
-        const a = e.CONSUME(Uo);
-        return e.ACTION(() => this._ensureWhitespace(or(a.image), e.getLexerPosition()));
+        const a = e.CONSUME(wo);
+        return e.ACTION(() => this._ensureWhitespace(rr(a.image), e.getLexerPosition()));
       } }, { ALT: () => {
-        const a = e.CONSUME(Co);
-        return e.ACTION(() => this._ensureWhitespace(ar(a.image), e.getLexerPosition()));
+        const a = e.CONSUME(Lo);
+        return e.ACTION(() => this._ensureWhitespace(or(a.image), e.getLexerPosition()));
       } }, { ALT: () => {
-        const a = e.CONSUME(Ju);
-        return e.ACTION(() => this._ensureWhitespace(cr(a.image), e.getLexerPosition()));
+        const a = e.CONSUME(Zu);
+        return e.ACTION(() => this._ensureWhitespace(sr(a.image), e.getLexerPosition()));
       } }]);
       if (o) {
-        const a = e.OPTION3(() => this.CONSUME(fr));
+        const a = e.OPTION3(() => this.CONSUME(lr));
         e.ACTION(() => (a || this._reportError(s, "Missing closing parenthesis ']'", i), this._ensureWhitespace(s, e.getLexerPosition(), !1, !0))), s = { type: "structuredArg", value: null, inputs: [s] };
       }
       return e.ACTION(() => {
@@ -5136,42 +5139,42 @@ class Sl extends qc {
         i.ref && (i.ref.sheet = r);
       }), i;
     } }])), e.RULE("reference", () => {
-      const r = e.OPTION4(() => e.CONSUME(hr));
+      const r = e.OPTION4(() => e.CONSUME(ur));
       let i = e.OR([{ ALT: () => {
-        const o = e.CONSUME(nl), s = e.getLexerPosition(), a = e.OPTION(() => e.CONSUME(Mo));
+        const o = e.CONSUME(tl), s = e.getLexerPosition(), a = e.OPTION(() => e.CONSUME(Po));
         return e.ACTION(() => {
           const c = this._ensureWhitespace(function(u, l) {
             const h = u.match(/([$]?)([A-Za-z]{1,3})([$]?)([1-9][0-9]*)/);
-            let N = Ao(h[2]) - 1;
+            let N = go(h[2]) - 1;
             const S = h[1].length === 1;
             let _ = +h[4] - 1;
             const m = h[3].length === 1;
             return S || N === Number.MIN_SAFE_INTEGER || (N -= l.colIndex), m || _ === Number.MIN_SAFE_INTEGER || (_ -= l.rowIndex), { type: "cell", value: Object.freeze({ colIndex: N, rowIndex: _, $colIndex: S, $rowIndex: m }), inputs: null, isReference: !0 };
           }(o.image, e.position), s);
-          return a ? this._ensureWhitespace(sr("#", c, !0), s) : c;
+          return a ? this._ensureWhitespace(ir("#", c, !0), s) : c;
         });
       } }, { ALT: () => {
-        const o = e.CONSUME(Co);
-        return e.ACTION(() => this._ensureWhitespace(ar(o.image), e.getLexerPosition()));
+        const o = e.CONSUME(Lo);
+        return e.ACTION(() => this._ensureWhitespace(or(o.image), e.getLexerPosition()));
       } }, { ALT: () => {
-        const o = e.CONSUME(il);
+        const o = e.CONSUME(nl);
         return e.ACTION(() => this._ensureWhitespace(function(s, a) {
           const c = s.startsWith("$");
           c && (s = s.substring(1));
-          let u = Ao(s) - 1;
+          let u = go(s) - 1;
           return c || u === Number.MIN_SAFE_INTEGER || (u -= a.colIndex), { type: "cell", value: Object.freeze({ colIndex: u, rowIndex: Number.MIN_SAFE_INTEGER, $colIndex: c, $rowIndex: !1 }), inputs: null, isReference: !0 };
         }(o.image, e.position), e.getLexerPosition()));
       } }, { ALT: () => {
-        const o = e.CONSUME(ol);
-        return e.ACTION(() => this._ensureWhitespace(Io(o.image, e.position), e.getLexerPosition()));
+        const o = e.CONSUME(rl);
+        return e.ACTION(() => this._ensureWhitespace(To(o.image, e.position), e.getLexerPosition()));
       } }, { ALT: () => {
-        const o = e.CONSUME(xo);
+        const o = e.CONSUME(_o);
         return e.ACTION(() => this._ensureWhitespace(vn(o.image), e.getLexerPosition()));
       } }]);
       return e.ACTION(() => {
         r && (i = Ce(r, i, !0), i = this._ensureWhitespace(i, e.getLexerPosition()));
       }), i;
-    }), e.RULE("prefixSheetName", () => e.OR([{ ALT: () => e.CONSUME(rl).image.slice(0, -1) }, { ALT: () => e.CONSUME(Qu).image.slice(1, -2).replace(/''/g, "'") }])), e.performSelfAnalysis();
+    }), e.RULE("prefixSheetName", () => e.OR([{ ALT: () => e.CONSUME(el).image.slice(0, -1) }, { ALT: () => e.CONSUME(qu).image.slice(1, -2).replace(/''/g, "'") }])), e.performSelfAnalysis();
   }
   _reportError(e, n, r = void 0, i = "SyntaxError") {
     r === void 0 && (r = this.getLexerPosition()), e.error = !0, this.astErrors.push({ name: i, message: n, previousToken: this.input[r], ast: e });
@@ -5191,7 +5194,7 @@ class Sl extends qc {
   }
   _createAST(e, n) {
     const r = function(a) {
-      const c = Pu.tokenize(a);
+      const c = ku.tokenize(a);
       if (c.errors.length > 0) {
         const u = c.errors[0], l = u.line, h = u.column;
         let N = `
@@ -5214,22 +5217,22 @@ class Sl extends qc {
       if (u === "function" && a.value && a.value.toUpperCase().startsWith("_XLFN.")) {
         const l = a.value.substring(6);
         let h = a.image.substring(6), N = a;
-        l === "ANCHORARRAY" ? (N = sr("#", a.inputs[0], !0), h = "#") : l === "SINGLE" ? (N = Ce("@", a.inputs[0], !0), h = "@") : N = No(l, a.inputs), ur(N, a), N.image = h, u = (a = N).type;
+        l === "ANCHORARRAY" ? (N = ir("#", a.inputs[0], !0), h = "#") : l === "SINGLE" ? (N = Ce("@", a.inputs[0], !0), h = "@") : N = Ao(l, a.inputs), ar(N, a), N.image = h, u = (a = N).type;
       }
       if (c?.isReference) {
         const l = c.value;
         if ((l === ":" || l === ".:." || l === ".:" || l === ":.") && Number.isInteger(a.value)) {
           const h = c.inputs[0] === a ? c.inputs[1] : c.inputs[0];
           if (h && Number.isInteger(h.value)) {
-            const N = Io(a.image, s);
-            return ur(N, a), N;
+            const N = To(a.image, s);
+            return ar(N, a), N;
           }
         }
       } else if (u === "cell") {
         const l = a.value;
         if (l.rowIndex === Number.MIN_SAFE_INTEGER || l.colIndex >= 16384) {
-          const h = ar(a.image);
-          return ur(h, a), h;
+          const h = or(a.image);
+          return ar(h, a), h;
         }
       }
       return a;
@@ -5244,9 +5247,9 @@ class Sl extends qc {
       o = c instanceof D.Parse ? c : new D.Parse(c.message, c);
     }
     const s = this.errors;
-    s.length > 0 && (o = Oo(s[0], n));
+    s.length > 0 && (o = Ro(s[0], n));
     const a = this.astErrors;
-    return a.length > 0 && (o = Oo(a[0], n)), i = r ? dn(r, o) : { ast: null, evaluations: ft.EmptyArray, executions: ft.EmptyArray, precedentsAbsolute: ft.EmptyArray, precedentsExecute: ft.EmptyArray, precedentsNamed: null, precedentsRelative: ft.EmptyArray, precedentsRoot: ft.EmptyArray, references: ft.EmptyArray, tokens: ft.EmptyArray, error: o }, i;
+    return a.length > 0 && (o = Ro(a[0], n)), i = r ? dn(r, o) : { ast: null, evaluations: ft.EmptyArray, executions: ft.EmptyArray, precedentsAbsolute: ft.EmptyArray, precedentsExecute: ft.EmptyArray, precedentsNamed: null, precedentsRelative: ft.EmptyArray, precedentsRoot: ft.EmptyArray, references: ft.EmptyArray, tokens: ft.EmptyArray, error: o }, i;
   }
 }
 class Me {
@@ -5254,7 +5257,7 @@ class Me {
     this._options = e, this._compiled = n;
   }
   getTextAt(e, n, r = !1) {
-    return r ? Ye(this._compiled.tokens) : Ks(this._compiled.tokens, e, n);
+    return r ? Ye(this._compiled.tokens) : Ws(this._compiled.tokens, e, n);
   }
   getTokens() {
     return this._compiled.tokens;
@@ -5305,7 +5308,7 @@ class Me {
     const y = this._compiled.ast, p = Ke(y, (A) => {
       if (!A || !A.isReference) return;
       const v = A.type;
-      if (!n && Ws.includes(A.value)) {
+      if (!n && Bs.includes(A.value)) {
         const E = u[0], R = u[1];
         let M = E.evalIndex === _, L = R.evalIndex === m;
         if (M || L) {
@@ -5320,7 +5323,7 @@ class Me {
         if (n) if (S === N) {
           let E = I ? l : h;
           d = { ...A }, d.value = E, d.image = null;
-        } else d = N ? Ur(":", rr(l), rr(h), !0) : rr(l);
+        } else d = N ? wr(":", er(l), er(h), !0) : er(l);
         else d = vn(), d.image = "#REF!";
         return d;
       }
@@ -5345,7 +5348,7 @@ class Me {
       l[p] = A;
     }
     let N = !1;
-    const S = s.precedentsExecute, _ = S.length, m = Fr;
+    const S = s.precedentsExecute, _ = S.length, m = Mr;
     for (let p = 0; p < _; p++) {
       const T = S[p], g = T.op;
       if (!g) {
@@ -5520,7 +5523,7 @@ class Me {
     if (i.type === "cell") return this;
     if (i.value === "@") return this;
     if (!r) return this;
-    const o = zs(n) + Vs(e);
+    const o = Gs(n) + Ks(e);
     if (r.has(o)) return this;
     const s = dn(Ce("@", i, !0), this._compiled.error);
     return new Me(this._options, s);
@@ -5545,7 +5548,7 @@ class Me {
     } catch {
       n = D.BuiltIn.Value;
     }
-    return n?.isIRange ? n.size === 1 ? (n = n.getValueAt(0, 0, _l), (n = Xe(n, e)) === null && (n = 0)) : n = n.fillEmpty(0) : (n = Xe(n, e)) === null && (n = 0), n;
+    return n?.isIRange ? n.size === 1 ? (n = n.getValueAt(0, 0, Ol), (n = Xe(n, e)) === null && (n = 0)) : n = n.fillEmpty(0) : (n = Xe(n, e)) === null && (n = 0), n;
   }
   get [Symbol.toStringTag]() {
     return "[FormulaBlock]";
@@ -5561,12 +5564,12 @@ class Me {
     return Ye(e.tokens);
   }
 }
-const Fr = new Array(20);
-for (let t = 0; t < Fr.length; t++) Fr[t] = { colStart: 0, rowStart: 0, colEnd: 0, rowEnd: 0, sheetName: null };
-const _l = { type: null };
-class xl {
+const Mr = new Array(20);
+for (let t = 0; t < Mr.length; t++) Mr[t] = { colStart: 0, rowStart: 0, colEnd: 0, rowEnd: 0, sheetName: null };
+const Ol = { type: null };
+class _l {
   constructor(e) {
-    this._options = { getEntireCoords: Gs, ...e }, this._astBuilder = new Sl();
+    this._options = { getEntireCoords: $s, ...e }, this._astBuilder = new vl();
   }
   parse(e, n) {
     e.getPosition().sheetName;
@@ -5578,5 +5581,5 @@ class xl {
   }
 }
 export {
-  xl as FormulaParser
+  _l as FormulaParser
 };