@dbml/parse 3.4.3 → 3.5.1

package/dist/dbml-parse.mjs

@@ -1,6 +1,6 @@
-import I from "lodash";
-var u = /* @__PURE__ */ ((t) => (t.SPACE = "<space>", t.TAB = "<tab>", t.NEWLINE = "<newline>", t.COMMA = "<comma>", t.LPAREN = "<lparen>", t.RPAREN = "<rparen>", t.LBRACE = "<lbrace>", t.RBRACE = "<rbrace>", t.LBRACKET = "<lbracket>", t.RBRACKET = "<rbracket>", t.LANGLE = "<langle>", t.RANGLE = "<rangle>", t.OP = "<op>", t.EOF = "<eof>", t.NUMERIC_LITERAL = "<number>", t.STRING_LITERAL = "<string>", t.COLOR_LITERAL = "<color>", t.FUNCTION_EXPRESSION = "<function-expression>", t.QUOTED_STRING = "<variable>", t.IDENTIFIER = "<identifier>", t.SEMICOLON = "<semicolon>", t.COLON = "<colon>", t.SINGLE_LINE_COMMENT = "<single-line-comment>", t.MULTILINE_COMMENT = "<multiline-comment>", t))(u || {});
-function jt(t) {
+import I, { findLastIndex as jt, last as it } from "lodash";
+var l = /* @__PURE__ */ ((t) => (t.SPACE = "<space>", t.TAB = "<tab>", t.NEWLINE = "<newline>", t.COMMA = "<comma>", t.LPAREN = "<lparen>", t.RPAREN = "<rparen>", t.LBRACE = "<lbrace>", t.RBRACE = "<rbrace>", t.LBRACKET = "<lbracket>", t.RBRACKET = "<rbracket>", t.LANGLE = "<langle>", t.RANGLE = "<rangle>", t.OP = "<op>", t.EOF = "<eof>", t.NUMERIC_LITERAL = "<number>", t.STRING_LITERAL = "<string>", t.COLOR_LITERAL = "<color>", t.FUNCTION_EXPRESSION = "<function-expression>", t.QUOTED_STRING = "<variable>", t.IDENTIFIER = "<identifier>", t.SEMICOLON = "<semicolon>", t.COLON = "<colon>", t.SINGLE_LINE_COMMENT = "<single-line-comment>", t.MULTILINE_COMMENT = "<multiline-comment>", t))(l || {});
+function Yt(t) {
   switch (t.kind) {
     case "<newline>":
     case "<space>":
@@ -45,13 +45,13 @@ class F {
   }
 }
 function bt(t) {
-  return t.trailingTrivia.find(({ kind: e }) => e === u.NEWLINE) !== void 0;
+  return t.trailingTrivia.find(({ kind: e }) => e === l.NEWLINE) !== void 0;
 }
 function ot(t, e) {
-  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || bt(t);
+  return e.leadingTrivia.find(({ kind: s }) => s === l.NEWLINE) !== void 0 || bt(t);
 }
 function Ce(t) {
-  return t.trailingTrivia.find(({ kind: e }) => e === u.SPACE) !== void 0;
+  return t.trailingTrivia.find(({ kind: e }) => e === l.SPACE) !== void 0;
 }
 function It(t) {
   return t.trailingTrivia.length === 0 ? t.end : It(I.last(t.trailingTrivia));
@@ -59,12 +59,12 @@ function It(t) {
 function Lt(t) {
   return t.leadingTrivia.length === 0 ? t.start : Lt(t.leadingTrivia[0]);
 }
-function Wt(t) {
-  return [u.SINGLE_LINE_COMMENT, u.MULTILINE_COMMENT].includes(
+function zt(t) {
+  return [l.SINGLE_LINE_COMMENT, l.MULTILINE_COMMENT].includes(
     t.kind
   );
 }
-class Yt {
+class Qt {
   constructor() {
     this.id = 0;
   }
@@ -108,7 +108,7 @@ class A extends x {
     alias: i,
     attributeList: r,
     bodyColon: a,
-    body: c
+    body: u
   }, p) {
     if (super(p, "<element-declaration>", [
       e,
@@ -117,10 +117,10 @@ class A extends x {
       i,
       r,
       a,
-      c
-    ]), c && a && !(c instanceof y || c instanceof A))
+      u
+    ]), u && a && !(u instanceof y || u instanceof A))
       throw new Error("If an element has a simple body, it must be a function application node");
-    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = c;
+    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = u;
   }
 }
 class $ extends x {
@@ -151,7 +151,7 @@ class q extends x {
     super(i, "<infix-expression>", [n, e, s]), this.op = e, this.leftExpression = n, this.rightExpression = s;
   }
 }
-class Pe extends x {
+class Ue extends x {
   constructor({ op: e, expression: n }, s) {
     super(s, "<postfix-expression>", [n, e]), this.op = e, this.expression = n;
   }
@@ -203,7 +203,7 @@ class J extends x {
     ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
 }
-class je extends J {
+class We extends J {
   constructor({
     groupOpenParen: e,
     expression: n,
@@ -243,9 +243,9 @@ class U extends x {
     super(n, "<primary-expression>", [e]), this.expression = e;
   }
 }
-class ke extends x {
+class xe extends x {
   constructor({ pre: e }, n) {
-    const s = F.create(u.SPACE, e.endPos, e.endPos, " ", !1);
+    const s = F.create(l.SPACE, e.endPos, e.endPos, " ", !1);
     super(n, "<dummy>", [s]);
   }
 }
@@ -264,7 +264,7 @@ function gt(t, e) {
     (i) => i !== null
   );
 }
-function os(t, e = !1) {
+function ls(t, e = !1) {
   return JSON.stringify(
     t,
     function(n, s) {
@@ -334,11 +334,11 @@ class w {
     return !1;
   }
 }
-var m = /* @__PURE__ */ ((t) => (t.Schema = "Schema", t.Table = "Table", t.Column = "Column", t.TableGroup = "TableGroup", t.TableGroupField = "TableGroup field", t.Enum = "Enum", t.EnumField = "Enum field", t.Note = "Note", t))(m || {});
-function We(t) {
+var T = /* @__PURE__ */ ((t) => (t.Schema = "Schema", t.Table = "Table", t.Column = "Column", t.TableGroup = "TableGroup", t.TableGroupField = "TableGroup field", t.Enum = "Enum", t.EnumField = "Enum field", t.Note = "Note", t))(T || {});
+function je(t) {
   return `Schema:${t}`;
 }
-function Se(t) {
+function Oe(t) {
   return `Table:${t}`;
 }
 function Ye(t) {
@@ -356,7 +356,7 @@ function qe(t) {
 function He(t) {
   return `TableGroup field:${t}`;
 }
-function zt(t) {
+function qt(t) {
   return `Note:${t}`;
 }
 function Ve(t, e) {
@@ -368,9 +368,9 @@ function Ve(t, e) {
     case "Enum field":
       return Qe(t);
     case "Schema":
-      return We(t);
+      return je(t);
     case "Table":
-      return Se(t);
+      return Oe(t);
     case "TableGroup":
       return qe(t);
     case "TableGroup field":
@@ -381,22 +381,22 @@ function Ve(t, e) {
 }
 function ie(t) {
   const [e, n] = t.split(":");
-  return Object.values(m).includes(e) ? new S({
+  return Object.values(T).includes(e) ? new S({
     name: n,
     kind: e
   }) : new w();
 }
-function Qt(t) {
+function Ht(t) {
   const e = ie(t).unwrap_or(void 0);
   if (!e)
     return !1;
   const { kind: n, name: s } = e;
   return n === "Schema" && s === "public";
 }
-function qt(t) {
+function Jt(t) {
   return [
-    We,
-    Se,
+    je,
+    Oe,
     ze,
     qe,
     Ye,
@@ -404,19 +404,19 @@ function qt(t) {
     He
   ].map((e) => e(t));
 }
-function Ue(t) {
+function Me(t) {
   return !!t.match(/(\p{L}|_|\p{M})/gu);
 }
-function Oe(t) {
+function Re(t) {
   const [e] = t;
   return e >= "0" && e <= "9";
 }
-function Ht(t) {
+function Zt(t) {
   const [e] = t;
-  return Oe(e) || Ue(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
+  return Re(e) || Me(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
 }
 function de(t) {
-  return Ue(t) || Oe(t);
+  return Me(t) || Re(t);
 }
 function ct(t, e) {
   const n = [], s = Math.min(t.length, e.length);
@@ -427,7 +427,7 @@ function ct(t, e) {
 function ge(t, e) {
   return t >= e.start && t < e.end;
 }
-class Jt {
+class Kt {
   constructor() {
     this.id = 0;
   }
@@ -443,12 +443,12 @@ class _t {
     this.references = [], this.id = n, this.symbolTable = e;
   }
 }
-class Zt {
+class en {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Kt {
+class tn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
@@ -458,25 +458,25 @@ class At {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class en {
+class nn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-class tn {
+class sn {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class nn {
+class rn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
 var o = /* @__PURE__ */ ((t) => (t[t.UNKNOWN_SYMBOL = 1e3] = "UNKNOWN_SYMBOL", t[t.UNEXPECTED_SYMBOL = 1001] = "UNEXPECTED_SYMBOL", t[t.UNEXPECTED_EOF = 1002] = "UNEXPECTED_EOF", t[t.UNEXPECTED_NEWLINE = 1003] = "UNEXPECTED_NEWLINE", t[t.UNKNOWN_TOKEN = 1004] = "UNKNOWN_TOKEN", t[t.UNEXPECTED_TOKEN = 1005] = "UNEXPECTED_TOKEN", t[t.UNEXPECTED_ELEMENT_DECLARATION = 1006] = "UNEXPECTED_ELEMENT_DECLARATION", t[t.MISSING_SPACES = 1007] = "MISSING_SPACES", t[t.UNKNOWN_PREFIX_OP = 1008] = "UNKNOWN_PREFIX_OP", t[t.INVALID_OPERAND = 1009] = "INVALID_OPERAND", t[t.EMPTY_ATTRIBUTE_NAME = 1010] = "EMPTY_ATTRIBUTE_NAME", t[t.INVALID_ESCAPE_SEQUENCE = 1011] = "INVALID_ESCAPE_SEQUENCE", t[t.INVALID_NAME = 3e3] = "INVALID_NAME", t[t.UNEXPECTED_NAME = 3001] = "UNEXPECTED_NAME", t[t.NAME_NOT_FOUND = 3002] = "NAME_NOT_FOUND", t[t.DUPLICATE_NAME = 3003] = "DUPLICATE_NAME", t[t.INVALID_ALIAS = 3004] = "INVALID_ALIAS", t[t.UNEXPECTED_ALIAS = 3005] = "UNEXPECTED_ALIAS", t[t.UNEXPECTED_SETTINGS = 3006] = "UNEXPECTED_SETTINGS", t[t.INVALID_SETTINGS = 3007] = "INVALID_SETTINGS", t[t.UNEXPECTED_SIMPLE_BODY = 3008] = "UNEXPECTED_SIMPLE_BODY", t[t.UNEXPECTED_COMPLEX_BODY = 3009] = "UNEXPECTED_COMPLEX_BODY", t[t.INVALID_TABLE_CONTEXT = 3010] = "INVALID_TABLE_CONTEXT", t[t.INVALID_TABLE_SETTING = 3011] = "INVALID_TABLE_SETTING", t[t.DUPLICATE_TABLE_SETTING = 3012] = "DUPLICATE_TABLE_SETTING", t[t.INVALID_TABLEGROUP_CONTEXT = 3013] = "INVALID_TABLEGROUP_CONTEXT", t[t.INVALID_TABLEGROUP_ELEMENT_NAME = 3014] = "INVALID_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_ELEMENT_NAME = 3015] = "DUPLICATE_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_FIELD_NAME = 3016] = "DUPLICATE_TABLEGROUP_FIELD_NAME", t[t.INVALID_TABLEGROUP_FIELD = 3017] = "INVALID_TABLEGROUP_FIELD", t[t.EMPTY_TABLE = 3018] = "EMPTY_TABLE", t[t.INVALID_COLUMN = 3019] = "INVALID_COLUMN", t[t.INVALID_COLUMN_NAME = 3020] = "INVALID_COLUMN_NAME", t[t.UNKNOWN_COLUMN_SETTING = 3021] = "UNKNOWN_COLUMN_SETTING", t[t.INVALID_COLUMN_TYPE = 3022] = "INVALID_COLUMN_TYPE", t[t.DUPLICATE_COLUMN_NAME = 3023] = "DUPLICATE_COLUMN_NAME", t[t.DUPLICATE_COLUMN_SETTING = 3024] = "DUPLICATE_COLUMN_SETTING", t[t.INVALID_COLUMN_SETTING_VALUE = 3025] = "INVALID_COLUMN_SETTING_VALUE", t[t.INVALID_ENUM_CONTEXT = 3026] = "INVALID_ENUM_CONTEXT", t[t.INVALID_ENUM_ELEMENT_NAME = 3027] = "INVALID_ENUM_ELEMENT_NAME", t[t.INVALID_ENUM_ELEMENT = 3028] = "INVALID_ENUM_ELEMENT", t[t.DUPLICATE_ENUM_ELEMENT_NAME = 3029] = "DUPLICATE_ENUM_ELEMENT_NAME", t[t.UNKNOWN_ENUM_ELEMENT_SETTING = 3030] = "UNKNOWN_ENUM_ELEMENT_SETTING", t[t.DUPLICATE_ENUM_ELEMENT_SETTING = 3031] = "DUPLICATE_ENUM_ELEMENT_SETTING", t[t.INVALID_ENUM_ELEMENT_SETTING = 3032] = "INVALID_ENUM_ELEMENT_SETTING", t[t.EMPTY_ENUM = 3033] = "EMPTY_ENUM", t[t.INVALID_REF_CONTEXT = 3034] = "INVALID_REF_CONTEXT", t[t.UNKNOWN_REF_SETTING = 3035] = "UNKNOWN_REF_SETTING", t[t.DUPLICATE_REF_SETTING = 3036] = "DUPLICATE_REF_SETTING", t[t.INVALID_REF_SETTING_VALUE = 3037] = "INVALID_REF_SETTING_VALUE", t[t.INVALID_REF_RELATIONSHIP = 3038] = "INVALID_REF_RELATIONSHIP", t[t.INVALID_REF_FIELD = 3039] = "INVALID_REF_FIELD", t[t.EMPTY_REF = 3040] = "EMPTY_REF", t[t.REF_REDEFINED = 3041] = "REF_REDEFINED", t[t.INVALID_NOTE_CONTEXT = 3042] = "INVALID_NOTE_CONTEXT", t[t.INVALID_NOTE = 3043] = "INVALID_NOTE", t[t.NOTE_REDEFINED = 3044] = "NOTE_REDEFINED", t[t.NOTE_CONTENT_REDEFINED = 3045] = "NOTE_CONTENT_REDEFINED", t[t.EMPTY_NOTE = 3046] = "EMPTY_NOTE", t[t.INVALID_INDEXES_CONTEXT = 3047] = "INVALID_INDEXES_CONTEXT", t[t.INVALID_INDEXES_FIELD = 3048] = "INVALID_INDEXES_FIELD", t[t.INVALID_INDEX = 3049] = "INVALID_INDEX", t[t.UNKNOWN_INDEX_SETTING = 3050] = "UNKNOWN_INDEX_SETTING", t[t.DUPLICATE_INDEX_SETTING = 3051] = "DUPLICATE_INDEX_SETTING", t[t.UNEXPECTED_INDEX_SETTING_VALUE = 3052] = "UNEXPECTED_INDEX_SETTING_VALUE", t[t.INVALID_INDEX_SETTING_VALUE = 3053] = "INVALID_INDEX_SETTING_VALUE", t[t.INVALID_PROJECT_CONTEXT = 3054] = "INVALID_PROJECT_CONTEXT", t[t.PROJECT_REDEFINED = 3055] = "PROJECT_REDEFINED", t[t.INVALID_PROJECT_FIELD = 3056] = "INVALID_PROJECT_FIELD", t[t.INVALID_CUSTOM_CONTEXT = 3057] = "INVALID_CUSTOM_CONTEXT", t[t.INVALID_CUSTOM_ELEMENT_VALUE = 3058] = "INVALID_CUSTOM_ELEMENT_VALUE", t[t.INVALID_ELEMENT_IN_SIMPLE_BODY = 3059] = "INVALID_ELEMENT_IN_SIMPLE_BODY", t[t.BINDING_ERROR = 4e3] = "BINDING_ERROR", t[t.UNSUPPORTED = 5e3] = "UNSUPPORTED", t[t.CIRCULAR_REF = 5001] = "CIRCULAR_REF", t[t.SAME_ENDPOINT = 5002] = "SAME_ENDPOINT", t[t.UNEQUAL_FIELDS_BINARY_REF = 5003] = "UNEQUAL_FIELDS_BINARY_REF", t[t.CONFLICTING_SETTING = 5004] = "CONFLICTING_SETTING", t[t.TABLE_REAPPEAR_IN_TABLEGROUP = 5005] = "TABLE_REAPPEAR_IN_TABLEGROUP", t))(o || {});
-class l extends Error {
+class c extends Error {
   constructor(e, n, s) {
-    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, l.prototype);
+    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, c.prototype);
   }
 }
 class B {
@@ -497,7 +497,7 @@ class B {
     return new B(e(this.value), this.errors);
   }
 }
-function sn(t, e, n) {
+function an(t, e, n) {
   if (!t || !me(t) || e.length === 0)
     return new w();
   const s = [...e], i = Ge(t).unwrap(), r = s.pop();
@@ -529,47 +529,47 @@ function sn(t, e, n) {
   ) : new w();
 }
 function lt(t) {
-  return t.kind === u.IDENTIFIER && t.value === "as";
+  return t.kind === l.IDENTIFIER && t.value === "as";
 }
-function E(t) {
-  t && (t instanceof F ? rn(t) : an(t));
+function N(t) {
+  t && (t instanceof F ? on(t) : cn(t));
 }
-function rn(t) {
-  t.kind !== u.EOF && (t.isInvalid = !0);
+function on(t) {
+  t.kind !== l.EOF && (t.isInvalid = !0);
 }
-function an(t) {
+function cn(t) {
   if (t instanceof A)
-    E(t.type), E(t.name), E(t.as), E(t.alias), E(t.bodyColon), E(t.attributeList), E(t.body);
+    N(t.type), N(t.name), N(t.as), N(t.alias), N(t.bodyColon), N(t.attributeList), N(t.body);
   else if (t instanceof $)
-    t.identifiers.forEach(E);
+    t.identifiers.forEach(N);
   else if (t instanceof se)
-    E(t.name), E(t.colon), E(t.value);
+    N(t.name), N(t.colon), N(t.value);
   else if (t instanceof Q)
-    E(t.op), E(t.expression);
+    N(t.op), N(t.expression);
   else if (t instanceof q)
-    E(t.leftExpression), E(t.op), E(t.rightExpression);
-  else if (t instanceof Pe)
-    E(t.op), E(t.expression);
+    N(t.leftExpression), N(t.op), N(t.rightExpression);
+  else if (t instanceof Ue)
+    N(t.op), N(t.expression);
   else if (t instanceof ne)
-    E(t.blockOpenBrace), t.body.forEach(E), E(t.blockCloseBrace);
+    N(t.blockOpenBrace), t.body.forEach(N), N(t.blockCloseBrace);
   else if (t instanceof D)
-    E(t.listOpenBracket), t.commaList.forEach(E), t.elementList.forEach(E), E(t.listCloseBracket);
+    N(t.listOpenBracket), t.commaList.forEach(N), t.elementList.forEach(N), N(t.listCloseBracket);
   else if (t instanceof J)
-    E(t.tupleOpenParen), t.commaList.forEach(E), t.elementList.forEach(E), E(t.tupleCloseParen);
+    N(t.tupleOpenParen), t.commaList.forEach(N), t.elementList.forEach(N), N(t.tupleCloseParen);
   else if (t instanceof H)
-    E(t.callee), E(t.argumentList);
+    N(t.callee), N(t.argumentList);
   else if (t instanceof y)
-    E(t.callee), t.args.forEach(E);
+    N(t.callee), t.args.forEach(N);
   else if (t instanceof U)
-    E(t.expression);
+    N(t.expression);
   else if (t instanceof te)
-    E(t.value);
+    N(t.value);
   else if (t instanceof Z)
-    E(t.variable);
+    N(t.variable);
   else if (t instanceof be)
-    E(t.literal);
+    N(t.literal);
   else
-    throw t instanceof je ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
+    throw t instanceof We ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
 }
 function vt(t) {
   return !!(t != null && t.isInvalid);
@@ -577,7 +577,7 @@ function vt(t) {
 function P(...t) {
   return t.filter((e) => e !== void 0);
 }
-function on(t) {
+function ln(t) {
   if (t instanceof G)
     return P(...t.body, t.eof);
   if (t instanceof A)
@@ -602,7 +602,7 @@ function on(t) {
     return P(t.op, t.expression);
   if (t instanceof q)
     return P(t.leftExpression, t.op, t.rightExpression);
-  if (t instanceof Pe)
+  if (t instanceof Ue)
     return P(t.expression, t.op);
   if (t instanceof te)
     return P(t.value);
@@ -631,21 +631,21 @@ function on(t) {
       t.array,
       t.indexer
     );
-  throw t instanceof je ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
+  throw t instanceof We ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
 function Ge(t) {
   return M(t) ? new S(t.expression.variable) : new w();
 }
-function W(t) {
+function j(t) {
   var e;
-  return t instanceof U && (t.expression instanceof Z && t.expression.variable instanceof F && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
+  return t instanceof U && (t.expression instanceof Z && t.expression.variable instanceof F && t.expression.variable.kind === l.QUOTED_STRING || t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === l.STRING_LITERAL);
 }
 function M(t) {
   return t instanceof U && t.expression instanceof Z && t.expression.variable instanceof F;
 }
 function me(t) {
   var e;
-  return t instanceof U && t.expression instanceof Z && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
+  return t instanceof U && t.expression instanceof Z && ((e = t.expression.variable) == null ? void 0 : e.kind) === l.IDENTIFIER;
 }
 function Je(t) {
   var e;
@@ -657,7 +657,7 @@ function Te(t) {
   const e = t.identifiers.map((n) => n.value).join(" ");
   return e === "" ? new w() : new S(e);
 }
-class cn {
+class un {
   // list of errors during lexing
   constructor(e) {
     this.start = {
@@ -706,50 +706,50 @@ class cn {
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(F.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
+    return this.scanTokens(), this.tokens.push(F.create(l.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
   }
   scanTokens() {
     for (; !this.isAtEnd(); ) {
       const e = this.advance();
       switch (e) {
         case " ":
-          this.addToken(u.SPACE);
+          this.addToken(l.SPACE);
           break;
         case "\r":
           break;
         case `
 `:
-          this.addToken(u.NEWLINE);
+          this.addToken(l.NEWLINE);
           break;
         case "	":
-          this.addToken(u.TAB);
+          this.addToken(l.TAB);
           break;
         case ",":
-          this.addToken(u.COMMA);
+          this.addToken(l.COMMA);
           break;
         case "(":
-          this.addToken(u.LPAREN);
+          this.addToken(l.LPAREN);
           break;
         case ")":
-          this.addToken(u.RPAREN);
+          this.addToken(l.RPAREN);
           break;
         case "[":
-          this.addToken(u.LBRACKET);
+          this.addToken(l.LBRACKET);
           break;
         case "]":
-          this.addToken(u.RBRACKET);
+          this.addToken(l.RBRACKET);
           break;
         case "{":
-          this.addToken(u.LBRACE);
+          this.addToken(l.LBRACE);
           break;
         case "}":
-          this.addToken(u.RBRACE);
+          this.addToken(l.RBRACE);
           break;
         case ";":
-          this.addToken(u.SEMICOLON);
+          this.addToken(l.SEMICOLON);
           break;
         case ":":
-          this.addToken(u.COLON);
+          this.addToken(l.COLON);
           break;
         case "'":
           this.match("''") ? this.multilineStringLiteral() : this.singleLineStringLiteral();
@@ -771,19 +771,19 @@ class cn {
             this.operator();
             break;
           }
-          if (Ue(e)) {
+          if (Me(e)) {
             this.identifier();
             break;
           }
-          if (Oe(e)) {
+          if (Re(e)) {
             this.numericLiteralOrIdentifier();
             break;
           }
-          this.addToken(u.OP, !0), this.errors.push(
-            new l(
+          this.addToken(l.OP, !0), this.errors.push(
+            new c(
               o.UNKNOWN_SYMBOL,
               `Unexpected token '${e}'`,
-              this.createToken(u.OP, !0)
+              this.createToken(l.OP, !0)
             )
           );
           break;
@@ -795,7 +795,7 @@ class cn {
     let e = !0, n = [], s;
     const i = [];
     for (const r of this.tokens)
-      jt(r) ? (n.push(r), r.kind === u.NEWLINE && s && (s.trailingTrivia = n, e = !0, s = void 0, n = [])) : (e ? r.leadingTrivia = n : s.trailingTrivia = n, i.push(r), n = [], s = r, e = !1);
+      Yt(r) ? (n.push(r), r.kind === l.NEWLINE && s && (s.trailingTrivia = n, e = !0, s = void 0, n = [])) : (e ? r.leadingTrivia = n : s.trailingTrivia = n, i.push(r), n = [], s = r, e = !1);
     this.tokens = i;
   }
   gatherInvalid() {
@@ -820,14 +820,14 @@ class cn {
     // Whether to interpret '\' as a backlash
     consumeStopSequence: a = !0
   }) {
-    let c = "";
+    let u = "";
     for (; !this.isAtEnd() && (s || !this.check(`
 `)) && !this.check(n); )
-      this.peek() === "\\" && !r ? (this.advance(), c += this.escapedString()) : c += this.advance();
+      this.peek() === "\\" && !r ? (this.advance(), u += this.escapedString()) : u += this.advance();
     if (this.isAtEnd() && !i) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new l(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
+        new c(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
       );
       return;
     }
@@ -835,7 +835,7 @@ class cn {
 `) && !s) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new l(
+        new c(
           o.UNEXPECTED_NEWLINE,
           "Invalid newline encountered while parsing",
           p
@@ -843,38 +843,38 @@ class cn {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(F.create(e, this.start, this.current, c, !1));
+    a && this.match(n), this.tokens.push(F.create(e, this.start, this.current, u, !1));
   }
   singleLineStringLiteral() {
-    this.consumeUntil(u.STRING_LITERAL, "'", {
+    this.consumeUntil(l.STRING_LITERAL, "'", {
       allowNewline: !1,
       allowEof: !1,
       raw: !1
     });
   }
   multilineStringLiteral() {
-    this.consumeUntil(u.STRING_LITERAL, "'''", {
+    this.consumeUntil(l.STRING_LITERAL, "'''", {
       allowNewline: !0,
       allowEof: !1,
       raw: !1
     });
   }
   functionExpression() {
-    this.consumeUntil(u.FUNCTION_EXPRESSION, "`", {
+    this.consumeUntil(l.FUNCTION_EXPRESSION, "`", {
       allowNewline: !1,
       allowEof: !1,
       raw: !0
     });
   }
   quotedVariable() {
-    this.consumeUntil(u.QUOTED_STRING, '"', {
+    this.consumeUntil(l.QUOTED_STRING, '"', {
       allowNewline: !1,
       allowEof: !1,
       raw: !1
     });
   }
   singleLineComment() {
-    this.consumeUntil(u.SINGLE_LINE_COMMENT, `
+    this.consumeUntil(l.SINGLE_LINE_COMMENT, `
 `, {
       allowNewline: !0,
       allowEof: !0,
@@ -883,7 +883,7 @@ class cn {
     });
   }
   multilineComment() {
-    this.consumeUntil(u.MULTILINE_COMMENT, "*/", {
+    this.consumeUntil(l.MULTILINE_COMMENT, "*/", {
       allowNewline: !0,
       allowEof: !1,
       raw: !0
@@ -892,46 +892,46 @@ class cn {
   identifier() {
     for (; !this.isAtEnd() && de(this.peek()); )
       this.advance();
-    this.addToken(u.IDENTIFIER);
+    this.addToken(l.IDENTIFIER);
   }
   operator() {
     for (; rt(this.peek()); )
       this.advance();
-    this.addToken(u.OP);
+    this.addToken(l.OP);
   }
   // we accept identifiers starting with digits but must contain at least one char or underscore
   numericLiteralOrIdentifier() {
     let e = 0;
     if (this.isAtEnd())
-      return this.addToken(u.NUMERIC_LITERAL);
+      return this.addToken(l.NUMERIC_LITERAL);
     for (; !this.isAtEnd(); ) {
       const n = this.check(".");
       if (e += n ? 1 : 0, e > 1)
         break;
       if (!n && this.current.offset === this.text.length - 1)
-        return this.advance(), this.addToken(u.NUMERIC_LITERAL);
+        return this.advance(), this.addToken(l.NUMERIC_LITERAL);
       if (!n && !de(this.peek()))
-        return this.addToken(u.NUMERIC_LITERAL);
-      if (!n && !Oe(this.peek()))
+        return this.addToken(l.NUMERIC_LITERAL);
+      if (!n && !Re(this.peek()))
         break;
       this.advance();
     }
     if (e > 0) {
       for (; !this.isAtEnd() && (this.check(".") || de(this.peek())); )
         this.advance();
-      const n = this.createToken(u.NUMERIC_LITERAL, !0);
-      this.tokens.push(n), this.errors.push(new l(o.UNKNOWN_TOKEN, "Invalid number", n));
+      const n = this.createToken(l.NUMERIC_LITERAL, !0);
+      this.tokens.push(n), this.errors.push(new c(o.UNKNOWN_TOKEN, "Invalid number", n));
     } else {
       for (; !this.isAtEnd() && de(this.peek()); )
         this.advance();
-      const n = this.createToken(u.IDENTIFIER, !1);
+      const n = this.createToken(l.IDENTIFIER, !1);
       this.tokens.push(n);
     }
   }
   colorLiteral() {
     for (; !this.isAtEnd() && de(this.peek()); )
       this.advance();
-    this.addToken(u.COLOR_LITERAL);
+    this.addToken(l.COLOR_LITERAL);
   }
   escapedString() {
     const e = { column: this.current.column - 1, offset: this.current.offset - 1, line: this.current.line };
@@ -971,7 +971,7 @@ class cn {
         let n = "";
         for (let s = 0; s <= 3; s += 1) {
           if (this.isAtEnd() || !de(this.peek()))
-            return this.errors.push(new l(o.INVALID_ESCAPE_SEQUENCE, `Invalid unicode escape sequence '\\u${n}', only unicode escape sequences of the form '\\uHHHH' where H is a hexadecimal number are allowed`, F.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
+            return this.errors.push(new c(o.INVALID_ESCAPE_SEQUENCE, `Invalid unicode escape sequence '\\u${n}', only unicode escape sequences of the form '\\uHHHH' where H is a hexadecimal number are allowed`, F.create(l.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
           n += this.advance();
         }
         return String.fromCharCode(parseInt(n, 16));
@@ -981,8 +981,8 @@ class cn {
     }
   }
 }
-var xe = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(xe || {});
-class ln {
+var Se = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(Se || {});
+class hn {
   constructor() {
     this.stack = [], this.numberOfNestedLParens = 0, this.numberOfNestedLBrackets = 0, this.numberOfNestedLBraces = 0;
   }
@@ -1023,7 +1023,7 @@ class ln {
     if (!(this.numberOfNestedLBraces <= 0 && this.numberOfNestedLBrackets <= 0 && this.numberOfNestedLParens <= 0))
       for (let s = n; s < e.length - 1; s += 1)
         switch (e[s].kind) {
-          case u.COMMA:
+          case l.COMMA:
             if (this.isWithinGroupExpressionContext() || this.isWithinListExpressionContext())
               return [...this.stack].reverse().find(
                 (r) => [
@@ -1033,22 +1033,22 @@ class ln {
                 ].includes(r)
               );
             break;
-          case u.RPAREN:
+          case l.RPAREN:
             if (this.isWithinGroupExpressionContext())
               return 1;
             break;
-          case u.RBRACE:
+          case l.RBRACE:
             if (this.isWithinBlockExpressionContext())
               return 2;
             break;
-          case u.RBRACKET:
+          case l.RBRACKET:
             if (this.isWithinListExpressionContext())
               return 0;
             break;
         }
   }
 }
-class un {
+class fn {
   constructor(e) {
     this.generator = e;
   }
@@ -1061,29 +1061,29 @@ class d {
     this.token = e, this.partialNode = n, this.handlerContext = s;
   }
 }
-class hn {
+class pn {
   constructor(e, n) {
-    this.current = 0, this.errors = [], this.contextStack = new ln(), this.synchronizeProgram = () => {
+    this.current = 0, this.errors = [], this.contextStack = new hn(), this.synchronizeProgram = () => {
       const s = this.peek();
-      s.kind !== u.EOF ? E(this.advance()) : (E(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
+      s.kind !== l.EOF ? N(this.advance()) : (N(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (lt(s) || this.check(l.COLON, l.LBRACE, l.LBRACKET))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
     }, this.synchronizeElementDeclarationAlias = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (this.check(l.COLON, l.LBRACE, l.LBRACKET))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
-    }, this.blockExpression = this.contextStack.withContextDo(xe.BlockExpression, () => {
+    }, this.blockExpression = this.contextStack.withContextDo(Se.BlockExpression, () => {
       const s = { body: [] }, i = () => this.nodeFactory.create(ne, s);
       try {
-        this.consume("Expect an opening brace '{'", u.LBRACE), s.blockOpenBrace = this.previous();
+        this.consume("Expect an opening brace '{'", l.LBRACE), s.blockOpenBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1091,7 +1091,7 @@ class hn {
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeBlock();
       }
-      for (; !this.isAtEnd() && !this.check(u.RBRACE); )
+      for (; !this.isAtEnd() && !this.check(l.RBRACE); )
         try {
           s.body.push(this.canBeField() ? this.fieldDeclaration() : this.expression());
         } catch (r) {
@@ -1102,7 +1102,7 @@ class hn {
           this.synchronizeBlock();
         }
       try {
-        this.consume("Expect a closing brace '}'", u.RBRACE), s.blockCloseBrace = this.previous();
+        this.consume("Expect a closing brace '}'", l.RBRACE), s.blockCloseBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1112,21 +1112,21 @@ class hn {
       }
       return i();
     }), this.synchronizeBlock = () => {
-      if (!this.check(u.RBRACE))
-        for (E(this.advance()); !this.isAtEnd(); ) {
+      if (!this.check(l.RBRACE))
+        for (N(this.advance()); !this.isAtEnd(); ) {
           const s = this.peek();
-          if (this.check(u.RBRACE) || ot(this.previous(), s))
+          if (this.check(l.RBRACE) || ot(this.previous(), s))
             break;
-          E(s), this.advance();
+          N(s), this.advance();
         }
-    }, this.tupleExpression = this.contextStack.withContextDo(xe.GroupExpression, () => {
-      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(je, {
+    }, this.tupleExpression = this.contextStack.withContextDo(Se.GroupExpression, () => {
+      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(We, {
         groupOpenParen: s.tupleOpenParen,
         groupCloseParen: s.tupleCloseParen,
         expression: s.elementList[0]
       }), r = () => this.nodeFactory.create(J, s);
       try {
-        this.consume("Expect an opening parenthesis '('", u.LPAREN), s.tupleOpenParen = this.previous();
+        this.consume("Expect an opening parenthesis '('", l.LPAREN), s.tupleOpenParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
@@ -1134,7 +1134,7 @@ class hn {
           throw new d(a.token, r(), a.handlerContext);
         this.synchronizeTuple();
       }
-      if (!this.isAtEnd() && !this.check(u.RPAREN))
+      if (!this.isAtEnd() && !this.check(l.RPAREN))
         try {
           s.elementList.push(this.normalExpression());
         } catch (a) {
@@ -1144,9 +1144,9 @@ class hn {
             throw new d(a.token, i(), a.handlerContext);
           this.synchronizeTuple();
         }
-      for (; !this.isAtEnd() && !this.check(u.RPAREN); )
+      for (; !this.isAtEnd() && !this.check(l.RPAREN); )
         try {
-          this.consume("Expect a comma ','", u.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.normalExpression());
+          this.consume("Expect a comma ','", l.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.normalExpression());
         } catch (a) {
           if (!(a instanceof d))
             throw a;
@@ -1155,7 +1155,7 @@ class hn {
           this.synchronizeTuple();
         }
       try {
-        this.consume("Expect a closing parenthesis ')'", u.RPAREN), s.tupleCloseParen = this.previous();
+        this.consume("Expect a closing parenthesis ')'", l.RPAREN), s.tupleCloseParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
@@ -1167,14 +1167,14 @@ class hn {
     }), this.synchronizeTuple = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(u.RPAREN, u.COMMA))
+        if (this.check(l.RPAREN, l.COMMA))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
-    }, this.listExpression = this.contextStack.withContextDo(xe.ListExpression, () => {
+    }, this.listExpression = this.contextStack.withContextDo(Se.ListExpression, () => {
       const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(D, s);
       try {
-        this.consume("Expect an opening bracket '['", u.LBRACKET), s.listOpenBracket = this.previous();
+        this.consume("Expect an opening bracket '['", l.LBRACKET), s.listOpenBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1182,7 +1182,7 @@ class hn {
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeList();
       }
-      if (!this.isAtEnd() && !this.check(u.RBRACKET))
+      if (!this.isAtEnd() && !this.check(l.RBRACKET))
         try {
           s.elementList.push(this.attribute());
         } catch (r) {
@@ -1192,9 +1192,9 @@ class hn {
             throw new d(r.token, i(), r.handlerContext);
           this.synchronizeList();
         }
-      for (; !this.isAtEnd() && !this.check(u.RBRACKET); )
+      for (; !this.isAtEnd() && !this.check(l.RBRACKET); )
         try {
-          this.consume("Expect a comma ','", u.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.attribute());
+          this.consume("Expect a comma ','", l.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.attribute());
         } catch (r) {
           if (!(r instanceof d))
             throw r;
@@ -1203,7 +1203,7 @@ class hn {
           this.synchronizeList();
         }
       try {
-        this.consume("Expect a closing bracket ']'", u.RBRACKET), s.listCloseBracket = this.previous();
+        this.consume("Expect a closing bracket ']'", l.RBRACKET), s.listCloseBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1215,28 +1215,28 @@ class hn {
     }), this.synchronizeList = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(u.COMMA, u.RBRACKET))
+        if (this.check(l.COMMA, l.RBRACKET))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
     }, this.synchronizeAttributeName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(u.COMMA, u.RBRACKET, u.COLON))
+        if (this.check(l.COMMA, l.RBRACKET, l.COLON))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
     }, this.synchronizeAttributeValue = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(u.COMMA, u.RBRACKET))
+        if (this.check(l.COMMA, l.RBRACKET))
           break;
-        E(s), this.advance();
+        N(s), this.advance();
       }
-    }, this.tokens = e, this.nodeFactory = new un(n);
+    }, this.tokens = e, this.nodeFactory = new fn(n);
   }
   isAtEnd() {
-    return this.current >= this.tokens.length || this.tokens[this.current].kind === u.EOF;
+    return this.current >= this.tokens.length || this.tokens[this.current].kind === l.EOF;
   }
   advance() {
     return this.isAtEnd() ? I.last(this.tokens) : this.tokens[this.current++];
@@ -1271,8 +1271,8 @@ class hn {
   // Return whether the token of one of the listed kinds are eventually reached
   discardUntil(e, ...n) {
     if (this.isAtEnd() || !this.check(...n)) {
-      for (E(this.peek()), this.logError(this.advance(), o.UNEXPECTED_TOKEN, e); !this.isAtEnd() && !this.check(...n); )
-        E(this.advance());
+      for (N(this.peek()), this.logError(this.advance(), o.UNEXPECTED_TOKEN, e); !this.isAtEnd() && !this.check(...n); )
+        N(this.advance());
       return !this.isAtEnd();
     }
     return !0;
@@ -1310,11 +1310,11 @@ class hn {
   elementDeclaration() {
     const e = {}, n = () => this.nodeFactory.create(A, e);
     try {
-      this.consume("Expect an identifier", u.IDENTIFIER), e.type = this.previous();
+      this.consume("Expect an identifier", l.IDENTIFIER), e.type = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.type = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
-    if (!this.check(u.COLON, u.LBRACE, u.LBRACKET))
+    if (!this.check(l.COLON, l.LBRACE, l.LBRACKET))
       try {
         e.name = this.normalExpression();
       } catch (s) {
@@ -1325,7 +1325,7 @@ class hn {
         this.synchronizeElementDeclarationName();
       }
     if (lt(this.peek()))
-      if (e.as = this.advance(), this.check(u.COLON, u.LBRACE, u.LBRACKET))
+      if (e.as = this.advance(), this.check(l.COLON, l.LBRACE, l.LBRACKET))
         this.logError(this.peek(), o.UNEXPECTED_TOKEN, "Expect an alias");
       else
         try {
@@ -1338,21 +1338,21 @@ class hn {
           this.synchronizeElementDeclarationAlias();
         }
     try {
-      e.attributeList = this.check(u.LBRACKET) ? this.listExpression() : void 0;
+      e.attributeList = this.check(l.LBRACKET) ? this.listExpression() : void 0;
     } catch (s) {
       throw s instanceof d ? (e.attributeList = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     if (!this.discardUntil(
       "Expect an opening brace '{' or a colon ':'",
-      u.LBRACE,
-      u.COLON
+      l.LBRACE,
+      l.COLON
     ))
       return n();
     try {
-      if (this.match(u.COLON)) {
+      if (this.match(l.COLON)) {
         e.bodyColon = this.previous();
         const s = this.expression();
-        s instanceof A ? (E(s), this.logError(s, o.UNEXPECTED_ELEMENT_DECLARATION, "An element's simple body must not be an element declaration")) : e.body = s;
+        s instanceof A ? (N(s), this.logError(s, o.UNEXPECTED_ELEMENT_DECLARATION, "An element's simple body must not be an element declaration")) : e.body = s;
       } else
         e.body = this.blockExpression();
     } catch (s) {
@@ -1369,18 +1369,18 @@ class hn {
   fieldDeclaration() {
     const e = {}, n = () => this.nodeFactory.create(A, e);
     try {
-      this.consume("Expect an identifier", u.IDENTIFIER), e.type = this.previous();
+      this.consume("Expect an identifier", l.IDENTIFIER), e.type = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.type = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     try {
-      this.consume("Expect a colon ':'", u.COLON), e.bodyColon = this.previous();
+      this.consume("Expect a colon ':'", l.COLON), e.bodyColon = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.bodyColon = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     try {
       const s = this.expression();
-      s instanceof A ? this.errors.push(new l(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
+      s instanceof A ? this.errors.push(new c(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
     } catch (s) {
       throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
@@ -1388,7 +1388,7 @@ class hn {
   }
   /* Parsing any ExpressionNode, including non-NormalExpression */
   expression() {
-    const e = { args: [] }, n = () => sn(e.callee, e.args, this.nodeFactory).unwrap_or(
+    const e = { args: [] }, n = () => an(e.callee, e.args, this.nodeFactory).unwrap_or(
       this.nodeFactory.create(y, e)
     );
     try {
@@ -1413,7 +1413,7 @@ class hn {
     if (this.isAtEnd() || bt(this.previous()))
       return !0;
     const e = this.peek().kind;
-    return e === u.RBRACE || e === u.RBRACKET || e === u.RPAREN || e === u.COMMA || e === u.COLON;
+    return e === l.RBRACE || e === l.RBRACKET || e === l.RPAREN || e === l.COMMA || e === l.COLON;
   }
   normalExpression() {
     return this.expression_bp(0);
@@ -1423,7 +1423,7 @@ class hn {
     let n = this.leftExpression_bp();
     for (; !this.isAtEnd(); ) {
       const s = this.peek();
-      if (s.kind === u.LPAREN) {
+      if (s.kind === l.LPAREN) {
         const { left: i } = ut(s);
         if (i < e || // When '(' is encountered,
         // consider it part of another expression if
@@ -1442,7 +1442,7 @@ class hn {
             argumentList: r.partialNode
           }), new d(r.token, n, r.handlerContext)) : r;
         }
-      } else if (s.kind === u.LBRACKET) {
+      } else if (s.kind === l.LBRACKET) {
         if (Ce(this.previous()))
           break;
         try {
@@ -1461,12 +1461,12 @@ class hn {
         if (r.left !== null) {
           if (r.left <= e)
             break;
-          this.advance(), n = this.nodeFactory.create(Pe, {
+          this.advance(), n = this.nodeFactory.create(Ue, {
             expression: n,
             op: i
           });
         } else {
-          const a = pn(i);
+          const a = En(i);
           if (a.left === null || a.left <= e)
             break;
           this.advance();
@@ -1476,12 +1476,12 @@ class hn {
               op: i,
               rightExpression: i.value === "." ? this.extractOperand() : this.expression_bp(a.right)
             });
-          } catch (c) {
-            throw c instanceof d ? (n = this.nodeFactory.create(q, {
+          } catch (u) {
+            throw u instanceof d ? (n = this.nodeFactory.create(q, {
               leftExpression: n,
               op: i,
-              rightExpression: c.partialNode
-            }), new d(c.token, n, c.handlerContext)) : c;
+              rightExpression: u.partialNode
+            }), new d(u.token, n, u.handlerContext)) : u;
           }
         }
       } else
@@ -1494,7 +1494,7 @@ class hn {
     if (at(this.peek())) {
       const n = {};
       n.op = this.peek();
-      const s = En(n.op);
+      const s = mn(n.op);
       if (s.right === null)
         throw this.logError(
           n.op,
@@ -1502,7 +1502,7 @@ class hn {
           `Unexpected '${n.op.value}' in an expression`
         ), new d(
           n.op,
-          this.nodeFactory.create(ke, { pre: n.op }),
+          this.nodeFactory.create(xe, { pre: n.op }),
           this.contextStack.findHandlerContext(this.tokens, this.current)
         );
       this.advance();
@@ -1516,10 +1516,10 @@ class hn {
         )) : i;
       }
       e = this.nodeFactory.create(Q, n);
-    } else if (e = this.extractOperand(), e instanceof ke)
+    } else if (e = this.extractOperand(), e instanceof xe)
       throw new d(
         this.peek(),
-        this.nodeFactory.create(ke, { pre: this.peek() }),
+        this.nodeFactory.create(xe, { pre: this.peek() }),
         this.contextStack.findHandlerContext(this.tokens, this.current)
       );
     return e;
@@ -1530,12 +1530,12 @@ class hn {
   // e.g { ... }
   extractOperand() {
     return this.check(
-      u.NUMERIC_LITERAL,
-      u.STRING_LITERAL,
-      u.COLOR_LITERAL,
-      u.QUOTED_STRING,
-      u.IDENTIFIER
-    ) ? this.primaryExpression() : this.check(u.FUNCTION_EXPRESSION) ? this.functionExpression() : this.check(u.LBRACKET) ? this.listExpression() : this.check(u.LBRACE) ? this.blockExpression() : this.check(u.LPAREN) ? this.tupleExpression() : (this.peek().kind === u.EOF ? this.logError(
+      l.NUMERIC_LITERAL,
+      l.STRING_LITERAL,
+      l.COLOR_LITERAL,
+      l.QUOTED_STRING,
+      l.IDENTIFIER
+    ) ? this.primaryExpression() : this.check(l.FUNCTION_EXPRESSION) ? this.functionExpression() : this.check(l.LBRACKET) ? this.listExpression() : this.check(l.LBRACE) ? this.blockExpression() : this.check(l.LPAREN) ? this.tupleExpression() : (this.peek().kind === l.EOF ? this.logError(
       this.peek(),
       o.UNEXPECTED_EOF,
       "Unexpected EOF"
@@ -1543,13 +1543,13 @@ class hn {
       this.peek(),
       o.INVALID_OPERAND,
       `Invalid start of operand "${this.peek().value}"`
-    ), this.nodeFactory.create(ke, { pre: this.previous() }));
+    ), this.nodeFactory.create(xe, { pre: this.previous() }));
   }
   /* Parsing FunctionExpression */
   functionExpression() {
     const e = {};
     try {
-      this.consume("Expect a function expression", u.FUNCTION_EXPRESSION), e.value = this.previous();
+      this.consume("Expect a function expression", l.FUNCTION_EXPRESSION), e.value = this.previous();
     } catch (n) {
       throw n instanceof d ? (e.value = n.partialNode, new d(
         n.token,
@@ -1560,19 +1560,19 @@ class hn {
     return this.nodeFactory.create(te, e);
   }
   canBeField() {
-    return this.peek().kind === u.IDENTIFIER && this.peek(1).kind === u.COLON;
+    return this.peek().kind === l.IDENTIFIER && this.peek(1).kind === l.COLON;
   }
   /* Parsing PrimaryExpression */
   primaryExpression() {
     if (this.match(
-      u.COLOR_LITERAL,
-      u.STRING_LITERAL,
-      u.NUMERIC_LITERAL
+      l.COLOR_LITERAL,
+      l.STRING_LITERAL,
+      l.NUMERIC_LITERAL
     ))
       return this.nodeFactory.create(U, {
         expression: this.nodeFactory.create(be, { literal: this.previous() })
       });
-    if (this.match(u.QUOTED_STRING, u.IDENTIFIER))
+    if (this.match(l.QUOTED_STRING, l.IDENTIFIER))
       return this.nodeFactory.create(U, {
         expression: this.nodeFactory.create(Z, { variable: this.previous() })
       });
@@ -1584,7 +1584,7 @@ class hn {
   }
   attribute() {
     const e = {};
-    if (this.check(u.COLON, u.RBRACKET, u.COMMA)) {
+    if (this.check(l.COLON, l.RBRACKET, l.COMMA)) {
       const n = this.peek();
       this.logError(
         n,
@@ -1605,12 +1605,12 @@ class hn {
           );
         this.synchronizeAttributeName();
       }
-    return this.match(u.COLON) && (e.colon = this.previous(), e.value = this.attributeValue()), this.nodeFactory.create(se, e);
+    return this.match(l.COLON) && (e.colon = this.previous(), e.value = this.attributeValue()), this.nodeFactory.create(se, e);
   }
   attributeValue() {
     let e;
     try {
-      e = this.peek().kind === u.IDENTIFIER && this.peek(1).kind === u.IDENTIFIER ? this.attributeName() : this.normalExpression();
+      e = this.peek().kind === l.IDENTIFIER && this.peek(1).kind === l.IDENTIFIER ? this.attributeName() : this.normalExpression();
     } catch (n) {
       if (!(n instanceof d) || !this.canHandle(n))
         throw n;
@@ -1620,11 +1620,11 @@ class hn {
   }
   attributeName() {
     const e = [];
-    if (this.peek().kind !== u.IDENTIFIER)
+    if (this.peek().kind !== l.IDENTIFIER)
       return this.primaryExpression();
-    for (; !this.isAtEnd() && !this.check(u.COLON, u.COMMA, u.RBRACKET); )
+    for (; !this.isAtEnd() && !this.check(l.COLON, l.COMMA, l.RBRACKET); )
       try {
-        this.consume("Expect an identifier", u.IDENTIFIER), e.push(this.previous());
+        this.consume("Expect an identifier", l.IDENTIFIER), e.push(this.previous());
       } catch (n) {
         throw n instanceof d ? new d(
           n.token,
@@ -1635,10 +1635,10 @@ class hn {
     return this.nodeFactory.create($, { identifiers: e });
   }
   logError(e, n, s) {
-    this.errors.push(new l(n, s, e));
+    this.errors.push(new c(n, s, e));
   }
 }
-const fn = {
+const dn = {
   "+": { left: 9, right: 10 },
   "*": { left: 11, right: 12 },
   "-": { left: 9, right: 10 },
@@ -1654,10 +1654,10 @@ const fn = {
   "!=": { left: 4, right: 5 },
   ".": { left: 16, right: 17 }
 };
-function pn(t) {
-  return fn[t.value] || { left: null, right: null };
+function En(t) {
+  return dn[t.value] || { left: null, right: null };
 }
-const dn = {
+const Nn = {
   "+": { left: null, right: 15 },
   "-": { left: null, right: 15 },
   "<": { left: null, right: 15 },
@@ -1665,14 +1665,14 @@ const dn = {
   "<>": { left: null, right: 15 },
   "!": { left: null, right: 15 }
 };
-function En(t) {
-  return dn[t.value] || { left: null, right: null };
+function mn(t) {
+  return Nn[t.value] || { left: null, right: null };
 }
-const Nn = {
+const Tn = {
   "(": { left: 14, right: null }
 };
 function ut(t) {
-  return Nn[t.value] || { left: null, right: null };
+  return Tn[t.value] || { left: null, right: null };
 }
 var b = /* @__PURE__ */ ((t) => (t.Table = "table", t.Enum = "enum", t.Ref = "ref", t.Note = "note", t.Project = "project", t.Indexes = "indexes", t.TableGroup = "tablegroup", t))(b || {});
 function ve(t) {
@@ -1722,7 +1722,7 @@ function _e(t) {
   let s;
   if (!M(I.last(e))) {
     const i = e.pop();
-    if (kt(i))
+    if (xt(i))
       s = i.elementList.map(
         (r) => V(r).unwrap()
       );
@@ -1760,13 +1760,13 @@ function V(t) {
   return e === void 0 ? new w() : new S(e);
 }
 function z(t) {
-  return W(t) ? t.expression instanceof Z ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new w();
+  return j(t) ? t.expression instanceof Z ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new w();
 }
-function mn(t) {
+function bn(t) {
   var e;
-  return !(t instanceof q) || !yt((e = t.op) == null ? void 0 : e.value) ? !1 : _e(t.leftExpression).and_then(() => _e(t.rightExpression)).unwrap_or(void 0) !== void 0;
+  return !(t instanceof q) || !kt((e = t.op) == null ? void 0 : e.value) ? !1 : _e(t.leftExpression).and_then(() => _e(t.rightExpression)).unwrap_or(void 0) !== void 0;
 }
-function Tn(t) {
+function In(t) {
   const e = _e(t.leftExpression), n = _e(t.rightExpression);
   if (!e.isOk() || !n.isOk())
     return !1;
@@ -1776,21 +1776,21 @@ function Tn(t) {
 function ht(t) {
   return t instanceof U && t.expression instanceof Z || t instanceof te;
 }
-function bn(t, e) {
-  var i, r, a, c;
+function Ln(t, e) {
+  var i, r, a, u;
   let n = e;
-  const s = Qt(t);
+  const s = Ht(t);
   for (; n; ) {
     if ((r = (i = n.symbol) == null ? void 0 : i.symbolTable) != null && r.has(t))
       return (a = n.symbol.symbolTable) == null ? void 0 : a.get(t);
-    if (((c = n.symbol) == null ? void 0 : c.declaration) instanceof G && s)
+    if (((u = n.symbol) == null ? void 0 : u.declaration) instanceof G && s)
       return n.symbol;
     if (n instanceof G)
       return;
     n = n.parent;
   }
 }
-class In {
+class gn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1798,24 +1798,24 @@ class In {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof G || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new l(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof G || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new c(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof ne)
-      return [new l(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
+      return [new c(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
     const n = [];
-    return W(e.callee) || n.push(new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && n.push(...e.args.map((s) => new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), n;
+    return j(e.callee) || n.push(new c(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && n.push(...e.args.map((s) => new c(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), n;
   }
 }
 class we {
@@ -1835,7 +1835,7 @@ class we {
     return this.table.entries();
   }
 }
-class Ln {
+class _n {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1843,26 +1843,26 @@ class Ln {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.registerElement(), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Ze(e) ? [] : [new l(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new l(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
+    return e ? yt(e) ? [] : [new c(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new c(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(Zt, { declaration: this.declarationNode, symbolTable: new we() });
+    this.declarationNode.symbol = this.symbolFactory.create(en, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n } = this.declarationNode, s = C(n);
     if (s.isOk()) {
-      const i = s.unwrap(), r = i.pop(), a = Ke(i, this.publicSymbolTable, this.symbolFactory), c = ze(r);
-      a.has(c) && e.push(new l(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(c, this.declarationNode.symbol);
+      const i = s.unwrap(), r = i.pop(), a = Ze(i, this.publicSymbolTable, this.symbolFactory), u = ze(r);
+      a.has(u) && e.push(new c(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(u, this.declarationNode.symbol);
     }
     return e;
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -1873,25 +1873,25 @@ class Ln {
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new l(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !M(n.callee) && s.push(new l(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
+      n.callee && !M(n.callee) && s.push(new c(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
       const i = [...n.args];
-      return I.last(i) instanceof D ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof D && (s.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && s.push(...i.map((r) => new l(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
+      return I.last(i) instanceof D ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof D && (s.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && s.push(...i.map((r) => new c(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
     });
   }
   validateFieldSettings(e) {
-    const n = j(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "note":
-          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
-            W(c.value) || s.push(new l(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", c));
+          a.length > 1 && a.forEach((u) => s.push(new c(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", u))), a.forEach((u) => {
+            j(u.value) || s.push(new c(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", u));
           });
           break;
         default:
-          a.forEach((c) => s.push(new l(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, c)));
+          a.forEach((u) => s.push(new c(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, u)));
       }
     }
     return s;
@@ -1906,14 +1906,14 @@ class Ln {
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(Kt, { declaration: e });
+      const n = V(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(tn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
-          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -1921,7 +1921,7 @@ class Ln {
     return [];
   }
 }
-class gn {
+class An {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1929,22 +1929,22 @@ class gn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof G || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new l(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof G || ve(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new c(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new l(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof y)
-      return [new l(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
@@ -1955,35 +1955,35 @@ class gn {
       const s = [], i = [n.callee, ...n.args];
       return I.last(i) instanceof D && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
         for (; r instanceof H; )
-          r.argumentList && !Xe(r.argumentList).isOk() && s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r.argumentList)), r = r.callee;
-        Xe(r).isOk() || s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
+          r.argumentList && !Xe(r.argumentList).isOk() && s.push(new c(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r.argumentList)), r = r.callee;
+        Xe(r).isOk() || s.push(new c(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
       }), s;
     });
   }
   validateFieldSetting(e) {
-    const n = j(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "note":
         case "name":
-          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
-            W(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, c));
+          a.length > 1 && a.forEach((u) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, u))), a.forEach((u) => {
+            j(u.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, u));
           });
           break;
         case "unique":
         case "pk":
-          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
-            le(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, c));
+          a.length > 1 && a.forEach((u) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, u))), a.forEach((u) => {
+            le(u.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, u));
           });
           break;
         case "type":
-          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", c))), a.forEach((c) => {
-            M(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, c));
+          a.length > 1 && a.forEach((u) => s.push(new c(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", u))), a.forEach((u) => {
+            M(u.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, u));
           });
           break;
         default:
-          a.forEach((c) => s.push(new l(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, c)));
+          a.forEach((u) => s.push(new c(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, u)));
       }
     }
     return s;
@@ -1997,7 +1997,7 @@ class gn {
     });
   }
 }
-class _n {
+class vn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2005,24 +2005,24 @@ class _n {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return !(this.declarationNode.parent instanceof G) && ![b.Table, b.Project].includes(ve(this.declarationNode.parent).unwrap_or(void 0)) ? [new l(o.INVALID_NOTE_CONTEXT, "A Note can only appear inside a Table or a Project. Sticky note can only appear at the global scope.", this.declarationNode)] : [];
+    return !(this.declarationNode.parent instanceof G) && ![b.Table, b.Project].includes(ve(this.declarationNode.parent).unwrap_or(void 0)) ? [new c(o.INVALID_NOTE_CONTEXT, "A Note can only appear inside a Table or a Project. Sticky note can only appear at the global scope.", this.declarationNode)] : [];
   }
   validateName(e) {
     if (!(this.declarationNode.parent instanceof G))
-      return e ? [new l(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+      return e ? [new c(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
     if (!e)
-      return [new l(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
+      return [new c(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
     const n = C(e);
     if (!n.isOk())
-      return [new l(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
-    const i = n.unwrap().join("."), r = zt(i);
-    return this.publicSymbolTable.has(r) ? [new l(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
+      return [new c(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
+    const i = n.unwrap().join("."), r = qt(i);
+    return this.publicSymbolTable.has(r) ? [new c(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -2034,7 +2034,7 @@ class _n {
   }
   validateFields(e) {
     const n = [];
-    return e.length === 0 ? [new l(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new l(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), W(e[0].callee) || n.push(new l(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && n.push(...e[0].args.map((s) => new l(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
+    return e.length === 0 ? [new c(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new c(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), j(e[0].callee) || n.push(new c(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && n.push(...e[0].args.map((s) => new c(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
   }
   validateSubElements(e) {
     return e.flatMap((n) => {
@@ -2045,7 +2045,7 @@ class _n {
     });
   }
 }
-class An {
+class wn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2053,25 +2053,25 @@ class An {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Me(e) ? [] : [new l(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? ye(e) ? [] : [new c(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof y)
-      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [
-      ...n.map((i) => new l(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
+      ...n.map((i) => new c(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
       ...this.validateSubElements(s)
     ];
   }
@@ -2084,7 +2084,7 @@ class An {
     });
   }
 }
-class vn {
+class yn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2092,16 +2092,16 @@ class vn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof G ? [] : [new l(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
+    return this.declarationNode.parent instanceof G ? [] : [new c(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
   }
   validateName(e) {
-    return e ? Me(e) ? [] : [new l(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? ye(e) ? [] : [new c(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -2113,27 +2113,27 @@ class vn {
   }
   validateFields(e) {
     if (e.length === 0)
-      return [new l(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
+      return [new c(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
     const n = [];
-    return e.length > 1 && n.push(...e.slice(1).map((s) => new l(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
-      s.callee && !mn(s.callee) && n.push(new l(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !Tn(s.callee) && n.push(new l(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
+    return e.length > 1 && n.push(...e.slice(1).map((s) => new c(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
+      s.callee && !bn(s.callee) && n.push(new c(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !In(s.callee) && n.push(new c(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
       const i = [...s.args];
-      I.last(i) instanceof D ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof D && (n.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && n.push(...i.map((r) => new l(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", r)));
+      I.last(i) instanceof D ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof D && (n.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && n.push(...i.map((r) => new c(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", r)));
     }), n;
   }
   validateFieldSettings(e) {
-    const n = j(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "delete":
         case "update":
-          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
-            wn(c.value) || s.push(new l(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, c));
+          a.length > 1 && a.forEach((u) => s.push(new c(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, u))), a.forEach((u) => {
+            kn(u.value) || s.push(new c(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, u));
           });
           break;
         default:
-          a.forEach((c) => s.push(new l(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, c)));
+          a.forEach((u) => s.push(new c(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, u)));
       }
     }
     return s;
@@ -2147,8 +2147,8 @@ class vn {
     });
   }
 }
-function wn(t) {
-  if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
+function kn(t) {
+  if (!(M(t) && t.expression.variable.kind !== l.QUOTED_STRING) && !(t instanceof $))
     return !1;
   let e;
   if (t instanceof $ ? e = Te(t).unwrap_or("") : e = t.expression.variable.value, e)
@@ -2164,7 +2164,7 @@ function wn(t) {
     }
   return !1;
 }
-class yn {
+class xn {
   constructor(e, n, s) {
     this.declarationNode = e, this.symbolFactory = s, this.publicSymbolTable = n;
   }
@@ -2172,31 +2172,31 @@ class yn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.registerElement(), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof ue ? [new l(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : Ze(e) ? [] : [new l(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new l(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
+    return e ? e instanceof ue ? [new c(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : yt(e) ? [] : [new c(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new c(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? On(e) ? [] : [new l(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
+    return e ? Dn(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
   }
   validateSettingList(e) {
-    const n = j(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "headercolor":
-          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", c))), a.forEach((c) => {
-            Rn(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", c.value || c.name));
+          a.length > 1 && s.push(...a.map((u) => new c(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", u))), a.forEach((u) => {
+            Pn(u.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", u.value || u.name));
           });
           break;
         case "note":
-          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
-            W(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'note' must be a string literal", c.value || c.name));
+          a.length > 1 && s.push(...a.map((u) => new c(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", u))), a.forEach((u) => {
+            j(u.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'note' must be a string literal", u.value || u.name));
           });
           break;
         default:
-          s.push(...a.map((c) => new l(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, c)));
+          s.push(...a.map((u) => new c(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, u)));
       }
     }
     return s;
@@ -2206,12 +2206,12 @@ class yn {
     this.declarationNode.symbol = this.symbolFactory.create(At, { declaration: this.declarationNode, symbolTable: new we() });
     const { name: n, alias: s } = this.declarationNode, i = C(n);
     if (i.isOk()) {
-      const r = [...i.unwrap()], a = r.pop(), c = Ke(r, this.publicSymbolTable, this.symbolFactory), p = Se(a);
-      c.has(p) && e.push(new l(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), c.set(p, this.declarationNode.symbol);
+      const r = [...i.unwrap()], a = r.pop(), u = Ze(r, this.publicSymbolTable, this.symbolFactory), p = Oe(a);
+      u.has(p) && e.push(new c(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), u.set(p, this.declarationNode.symbol);
     }
-    if (s && Me(s) && !xn(s.expression.variable.value, i.unwrap_or([]))) {
-      const r = V(s).unwrap(), a = Se(r);
-      this.publicSymbolTable.has(a) && e.push(new l(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
+    if (s && ye(s) && !On(s.expression.variable.value, i.unwrap_or([]))) {
+      const r = V(s).unwrap(), a = Oe(r);
+      this.publicSymbolTable.has(a) && e.push(new c(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
     }
     return e;
   }
@@ -2219,30 +2219,30 @@ class yn {
     if (!e)
       return [];
     if (e instanceof y)
-      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new l(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new c(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
       if (!n.callee)
         return [];
       const s = [];
-      n.args.length === 0 && s.push(new l(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new l(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !kn(n.args[0]) && s.push(new l(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      n.args.length === 0 && s.push(new c(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new c(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !Sn(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
       const i = n.args.slice(1);
       return s.push(...this.validateFieldSetting(i)), s.push(...this.registerField(n)), s;
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(en, { declaration: e });
+      const n = V(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(nn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
-          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2252,74 +2252,74 @@ class yn {
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
     if (!e.slice(0, -1).every(me) || !e.slice(-1).every((p) => me(p) || p instanceof D))
-      return [...e.map((p) => new l(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
+      return [...e.map((p) => new c(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
     if (e.length === 0)
       return [];
     let n;
     I.last(e) instanceof D && (n = e.pop());
-    const s = j(n), i = s.getErrors(), r = s.getValue();
+    const s = W(n), i = s.getErrors(), r = s.getValue();
     for (const p of e) {
-      const h = V(p).unwrap_or("").toLowerCase();
-      if (h !== "pk" && h !== "unique") {
-        i.push(new l(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
+      const f = V(p).unwrap_or("").toLowerCase();
+      if (f !== "pk" && f !== "unique") {
+        i.push(new c(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
         continue;
       }
-      r[h] === void 0 ? r[h] = [p] : r[h].push(p);
+      r[f] === void 0 ? r[f] = [p] : r[f].push(p);
     }
-    const a = r.pk || [], c = r["primary key"] || [];
-    a.length >= 1 && c.length >= 1 && i.push(...[...a, ...c].map((p) => new l(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
+    const a = r.pk || [], u = r["primary key"] || [];
+    a.length >= 1 && u.length >= 1 && i.push(...[...a, ...u].map((p) => new c(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
     for (const p in r) {
-      const h = r[p];
+      const f = r[p];
       switch (p) {
         case "note":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
-            W(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", h))), f.forEach((h) => {
+            j(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", h.value || h.name));
           });
           break;
         case "ref":
-          h.forEach((f) => {
-            Pn(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", f.value || f.name));
+          f.forEach((h) => {
+            Mn(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", h.value || h.name));
           });
           break;
         case "primary key":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
-            le(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", h))), f.forEach((h) => {
+            le(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", h.value || h.name));
           });
           break;
         case "pk":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !le(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", h.value || h.name));
           });
           break;
         case "not null":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
-          const T = r.null || [];
-          h.length >= 1 && T.length >= 1 && i.push(...[...h, ...T].map((f) => new l(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", f))), h.forEach((f) => {
-            le(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", h)));
+          const E = r.null || [];
+          f.length >= 1 && E.length >= 1 && i.push(...[...f, ...E].map((h) => new c(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", h))), f.forEach((h) => {
+            le(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", h.value || h.name));
           });
           break;
         case "null":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
-            le(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", h))), f.forEach((h) => {
+            le(h.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", h.value || h.name));
           });
           break;
         case "unique":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !le(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", h.value || h.name));
           });
           break;
         case "increment":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", h))), f.forEach((h) => {
+            h instanceof se && !le(h.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", h.value || h.name));
           });
           break;
         case "default":
-          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
-            Dn(f.value) || i.push(new l(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", f.value || f.name));
+          f.length > 1 && i.push(...f.map((h) => new c(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", h))), f.forEach((h) => {
+            Un(h.value) || i.push(new c(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", h.value || h.name));
           });
           break;
         default:
-          h.forEach((f) => i.push(new l(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
+          f.forEach((h) => i.push(new c(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, h)));
       }
     }
     return i;
@@ -2334,14 +2334,14 @@ class yn {
       var r;
       return ((r = i.type) == null ? void 0 : r.value.toLowerCase()) === "note";
     });
-    return s.length > 1 && (n.push(...s.map((i) => new l(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
+    return s.length > 1 && (n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
   }
 }
-function kn(t) {
+function Sn(t) {
   if (!(t instanceof H || Je(t) || t instanceof U || t instanceof ue))
     return !1;
   if (t instanceof H) {
-    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => he(n) || W(n) || me(n)))
+    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => he(n) || j(n) || me(n)))
       return !1;
     t = t.callee;
   }
@@ -2353,10 +2353,10 @@ function kn(t) {
   const e = C(t).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-function xn(t, e) {
+function On(t, e) {
   return e.length === 1 && t === e[0];
 }
-class Sn {
+class Rn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2364,41 +2364,41 @@ class Sn {
     return [...this.validateContext(), ...this.validateName(this.declarationNode.name), ...this.validateAlias(this.declarationNode.alias), ...this.validateSettingList(this.declarationNode.attributeList), ...this.registerElement(), ...this.validateBody(this.declarationNode.body)];
   }
   validateContext() {
-    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Ze(e) ? [] : [new l(o.INVALID_NAME, "A TableGroup name must be of the form <tablegroup> or <schema>.<tablegroup>", e)] : [new l(o.NAME_NOT_FOUND, "A TableGroup must have a name", this.declarationNode)];
+    return e ? ye(e) ? [] : [new c(o.INVALID_NAME, "A TableGroup name must be a single identifier", e)] : [new c(o.NAME_NOT_FOUND, "A TableGroup must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new l(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const { name: e } = this.declarationNode;
-    this.declarationNode.symbol = this.symbolFactory.create(tn, { declaration: this.declarationNode, symbolTable: new we() });
+    this.declarationNode.symbol = this.symbolFactory.create(sn, { declaration: this.declarationNode, symbolTable: new we() });
     const n = C(e);
     if (n.isOk()) {
-      const s = n.unwrap(), i = s.pop(), r = Ke(s, this.publicSymbolTable, this.symbolFactory), a = qe(i);
+      const s = n.unwrap(), i = s.pop(), r = Ze(s, this.publicSymbolTable, this.symbolFactory), a = qe(i);
       if (r.has(a))
-        return [new l(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
+        return [new c(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists`, e)];
       r.set(a, this.declarationNode.symbol);
     }
     return [];
   }
   validateSettingList(e) {
-    return e ? [new l(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof y)
-      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     return e.flatMap((n) => {
       const s = [];
-      return n.callee && !C(n.callee).isOk() && s.push(new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
+      return n.callee && !C(n.callee).isOk() && s.push(new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
     });
   }
   validateSubElements(e) {
@@ -2411,14 +2411,14 @@ class Sn {
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(nn, { declaration: e });
+      const n = V(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(rn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
-          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
+          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
+          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2430,88 +2430,88 @@ const wt = ["-", "+"];
 function re(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
-      return Ln;
+      return _n;
     case b.Table:
-      return yn;
+      return xn;
     case b.TableGroup:
-      return Sn;
+      return Rn;
     case b.Project:
-      return An;
+      return wn;
     case b.Ref:
-      return vn;
+      return yn;
     case b.Note:
-      return _n;
+      return vn;
     case b.Indexes:
-      return gn;
+      return An;
     default:
-      return In;
+      return gn;
   }
 }
-function Ze(t) {
+function yt(t) {
   return !!C(t).unwrap_or(!1);
 }
-function On(t) {
-  return Me(t);
+function Dn(t) {
+  return ye(t);
 }
-function Me(t) {
+function ye(t) {
   return t instanceof U && t.expression instanceof Z;
 }
-function Ke(t, e, n) {
+function Ze(t, e, n) {
   var i;
   t[0] === "public" && (t = t.slice(1));
   let s = e;
   for (const r of t) {
     let a;
-    const c = We(r);
-    if (s.has(c)) {
-      if (a = (i = s.get(c)) == null ? void 0 : i.symbolTable, !a)
+    const u = je(r);
+    if (s.has(u)) {
+      if (a = (i = s.get(u)) == null ? void 0 : i.symbolTable, !a)
         throw new Error("Expect a symbol table in a schema symbol");
     } else {
       a = new we();
       const p = n.create(_t, { symbolTable: a });
-      s.set(c, p);
+      s.set(u, p);
     }
     s = a;
   }
   return s;
 }
-function yt(t) {
+function kt(t) {
   return t === "-" || t === "<>" || t === ">" || t === "<";
 }
-function Rn(t) {
+function Pn(t) {
   var n;
-  if (!(t instanceof U) || !(t.expression instanceof be) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
+  if (!(t instanceof U) || !(t.expression instanceof be) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== l.COLOR_LITERAL)
     return !1;
   const e = t.expression.literal.value;
   if (e.length !== 4 && e.length !== 7 || e[0] !== "#")
     return !1;
   for (let s = 1; s < e.length; s += 1)
-    if (!Ht(e[s]))
+    if (!Zt(e[s]))
       return !1;
   return !0;
 }
 function le(t) {
   return t === void 0;
 }
-function Dn(t) {
+function Un(t) {
   var e;
-  return !!(W(t) || he(t) || me(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && he(t.expression) || t instanceof te);
+  return !!(j(t) || he(t) || me(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && he(t.expression) || t instanceof te);
 }
 function he(t) {
   var e;
-  return t instanceof U && t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
+  return t instanceof U && t.expression instanceof be && ((e = t.expression.literal) == null ? void 0 : e.kind) === l.NUMERIC_LITERAL;
 }
-function Pn(t) {
+function Mn(t) {
   var n;
-  if (!(t instanceof Q) || !yt((n = t.op) == null ? void 0 : n.value))
+  if (!(t instanceof Q) || !kt((n = t.op) == null ? void 0 : n.value))
     return !1;
   const e = C(t.expression).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-function kt(t) {
+function xt(t) {
   return t instanceof J && t.elementList.every(M);
 }
-function j(t) {
+function W(t) {
   var s;
   const e = {}, n = [];
   if (!t)
@@ -2520,7 +2520,7 @@ function j(t) {
     if (!i.name)
       continue;
     if (i.name instanceof U) {
-      n.push(new l(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
+      n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
     const r = (s = Te(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
@@ -2547,7 +2547,7 @@ class ft {
       e.push(...r.validate());
     });
     const n = this.ast.body.filter((s) => ve(s).unwrap_or(void 0) === b.Project);
-    return n.length > 1 && n.forEach((s) => e.push(new l(o.PROJECT_REDEFINED, "Only one project can exist", s))), new B(this.ast, e);
+    return n.length > 1 && n.forEach((s) => e.push(new c(o.PROJECT_REDEFINED, "Only one project can exist", s))), new B(this.ast, e);
   }
 }
 class ae {
@@ -2579,7 +2579,7 @@ class ae {
         if (s instanceof A) {
           if (!s.type)
             continue;
-          const i = xt(s);
+          const i = St(s);
           new i(s, this.errors).bind();
         } else
           this.bindSubfield(s);
@@ -2602,7 +2602,7 @@ class ae {
           return;
         this.bindFragments([e], n);
       } else
-        e instanceof q ? Je(e) ? this.bindFragments(fe(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof Q ? this.scanAndBind(e.expression, n) : e instanceof Pe ? this.scanAndBind(e.expression, n) : e instanceof J && e.elementList.forEach((r) => this.scanAndBind(r, n));
+        e instanceof q ? Je(e) ? this.bindFragments(fe(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof Q ? this.scanAndBind(e.expression, n) : e instanceof Ue ? this.scanAndBind(e.expression, n) : e instanceof J && e.elementList.forEach((r) => this.scanAndBind(r, n));
   }
   // Bind the fragments of a member access expression
   // which can be a simple expression like v1.User,
@@ -2610,76 +2610,76 @@ class ae {
   bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((f) => !M(f)), c = r !== -1 && kt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, h = e.slice(
+    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((h) => !M(h)), u = r !== -1 && xt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, f = e.slice(
       0,
       r === -1 ? void 0 : r
     );
-    if (h.length === 0)
+    if (f.length === 0)
       return;
-    const T = [];
-    for (; s.length && h.length; ) {
-      const f = s.pop(), N = h.pop(), g = V(N).unwrap();
-      T.unshift({
-        index: Ve(g, f),
-        referrer: N
+    const E = [];
+    for (; s.length && f.length; ) {
+      const h = s.pop(), m = f.pop(), g = V(m).unwrap();
+      E.unshift({
+        index: Ve(g, h),
+        referrer: m
       });
     }
-    for (; h.length; ) {
-      const f = h.pop(), N = V(f).unwrap();
-      T.unshift({
-        index: Ve(N, i),
-        referrer: f
+    for (; f.length; ) {
+      const h = f.pop(), m = V(h).unwrap();
+      E.unshift({
+        index: Ve(m, i),
+        referrer: h
       });
     }
-    return c ? c.elementList.forEach(
-      (f) => this.resolveIndexStack(
+    return u ? u.elementList.forEach(
+      (h) => this.resolveIndexStack(
         [
-          ...T,
+          ...E,
           {
             index: Ve(
-              V(f).unwrap(),
+              V(h).unwrap(),
               p
             ),
-            referrer: f
+            referrer: h
           }
         ],
         n.ignoreNameNotFound
       )
-    ) : this.resolveIndexStack(T, n.ignoreNameNotFound);
+    ) : this.resolveIndexStack(E, n.ignoreNameNotFound);
   }
   // Looking up the indexes in the subname stack from the current declaration node
   // Each time the index resolves to a symbol, the referrer's symbol is bound to it
   resolveIndexStack(e, n) {
     if (e.length === 0)
       throw new Error("Unreachable - An unresolved name must have at least one name component");
-    const [s, ...i] = e, r = bn(s.index, this.declarationNode);
+    const [s, ...i] = e, r = Ln(s.index, this.declarationNode);
     if (r === void 0) {
-      const { kind: h, name: T } = ie(s.index).unwrap();
-      this.logError(s.referrer, `Can not find ${h} '${T}'`, n);
+      const { kind: f, name: E } = ie(s.index).unwrap();
+      this.logError(s.referrer, `Can not find ${f} '${E}'`, n);
       return;
     }
     r.references.push(s.referrer), s.referrer.referee = r;
-    let a = r.symbolTable, { kind: c, name: p } = ie(s.index).unwrap();
-    for (const h of i) {
-      const { kind: T, name: f } = ie(h.index).unwrap(), N = a.get(h.index);
-      if (!N) {
+    let a = r.symbolTable, { kind: u, name: p } = ie(s.index).unwrap();
+    for (const f of i) {
+      const { kind: E, name: h } = ie(f.index).unwrap(), m = a.get(f.index);
+      if (!m) {
         this.logError(
-          h.referrer,
-          `${c} '${p}' does not have ${T} '${f}'`,
+          f.referrer,
+          `${u} '${p}' does not have ${E} '${h}'`,
           n
         );
         return;
       }
-      if (c = T, p = f, h.referrer.referee = N, N.references.push(h.referrer), !N.symbolTable)
+      if (u = E, p = h, f.referrer.referee = m, m.references.push(f.referrer), !m.symbolTable)
         break;
-      a = N.symbolTable;
+      a = m.symbolTable;
     }
   }
   logError(e, n, s) {
-    s || this.errors.push(new l(o.BINDING_ERROR, n, e));
+    s || this.errors.push(new c(o.BINDING_ERROR, n, e));
   }
 }
-class Un extends ae {
+class Fn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2689,7 +2689,7 @@ class Un extends ae {
     }, this.settingList = {};
   }
 }
-class Mn extends ae {
+class Bn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2699,33 +2699,33 @@ class Mn extends ae {
     }, this.settingList = {};
   }
 }
-class Fn extends ae {
+class Vn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
         argBinderRules: [
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table, m.Column],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table, T.Column],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           },
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table, m.Column],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table, T.Column],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           },
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table, m.Column],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table, T.Column],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           },
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table, m.Column],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table, T.Column],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           }
         ]
@@ -2734,7 +2734,7 @@ class Fn extends ae {
     }, this.settingList = {};
   }
 }
-class Bn extends ae {
+class Gn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2744,7 +2744,7 @@ class Bn extends ae {
     }, this.settingList = {};
   }
 }
-class Vn extends ae {
+class Cn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2754,15 +2754,15 @@ class Vn extends ae {
     }, this.settingList = {};
   }
 }
-class Gn extends ae {
+class Xn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
         argBinderRules: [
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table, m.Column],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table, T.Column],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           }
         ]
@@ -2771,7 +2771,7 @@ class Gn extends ae {
     }, this.settingList = {};
   }
 }
-class Cn extends ae {
+class $n extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2779,8 +2779,8 @@ class Cn extends ae {
           { shouldBind: !1 },
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Enum],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Enum],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !0
           }
         ]
@@ -2788,8 +2788,8 @@ class Cn extends ae {
       settingList: {
         ref: {
           shouldBind: !0,
-          topSubnamesSymbolKind: [m.Table, m.Column],
-          remainingSubnamesSymbolKind: m.Schema,
+          topSubnamesSymbolKind: [T.Table, T.Column],
+          remainingSubnamesSymbolKind: T.Schema,
           ignoreNameNotFound: !1
         },
         default: {
@@ -2799,15 +2799,15 @@ class Cn extends ae {
     }, this.settingList = {};
   }
 }
-class Xn extends ae {
+class Wn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
         argBinderRules: [
           {
             shouldBind: !0,
-            topSubnamesSymbolKind: [m.Table],
-            remainingSubnamesSymbolKind: m.Schema,
+            topSubnamesSymbolKind: [T.Table],
+            remainingSubnamesSymbolKind: T.Schema,
             ignoreNameNotFound: !1
           }
         ]
@@ -2816,40 +2816,40 @@ class Xn extends ae {
     }, this.settingList = {};
   }
 }
-function xt(t) {
+function St(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
-      return Mn;
+      return Bn;
     case b.Table:
-      return Cn;
+      return $n;
     case b.TableGroup:
-      return Xn;
+      return Wn;
     case b.Project:
-      return Vn;
+      return Cn;
     case b.Ref:
-      return Gn;
+      return Xn;
     case b.Note:
-      return Bn;
+      return Gn;
     case b.Indexes:
-      return Fn;
+      return Vn;
     default:
-      return Un;
+      return Fn;
   }
 }
-class $n {
+class jn {
   constructor(e) {
     this.ast = e, this.errors = [];
   }
   resolve() {
     for (const e of this.ast.body)
       if (e.type) {
-        const n = xt(e);
+        const n = St(e);
         new n(e, this.errors).bind();
       }
     return new B(this.ast, this.errors);
   }
 }
-class jn {
+class Yn {
   constructor(e) {
     this.generator = e;
   }
@@ -2857,13 +2857,13 @@ class jn {
     return new e(n, this.generator.nextId());
   }
 }
-class Wn {
+class zn {
   constructor(e, n) {
-    this.ast = e, this.symbolFactory = new jn(n);
+    this.ast = e, this.symbolFactory = new Yn(n);
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new $n(n).resolve());
+    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new jn(n).resolve());
   }
   // For invoking the validator only
   validate() {
@@ -2890,7 +2890,7 @@ function pt(t, e) {
     schemaName: n.pop() || null
   };
 }
-function St(t) {
+function Ot(t) {
   switch (t) {
     case "<":
       return ["1", "*"];
@@ -2925,10 +2925,10 @@ function Ie(t) {
     schemaName: e
   };
 }
-function Ot(t) {
+function Rt(t) {
   return t.expression.literal.value;
 }
-function Rt(t, e) {
+function Dt(t, e) {
   if (Array.isArray(t)) {
     const i = t.map(({ id: a }) => a).sort().join(","), r = e.map(({ id: a }) => a).sort().join(",");
     return i < r ? `${i}-${r}` : `${r}-${i}`;
@@ -2936,10 +2936,10 @@ function Rt(t, e) {
   const n = t.id.toString(), s = e.id.toString();
   return n < s ? `${n}-${s}` : `${s}-${n}`;
 }
-function Dt(t, e) {
+function Pt(t, e) {
   if (Array.isArray(t)) {
     const i = t.map(({ id: a }) => a).sort(), r = e.map(({ id: a }) => a).sort();
-    return I.zip(i, r).every(([a, c]) => a === c);
+    return I.zip(i, r).every(([a, u]) => a === u);
   }
   const n = t.id, s = e.id;
   return n === s;
@@ -2950,7 +2950,7 @@ function Ne(t) {
   return n.map((r) => r.slice(i)).join(`
 `);
 }
-class Pt {
+class Ut {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.table = { name: void 0, schemaName: void 0, alias: null, fields: [], token: void 0, indexes: [] }, this.pkColumns = [];
   }
@@ -2975,7 +2975,7 @@ class Pt {
   }
   interpretName(e) {
     const { name: n, schemaName: s } = Ie(e);
-    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
+    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
   }
   interpretAlias(e) {
     if (!e)
@@ -2992,8 +2992,8 @@ class Pt {
   }
   interpretSettingList(e) {
     var i, r, a;
-    const n = j(e).getValue();
-    this.table.headerColor = (i = n.headercolor) != null && i.length ? Ot((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
+    const n = W(e).getValue();
+    this.table.headerColor = (i = n.headercolor) != null && i.length ? Rt((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
     const [s] = n.note || [];
     return this.table.note = s && {
       value: z(s == null ? void 0 : s.value).map(Ne).unwrap(),
@@ -3023,15 +3023,15 @@ class Pt {
     return e.flatMap((n) => this.interpretColumn(n));
   }
   interpretColumn(e) {
-    var a, c, p, h, T, f, N, g;
+    var a, u, p, f, E, h, m, g;
     const n = [], s = {};
     s.name = V(e.callee).unwrap();
-    const i = Yn(e.args[0]);
+    const i = Qn(e.args[0]);
     s.type = i.getValue(), n.push(...i.getErrors()), s.token = v(e), s.inline_refs = [];
     const r = e.args.slice(1);
     if (I.last(r) instanceof D) {
-      const _ = j(r.pop()).getValue();
-      s.pk = !!((a = _.pk) != null && a.length) || !!((c = _["primary key"]) != null && c.length), s.increment = !!((p = _.increment) != null && p.length), s.unique = !!((h = _.unique) != null && h.length), s.not_null = !!((T = _["not null"]) != null && T.length) && !0, s.dbdefault = zn((N = (f = _.default) == null ? void 0 : f.at(0)) == null ? void 0 : N.value);
+      const _ = W(r.pop()).getValue();
+      s.pk = !!((a = _.pk) != null && a.length) || !!((u = _["primary key"]) != null && u.length), s.increment = !!((p = _.increment) != null && p.length), s.unique = !!((f = _.unique) != null && f.length), s.not_null = !!((E = _["not null"]) != null && E.length) && !0, s.dbdefault = qn((m = (h = _.default) == null ? void 0 : h.at(0)) == null ? void 0 : m.value);
       const K = (g = _.note) == null ? void 0 : g.at(0);
       s.note = K && {
         value: z(K.value).map(Ne).unwrap(),
@@ -3039,10 +3039,10 @@ class Pt {
       };
       const oe = _.ref || [];
       s.inline_refs = oe.flatMap((Y) => {
-        const [nt] = $e(Y.value.expression);
-        if (Dt(nt, e.symbol))
-          return n.push(new l(o.SAME_ENDPOINT, "Two endpoints are the same", Y)), [];
-        const ye = Y.value.op, ee = C(Y.value.expression).unwrap();
+        const [tt] = $e(Y.value.expression);
+        if (Pt(tt, e.symbol))
+          return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", Y)), [];
+        const ke = Y.value.op, ee = C(Y.value.expression).unwrap();
         let pe;
         if (ee.length === 1) {
           const [ce] = ee;
@@ -3050,7 +3050,7 @@ class Pt {
             schemaName: this.table.schemaName,
             tableName: this.table.name,
             fieldNames: [ce],
-            relation: ye.value,
+            relation: ke.value,
             token: v(Y)
           };
         } else if (ee.length === 2) {
@@ -3059,49 +3059,49 @@ class Pt {
             schemaName: null,
             tableName: ce,
             fieldNames: [Le],
-            relation: ye.value,
+            relation: ke.value,
             token: v(Y)
           };
         } else if (ee.length === 3) {
-          const [ce, Le, it] = ee;
+          const [ce, Le, st] = ee;
           pe = {
             schemaName: ce,
             tableName: Le,
-            fieldNames: [it],
-            relation: ye.value,
+            fieldNames: [st],
+            relation: ke.value,
             token: v(Y)
           };
         } else {
-          n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", Y));
+          n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", Y));
           const ce = ee.pop(), Le = ee.pop();
           pe = {
             schemaName: ee.join("."),
             tableName: Le,
             fieldNames: [ce],
-            relation: ye.value,
+            relation: ke.value,
             token: v(Y)
           };
         }
-        const st = this.registerInlineRefToEnv(e, nt, pe, Y);
-        return n.push(...st), st.length === 0 ? pe : [];
+        const nt = this.registerInlineRefToEnv(e, tt, pe, Y);
+        return n.push(...nt), nt.length === 0 ? pe : [];
       });
     }
     return s.pk || (s.pk = r.some((_) => X(_).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((_) => X(_).unwrap().toLowerCase() === "unique")), this.table.fields.push(s), s.pk && this.pkColumns.push(s), n;
   }
   interpretIndexes(e) {
     return this.table.indexes.push(...e.body.body.map((n) => {
-      var a, c, p, h, T, f, N;
+      var a, u, p, f, E, h, m;
       const s = { columns: [] }, i = n;
       s.token = v(e);
       const r = [i.callee, ...i.args];
       if (I.last(r) instanceof D) {
-        const g = j(r.pop()).getValue();
-        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((c = g.unique) != null && c.length), s.name = z((h = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : h.value).unwrap_or(void 0);
-        const _ = (T = g.note) == null ? void 0 : T.at(0);
+        const g = W(r.pop()).getValue();
+        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((u = g.unique) != null && u.length), s.name = z((f = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : f.value).unwrap_or(void 0);
+        const _ = (E = g.note) == null ? void 0 : E.at(0);
         s.note = _ && {
           value: z(_.value).unwrap(),
           token: v(_)
-        }, s.type = X((N = (f = g.type) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
+        }, s.type = X((m = (h = g.type) == null ? void 0 : h.at(0)) == null ? void 0 : m.value).unwrap_or(void 0);
       }
       return r.flatMap((g) => {
         if (!(g instanceof H))
@@ -3128,13 +3128,13 @@ class Pt {
     })), [];
   }
   registerInlineRefToEnv(e, n, s, i) {
-    const r = Rt(e.symbol, n);
+    const r = Dt(e.symbol, n);
     if (this.env.refIds[r])
       return [
-        new l(o.CIRCULAR_REF, "References with same endpoints exist", i),
-        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", i),
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
       ];
-    const a = St(s.relation);
+    const a = Ot(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
       name: null,
       schemaName: null,
@@ -3155,9 +3155,9 @@ class Pt {
     }), [];
   }
 }
-function Yn(t) {
+function Qn(t) {
   let e = null;
-  t instanceof H && (e = t.argumentList.elementList.map((r) => he(r) ? r.expression.literal.value : W(r) ? z(r).unwrap() : X(r).unwrap()).join(","), t = t.callee);
+  t instanceof H && (e = t.argumentList.elementList.map((r) => he(r) ? r.expression.literal.value : j(r) ? z(r).unwrap() : X(r).unwrap()).join(","), t = t.callee);
   let n = "";
   for (; t instanceof ue; )
     n = `[${t.indexer.elementList.map((r) => r.name.expression.literal.value).join(",")}]${n}`, t = t.array;
@@ -3168,17 +3168,17 @@ function Yn(t) {
       type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
-    [new l(o.UNSUPPORTED, "Nested schema is not supported", t)]
+    [new c(o.UNSUPPORTED, "Nested schema is not supported", t)]
   ) : new B({
     schemaName: i.length === 0 ? null : i[0],
     type_name: `${s}${n}${e ? `(${e})` : ""}`,
     args: e
   });
 }
-function zn(t) {
+function qn(t) {
   var e, n, s;
   if (t) {
-    if (W(t))
+    if (j(t))
       return {
         value: z(t).unwrap(),
         type: "string"
@@ -3208,7 +3208,7 @@ function zn(t) {
     throw new Error("Unreachable");
   }
 }
-class Qn {
+class Hn {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.note = { name: void 0, content: void 0, token: void 0 };
   }
@@ -3225,13 +3225,13 @@ class Qn {
   }
   interpretSettingList(e) {
     var s, i, r;
-    const n = j(e).getValue();
-    return this.note.headerColor = (s = n.headercolor) != null && s.length ? Ot((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
+    const n = W(e).getValue();
+    return this.note.headerColor = (s = n.headercolor) != null && s.length ? Rt((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
   }
   interpretBody(e) {
     const [n, s] = I.partition(e.body, (i) => i instanceof y);
     return n.length !== 1 || s.length > 0 ? [
-      new l(o.INVALID_NOTE, "Invalid note syntax", e)
+      new c(o.INVALID_NOTE, "Invalid note syntax", e)
     ] : [...this.interpretNote(n[0])];
   }
   interpretNote(e) {
@@ -3239,7 +3239,7 @@ class Qn {
     return this.note.content = Ne(n), [];
   }
 }
-class Ut {
+class Mt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof A ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
   }
@@ -3248,29 +3248,29 @@ class Ut {
   }
   interpretName(e) {
     const n = [], s = C(this.declarationNode.name).unwrap_or([]);
-    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
+    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
   }
   interpretBody(e) {
     return e instanceof y ? this.interpretField(e) : this.interpretField(e.body[0]);
   }
   interpretField(e) {
-    var h, T, f, N;
+    var f, E, h, m;
     const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = $e(s), a = $e(i);
-    if (Dt(r, a))
-      return [new l(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
-    const c = Rt(r, a);
-    if (this.env.refIds[c])
+    if (Pt(r, a))
+      return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
+    const u = Dt(r, a);
+    if (this.env.refIds[u])
       return [
-        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
-        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[c])
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[u])
       ];
     if (e.args[0]) {
-      const g = j(e.args[0]).getValue(), _ = (T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value;
+      const g = W(e.args[0]).getValue(), _ = (E = (f = g.delete) == null ? void 0 : f.at(0)) == null ? void 0 : E.value;
       this.ref.onDelete = _ instanceof $ ? Te(_).unwrap_or(void 0) : X(_).unwrap_or(void 0);
-      const K = (N = (f = g.update) == null ? void 0 : f.at(0)) == null ? void 0 : N.value;
+      const K = (m = (h = g.update) == null ? void 0 : h.at(0)) == null ? void 0 : m.value;
       this.ref.onUpdate = K instanceof $ ? Te(K).unwrap_or(void 0) : X(K).unwrap_or(void 0);
     }
-    const p = St(n);
+    const p = Ot(n);
     return this.ref.endpoints = [
       {
         ...pt(s, this.container),
@@ -3282,10 +3282,10 @@ class Ut {
         relation: p[1],
         token: v(i)
       }
-    ], this.env.refIds[c] = this.declarationNode, [];
+    ], this.env.refIds[u] = this.declarationNode, [];
   }
 }
-class Mt {
+class Ft {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.tableGroup = { tables: [] };
   }
@@ -3298,17 +3298,17 @@ class Mt {
   }
   interpretName(e) {
     const n = [], { name: s, schemaName: i } = Ie(e);
-    return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
+    return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
   }
   interpretBody(e) {
     const n = [];
     return this.tableGroup.tables = this.declarationNode.body.body.map((s) => {
       const i = C(s.callee).unwrap();
-      i.length > 2 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", s));
+      i.length > 2 && n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", s));
       const r = fe(s.callee).unwrap().pop().referee.id;
       if (this.env.groupOfTable[r]) {
-        const a = this.env.groupOfTable[r], { schemaName: c, name: p } = this.env.tableGroups.get(a), h = c ? `${c}.${p}` : p;
-        n.push(new l(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${h}"`, s));
+        const a = this.env.groupOfTable[r], { schemaName: u, name: p } = this.env.tableGroups.get(a), f = u ? `${u}.${p}` : p;
+        n.push(new c(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${f}"`, s));
       } else
         this.env.groupOfTable[r] = this.declarationNode;
       return {
@@ -3318,7 +3318,7 @@ class Mt {
     }), n;
   }
 }
-class Ft {
+class Bt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.enum = { values: [] };
   }
@@ -3327,14 +3327,14 @@ class Ft {
   }
   interpretName(e) {
     const { name: n, schemaName: s } = Ie(e);
-    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
+    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
   }
   interpretBody(e) {
     return e.body.flatMap((n) => {
-      var c;
+      var u;
       const s = n, i = {};
       i.token = v(s), i.name = X(s.callee).unwrap();
-      const a = (c = j(s.args[0]).getValue().note) == null ? void 0 : c.at(0);
+      const a = (u = W(s.args[0]).getValue().note) == null ? void 0 : u.at(0);
       return i.note = a && {
         value: z(a.value).map(Ne).unwrap(),
         token: v(a)
@@ -3342,7 +3342,7 @@ class Ft {
     });
   }
 }
-class qn {
+class Jn {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.project = { enums: [], refs: [], tableGroups: [], tables: [] };
   }
@@ -3361,19 +3361,19 @@ class qn {
       const s = n;
       switch ((i = s.type) == null ? void 0 : i.value.toLowerCase()) {
         case "table": {
-          const r = new Pt(s, this.env).interpret();
+          const r = new Ut(s, this.env).interpret();
           return this.project.tables.push(this.env.tables.get(s)), r;
         }
         case "ref": {
-          const r = new Ut(s, this.env).interpret();
+          const r = new Mt(s, this.env).interpret();
           return this.project.refs.push(this.env.ref.get(s)), r;
         }
         case "tablegroup": {
-          const r = new Mt(s, this.env).interpret();
+          const r = new Ft(s, this.env).interpret();
           return this.project.tableGroups.push(this.env.tableGroups.get(s)), r;
         }
         case "enum": {
-          const r = new Ft(s, this.env).interpret();
+          const r = new Bt(s, this.env).interpret();
           return this.project.enums.push(this.env.enums.get(s)), r;
         }
         case "note":
@@ -3387,7 +3387,7 @@ class qn {
     });
   }
 }
-class Hn {
+class Zn {
   constructor(e) {
     this.ast = e, this.env = {
       schema: [],
@@ -3406,25 +3406,25 @@ class Hn {
     const e = this.ast.body.flatMap((n) => {
       switch (ve(n).unwrap_or(void 0)) {
         case b.Table:
-          return new Pt(n, this.env).interpret();
+          return new Ut(n, this.env).interpret();
         case b.Note:
-          return new Qn(n, this.env).interpret();
+          return new Hn(n, this.env).interpret();
         case b.Ref:
-          return new Ut(n, this.env).interpret();
-        case b.TableGroup:
           return new Mt(n, this.env).interpret();
-        case b.Enum:
+        case b.TableGroup:
           return new Ft(n, this.env).interpret();
+        case b.Enum:
+          return new Bt(n, this.env).interpret();
         case b.Project:
-          return new qn(n, this.env).interpret();
+          return new Jn(n, this.env).interpret();
         default:
           return [];
       }
     });
-    return new B(Jn(this.env), e);
+    return new B(Kn(this.env), e);
   }
 }
-function Jn(t) {
+function Kn(t) {
   return {
     schemas: [],
     tables: Array.from(t.tables.values()),
@@ -3439,31 +3439,31 @@ function Jn(t) {
 var L = /* @__PURE__ */ ((t) => (t[t.Function = 1] = "Function", t[t.Constructor = 2] = "Constructor", t[t.Field = 3] = "Field", t[t.Variable = 4] = "Variable", t[t.Class = 5] = "Class", t[t.Struct = 6] = "Struct", t[t.Interface = 7] = "Interface", t[t.Module = 8] = "Module", t[t.Property = 9] = "Property", t[t.Event = 10] = "Event", t[t.Operator = 11] = "Operator", t[t.Unit = 12] = "Unit", t[t.Value = 13] = "Value", t[t.Constant = 14] = "Constant", t[t.Enum = 15] = "Enum", t[t.EnumMember = 16] = "EnumMember", t[t.Keyword = 17] = "Keyword", t[t.Text = 18] = "Text", t[t.Color = 19] = "Color", t[t.File = 20] = "File", t[t.Reference = 21] = "Reference", t[t.Customcolor = 22] = "Customcolor", t[t.Folder = 23] = "Folder", t[t.TypeParameter = 24] = "TypeParameter", t[t.User = 25] = "User", t[t.Issue = 26] = "Issue", t[t.Snippet = 27] = "Snippet", t))(L || {}), k = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(k || {});
 function Ae(t) {
   switch (t) {
-    case m.Schema:
+    case T.Schema:
       return L.Module;
-    case m.Table:
+    case T.Table:
       return L.Class;
-    case m.Column:
+    case T.Column:
       return L.Field;
-    case m.Enum:
+    case T.Enum:
       return L.Enum;
-    case m.EnumField:
+    case T.EnumField:
       return L.EnumMember;
-    case m.TableGroup:
+    case T.TableGroup:
       return L.Struct;
-    case m.TableGroupField:
+    case T.TableGroupField:
       return L.Field;
     default:
       return L.Text;
   }
 }
-function Re(t, e) {
+function De(t, e) {
   if (!t || Ce(t))
     return !1;
   for (const n of t.trailingTrivia) {
     if (n.start > e)
       break;
-    if (n.kind === u.NEWLINE && n.end <= e)
+    if (n.kind === l.NEWLINE && n.end <= e)
       return !1;
   }
   return !0;
@@ -3473,7 +3473,7 @@ function O() {
     suggestions: []
   };
 }
-function De(t) {
+function Pe(t) {
   return {
     ...t,
     suggestions: t.suggestions.map((e) => ({
@@ -3487,37 +3487,37 @@ function Fe(t) {
     ...t,
     suggestions: t.suggestions.map((e) => ({
       ...e,
-      insertText: e.insertText.split("").every(Ue) ? e.insertText : `"${e.insertText}"`
+      insertText: e.insertText.split("").every(Me) ? e.insertText : `"${e.insertText}"`
     }))
   };
 }
-function et(t, e) {
+function Ke(t, e) {
   return t.getOffsetAt(e);
 }
-class Bt {
+class Vt {
   constructor(e, n = []) {
     this.compiler = e, this.triggerCharacters = n;
   }
   provideCompletionItems(e, n) {
-    var T, f;
-    const s = et(e, n), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(s), c = a === void 0 ? i[0] : i[a + 1];
+    var E, h;
+    const s = Ke(e, n), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(s), u = a === void 0 ? i[0] : i[a + 1];
     if ([
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
-      ...(c == null ? void 0 : c.leadingTrivia) || []
-    ].find((N) => Wt(N) && ge(s, N)))
+      ...(u == null ? void 0 : u.leadingTrivia) || []
+    ].find((m) => zt(m) && ge(s, m)))
       return O();
     if (a === void 0)
       return Tt();
-    if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && ge(s, r))
+    if ([l.STRING_LITERAL, l.QUOTED_STRING].includes(r.kind) && ge(s, r))
       return O();
     const p = this.compiler.container.element(s);
     if (this.compiler.container.scopeKind(s) === R.TOPLEVEL || p instanceof A && p.type && p.type.start <= s && p.type.end >= s)
       return Tt();
-    const h = [...this.compiler.container.stack(s)].reverse();
-    for (const N of h)
-      if (N instanceof Q)
-        switch ((T = N.op) == null ? void 0 : T.value) {
+    const f = [...this.compiler.container.stack(s)].reverse();
+    for (const m of f)
+      if (m instanceof Q)
+        switch ((E = m.op) == null ? void 0 : E.value) {
           case ">":
           case "<":
           case "<>":
@@ -3525,11 +3525,11 @@ class Bt {
             return dt(
               this.compiler,
               s,
-              N
+              m
             );
         }
-      else if (N instanceof q)
-        switch ((f = N.op) == null ? void 0 : f.value) {
+      else if (m instanceof q)
+        switch ((h = m.op) == null ? void 0 : h.value) {
           case ">":
           case "<":
           case "<>":
@@ -3537,25 +3537,25 @@ class Bt {
             return dt(
               this.compiler,
               s,
-              N
+              m
             );
           case ".":
-            return Vt(
+            return Gt(
               this.compiler,
               s,
-              N
+              m
             );
         }
       else {
-        if (N instanceof se)
-          return Et(this.compiler, s, N);
-        if (N instanceof D)
-          return Et(this.compiler, s, N);
-        if (N instanceof J)
-          return Zn(this.compiler, s);
-        if (N instanceof y)
-          return mt(this.compiler, s, N);
-        if (N instanceof A && (N.bodyColon && s >= N.bodyColon.end || N.body && ge(s, N.body)))
+        if (m instanceof se)
+          return Et(this.compiler, s, m);
+        if (m instanceof D)
+          return Et(this.compiler, s, m);
+        if (m instanceof J)
+          return es(this.compiler, s);
+        if (m instanceof y)
+          return mt(this.compiler, s, m);
+        if (m instanceof A && (m.bodyColon && s >= m.bodyColon.end || m.body && ge(s, m.body)))
           return mt(this.compiler, s, void 0);
       }
     return O();
@@ -3565,11 +3565,11 @@ function dt(t, e, n) {
   const s = t.container.scopeKind(e);
   if ([R.REF, R.TABLE].includes(s)) {
     const i = Be(t, e, t.container.element(e), [
-      m.Table,
-      m.Schema,
-      m.Column
+      T.Table,
+      T.Schema,
+      T.Column
     ]);
-    return Re(n.op, e) ? De(i) : i;
+    return De(n.op, e) ? Pe(i) : i;
   }
   return O();
 }
@@ -3581,14 +3581,14 @@ function Be(t, e, n, s) {
   const r = { suggestions: [] };
   for (; i; ) {
     if ((a = i == null ? void 0 : i.symbol) != null && a.symbolTable) {
-      const { symbol: c } = i;
+      const { symbol: u } = i;
       r.suggestions.push(
-        ...t.symbol.members(c).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: h }) => ({
+        ...t.symbol.members(u).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: f }) => ({
           label: p,
           insertText: p,
           insertTextRules: k.KeepWhitespace,
-          kind: Ae(h),
-          sortText: Ae(h).toString().padStart(2, "0"),
+          kind: Ae(f),
+          sortText: Ae(f).toString().padStart(2, "0"),
           range: void 0
         }))
       );
@@ -3597,43 +3597,43 @@ function Be(t, e, n, s) {
   }
   return Fe(r);
 }
-function Zn(t, e) {
+function es(t, e) {
   var s;
   switch (t.container.scopeKind(e)) {
     case R.INDEXES:
-      return Ct(t, e);
+      return Xt(t, e);
     case R.REF:
       {
         const i = [...t.container.stack(e)];
         for (; i.length > 0; ) {
           const r = i.pop();
           if (r instanceof q && ((s = r.op) == null ? void 0 : s.value) === ".")
-            return Vt(
+            return Gt(
               t,
               e,
               r
             );
         }
       }
-      return Gt(t, e);
+      return Ct(t, e);
   }
   return O();
 }
 function Et(t, e, n) {
   const { token: s } = t.container.token(e);
-  if ([u.COMMA, u.LBRACKET].includes(s == null ? void 0 : s.kind)) {
+  if ([l.COMMA, l.LBRACKET].includes(s == null ? void 0 : s.kind)) {
     const i = Nt(t, e);
-    return (s == null ? void 0 : s.kind) === u.COMMA && Re(s, e) ? De(i) : i;
+    return (s == null ? void 0 : s.kind) === l.COMMA && De(s, e) ? Pe(i) : i;
   }
   if (n.name && n.name.start <= e && n.name.end >= e)
     return Nt(t, e);
   if (n.name instanceof $) {
-    const i = Kn(
+    const i = ts(
       t,
       e,
       Te(n.name).unwrap()
     );
-    return (s == null ? void 0 : s.kind) === u.COLON && Re(s, e) ? De(i) : i;
+    return (s == null ? void 0 : s.kind) === l.COLON && De(s, e) ? Pe(i) : i;
   }
   return O();
 }
@@ -3736,7 +3736,7 @@ function Nt(t, e) {
   }
   return O();
 }
-function Kn(t, e, n) {
+function ts(t, e, n) {
   switch (n == null ? void 0 : n.toLowerCase()) {
     case "update":
     case "delete":
@@ -3762,7 +3762,7 @@ function Kn(t, e, n) {
   }
   return O();
 }
-function Vt(t, e, n) {
+function Gt(t, e, n) {
   const s = fe(n).unwrap_or([]);
   if (s.pop(), s.some((r) => !M(r)))
     return O();
@@ -3780,19 +3780,19 @@ function mt(t, e, n) {
   var i;
   switch (t.container.scopeKind(e)) {
     case R.TABLE:
-      return ts(t, e, n);
+      return ss(t, e, n);
     case R.PROJECT:
-      return ns(t, e, n);
+      return is(t, e, n);
     case R.INDEXES:
-      return is(t, e);
+      return as(t, e);
     case R.ENUM:
-      return es(t, e, n);
+      return ns(t, e, n);
     case R.REF: {
-      const r = Gt(t, e);
-      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === u.COLON && Re(t.container.token(e).token, e) ? De(r) : r;
+      const r = Ct(t, e);
+      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === l.COLON && De(t.container.token(e).token, e) ? Pe(r) : r;
     }
     case R.TABLEGROUP:
-      return ss(t);
+      return rs(t);
     default:
       return O();
   }
@@ -3808,14 +3808,14 @@ function Tt() {
     }))
   };
 }
-function es(t, e, n) {
-  return n != null && n.callee && tt(e, n) === 1 ? Be(t, e, t.container.element(e), [
-    m.Schema,
-    m.Table,
-    m.Column
+function ns(t, e, n) {
+  return n != null && n.callee && et(e, n) === 1 ? Be(t, e, t.container.element(e), [
+    T.Schema,
+    T.Table,
+    T.Column
   ]) : O();
 }
-function ts(t, e, n) {
+function ss(t, e, n) {
   if (!(n != null && n.callee))
     return {
       suggestions: ["Note", "indexes"].map((i) => ({
@@ -3826,7 +3826,7 @@ function ts(t, e, n) {
         range: void 0
       }))
     };
-  const s = tt(e, n);
+  const s = et(e, n);
   return s === 0 ? {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
@@ -3835,10 +3835,10 @@ function ts(t, e, n) {
       kind: L.Keyword,
       range: void 0
     }))
-  } : s === 1 ? rs(t, e) : O();
+  } : s === 1 ? os(t, e) : O();
 }
-function ns(t, e, n) {
-  return n != null && n.callee ? tt(e, n) === 0 ? {
+function is(t, e, n) {
+  return n != null && n.callee ? et(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
@@ -3856,21 +3856,21 @@ function ns(t, e, n) {
     }))
   };
 }
-function Gt(t, e) {
+function Ct(t, e) {
   return Be(t, e, t.container.element(e), [
-    m.Schema,
-    m.Table,
-    m.Column
+    T.Schema,
+    T.Table,
+    T.Column
   ]);
 }
-function ss(t) {
+function rs(t) {
   return Fe({
     suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
       const n = ie(e).unwrap_or(void 0);
       if (n === void 0)
         return [];
       const { kind: s, name: i } = n;
-      return s !== m.Table && s !== m.Schema ? [] : {
+      return s !== T.Table && s !== T.Schema ? [] : {
         label: i,
         insertText: i,
         insertTextRules: k.KeepWhitespace,
@@ -3880,10 +3880,10 @@ function ss(t) {
     })
   });
 }
-function is(t, e) {
-  return Ct(t, e);
+function as(t, e) {
+  return Xt(t, e);
 }
-function rs(t, e) {
+function os(t, e) {
   return {
     suggestions: [
       ...[
@@ -3952,13 +3952,13 @@ function rs(t, e) {
         range: void 0
       })),
       ...Be(t, e, t.container.element(e), [
-        m.Enum,
-        m.Schema
+        T.Enum,
+        T.Schema
       ]).suggestions
     ]
   };
 }
-function Ct(t, e) {
+function Xt(t, e) {
   const n = t.container.element(e), s = n == null ? void 0 : n.parent;
   if (!((s == null ? void 0 : s.symbol) instanceof At))
     return O();
@@ -3968,41 +3968,41 @@ function Ct(t, e) {
       const a = ie(r).unwrap_or(void 0);
       if (a === void 0)
         return [];
-      const { name: c } = a;
+      const { name: u } = a;
       return {
-        label: c,
-        insertText: c,
+        label: u,
+        insertText: u,
         insertTextRules: k.KeepWhitespace,
-        kind: Ae(m.Column),
+        kind: Ae(T.Column),
         range: void 0
       };
     })
   });
 }
-function tt(t, e) {
+function et(t, e) {
   if (!e.callee)
     return -1;
   const n = [e.callee, ...e.args], s = n.findIndex((i) => t <= i.end);
   return s === -1 ? n.length : s;
 }
-class Xt {
+class $t {
   constructor(e) {
     this.compiler = e;
   }
   provideDefinition(e, n) {
     var a;
-    const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = Ke(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
-      const c = r.pop();
-      if ((a = c == null ? void 0 : c.referee) != null && a.declaration && [Ee.PRIMARY_EXPRESSION, Ee.VARIABLE].includes(c == null ? void 0 : c.kind)) {
-        const { startPos: p, endPos: h } = c.referee.declaration;
+      const u = r.pop();
+      if ((a = u == null ? void 0 : u.referee) != null && a.declaration && [Ee.PRIMARY_EXPRESSION, Ee.VARIABLE].includes(u == null ? void 0 : u.kind)) {
+        const { startPos: p, endPos: f } = u.referee.declaration;
         return [
           {
             range: {
               startColumn: p.column + 1,
               startLineNumber: p.line + 1,
-              endColumn: h.column + 1,
-              endLineNumber: h.line + 1
+              endColumn: f.column + 1,
+              endLineNumber: f.line + 1
             },
             uri: s
           }
@@ -4012,12 +4012,12 @@ class Xt {
     return [];
   }
 }
-class $t {
+class Wt {
   constructor(e) {
     this.compiler = e;
   }
   provideReferences(e, n) {
-    const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = Ke(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
       const a = r.pop();
       if (a && [
@@ -4025,14 +4025,14 @@ class $t {
         Ee.FUNCTION_APPLICATION,
         Ee.PRIMARY_EXPRESSION
       ].includes(a == null ? void 0 : a.kind)) {
-        const { symbol: c } = a;
-        if (c != null && c.references.length)
-          return c.references.map(({ startPos: p, endPos: h }) => ({
+        const { symbol: u } = a;
+        if (u != null && u.references.length)
+          return u.references.map(({ startPos: p, endPos: f }) => ({
             range: {
               startColumn: p.column + 1,
               startLineNumber: p.line + 1,
-              endColumn: h.column + 1,
-              endLineNumber: h.line + 1
+              endColumn: f.column + 1,
+              endLineNumber: f.line + 1
             },
             uri: s
           }));
@@ -4041,21 +4041,21 @@ class $t {
     return [];
   }
 }
-const cs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const us = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   CompletionItemInsertTextRule: k,
   CompletionItemKind: L,
-  DBMLCompletionItemProvider: Bt,
-  DBMLDefinitionProvider: Xt,
-  DBMLReferencesProvider: $t
+  DBMLCompletionItemProvider: Vt,
+  DBMLDefinitionProvider: $t,
+  DBMLReferencesProvider: Wt
 }, Symbol.toStringTag, { value: "Module" }));
 var R = /* @__PURE__ */ ((t) => (t[t.TABLE = 0] = "TABLE", t[t.ENUM = 1] = "ENUM", t[t.TABLEGROUP = 2] = "TABLEGROUP", t[t.INDEXES = 3] = "INDEXES", t[t.NOTE = 4] = "NOTE", t[t.REF = 5] = "REF", t[t.PROJECT = 6] = "PROJECT", t[t.CUSTOM = 7] = "CUSTOM", t[t.TOPLEVEL = 8] = "TOPLEVEL", t))(R || {});
-class ls {
+class hs {
   constructor() {
     this.source = "", this.cache = new Array(
       16
       /* TOTAL_QUERY_COUNT */
-    ).fill(null), this.nodeIdGenerator = new Yt(), this.symbolIdGenerator = new Jt(), this.token = {
+    ).fill(null), this.nodeIdGenerator = new Qt(), this.symbolIdGenerator = new Kt(), this.token = {
       invalidStream: this.createQuery(
         6,
         () => this.parse.tokens().filter(vt)
@@ -4070,8 +4070,8 @@ class ls {
       _: this.createQuery(
         0,
         () => {
-          const e = new cn(this.source).lex().chain((n) => new hn(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new Wn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
-          return e.getErrors().length > 0 ? e : e.chain(({ ast: n, tokens: s }) => new Hn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
+          const e = new un(this.source).lex().chain((n) => new pn(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new zn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
+          return e.getErrors().length > 0 ? e : e.chain(({ ast: n, tokens: s }) => new Zn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
         }
       ),
       ast: this.createQuery(
@@ -4095,44 +4095,38 @@ class ls {
       stack: this.createQuery(
         10,
         (e) => {
-          const n = this.parse.tokens();
-          let { index: s } = this.container.token(e);
-          const { token: i } = this.container.token(e);
-          if (s === void 0)
-            return [this.parse.ast()];
-          for (; n[s].isInvalid && s >= 0; )
-            s -= 1;
-          if (s === -1)
+          const n = this.token.flatStream(), { index: s, token: i } = this.container.token(e), r = s === void 0 ? -1 : jt(n, (f) => !f.isInvalid, s);
+          if (r === -1)
             return [this.parse.ast()];
-          const r = n[s].start;
-          let a = this.parse.ast();
-          const c = [a];
+          const a = n[r].start;
+          let u = this.parse.ast();
+          const p = [u];
           for (; ; ) {
-            const h = on(a).find((T) => ge(r, T));
-            if (h === void 0 || h instanceof F)
+            const E = ln(u).find((h) => ge(a, h));
+            if (E === void 0 || E instanceof F)
               break;
-            c.push(h), a = h;
+            p.push(E), u = E;
           }
-          if ((i == null ? void 0 : i.kind) === u.COLON)
-            return c;
-          for (; c.length > 0; ) {
-            let p = !1;
-            const h = I.last(c);
-            if (h instanceof y) {
-              const T = this.parse.source();
-              for (let f = h.end; f < e; f += 1)
-                T[f] === `
-` && (c.pop(), p = !0);
+          if ((i == null ? void 0 : i.kind) === l.COLON)
+            return p;
+          for (; p.length > 0; ) {
+            let f = !1;
+            const E = it(p);
+            if (E instanceof y) {
+              const h = this.parse.source();
+              for (let m = E.end; m < e; m += 1)
+                h[m] === `
+` && (p.pop(), f = !0);
             } else
-              h instanceof Q || h instanceof q ? this.container.token(e).token !== h.op && (c.pop(), p = !0) : h instanceof D ? h.listCloseBracket && h.end <= e && (c.pop(), p = !0) : h instanceof J ? h.tupleCloseParen && h.end <= e && (c.pop(), p = !0) : h instanceof ne ? h.blockCloseBrace && h.end <= e && (c.pop(), p = !0) : h instanceof $ || h.end < e && (c.pop(), p = !0);
-            if (p) {
-              const T = I.last(c);
-              T instanceof A && T.end <= e && c.pop();
+              E instanceof Q || E instanceof q ? this.container.token(e).token !== E.op && (p.pop(), f = !0) : E instanceof D ? E.listCloseBracket && E.end <= e && (p.pop(), f = !0) : E instanceof J ? E.tupleCloseParen && E.end <= e && (p.pop(), f = !0) : E instanceof ne ? E.blockCloseBrace && E.end <= e && (p.pop(), f = !0) : E instanceof $ || E.end < e && (p.pop(), f = !0);
+            if (f) {
+              const h = it(p);
+              h instanceof A && h.end <= e && p.pop();
             }
-            if (!p)
+            if (!f)
               break;
           }
-          return c;
+          return p;
         }
       ),
       token: this.createQuery(
@@ -4204,15 +4198,15 @@ class ls {
             if (!((i = r.symbol) != null && i.symbolTable))
               continue;
             const { symbolTable: a } = r.symbol;
-            let c = [a], p = [];
-            for (const h of e)
-              p = c.flatMap(
-                (T) => qt(h).flatMap((f) => {
-                  const N = T.get(f), g = ie(f).unwrap_or(void 0);
-                  return !N || !g ? [] : { ...g, symbol: N };
+            let u = [a], p = [];
+            for (const f of e)
+              p = u.flatMap(
+                (E) => Jt(f).flatMap((h) => {
+                  const m = E.get(h), g = ie(h).unwrap_or(void 0);
+                  return !m || !g ? [] : { ...g, symbol: m };
                 })
-              ), c = p.flatMap(
-                (T) => T.symbol.symbolTable ? T.symbol.symbolTable : []
+              ), u = p.flatMap(
+                (E) => E.symbol.symbolTable ? E.symbol.symbolTable : []
               );
             s.push(...p);
           }
@@ -4238,8 +4232,8 @@ class ls {
         if (r.has(a))
           return r.get(a);
       }
-      const c = n(i);
-      return i !== void 0 ? r instanceof Map ? r.set(a, c) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, c)) : this.cache[e] = c, c;
+      const u = n(i);
+      return i !== void 0 ? r instanceof Map ? r.set(a, u) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, u)) : this.cache[e] = u, u;
     };
   }
   setSource(e) {
@@ -4250,14 +4244,14 @@ class ls {
   }
   initMonacoServices() {
     return {
-      definitionProvider: new Xt(this),
-      referenceProvider: new $t(this),
-      autocompletionProvider: new Bt(this)
+      definitionProvider: new $t(this),
+      referenceProvider: new Wt(this),
+      autocompletionProvider: new Vt(this)
     };
   }
 }
 export {
-  ls as Compiler,
-  os as serialize,
-  cs as services
+  hs as Compiler,
+  ls as serialize,
+  us as services
 };