@aiao/code-editor-vue 0.0.7 → 0.0.8

package/dist/{index-D6_k5ZgA.js → index-BuVm7ZG6-BZLKs8s6.js}

@@ -1,10 +1,10 @@
-import { P as L, o as M, p as $, D as E, q as y, T as S, I as j } from "./index-3d5LPf68.js";
-class v {
+import { d as $, N as L, l as M, $ as E, f as w, V as S, H as G } from "./index-wcsJ2mym.js";
+class P {
   /**
   @internal
   */
-  constructor(t, e, s, i, h, r, n, o, a, u = 0, f) {
-    this.p = t, this.stack = e, this.state = s, this.reducePos = i, this.pos = h, this.score = r, this.buffer = n, this.bufferBase = o, this.curContext = a, this.lookAhead = u, this.parent = f;
+  constructor(t, e, s, i, h, r, n, o, a, u = 0, c) {
+    this.p = t, this.stack = e, this.state = s, this.reducePos = i, this.pos = h, this.score = r, this.buffer = n, this.bufferBase = o, this.curContext = a, this.lookAhead = u, this.parent = c;
   }
   /**
   @internal
@@ -18,7 +18,7 @@ class v {
   */
   static start(t, e, s = 0) {
     let i = t.parser.context;
-    return new v(t, [], e, s, s, 0, [], 0, i ? new N(i, i.start) : null, 0, null);
+    return new P(t, [], e, s, s, 0, [], 0, i ? new N(i, i.start) : null, 0, null);
   }
   /**
   The stack's current [context](#lr.ContextTracker) value, if
@@ -50,20 +50,20 @@ class v {
     }
     let o = this.stack.length - (s - 1) * 3 - (t & 262144 ? 6 : 0), a = o ? this.stack[o - 2] : this.p.ranges[0].from, u = this.reducePos - a;
     u >= 2e3 && !(!((e = this.p.parser.nodeSet.types[i]) === null || e === void 0) && e.isAnonymous) && (a == this.p.lastBigReductionStart ? (this.p.bigReductionCount++, this.p.lastBigReductionSize = u) : this.p.lastBigReductionSize < u && (this.p.bigReductionCount = 1, this.p.lastBigReductionStart = a, this.p.lastBigReductionSize = u));
-    let f = o ? this.stack[o - 1] : 0, p = this.bufferBase + this.buffer.length - f;
+    let c = o ? this.stack[o - 1] : 0, p = this.bufferBase + this.buffer.length - c;
     if (i < h.minRepeatTerm || t & 131072) {
-      let c = h.stateFlag(
+      let f = h.stateFlag(
         this.state,
         1
         /* StateFlag.Skipped */
       ) ? this.pos : this.reducePos;
-      this.storeNode(i, a, c, p + 4, !0);
+      this.storeNode(i, a, f, p + 4, !0);
     }
     if (t & 262144)
       this.state = this.stack[o];
     else {
-      let c = this.stack[o - 3];
-      this.state = h.getGoto(c, i, !0);
+      let f = this.stack[o - 3];
+      this.state = h.getGoto(f, i, !0);
     }
     for (; this.stack.length > o; )
       this.stack.pop();
@@ -156,7 +156,7 @@ class v {
     let s = t.buffer.slice(e), i = t.bufferBase + e;
     for (; t && i == t.bufferBase; )
       t = t.parent;
-    return new v(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, s, i, this.curContext, this.lookAhead, t);
+    return new P(this.p, this.stack.slice(), this.state, this.reducePos, this.pos, this.score, s, i, this.curContext, this.lookAhead, t);
   }
   // Try to recover from an error by 'deleting' (ignoring) one token.
   /**
@@ -173,7 +173,7 @@ class v {
   given token when it applies.
   */
   canShift(t) {
-    for (let e = new G(this); ; ) {
+    for (let e = new j(this); ; ) {
       let s = this.p.parser.stateSlot(
         e.state,
         4
@@ -376,7 +376,7 @@ class N {
     this.tracker = t, this.context = e, this.hash = t.strict ? t.hash(e) : 0;
   }
 }
-class G {
+class j {
   constructor(t) {
     this.start = t, this.state = t.state, this.stack = t.stack, this.base = this.stack.length;
   }
@@ -439,12 +439,12 @@ function x(l, t = Uint16Array) {
   }
   return e;
 }
-class P {
+class v {
   constructor() {
     this.start = -1, this.value = -1, this.end = -1, this.extended = -1, this.lookAhead = 0, this.mask = 0, this.context = 0;
   }
 }
-const R = new P();
+const R = new v();
 class U {
   /**
   @internal
@@ -597,7 +597,7 @@ class m {
   }
   token(t, e) {
     let { parser: s } = e.p;
-    F(this.data, t, e, this.id, s.data, s.tokenPrecTable);
+    O(this.data, t, e, this.id, s.data, s.tokenPrecTable);
   }
 }
 m.prototype.contextual = m.prototype.fallback = m.prototype.extend = !1;
@@ -609,7 +609,7 @@ class H {
     let s = t.pos, i = 0;
     for (; ; ) {
       let h = t.next < 0, r = t.resolveOffset(1, 1);
-      if (F(this.data, t, e, 0, this.data, this.precTable), t.token.value > -1)
+      if (O(this.data, t, e, 0, this.data, this.precTable), t.token.value > -1)
         break;
       if (this.elseToken == null)
         return;
@@ -621,7 +621,7 @@ class H {
   }
 }
 H.prototype.contextual = m.prototype.fallback = m.prototype.extend = !1;
-class Y {
+class Z {
   /**
   Create a tokenizer. The first argument is the function that,
   given an input stream, scans for the types of tokens it
@@ -633,29 +633,29 @@ class Y {
     this.token = t, this.contextual = !!e.contextual, this.fallback = !!e.fallback, this.extend = !!e.extend;
   }
 }
-function F(l, t, e, s, i, h) {
+function O(l, t, e, s, i, h) {
   let r = 0, n = 1 << s, { dialect: o } = e.p.parser;
   t: for (; (n & l[r]) != 0; ) {
     let a = l[r + 1];
-    for (let c = r + 3; c < a; c += 2)
-      if ((l[c + 1] & n) > 0) {
-        let d = l[c];
-        if (o.allows(d) && (t.token.value == -1 || t.token.value == d || W(d, t.token.value, i, h))) {
+    for (let f = r + 3; f < a; f += 2)
+      if ((l[f + 1] & n) > 0) {
+        let d = l[f];
+        if (o.allows(d) && (t.token.value == -1 || t.token.value == d || V(d, t.token.value, i, h))) {
           t.acceptToken(d);
           break;
         }
       }
-    let u = t.next, f = 0, p = l[r + 2];
-    if (t.next < 0 && p > f && l[a + p * 3 - 3] == 65535) {
+    let u = t.next, c = 0, p = l[r + 2];
+    if (t.next < 0 && p > c && l[a + p * 3 - 3] == 65535) {
       r = l[a + p * 3 - 1];
       continue t;
     }
-    for (; f < p; ) {
-      let c = f + p >> 1, d = a + c + (c << 1), b = l[d], O = l[d + 1] || 65536;
+    for (; c < p; ) {
+      let f = c + p >> 1, d = a + f + (f << 1), b = l[d], F = l[d + 1] || 65536;
       if (u < b)
-        p = c;
-      else if (u >= O)
-        f = c + 1;
+        p = f;
+      else if (u >= F)
+        c = f + 1;
       else {
         r = l[d + 2], t.advance();
         continue t;
@@ -670,14 +670,14 @@ function z(l, t, e) {
       return s - t;
   return -1;
 }
-function W(l, t, e, s) {
+function V(l, t, e, s) {
   let i = z(e, s, t);
   return i < 0 || z(e, s, l) < i;
 }
-const g = typeof process < "u" && process.env && /\bparse\b/.test(process.env.LOG);
-let T = null;
+const k = typeof process < "u" && process.env && /\bparse\b/.test(process.env.LOG);
+let C = null;
 function I(l, t, e) {
-  let s = l.cursor(j.IncludeAnonymous);
+  let s = l.cursor(G.IncludeAnonymous);
   for (s.moveTo(t); ; )
     if (!(e < 0 ? s.childBefore(t) : s.childAfter(t)))
       for (; ; ) {
@@ -697,7 +697,7 @@ function I(l, t, e) {
           return e < 0 ? 0 : l.length;
       }
 }
-class q {
+class W {
   constructor(t, e) {
     this.fragments = t, this.nodeSet = e, this.i = 0, this.fragment = null, this.safeFrom = -1, this.safeTo = -1, this.trees = [], this.start = [], this.index = [], this.nextFragment();
   }
@@ -736,7 +736,7 @@ class q {
             return null;
           let n = r + h.length;
           if (n <= this.safeTo) {
-            let o = h.prop(y.lookAhead);
+            let o = h.prop(w.lookAhead);
             if (!o || n + o < this.fragment.to)
               return h;
           }
@@ -747,9 +747,9 @@ class q {
     }
   }
 }
-class J {
+class q {
   constructor(t, e) {
-    this.stream = e, this.tokens = [], this.mainToken = null, this.actions = [], this.tokens = t.tokenizers.map((s) => new P());
+    this.stream = e, this.tokens = [], this.mainToken = null, this.actions = [], this.tokens = t.tokenizers.map((s) => new v());
   }
   getActions(t) {
     let e = 0, s = null, { parser: i } = t.p, { tokenizers: h } = i, r = i.stateSlot(
@@ -760,21 +760,21 @@ class J {
     for (let a = 0; a < h.length; a++) {
       if ((1 << a & r) == 0)
         continue;
-      let u = h[a], f = this.tokens[a];
-      if (!(s && !u.fallback) && ((u.contextual || f.start != t.pos || f.mask != r || f.context != n) && (this.updateCachedToken(f, u, t), f.mask = r, f.context = n), f.lookAhead > f.end + 25 && (o = Math.max(f.lookAhead, o)), f.value != 0)) {
+      let u = h[a], c = this.tokens[a];
+      if (!(s && !u.fallback) && ((u.contextual || c.start != t.pos || c.mask != r || c.context != n) && (this.updateCachedToken(c, u, t), c.mask = r, c.context = n), c.lookAhead > c.end + 25 && (o = Math.max(c.lookAhead, o)), c.value != 0)) {
         let p = e;
-        if (f.extended > -1 && (e = this.addActions(t, f.extended, f.end, e)), e = this.addActions(t, f.value, f.end, e), !u.extend && (s = f, e > p))
+        if (c.extended > -1 && (e = this.addActions(t, c.extended, c.end, e)), e = this.addActions(t, c.value, c.end, e), !u.extend && (s = c, e > p))
           break;
       }
     }
     for (; this.actions.length > e; )
       this.actions.pop();
-    return o && t.setLookAhead(o), !s && t.pos == this.stream.end && (s = new P(), s.value = t.p.parser.eofTerm, s.start = s.end = t.pos, e = this.addActions(t, s.value, s.end, e)), this.mainToken = s, this.actions;
+    return o && t.setLookAhead(o), !s && t.pos == this.stream.end && (s = new v(), s.value = t.p.parser.eofTerm, s.start = s.end = t.pos, e = this.addActions(t, s.value, s.end, e)), this.mainToken = s, this.actions;
   }
   getMainToken(t) {
     if (this.mainToken)
       return this.mainToken;
-    let e = new P(), { pos: s, p: i } = t;
+    let e = new v(), { pos: s, p: i } = t;
     return e.start = s, e.end = Math.min(s + 1, i.stream.end), e.value = s == i.stream.end ? i.parser.eofTerm : 0, e;
   }
   updateCachedToken(t, e, s) {
@@ -808,21 +808,21 @@ class J {
       ); ; a += 3) {
         if (n[a] == 65535)
           if (n[a + 1] == 1)
-            a = k(n, a + 2);
+            a = g(n, a + 2);
           else {
-            i == 0 && n[a + 1] == 2 && (i = this.putAction(k(n, a + 2), e, s, i));
+            i == 0 && n[a + 1] == 2 && (i = this.putAction(g(n, a + 2), e, s, i));
             break;
           }
-        n[a] == e && (i = this.putAction(k(n, a + 1), e, s, i));
+        n[a] == e && (i = this.putAction(g(n, a + 1), e, s, i));
       }
     return i;
   }
 }
-class K {
+class J {
   constructor(t, e, s, i) {
-    this.parser = t, this.input = e, this.ranges = i, this.recovering = 0, this.nextStackID = 9812, this.minStackPos = 0, this.reused = [], this.stoppedAt = null, this.lastBigReductionStart = -1, this.lastBigReductionSize = 0, this.bigReductionCount = 0, this.stream = new U(e, i), this.tokens = new J(t, this.stream), this.topTerm = t.top[1];
+    this.parser = t, this.input = e, this.ranges = i, this.recovering = 0, this.nextStackID = 9812, this.minStackPos = 0, this.reused = [], this.stoppedAt = null, this.lastBigReductionStart = -1, this.lastBigReductionSize = 0, this.bigReductionCount = 0, this.stream = new U(e, i), this.tokens = new q(t, this.stream), this.topTerm = t.top[1];
     let { from: h } = i[0];
-    this.stacks = [v.start(this, t.top[0], h)], this.fragments = s.length && this.stream.end - h > t.bufferLength * 4 ? new q(s, t.nodeSet) : null;
+    this.stacks = [P.start(this, t.top[0], h)], this.fragments = s.length && this.stream.end - h > t.bufferLength * 4 ? new W(s, t.nodeSet) : null;
   }
   get parsedPos() {
     return this.minStackPos;
@@ -859,17 +859,17 @@ class K {
       }
     }
     if (!s.length) {
-      let r = i && V(i);
+      let r = i && Q(i);
       if (r)
-        return g && console.log("Finish with " + this.stackID(r)), this.stackToTree(r);
+        return k && console.log("Finish with " + this.stackID(r)), this.stackToTree(r);
       if (this.parser.strict)
-        throw g && i && console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none")), new SyntaxError("No parse at " + e);
+        throw k && i && console.log("Stuck with token " + (this.tokens.mainToken ? this.parser.getName(this.tokens.mainToken.value) : "none")), new SyntaxError("No parse at " + e);
       this.recovering || (this.recovering = 5);
     }
     if (this.recovering && i) {
       let r = this.stoppedAt != null && i[0].pos > this.stoppedAt ? i[0] : this.runRecovery(i, h, s);
       if (r)
-        return g && console.log("Force-finish " + this.stackID(r)), this.stackToTree(r.forceAll());
+        return k && console.log("Force-finish " + this.stackID(r)), this.stackToTree(r.forceAll());
     }
     if (this.recovering) {
       let r = this.recovering == 1 ? 1 : this.recovering * 3;
@@ -912,20 +912,20 @@ class K {
   // given, stacks split off by ambiguous operations will be pushed to
   // `split`, or added to `stacks` if they move `pos` forward.
   advanceStack(t, e, s) {
-    let i = t.pos, { parser: h } = this, r = g ? this.stackID(t) + " -> " : "";
+    let i = t.pos, { parser: h } = this, r = k ? this.stackID(t) + " -> " : "";
     if (this.stoppedAt != null && i > this.stoppedAt)
       return t.forceReduce() ? t : null;
     if (this.fragments) {
       let a = t.curContext && t.curContext.tracker.strict, u = a ? t.curContext.hash : 0;
-      for (let f = this.fragments.nodeAt(i); f; ) {
-        let p = this.parser.nodeSet.types[f.type.id] == f.type ? h.getGoto(t.state, f.type.id) : -1;
-        if (p > -1 && f.length && (!a || (f.prop(y.contextHash) || 0) == u))
-          return t.useNode(f, p), g && console.log(r + this.stackID(t) + ` (via reuse of ${h.getName(f.type.id)})`), !0;
-        if (!(f instanceof S) || f.children.length == 0 || f.positions[0] > 0)
+      for (let c = this.fragments.nodeAt(i); c; ) {
+        let p = this.parser.nodeSet.types[c.type.id] == c.type ? h.getGoto(t.state, c.type.id) : -1;
+        if (p > -1 && c.length && (!a || (c.prop(w.contextHash) || 0) == u))
+          return t.useNode(c, p), k && console.log(r + this.stackID(t) + ` (via reuse of ${h.getName(c.type.id)})`), !0;
+        if (!(c instanceof S) || c.children.length == 0 || c.positions[0] > 0)
           break;
-        let c = f.children[0];
-        if (c instanceof S && f.positions[0] == 0)
-          f = c;
+        let f = c.children[0];
+        if (f instanceof S && c.positions[0] == 0)
+          c = f;
         else
           break;
       }
@@ -936,7 +936,7 @@ class K {
       /* ParseState.DefaultReduce */
     );
     if (n > 0)
-      return t.reduce(n), g && console.log(r + this.stackID(t) + ` (via always-reduce ${h.getName(
+      return t.reduce(n), k && console.log(r + this.stackID(t) + ` (via always-reduce ${h.getName(
         n & 65535
         /* Action.ValueMask */
       )})`), !0;
@@ -945,11 +945,11 @@ class K {
         ;
     let o = this.tokens.getActions(t);
     for (let a = 0; a < o.length; ) {
-      let u = o[a++], f = o[a++], p = o[a++], c = a == o.length || !s, d = c ? t : t.split(), b = this.tokens.mainToken;
-      if (d.apply(u, f, b ? b.start : d.pos, p), g && console.log(r + this.stackID(d) + ` (via ${(u & 65536) == 0 ? "shift" : `reduce of ${h.getName(
+      let u = o[a++], c = o[a++], p = o[a++], f = a == o.length || !s, d = f ? t : t.split(), b = this.tokens.mainToken;
+      if (d.apply(u, c, b ? b.start : d.pos, p), k && console.log(r + this.stackID(d) + ` (via ${(u & 65536) == 0 ? "shift" : `reduce of ${h.getName(
         u & 65535
         /* Action.ValueMask */
-      )}`} for ${h.getName(f)} @ ${i}${d == t ? "" : ", split"})`), c)
+      )}`} for ${h.getName(c)} @ ${i}${d == t ? "" : ", split"})`), f)
         return !0;
       d.pos > i ? e.push(d) : s.push(d);
     }
@@ -964,21 +964,21 @@ class K {
       if (!this.advanceStack(t, null, null))
         return !1;
       if (t.pos > s)
-        return D(t, e), !0;
+        return B(t, e), !0;
     }
   }
   runRecovery(t, e, s) {
     let i = null, h = !1;
     for (let r = 0; r < t.length; r++) {
-      let n = t[r], o = e[r << 1], a = e[(r << 1) + 1], u = g ? this.stackID(n) + " -> " : "";
-      if (n.deadEnd && (h || (h = !0, n.restart(), g && console.log(u + this.stackID(n) + " (restarted)"), this.advanceFully(n, s))))
+      let n = t[r], o = e[r << 1], a = e[(r << 1) + 1], u = k ? this.stackID(n) + " -> " : "";
+      if (n.deadEnd && (h || (h = !0, n.restart(), k && console.log(u + this.stackID(n) + " (restarted)"), this.advanceFully(n, s))))
         continue;
-      let f = n.split(), p = u;
-      for (let c = 0; c < 10 && f.forceReduce() && (g && console.log(p + this.stackID(f) + " (via force-reduce)"), !this.advanceFully(f, s)); c++)
-        g && (p = this.stackID(f) + " -> ");
-      for (let c of n.recoverByInsert(o))
-        g && console.log(u + this.stackID(c) + " (via recover-insert)"), this.advanceFully(c, s);
-      this.stream.end > n.pos ? (a == n.pos && (a++, o = 0), n.recoverByDelete(o, a), g && console.log(u + this.stackID(n) + ` (via recover-delete ${this.parser.getName(o)})`), D(n, s)) : (!i || i.score < n.score) && (i = n);
+      let c = n.split(), p = u;
+      for (let f = 0; f < 10 && c.forceReduce() && (k && console.log(p + this.stackID(c) + " (via force-reduce)"), !this.advanceFully(c, s)); f++)
+        k && (p = this.stackID(c) + " -> ");
+      for (let f of n.recoverByInsert(o))
+        k && console.log(u + this.stackID(f) + " (via recover-insert)"), this.advanceFully(f, s);
+      this.stream.end > n.pos ? (a == n.pos && (a++, o = 0), n.recoverByDelete(o, a), k && console.log(u + this.stackID(n) + ` (via recover-delete ${this.parser.getName(o)})`), B(n, s)) : (!i || i.score < n.score) && (i = n);
     }
     return i;
   }
@@ -996,11 +996,11 @@ class K {
     });
   }
   stackID(t) {
-    let e = (T || (T = /* @__PURE__ */ new WeakMap())).get(t);
-    return e || T.set(t, e = String.fromCodePoint(this.nextStackID++)), e + t;
+    let e = (C || (C = /* @__PURE__ */ new WeakMap())).get(t);
+    return e || C.set(t, e = String.fromCodePoint(this.nextStackID++)), e + t;
   }
 }
-function D(l, t) {
+function B(l, t) {
   for (let e = 0; e < t.length; e++) {
     let s = t[e];
     if (s.pos == l.pos && s.sameState(l)) {
@@ -1010,7 +1010,7 @@ function D(l, t) {
   }
   t.push(l);
 }
-class Q {
+class K {
   constructor(t, e, s) {
     this.source = t, this.flags = e, this.disabled = s;
   }
@@ -1018,16 +1018,16 @@ class Q {
     return !this.disabled || this.disabled[t] == 0;
   }
 }
-const C = (l) => l;
-class Z {
+const y = (l) => l;
+class X {
   /**
   Define a context tracker.
   */
   constructor(t) {
-    this.start = t.start, this.shift = t.shift || C, this.reduce = t.reduce || C, this.reuse = t.reuse || C, this.hash = t.hash || (() => 0), this.strict = t.strict !== !1;
+    this.start = t.start, this.shift = t.shift || y, this.reduce = t.reduce || y, this.reuse = t.reuse || y, this.hash = t.hash || (() => 0), this.strict = t.strict !== !1;
   }
 }
-class w extends L {
+class T extends $ {
   /**
   @internal
   */
@@ -1047,20 +1047,20 @@ class w extends L {
     if (t.nodeProps)
       for (let n of t.nodeProps) {
         let o = n[0];
-        typeof o == "string" && (o = y[o]);
+        typeof o == "string" && (o = w[o]);
         for (let a = 1; a < n.length; ) {
           let u = n[a++];
           if (u >= 0)
             h(u, o, n[a++]);
           else {
-            let f = n[a + -u];
+            let c = n[a + -u];
             for (let p = -u; p > 0; p--)
-              h(n[a++], o, f);
+              h(n[a++], o, c);
             a++;
           }
         }
       }
-    this.nodeSet = new M(e.map((n, o) => $.define({
+    this.nodeSet = new L(e.map((n, o) => M.define({
       name: o >= this.minRepeatTerm ? void 0 : n,
       id: o,
       props: i[o],
@@ -1072,10 +1072,10 @@ class w extends L {
     this.context = t.context, this.specializerSpecs = t.specialized || [], this.specialized = new Uint16Array(this.specializerSpecs.length);
     for (let n = 0; n < this.specializerSpecs.length; n++)
       this.specialized[n] = this.specializerSpecs[n].term;
-    this.specializers = this.specializerSpecs.map(B), this.states = x(t.states, Uint32Array), this.data = x(t.stateData), this.goto = x(t.goto), this.maxTerm = t.maxTerm, this.tokenizers = t.tokenizers.map((n) => typeof n == "number" ? new m(r, n) : n), this.topRules = t.topRules, this.dialects = t.dialects || {}, this.dynamicPrecedences = t.dynamicPrecedences || null, this.tokenPrecTable = t.tokenPrec, this.termNames = t.termNames || null, this.maxNode = this.nodeSet.types.length - 1, this.dialect = this.parseDialect(), this.top = this.topRules[Object.keys(this.topRules)[0]];
+    this.specializers = this.specializerSpecs.map(D), this.states = x(t.states, Uint32Array), this.data = x(t.stateData), this.goto = x(t.goto), this.maxTerm = t.maxTerm, this.tokenizers = t.tokenizers.map((n) => typeof n == "number" ? new m(r, n) : n), this.topRules = t.topRules, this.dialects = t.dialects || {}, this.dynamicPrecedences = t.dynamicPrecedences || null, this.tokenPrecTable = t.tokenPrec, this.termNames = t.termNames || null, this.maxNode = this.nodeSet.types.length - 1, this.dialect = this.parseDialect(), this.top = this.topRules[Object.keys(this.topRules)[0]];
   }
   createParse(t, e, s) {
-    let i = new K(this, t, e, s);
+    let i = new J(this, t, e, s);
     for (let h of this.wrappers)
       i = h(i, t, e, s);
     return i;
@@ -1111,14 +1111,14 @@ class w extends L {
       ), r; ; h += 3) {
         if ((r = s[h]) == 65535)
           if (s[h + 1] == 1)
-            r = s[h = k(s, h + 2)];
+            r = s[h = g(s, h + 2)];
           else {
             if (s[h + 1] == 2)
-              return k(s, h + 2);
+              return g(s, h + 2);
             break;
           }
         if (r == e || r == 0)
-          return k(s, h + 1);
+          return g(s, h + 1);
       }
     return 0;
   }
@@ -1160,10 +1160,10 @@ class w extends L {
     ); i == null; h += 3) {
       if (this.data[h] == 65535)
         if (this.data[h + 1] == 1)
-          h = k(this.data, h + 2);
+          h = g(this.data, h + 2);
         else
           break;
-      i = e(k(this.data, h + 1));
+      i = e(g(this.data, h + 1));
     }
     return i;
   }
@@ -1180,7 +1180,7 @@ class w extends L {
     ); ; s += 3) {
       if (this.data[s] == 65535)
         if (this.data[s + 1] == 1)
-          s = k(this.data, s + 2);
+          s = g(this.data, s + 2);
         else
           break;
       if ((this.data[s + 2] & 1) == 0) {
@@ -1196,7 +1196,7 @@ class w extends L {
   kept from the original parser.
   */
   configure(t) {
-    let e = Object.assign(Object.create(w.prototype), this);
+    let e = Object.assign(Object.create(T.prototype), this);
     if (t.props && (e.nodeSet = this.nodeSet.extend(...t.props)), t.top) {
       let s = this.topRules[t.top];
       if (!s)
@@ -1211,7 +1211,7 @@ class w extends L {
       if (!h)
         return s;
       let r = Object.assign(Object.assign({}, s), { external: h.to });
-      return e.specializers[i] = B(r), r;
+      return e.specializers[i] = D(r), r;
     })), t.contextTracker && (e.context = t.contextTracker), t.dialect && (e.dialect = this.parseDialect(t.dialect)), t.strict != null && (e.strict = t.strict), t.wrap && (e.wrappers = e.wrappers.concat(t.wrap)), t.bufferLength != null && (e.bufferLength = t.bufferLength), e;
   }
   /**
@@ -1265,20 +1265,20 @@ class w extends L {
       if (!s[h])
         for (let r = this.dialects[e[h]], n; (n = this.data[r++]) != 65535; )
           (i || (i = new Uint8Array(this.maxTerm + 1)))[n] = 1;
-    return new Q(t, s, i);
+    return new K(t, s, i);
   }
   /**
   Used by the output of the parser generator. Not available to
   user code. @hide
   */
   static deserialize(t) {
-    return new w(t);
+    return new T(t);
   }
 }
-function k(l, t) {
+function g(l, t) {
   return l[t] | l[t + 1] << 16;
 }
-function V(l) {
+function Q(l) {
   let t = null;
   for (let e of l) {
     let s = e.p.stoppedAt;
@@ -1290,7 +1290,7 @@ function V(l) {
   }
   return t;
 }
-function B(l) {
+function D(l) {
   if (l.external) {
     let t = l.extend ? 1 : 0;
     return (e, s) => l.external(e, s) << 1 | t;
@@ -1298,8 +1298,8 @@ function B(l) {
   return l.get;
 }
 export {
-  Z as C,
-  Y as E,
-  w as L,
-  H as a
+  H,
+  Z as Y,
+  X as Z,
+  T as w
 };