@dbml/parse 3.4.1-alpha.0 → 3.4.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 Wt(t) {
+function jt(t) {
   switch (t.kind) {
     case "<newline>":
     case "<space>":
@@ -36,12 +36,12 @@ function rt(t) {
 function at(t) {
   return t !== void 0 && t.kind === "<op>";
 }
-class M {
+class F {
   constructor(e, n, s, i, r) {
     this.kind = e, this.startPos = n, this.endPos = s, this.value = i, this.leadingTrivia = [], this.trailingTrivia = [], this.leadingInvalid = [], this.trailingInvalid = [], this.isInvalid = r, this.start = n.offset, this.end = s.offset;
   }
   static create(e, n, s, i, r) {
-    return new M(e, n, s, i, r);
+    return new F(e, n, s, i, r);
   }
 }
 function bt(t) {
@@ -59,7 +59,7 @@ function It(t) {
 function Lt(t) {
   return t.leadingTrivia.length === 0 ? t.start : Lt(t.leadingTrivia[0]);
 }
-function jt(t) {
+function Wt(t) {
   return [u.SINGLE_LINE_COMMENT, u.MULTILINE_COMMENT].includes(
     t.kind
   );
@@ -75,19 +75,19 @@ class Yt {
     return this.id++;
   }
 }
-class k {
+class x {
   // The symbol that this syntax node refers to
   // args must be passed in order of appearance in the node
   constructor(e, n, s) {
     this.id = e, this.kind = n;
     const i = s.find((a) => a !== void 0 && !Number.isNaN(a.start));
-    i ? (this.startPos = i.startPos, this.fullStart = i instanceof M ? Lt(i) : i.fullStart) : (this.startPos = {
+    i ? (this.startPos = i.startPos, this.fullStart = i instanceof F ? Lt(i) : i.fullStart) : (this.startPos = {
       offset: NaN,
       column: NaN,
       line: NaN
     }, this.fullStart = NaN);
     const r = [...s].reverse().find((a) => a !== void 0 && !Number.isNaN(a.end));
-    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof M ? It(r) : r.fullEnd) : (this.endPos = {
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof F ? It(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
@@ -95,12 +95,12 @@ class k {
   }
 }
 var de = /* @__PURE__ */ ((t) => (t.PROGRAM = "<program>", t.ELEMENT_DECLARATION = "<element-declaration>", t.ATTRIBUTE = "<attribute>", t.IDENTIFIER_STREAM = "<identifer-stream>", t.LITERAL = "<literal>", t.VARIABLE = "<variable>", t.PREFIX_EXPRESSION = "<prefix-expression>", t.INFIX_EXPRESSION = "<infix-expression>", t.POSTFIX_EXPRESSION = "<postfix-expression>", t.FUNCTION_EXPRESSION = "<function-expression>", t.FUNCTION_APPLICATION = "<function-application>", t.BLOCK_EXPRESSION = "<block-expression>", t.LIST_EXPRESSION = "<list-expression>", t.TUPLE_EXPRESSION = "<tuple-expression>", t.CALL_EXPRESSION = "<call-expression>", t.PRIMARY_EXPRESSION = "<primary-expression>", t.GROUP_EXPRESSION = "<group-expression>", t.DUMMY = "<dummy>", t.ARRAY = "<array>", t))(de || {});
-class G extends k {
+class G extends x {
   constructor({ body: e = [], eof: n }, s) {
     super(s, "<program>", [...e, n]), this.body = e, this.eof = n;
   }
 }
-class A extends k {
+class A extends x {
   constructor({
     type: e,
     name: n,
@@ -108,7 +108,7 @@ class A extends k {
     alias: i,
     attributeList: r,
     bodyColon: a,
-    body: l
+    body: c
   }, p) {
     if (super(p, "<element-declaration>", [
       e,
@@ -117,18 +117,18 @@ class A extends k {
       i,
       r,
       a,
-      l
-    ]), l && a && !(l instanceof w || l instanceof A))
+      c
+    ]), c && a && !(c instanceof w || c 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 = l;
+    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = c;
   }
 }
-class $ extends k {
+class $ extends x {
   constructor({ identifiers: e = [] }, n) {
     super(n, "<identifer-stream>", e || []), this.identifiers = e;
   }
 }
-class se extends k {
+class se extends x {
   constructor({
     name: e,
     colon: n,
@@ -137,12 +137,12 @@ class se extends k {
     super(i, "<attribute>", [e, n, s]), this.name = e, this.value = s, this.colon = n;
   }
 }
-class q extends k {
+class q extends x {
   constructor({ op: e, expression: n }, s) {
     super(s, "<prefix-expression>", [e, n]), this.op = e, this.expression = n;
   }
 }
-class H extends k {
+class H extends x {
   constructor({
     op: e,
     leftExpression: n,
@@ -151,22 +151,22 @@ class H extends k {
     super(i, "<infix-expression>", [n, e, s]), this.op = e, this.leftExpression = n, this.rightExpression = s;
   }
 }
-class Pe extends k {
+class Pe extends x {
   constructor({ op: e, expression: n }, s) {
     super(s, "<postfix-expression>", [n, e]), this.op = e, this.expression = n;
   }
 }
-class te extends k {
+class te extends x {
   constructor({ value: e }, n) {
     super(n, "<function-expression>", [e]), this.value = e;
   }
 }
-class w extends k {
+class w extends x {
   constructor({ callee: e, args: n = [] }, s) {
     super(s, "<function-application>", [e, ...n]), this.callee = e, this.args = n;
   }
 }
-class ne extends k {
+class ne extends x {
   constructor({
     blockOpenBrace: e,
     body: n = [],
@@ -175,7 +175,7 @@ class ne extends k {
     super(i, "<block-expression>", [e, ...n, s]), this.blockOpenBrace = e, this.body = n, this.blockCloseBrace = s;
   }
 }
-class P extends k {
+class P extends x {
   constructor({
     listOpenBracket: e,
     elementList: n = [],
@@ -189,7 +189,7 @@ class P extends k {
     ]), this.listOpenBracket = e, this.elementList = n, this.commaList = s, this.listCloseBracket = i;
   }
 }
-class Z extends k {
+class Z extends x {
   constructor({
     tupleOpenParen: e,
     elementList: n = [],
@@ -203,7 +203,7 @@ class Z extends k {
     ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
 }
-class We extends Z {
+class je extends Z {
   constructor({
     groupOpenParen: e,
     expression: n,
@@ -220,7 +220,7 @@ class We extends Z {
     ), this.kind = "<group-expression>";
   }
 }
-class J extends k {
+class J extends x {
   constructor({
     callee: e,
     argumentList: n
@@ -228,28 +228,28 @@ class J extends k {
     super(s, "<call-expression>", [e, n]), this.callee = e, this.argumentList = n;
   }
 }
-class Te extends k {
+class Te extends x {
   constructor({ literal: e }, n) {
     super(n, "<literal>", [e]), this.literal = e;
   }
 }
-class j extends k {
+class W extends x {
   constructor({ variable: e }, n) {
     super(n, "<variable>", [e]), this.variable = e;
   }
 }
-class D extends k {
+class D extends x {
   constructor({ expression: e }, n) {
     super(n, "<primary-expression>", [e]), this.expression = e;
   }
 }
-class ke extends k {
+class ke extends x {
   constructor({ pre: e }, n) {
-    const s = M.create(u.SPACE, e.endPos, e.endPos, " ", !1);
+    const s = F.create(u.SPACE, e.endPos, e.endPos, " ", !1);
     super(n, "<dummy>", [s]);
   }
 }
-class le extends k {
+class le extends x {
   constructor({ expression: e, indexer: n }, s) {
     super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
@@ -335,7 +335,7 @@ class v {
   }
 }
 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 je(t) {
+function We(t) {
   return `Schema:${t}`;
 }
 function Se(t) {
@@ -368,7 +368,7 @@ function Ve(t, e) {
     case "Enum field":
       return Qe(t);
     case "Schema":
-      return je(t);
+      return We(t);
     case "Table":
       return Se(t);
     case "TableGroup":
@@ -395,7 +395,7 @@ function Qt(t) {
 }
 function qt(t) {
   return [
-    je,
+    We,
     Se,
     ze,
     qe,
@@ -474,9 +474,9 @@ class nn {
   }
 }
 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 c extends Error {
+class l 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, c.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, l.prototype);
   }
 }
 class B {
@@ -532,7 +532,7 @@ function lt(t) {
   return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function E(t) {
-  t && (t instanceof M ? rn(t) : an(t));
+  t && (t instanceof F ? rn(t) : an(t));
 }
 function rn(t) {
   t.kind !== u.EOF && (t.isInvalid = !0);
@@ -564,12 +564,12 @@ function an(t) {
     E(t.expression);
   else if (t instanceof te)
     E(t.value);
-  else if (t instanceof j)
+  else if (t instanceof W)
     E(t.variable);
   else if (t instanceof Te)
     E(t.literal);
   else
-    throw t instanceof We ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
+    throw t instanceof je ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
 }
 function vt(t) {
   return !!(t != null && t.isInvalid);
@@ -596,7 +596,7 @@ function on(t) {
     return t.identifiers;
   if (t instanceof Te)
     return t.literal ? [t.literal] : [];
-  if (t instanceof j)
+  if (t instanceof W)
     return U(t.variable);
   if (t instanceof q)
     return U(t.op, t.expression);
@@ -631,25 +631,25 @@ function on(t) {
       t.array,
       t.indexer
     );
-  throw t instanceof We ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
+  throw t instanceof je ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
 function Ge(t) {
-  return F(t) ? new S(t.expression.variable) : new v();
+  return M(t) ? new S(t.expression.variable) : new v();
 }
 function Y(t) {
   var e;
-  return t instanceof D && (t.expression instanceof j && t.expression.variable instanceof M && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof Te && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
+  return t instanceof D && (t.expression instanceof W && t.expression.variable instanceof F && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof Te && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
 }
-function F(t) {
-  return t instanceof D && t.expression instanceof j && t.expression.variable instanceof M;
+function M(t) {
+  return t instanceof D && t.expression instanceof W && t.expression.variable instanceof F;
 }
 function Ne(t) {
   var e;
-  return t instanceof D && t.expression instanceof j && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
+  return t instanceof D && t.expression instanceof W && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
 }
 function Je(t) {
   var e;
-  return t instanceof H && t.leftExpression instanceof k && t.rightExpression instanceof k && ((e = t.op) == null ? void 0 : e.value) === ".";
+  return t instanceof H && t.leftExpression instanceof x && t.rightExpression instanceof x && ((e = t.op) == null ? void 0 : e.value) === ".";
 }
 function me(t) {
   if (t === void 0)
@@ -697,7 +697,7 @@ class cn {
     this.tokens.push(this.createToken(e, n));
   }
   createToken(e, n = !1) {
-    return M.create(
+    return F.create(
       e,
       this.start,
       this.current,
@@ -706,7 +706,7 @@ class cn {
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(M.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(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
   }
   scanTokens() {
     for (; !this.isAtEnd(); ) {
@@ -780,7 +780,7 @@ class cn {
             break;
           }
           this.addToken(u.OP, !0), this.errors.push(
-            new c(
+            new l(
               o.UNKNOWN_SYMBOL,
               `Unexpected token '${e}'`,
               this.createToken(u.OP, !0)
@@ -795,7 +795,7 @@ class cn {
     let e = !0, n = [], s;
     const i = [];
     for (const r of this.tokens)
-      Wt(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);
+      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);
     this.tokens = i;
   }
   gatherInvalid() {
@@ -820,14 +820,14 @@ class cn {
     // Whether to interpret '\' as a backlash
     consumeStopSequence: a = !0
   }) {
-    let l = "";
+    let c = "";
     for (; !this.isAtEnd() && (s || !this.check(`
 `)) && !this.check(n); )
-      this.peek() === "\\" && !r ? (this.advance(), l += this.escapedString()) : l += this.advance();
+      this.peek() === "\\" && !r ? (this.advance(), c += this.escapedString()) : c += this.advance();
     if (this.isAtEnd() && !i) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new c(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
+        new l(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 c(
+        new l(
           o.UNEXPECTED_NEWLINE,
           "Invalid newline encountered while parsing",
           p
@@ -843,7 +843,7 @@ class cn {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(M.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(F.create(e, this.start, this.current, c, !1));
   }
   singleLineStringLiteral() {
     this.consumeUntil(u.STRING_LITERAL, "'", {
@@ -920,7 +920,7 @@ class cn {
       for (; !this.isAtEnd() && (this.check(".") || pe(this.peek())); )
         this.advance();
       const n = this.createToken(u.NUMERIC_LITERAL, !0);
-      this.tokens.push(n), this.errors.push(new c(o.UNKNOWN_TOKEN, "Invalid number", n));
+      this.tokens.push(n), this.errors.push(new l(o.UNKNOWN_TOKEN, "Invalid number", n));
     } else {
       for (; !this.isAtEnd() && pe(this.peek()); )
         this.advance();
@@ -971,15 +971,13 @@ class cn {
         let n = "";
         for (let s = 0; s <= 3; s += 1) {
           if (this.isAtEnd() || !pe(this.peek()))
-            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`, M.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
+            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}`;
           n += this.advance();
         }
         return String.fromCharCode(parseInt(n, 16));
       }
-      default: {
-        const n = `\\${this.text[this.current.offset - 1]}`;
-        return this.errors.push(new c(o.INVALID_ESCAPE_SEQUENCE, `Invalid escape sequence '${n}'`, M.create(u.STRING_LITERAL, e, this.current, n, !0))), n;
-      }
+      default:
+        return this.text[this.current.offset - 1];
     }
   }
 }
@@ -1122,7 +1120,7 @@ class hn {
           E(s), this.advance();
         }
     }, this.tupleExpression = this.contextStack.withContextDo(xe.GroupExpression, () => {
-      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(We, {
+      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(je, {
         groupOpenParen: s.tupleOpenParen,
         groupCloseParen: s.tupleCloseParen,
         expression: s.elementList[0]
@@ -1152,7 +1150,7 @@ class hn {
         } catch (a) {
           if (!(a instanceof d))
             throw a;
-          if (a.partialNode instanceof k && s.elementList.push(a.partialNode), !this.canHandle(a))
+          if (a.partialNode instanceof x && s.elementList.push(a.partialNode), !this.canHandle(a))
             throw new d(a.token, r(), a.handlerContext);
           this.synchronizeTuple();
         }
@@ -1200,7 +1198,7 @@ class hn {
         } catch (r) {
           if (!(r instanceof d))
             throw r;
-          if (r.partialNode instanceof k && s.elementList.push(r.partialNode), !this.canHandle(r))
+          if (r.partialNode instanceof x && s.elementList.push(r.partialNode), !this.canHandle(r))
             throw new d(r.token, i(), r.handlerContext);
           this.synchronizeList();
         }
@@ -1382,7 +1380,7 @@ class hn {
     }
     try {
       const s = this.expression();
-      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;
+      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;
     } catch (s) {
       throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
@@ -1478,12 +1476,12 @@ class hn {
               op: i,
               rightExpression: i.value === "." ? this.extractOperand() : this.expression_bp(a.right)
             });
-          } catch (l) {
-            throw l instanceof d ? (n = this.nodeFactory.create(H, {
+          } catch (c) {
+            throw c instanceof d ? (n = this.nodeFactory.create(H, {
               leftExpression: n,
               op: i,
-              rightExpression: l.partialNode
-            }), new d(l.token, n, l.handlerContext)) : l;
+              rightExpression: c.partialNode
+            }), new d(c.token, n, c.handlerContext)) : c;
           }
         }
       } else
@@ -1576,12 +1574,12 @@ class hn {
       });
     if (this.match(u.QUOTED_STRING, u.IDENTIFIER))
       return this.nodeFactory.create(D, {
-        expression: this.nodeFactory.create(j, { variable: this.previous() })
+        expression: this.nodeFactory.create(W, { variable: this.previous() })
       });
     throw this.logError(this.peek(), o.UNEXPECTED_TOKEN, "Expect a variable or literal"), new d(
       this.peek(),
       this.nodeFactory.create(D, {
-        expression: this.nodeFactory.create(j, {})
+        expression: this.nodeFactory.create(W, {})
       }),
       this.contextStack.findHandlerContext(this.tokens, this.current)
     );
@@ -1639,7 +1637,7 @@ class hn {
     return this.nodeFactory.create($, { identifiers: e });
   }
   logError(e, n, s) {
-    this.errors.push(new c(n, s, e));
+    this.errors.push(new l(n, s, e));
   }
 }
 const fn = {
@@ -1724,7 +1722,7 @@ function _e(t) {
     return new v();
   const n = [];
   let s;
-  if (!F(I.last(e))) {
+  if (!M(I.last(e))) {
     const i = e.pop();
     if (kt(i))
       s = i.elementList.map(
@@ -1745,7 +1743,7 @@ function _e(t) {
   });
 }
 function X(t) {
-  return F(t) ? new S(t.expression.variable.value) : new v();
+  return M(t) ? new S(t.expression.variable.value) : new v();
 }
 function Xe(t) {
   if (ht(t))
@@ -1753,7 +1751,7 @@ function Xe(t) {
   if (t instanceof Z && t.elementList.every(ht)) {
     const e = t.elementList.filter(
       (s) => s instanceof te
-    ), n = t.elementList.filter(F);
+    ), n = t.elementList.filter(M);
     return new S({ functional: e, nonFunctional: n });
   }
   return new v();
@@ -1764,7 +1762,7 @@ function V(t) {
   return e === void 0 ? new v() : new S(e);
 }
 function Q(t) {
-  return Y(t) ? t.expression instanceof j ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new v();
+  return Y(t) ? t.expression instanceof W ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new v();
 }
 function mn(t) {
   var e;
@@ -1778,16 +1776,16 @@ function Tn(t) {
   return (s == null ? void 0 : s.length) === (i == null ? void 0 : i.length);
 }
 function ht(t) {
-  return t instanceof D && t.expression instanceof j || t instanceof te;
+  return t instanceof D && t.expression instanceof W || t instanceof te;
 }
 function bn(t, e) {
-  var i, r, a, l;
+  var i, r, a, c;
   let n = e;
   const s = Qt(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 (((l = n.symbol) == null ? void 0 : l.declaration) instanceof G && s)
+    if (((c = n.symbol) == null ? void 0 : c.declaration) instanceof G && s)
       return n.symbol;
     if (n instanceof G)
       return;
@@ -1802,24 +1800,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 c(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 l(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof ne)
-      return [new c(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
+      return [new l(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
     const n = [];
-    return Y(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;
+    return Y(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;
   }
 }
 class we {
@@ -1847,26 +1845,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 c(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Ze(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)];
+    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)];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(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() });
     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), l = ze(r);
-      a.has(l) && e.push(new c(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(l, this.declarationNode.symbol);
+      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);
     }
     return e;
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -1877,25 +1875,25 @@ class Ln {
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new l(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !F(n.callee) && s.push(new c(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 l(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 P ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof P && (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;
+      return I.last(i) instanceof P ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof P && (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;
     });
   }
   validateFieldSettings(e) {
-    const n = W(e), s = n.getErrors(), i = n.getValue();
+    const n = j(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((l) => s.push(new c(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            Y(l.value) || s.push(new c(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", c));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, c)));
       }
     }
     return s;
@@ -1909,15 +1907,15 @@ class Ln {
     });
   }
   registerField(e) {
-    if (e.callee && F(e.callee)) {
+    if (e.callee && M(e.callee)) {
       const n = V(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(Kt, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -1933,22 +1931,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 c(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 l(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new c(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
+    return e ? [new l(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
@@ -1959,35 +1957,35 @@ class gn {
       const s = [], i = [n.callee, ...n.args];
       return I.last(i) instanceof P && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
         for (; r instanceof J; )
-          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));
+          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));
       }), s;
     });
   }
   validateFieldSetting(e) {
-    const n = W(e), s = n.getErrors(), i = n.getValue();
+    const n = j(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((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            Y(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, c));
           });
           break;
         case "unique":
         case "pk":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            ce(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            ce(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, c));
           });
           break;
         case "type":
-          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
-            F(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+          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));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, c)));
       }
     }
     return s;
@@ -2009,24 +2007,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 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)] : [];
+    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)] : [];
   }
   validateName(e) {
     if (!(this.declarationNode.parent instanceof G))
-      return e ? [new c(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+      return e ? [new l(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
     if (!e)
-      return [new c(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
+      return [new l(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
     const n = C(e);
     if (!n.isOk())
-      return [new c(o.INVALID_NAME, "Invalid name for sticky note ", this.declarationNode)];
+      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 c(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
+    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), []);
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -2038,7 +2036,7 @@ class _n {
   }
   validateFields(e) {
     const 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))), Y(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);
+    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))), Y(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);
   }
   validateSubElements(e) {
     return e.flatMap((n) => {
@@ -2057,25 +2055,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 c(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Me(e) ? [] : [new c(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", 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)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [
-      ...n.map((i) => new c(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
+      ...n.map((i) => new l(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
       ...this.validateSubElements(s)
     ];
   }
@@ -2096,16 +2094,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 c(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
+    return this.declarationNode.parent instanceof G ? [] : [new l(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
   }
   validateName(e) {
-    return e ? Me(e) ? [] : [new c(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", 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)] : [];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
@@ -2117,27 +2115,27 @@ class vn {
   }
   validateFields(e) {
     if (e.length === 0)
-      return [new c(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
+      return [new l(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 c(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
-      s.callee && !mn(s.callee) && n.push(new c(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !Tn(s.callee) && n.push(new c(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
+    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));
       const i = [...s.args];
-      I.last(i) instanceof P ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof P && (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)));
+      I.last(i) instanceof P ? (this.validateFieldSettings(I.last(i)), i.pop()) : i[0] instanceof P && (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)));
     }), n;
   }
   validateFieldSettings(e) {
-    const n = W(e), s = n.getErrors(), i = n.getValue();
+    const n = j(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((l) => s.push(new c(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            wn(l.value) || s.push(new c(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, l));
+          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));
           });
           break;
         default:
-          a.forEach((l) => s.push(new c(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, c)));
       }
     }
     return s;
@@ -2152,7 +2150,7 @@ class vn {
   }
 }
 function wn(t) {
-  if (!(F(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
+  if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
     return !1;
   let e;
   if (t instanceof $ ? e = me(t).unwrap_or("") : e = t.expression.variable.value, e)
@@ -2176,31 +2174,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 c(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof le ? [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)] : Ze(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)];
+    return e ? e instanceof le ? [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)];
   }
   validateAlias(e) {
-    return e ? On(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
+    return e ? On(e) ? [] : [new l(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
   }
   validateSettingList(e) {
-    const n = W(e), s = n.getErrors(), i = n.getValue();
+    const n = j(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((l) => new c(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", l))), a.forEach((l) => {
-            Rn(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
+          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));
           });
           break;
         case "note":
-          a.length > 1 && s.push(...a.map((l) => new c(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            Y(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'note' must be a string literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'note' must be a string literal", c.value || c.name));
           });
           break;
         default:
-          s.push(...a.map((l) => new c(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
+          s.push(...a.map((c) => new l(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, c)));
       }
     }
     return s;
@@ -2210,12 +2208,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(), l = Ke(r, this.publicSymbolTable, this.symbolFactory), p = Se(a);
-      l.has(p) && e.push(new c(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), l.set(p, this.declarationNode.symbol);
+      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);
     }
     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 c(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
+      this.publicSymbolTable.has(a) && e.push(new l(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
     }
     return e;
   }
@@ -2223,30 +2221,30 @@ class yn {
     if (!e)
       return [];
     if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new c(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new l(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 c(o.INVALID_COLUMN, "A column must have a type", n.callee)), F(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] && !kn(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      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]));
       const i = n.args.slice(1);
       return s.push(...this.validateFieldSetting(i)), s.push(...this.registerField(n)), s;
     });
   }
   registerField(e) {
-    if (e.callee && F(e.callee)) {
+    if (e.callee && M(e.callee)) {
       const n = V(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(en, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
-          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2256,74 +2254,74 @@ class yn {
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
     if (!e.slice(0, -1).every(Ne) || !e.slice(-1).every((p) => Ne(p) || p instanceof P))
-      return [...e.map((p) => new c(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
+      return [...e.map((p) => new l(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 P && (n = e.pop());
-    const s = W(n), i = s.getErrors(), r = s.getValue();
+    const s = j(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 c(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
+        i.push(new l(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);
     }
-    const a = r.pk || [], l = r["primary key"] || [];
-    a.length >= 1 && l.length >= 1 && i.push(...[...a, ...l].map((p) => new c(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", 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)));
     for (const p in r) {
       const h = r[p];
       switch (p) {
         case "note":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
-            Y(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", f.value || f.name));
+          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
+            Y(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", f.value || f.name));
           });
           break;
         case "ref":
           h.forEach((f) => {
-            Pn(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", f.value || f.name));
+            Pn(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", f.value || f.name));
           });
           break;
         case "primary key":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
-            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
+          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
+            ce(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
           });
           break;
         case "pk":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
+          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 && !ce(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
           });
           break;
         case "not null":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
+          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 c(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", f))), h.forEach((f) => {
-            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
+          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) => {
+            ce(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
           });
           break;
         case "null":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
-            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
+          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
+            ce(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
           });
           break;
         case "unique":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
+          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 && !ce(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
           });
           break;
         case "increment":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
+          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 && !ce(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
           });
           break;
         case "default":
-          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
-            Dn(f.value) || i.push(new c(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", f.value || f.name));
+          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));
           });
           break;
         default:
-          h.forEach((f) => i.push(new c(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
+          h.forEach((f) => i.push(new l(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
       }
     }
     return i;
@@ -2338,7 +2336,7 @@ 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 c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
+    return s.length > 1 && (n.push(...s.map((i) => new l(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
   }
 }
 function kn(t) {
@@ -2368,13 +2366,13 @@ 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 c(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new l(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Ze(e) ? [] : [new c(o.INVALID_NAME, "A TableGroup name must be of the form <tablegroup> or <schema>.<tablegroup>", e)] : [new c(o.NAME_NOT_FOUND, "A TableGroup must have a name", this.declarationNode)];
+    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)];
   }
   validateAlias(e) {
-    return e ? [new c(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const { name: e } = this.declarationNode;
@@ -2383,26 +2381,26 @@ class Sn {
     if (n.isOk()) {
       const s = n.unwrap(), i = s.pop(), r = Ke(s, this.publicSymbolTable, this.symbolFactory), a = qe(i);
       if (r.has(a))
-        return [new c(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
+        return [new l(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
       r.set(a, this.declarationNode.symbol);
     }
     return [];
   }
   validateSettingList(e) {
-    return e ? [new c(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof w)
-      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
     const [n, s] = I.partition(e.body, (i) => i instanceof w);
     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 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;
+      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;
     });
   }
   validateSubElements(e) {
@@ -2414,15 +2412,15 @@ class Sn {
     });
   }
   registerField(e) {
-    if (e.callee && F(e.callee)) {
+    if (e.callee && M(e.callee)) {
       const n = V(e.callee).unwrap(), s = He(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 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)
+          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)
         ];
       }
       r.set(s, i);
@@ -2458,7 +2456,7 @@ function On(t) {
   return Me(t);
 }
 function Me(t) {
-  return t instanceof D && t.expression instanceof j;
+  return t instanceof D && t.expression instanceof W;
 }
 function Ke(t, e, n) {
   var i;
@@ -2466,14 +2464,14 @@ function Ke(t, e, n) {
   let s = e;
   for (const r of t) {
     let a;
-    const l = je(r);
-    if (s.has(l)) {
-      if (a = (i = s.get(l)) == null ? void 0 : i.symbolTable, !a)
+    const c = We(r);
+    if (s.has(c)) {
+      if (a = (i = s.get(c)) == 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(l, p);
+      s.set(c, p);
     }
     s = a;
   }
@@ -2513,9 +2511,9 @@ function Pn(t) {
   return e !== void 0 && e.length > 0;
 }
 function kt(t) {
-  return t instanceof Z && t.elementList.every(F);
+  return t instanceof Z && t.elementList.every(M);
 }
-function W(t) {
+function j(t) {
   var s;
   const e = {}, n = [];
   if (!t)
@@ -2524,7 +2522,7 @@ function W(t) {
     if (!i.name)
       continue;
     if (i.name instanceof D) {
-      n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
+      n.push(new l(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
     const r = (s = me(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
@@ -2551,7 +2549,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 c(o.PROJECT_REDEFINED, "Only one project can exist", s))), new B(this.ast, e);
+    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);
   }
 }
 class ae {
@@ -2602,7 +2600,7 @@ class ae {
     var s, i;
     if (e)
       if (e instanceof D) {
-        if (e.expression instanceof j && ((i = n.keywords) != null && i.includes((s = e.expression.variable) == null ? void 0 : s.value.toLowerCase())))
+        if (e.expression instanceof W && ((i = n.keywords) != null && i.includes((s = e.expression.variable) == null ? void 0 : s.value.toLowerCase())))
           return;
         this.bindFragments([e], n);
       } else
@@ -2614,7 +2612,7 @@ class ae {
   bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((f) => !F(f)), l = 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((f) => !M(f)), c = r !== -1 && kt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, h = e.slice(
       0,
       r === -1 ? void 0 : r
     );
@@ -2635,7 +2633,7 @@ class ae {
         referrer: f
       });
     }
-    return l ? l.elementList.forEach(
+    return c ? c.elementList.forEach(
       (f) => this.resolveIndexStack(
         [
           ...T,
@@ -2663,24 +2661,24 @@ class ae {
       return;
     }
     r.references.push(s.referrer), s.referrer.referee = r;
-    let a = r.symbolTable, { kind: l, name: p } = ie(s.index).unwrap();
+    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) {
         this.logError(
           h.referrer,
-          `${l} '${p}' does not have ${T} '${f}'`,
+          `${c} '${p}' does not have ${T} '${f}'`,
           n
         );
         return;
       }
-      if (l = T, p = f, h.referrer.referee = N, N.references.push(h.referrer), !N.symbolTable)
+      if (c = T, p = f, h.referrer.referee = N, N.references.push(h.referrer), !N.symbolTable)
         break;
       a = N.symbolTable;
     }
   }
   logError(e, n, s) {
-    s || this.errors.push(new c(o.BINDING_ERROR, n, e));
+    s || this.errors.push(new l(o.BINDING_ERROR, n, e));
   }
 }
 class Un extends ae {
@@ -2853,7 +2851,7 @@ class $n {
     return new B(this.ast, this.errors);
   }
 }
-class Wn {
+class jn {
   constructor(e) {
     this.generator = e;
   }
@@ -2861,9 +2859,9 @@ class Wn {
     return new e(n, this.generator.nextId());
   }
 }
-class jn {
+class Wn {
   constructor(e, n) {
-    this.ast = e, this.symbolFactory = new Wn(n);
+    this.ast = e, this.symbolFactory = new jn(n);
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
@@ -2907,7 +2905,7 @@ function St(t) {
   }
   throw new Error("Invalid relation op");
 }
-function x(t) {
+function y(t) {
   return {
     start: {
       offset: t.startPos.offset,
@@ -2943,7 +2941,7 @@ function Rt(t, e) {
 function Dt(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, l]) => a === l);
+    return I.zip(i, r).every(([a, c]) => a === c);
   }
   const n = t.id, s = e.id;
   return n === s;
@@ -2959,7 +2957,7 @@ class Pt {
     this.declarationNode = e, this.env = n, this.table = { name: void 0, schemaName: void 0, alias: null, fields: [], token: void 0, indexes: [] }, this.pkColumns = [];
   }
   interpret() {
-    this.table.token = x(this.declarationNode), this.env.tables.set(this.declarationNode, this.table);
+    this.table.token = y(this.declarationNode), this.env.tables.set(this.declarationNode, this.table);
     const e = [
       ...this.interpretName(this.declarationNode.name),
       ...this.interpretAlias(this.declarationNode.alias),
@@ -2979,7 +2977,7 @@ class Pt {
   }
   interpretName(e) {
     const { name: n, schemaName: s } = be(e);
-    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, []);
+    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, []);
   }
   interpretAlias(e) {
     if (!e)
@@ -2996,12 +2994,12 @@ class Pt {
   }
   interpretSettingList(e) {
     var i, r, a;
-    const n = W(e).getValue();
+    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 [s] = n.note || [];
     return this.table.note = s && {
       value: Q(s == null ? void 0 : s.value).map(Ee).unwrap(),
-      token: x(s)
+      token: y(s)
     }, [];
   }
   interpretBody(e) {
@@ -3015,7 +3013,7 @@ class Pt {
         case "note":
           return this.table.note = {
             value: Q(n.body instanceof ne ? n.body.body[0].callee : n.body.callee).map(Ee).unwrap(),
-            token: x(n)
+            token: y(n)
           }, [];
         case "indexes":
           return this.interpretIndexes(n);
@@ -3027,25 +3025,25 @@ class Pt {
     return e.flatMap((n) => this.interpretColumn(n));
   }
   interpretColumn(e) {
-    var a, l, p, h, T, f, N, g;
+    var a, c, p, h, T, f, N, g;
     const n = [], s = {};
     s.name = V(e.callee).unwrap();
     const i = Yn(e.args[0]);
-    s.type = i.getValue(), n.push(...i.getErrors()), s.token = x(e), s.inline_refs = [];
+    s.type = i.getValue(), n.push(...i.getErrors()), s.token = y(e), s.inline_refs = [];
     const r = e.args.slice(1);
     if (I.last(r) instanceof P) {
-      const _ = W(r.pop()).getValue();
-      s.pk = !!((a = _.pk) != null && a.length) || !!((l = _["primary key"]) != null && l.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 _ = 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 K = (g = _.note) == null ? void 0 : g.at(0);
       s.note = K && {
         value: Q(K.value).map(Ee).unwrap(),
-        token: x(K)
+        token: y(K)
       };
       const Ie = _.ref || [];
       s.inline_refs = Ie.flatMap((z) => {
         const [nt] = $e(z.value.expression);
         if (Dt(nt, e.symbol))
-          return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
+          return n.push(new l(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
         const ye = z.value.op, ee = C(z.value.expression).unwrap();
         let fe;
         if (ee.length === 1) {
@@ -3055,7 +3053,7 @@ class Pt {
             tableName: this.table.name,
             fieldNames: [oe],
             relation: ye.value,
-            token: x(z)
+            token: y(z)
           };
         } else if (ee.length === 2) {
           const [oe, Le] = ee;
@@ -3064,7 +3062,7 @@ class Pt {
             tableName: oe,
             fieldNames: [Le],
             relation: ye.value,
-            token: x(z)
+            token: y(z)
           };
         } else if (ee.length === 3) {
           const [oe, Le, it] = ee;
@@ -3073,17 +3071,17 @@ class Pt {
             tableName: Le,
             fieldNames: [it],
             relation: ye.value,
-            token: x(z)
+            token: y(z)
           };
         } else {
-          n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", z));
+          n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", z));
           const oe = ee.pop(), Le = ee.pop();
           fe = {
             schemaName: ee.join("."),
             tableName: Le,
             fieldNames: [oe],
             relation: ye.value,
-            token: x(z)
+            token: y(z)
           };
         }
         const st = this.registerInlineRefToEnv(e, nt, fe, z);
@@ -3094,17 +3092,17 @@ class Pt {
   }
   interpretIndexes(e) {
     return this.table.indexes.push(...e.body.body.map((n) => {
-      var a, l, p, h, T, f, N;
+      var a, c, p, h, T, f, N;
       const s = { columns: [] }, i = n;
-      s.token = x(e);
+      s.token = y(e);
       const r = [i.callee, ...i.args];
       if (I.last(r) instanceof P) {
-        const g = W(r.pop()).getValue();
-        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((l = g.unique) != null && l.length), s.name = Q((h = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : h.value).unwrap_or(void 0);
+        const g = j(r.pop()).getValue();
+        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((c = g.unique) != null && c.length), s.name = Q((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);
         s.note = _ && {
           value: Q(_.value).unwrap(),
-          token: x(_)
+          token: y(_)
         }, s.type = X((N = (f = g.type) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
       }
       return r.flatMap((g) => {
@@ -3133,8 +3131,8 @@ class Pt {
     const r = Rt(e.symbol, n);
     if (this.env.refIds[r])
       return [
-        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])
+        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])
       ];
     const a = St(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
@@ -3150,7 +3148,7 @@ class Pt {
           schemaName: this.table.schemaName,
           tableName: this.table.name,
           fieldNames: [X(e.callee).unwrap()],
-          token: x(e),
+          token: y(e),
           relation: a[0]
         }
       ]
@@ -3170,7 +3168,7 @@ function Yn(t) {
       type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
-    [new c(o.UNSUPPORTED, "Nested schema is not supported", t)]
+    [new l(o.UNSUPPORTED, "Nested schema is not supported", t)]
   ) : new B({
     schemaName: i.length === 0 ? null : i[0],
     type_name: `${s}${n}${e ? `(${e})` : ""}`,
@@ -3215,7 +3213,7 @@ class Qn {
     this.declarationNode = e, this.env = n, this.note = { name: void 0, content: void 0, token: void 0 };
   }
   interpret() {
-    return this.note.token = x(this.declarationNode), this.env.notes.set(this.declarationNode, this.note), [
+    return this.note.token = y(this.declarationNode), this.env.notes.set(this.declarationNode, this.note), [
       ...this.interpretName(this.declarationNode.name),
       ...this.interpretSettingList(this.declarationNode.attributeList),
       ...this.interpretBody(this.declarationNode.body)
@@ -3227,13 +3225,13 @@ class Qn {
   }
   interpretSettingList(e) {
     var s, i, r;
-    const n = W(e).getValue();
+    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, [];
   }
   interpretBody(e) {
     const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return n.length !== 1 || s.length > 0 ? [
-      new c(o.INVALID_NOTE, "Invalid note syntax", e)
+      new l(o.INVALID_NOTE, "Invalid note syntax", e)
     ] : [...this.interpretNote(n[0])];
   }
   interpretNote(e) {
@@ -3246,11 +3244,11 @@ class Ut {
     this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof A ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
   }
   interpret() {
-    return this.ref.token = x(this.declarationNode), this.env.ref.set(this.declarationNode, this.ref), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
+    return this.ref.token = y(this.declarationNode), this.env.ref.set(this.declarationNode, this.ref), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
   }
   interpretName(e) {
     const n = [], s = C(this.declarationNode.name).unwrap_or([]);
-    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;
+    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;
   }
   interpretBody(e) {
     return e instanceof w ? this.interpretField(e) : this.interpretField(e.body[0]);
@@ -3259,15 +3257,15 @@ class Ut {
     var h, T, f, N;
     const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = $e(s), a = $e(i);
     if (Dt(r, a))
-      return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
-    const l = Rt(r, a);
-    if (this.env.refIds[l])
+      return [new l(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
+    const c = Rt(r, a);
+    if (this.env.refIds[c])
       return [
-        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[l])
+        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])
       ];
     if (e.args[0]) {
-      const g = W(e.args[0]).getValue(), _ = (T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value;
+      const g = j(e.args[0]).getValue(), _ = (T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value;
       this.ref.onDelete = _ instanceof $ ? me(_).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;
       this.ref.onUpdate = K instanceof $ ? me(K).unwrap_or(void 0) : X(K).unwrap_or(void 0);
@@ -3277,14 +3275,14 @@ class Ut {
       {
         ...pt(s, this.container),
         relation: p[0],
-        token: x(s)
+        token: y(s)
       },
       {
         ...pt(i, this.container),
         relation: p[1],
-        token: x(i)
+        token: y(i)
       }
-    ], this.env.refIds[l] = this.declarationNode, [];
+    ], this.env.refIds[c] = this.declarationNode, [];
   }
 }
 class Mt {
@@ -3293,24 +3291,24 @@ class Mt {
   }
   interpret() {
     const e = [];
-    return this.tableGroup.token = x(this.declarationNode), this.env.tableGroups.set(this.declarationNode, this.tableGroup), e.push(
+    return this.tableGroup.token = y(this.declarationNode), this.env.tableGroups.set(this.declarationNode, this.tableGroup), e.push(
       ...this.interpretName(this.declarationNode.name),
       ...this.interpretBody(this.declarationNode.body)
     ), e;
   }
   interpretName(e) {
     const n = [], { name: s, schemaName: i } = be(e);
-    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;
+    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;
   }
   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 c(o.UNSUPPORTED, "Nested schema is not supported", s));
+      i.length > 2 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", s));
       const r = he(s.callee).unwrap().pop().referee.id;
       if (this.env.groupOfTable[r]) {
-        const a = this.env.groupOfTable[r], { schemaName: l, name: p } = this.env.tableGroups.get(a), h = l ? `${l}.${p}` : p;
-        n.push(new c(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${h}"`, s));
+        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));
       } else
         this.env.groupOfTable[r] = this.declarationNode;
       return {
@@ -3325,21 +3323,21 @@ class Ft {
     this.declarationNode = e, this.env = n, this.enum = { values: [] };
   }
   interpret() {
-    return this.enum.token = x(this.declarationNode), this.env.enums.set(this.declarationNode, this.enum), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
+    return this.enum.token = y(this.declarationNode), this.env.enums.set(this.declarationNode, this.enum), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
   }
   interpretName(e) {
     const { name: n, schemaName: s } = be(e);
-    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, []);
+    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, []);
   }
   interpretBody(e) {
     return e.body.flatMap((n) => {
-      var l;
+      var c;
       const s = n, i = {};
-      i.token = x(s), i.name = X(s.callee).unwrap();
-      const a = (l = W(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
+      i.token = y(s), i.name = X(s.callee).unwrap();
+      const a = (c = j(s.args[0]).getValue().note) == null ? void 0 : c.at(0);
       return i.note = a && {
         value: Q(a.value).map(Ee).unwrap(),
-        token: x(a)
+        token: y(a)
       }, this.enum.values.push(i), [];
     });
   }
@@ -3349,7 +3347,7 @@ class qn {
     this.declarationNode = e, this.env = n, this.project = { enums: [], refs: [], tableGroups: [], tables: [] };
   }
   interpret() {
-    return this.env.project.set(this.declarationNode, this.project), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
+    return this.env.project.set(this.declarationNode, this.project), this.project.token = y(this.declarationNode), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
   }
   interpretName(e) {
     if (!e)
@@ -3381,7 +3379,7 @@ class qn {
         case "note":
           return this.project.note = {
             value: Q(s.body instanceof ne ? s.body.body[0].callee : s.body.callee).map(Ee).unwrap(),
-            token: x(s)
+            token: y(s)
           }, [];
         default:
           return this.project[s.type.value.toLowerCase()] = Q(s.body.callee).unwrap(), [];
@@ -3438,7 +3436,7 @@ function Jn(t) {
     project: Array.from(t.project.values())[0] || {}
   };
 }
-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 || {}), y = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(y || {});
+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:
@@ -3502,12 +3500,12 @@ class Bt {
   }
   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), l = a === void 0 ? i[0] : i[a + 1];
+    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];
     if ([
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
-      ...(l == null ? void 0 : l.leadingTrivia) || []
-    ].find((N) => jt(N) && ge(s, N)))
+      ...(c == null ? void 0 : c.leadingTrivia) || []
+    ].find((N) => Wt(N) && ge(s, N)))
       return O();
     if (a === void 0)
       return Tt();
@@ -3583,12 +3581,12 @@ function Be(t, e, n, s) {
   const r = { suggestions: [] };
   for (; i; ) {
     if ((a = i == null ? void 0 : i.symbol) != null && a.symbolTable) {
-      const { symbol: l } = i;
+      const { symbol: c } = i;
       r.suggestions.push(
-        ...t.symbol.members(l).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: h }) => ({
+        ...t.symbol.members(c).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: h }) => ({
           label: p,
           insertText: p,
-          insertTextRules: y.KeepWhitespace,
+          insertTextRules: k.KeepWhitespace,
           kind: Ae(h),
           sortText: Ae(h).toString().padStart(2, "0"),
           range: void 0
@@ -3652,14 +3650,14 @@ function Nt(t, e) {
               label: "headercolor",
               insertText: "headercolor: ",
               kind: L.Field,
-              insertTextRules: y.KeepWhitespace,
+              insertTextRules: k.KeepWhitespace,
               range: void 0
             },
             {
               label: "note",
               insertText: "note: ",
               kind: L.Field,
-              insertTextRules: y.KeepWhitespace,
+              insertTextRules: k.KeepWhitespace,
               range: void 0
             }
           ]
@@ -3675,21 +3673,21 @@ function Nt(t, e) {
             label: i,
             insertText: i,
             kind: L.Property,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             range: void 0
           })),
           ...["ref", "default"].map((i) => ({
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             range: void 0
           })),
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             range: void 0
           }
         ]
@@ -3701,7 +3699,7 @@ function Nt(t, e) {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             range: void 0
           }
         ]
@@ -3712,7 +3710,7 @@ function Nt(t, e) {
           ...["unique", "pk"].map((i) => ({
             label: i,
             insertText: i,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             kind: L.Property,
             range: void 0
           })),
@@ -3720,7 +3718,7 @@ function Nt(t, e) {
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: y.KeepWhitespace,
+            insertTextRules: k.KeepWhitespace,
             range: void 0
           }))
         ]
@@ -3731,7 +3729,7 @@ function Nt(t, e) {
           label: i,
           insertText: `${i}: `,
           kind: L.Property,
-          insertTextRules: y.KeepWhitespace,
+          insertTextRules: k.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3747,7 +3745,7 @@ function Kn(t, e, n) {
           label: s,
           insertText: s,
           kind: L.Value,
-          insertTextRules: y.KeepWhitespace,
+          insertTextRules: k.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3757,7 +3755,7 @@ function Kn(t, e, n) {
           label: s,
           insertText: `${s}`,
           kind: L.Value,
-          insertTextRules: y.KeepWhitespace,
+          insertTextRules: k.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3766,7 +3764,7 @@ function Kn(t, e, n) {
 }
 function Vt(t, e, n) {
   const s = he(n).unwrap_or([]);
-  if (s.pop(), s.some((r) => !F(r)))
+  if (s.pop(), s.some((r) => !M(r)))
     return O();
   const i = s.map((r) => X(r).unwrap());
   return Fe({
@@ -3804,7 +3802,7 @@ function Tt() {
     suggestions: ["Table", "TableGroup", "Enum", "Project", "Ref"].map((t) => ({
       label: t,
       insertText: t,
-      insertTextRules: y.KeepWhitespace,
+      insertTextRules: k.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3823,7 +3821,7 @@ function ts(t, e, n) {
       suggestions: ["Note", "indexes"].map((i) => ({
         label: i,
         insertText: i,
-        insertTextRules: y.KeepWhitespace,
+        insertTextRules: k.KeepWhitespace,
         kind: L.Keyword,
         range: void 0
       }))
@@ -3833,7 +3831,7 @@ function ts(t, e, n) {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: y.KeepWhitespace,
+      insertTextRules: k.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3844,7 +3842,7 @@ function ns(t, e, n) {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: y.KeepWhitespace,
+      insertTextRules: k.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3852,7 +3850,7 @@ function ns(t, e, n) {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: y.KeepWhitespace,
+      insertTextRules: k.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
@@ -3875,7 +3873,7 @@ function ss(t) {
       return s !== m.Table && s !== m.Schema ? [] : {
         label: i,
         insertText: i,
-        insertTextRules: y.KeepWhitespace,
+        insertTextRules: k.KeepWhitespace,
         kind: Ae(s),
         range: void 0
       };
@@ -3948,7 +3946,7 @@ function rs(t, e) {
       ].map((n) => ({
         label: n,
         insertText: n,
-        insertTextRules: y.KeepWhitespace,
+        insertTextRules: k.KeepWhitespace,
         kind: L.TypeParameter,
         sortText: L.TypeParameter.toString().padStart(2, "0"),
         range: void 0
@@ -3970,11 +3968,11 @@ function Ct(t, e) {
       const a = ie(r).unwrap_or(void 0);
       if (a === void 0)
         return [];
-      const { name: l } = a;
+      const { name: c } = a;
       return {
-        label: l,
-        insertText: l,
-        insertTextRules: y.KeepWhitespace,
+        label: c,
+        insertText: c,
+        insertTextRules: k.KeepWhitespace,
         kind: Ae(m.Column),
         range: void 0
       };
@@ -3995,9 +3993,9 @@ class Xt {
     var a;
     const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
-      const l = r.pop();
-      if ((a = l == null ? void 0 : l.referee) != null && a.declaration && [de.PRIMARY_EXPRESSION, de.VARIABLE].includes(l == null ? void 0 : l.kind)) {
-        const { startPos: p, endPos: h } = l.referee.declaration;
+      const c = r.pop();
+      if ((a = c == null ? void 0 : c.referee) != null && a.declaration && [de.PRIMARY_EXPRESSION, de.VARIABLE].includes(c == null ? void 0 : c.kind)) {
+        const { startPos: p, endPos: h } = c.referee.declaration;
         return [
           {
             range: {
@@ -4027,9 +4025,9 @@ class $t {
         de.FUNCTION_APPLICATION,
         de.PRIMARY_EXPRESSION
       ].includes(a == null ? void 0 : a.kind)) {
-        const { symbol: l } = a;
-        if (l != null && l.references.length)
-          return l.references.map(({ startPos: p, endPos: h }) => ({
+        const { symbol: c } = a;
+        if (c != null && c.references.length)
+          return c.references.map(({ startPos: p, endPos: h }) => ({
             range: {
               startColumn: p.column + 1,
               startLineNumber: p.line + 1,
@@ -4045,7 +4043,7 @@ class $t {
 }
 const cs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  CompletionItemInsertTextRule: y,
+  CompletionItemInsertTextRule: k,
   CompletionItemKind: L,
   DBMLCompletionItemProvider: Bt,
   DBMLDefinitionProvider: Xt,
@@ -4072,7 +4070,7 @@ 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 jn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
+          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 })));
         }
       ),
@@ -4108,33 +4106,33 @@ class ls {
             return [this.parse.ast()];
           const r = n[s].start;
           let a = this.parse.ast();
-          const l = [a];
+          const c = [a];
           for (; ; ) {
             const h = on(a).find((T) => ge(r, T));
-            if (h === void 0 || h instanceof M)
+            if (h === void 0 || h instanceof F)
               break;
-            l.push(h), a = h;
+            c.push(h), a = h;
           }
           if ((i == null ? void 0 : i.kind) === u.COLON)
-            return l;
-          for (; l.length > 0; ) {
+            return c;
+          for (; c.length > 0; ) {
             let p = !1;
-            const h = I.last(l);
+            const h = I.last(c);
             if (h instanceof w) {
               const T = this.parse.source();
               for (let f = h.end; f < e; f += 1)
                 T[f] === `
-` && (l.pop(), p = !0);
+` && (c.pop(), p = !0);
             } else
-              h instanceof q || h instanceof H ? this.container.token(e).token !== h.op && (l.pop(), p = !0) : h instanceof P ? h.listCloseBracket && h.end <= e && (l.pop(), p = !0) : h instanceof Z ? h.tupleCloseParen && h.end <= e && (l.pop(), p = !0) : h instanceof ne ? h.blockCloseBrace && h.end <= e && (l.pop(), p = !0) : h instanceof $ || h.end < e && (l.pop(), p = !0);
+              h instanceof q || h instanceof H ? this.container.token(e).token !== h.op && (c.pop(), p = !0) : h instanceof P ? h.listCloseBracket && h.end <= e && (c.pop(), p = !0) : h instanceof Z ? 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(l);
-              T instanceof A && T.end <= e && l.pop();
+              const T = I.last(c);
+              T instanceof A && T.end <= e && c.pop();
             }
             if (!p)
               break;
           }
-          return l;
+          return c;
         }
       ),
       token: this.createQuery(
@@ -4206,14 +4204,14 @@ class ls {
             if (!((i = r.symbol) != null && i.symbolTable))
               continue;
             const { symbolTable: a } = r.symbol;
-            let l = [a], p = [];
+            let c = [a], p = [];
             for (const h of e)
-              p = l.flatMap(
+              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 };
                 })
-              ), l = p.flatMap(
+              ), c = p.flatMap(
                 (T) => T.symbol.symbolTable ? T.symbol.symbolTable : []
               );
             s.push(...p);
@@ -4240,8 +4238,8 @@ class ls {
         if (r.has(a))
           return r.get(a);
       }
-      const l = n(i);
-      return i !== void 0 ? r instanceof Map ? r.set(a, l) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, l)) : this.cache[e] = l, l;
+      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;
     };
   }
   setSource(e) {