@dbml/parse 3.1.7 → 3.1.8-alpha.0

package/dist/dbml-parse.mjs

@@ -1,6 +1,6 @@
 import I from "lodash";
-var c = /* @__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))(c || {});
-function Xt(t) {
+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 $t(t) {
   switch (t.kind) {
     case "<newline>":
     case "<space>":
@@ -36,22 +36,22 @@ function it(t) {
 function rt(t) {
   return t !== void 0 && t.kind === "<op>";
 }
-class B {
+class V {
   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 B(e, n, s, i, r);
+    return new V(e, n, s, i, r);
   }
 }
 function Tt(t) {
-  return t.trailingTrivia.find(({ kind: e }) => e === c.NEWLINE) !== void 0;
+  return t.trailingTrivia.find(({ kind: e }) => e === u.NEWLINE) !== void 0;
 }
 function at(t, e) {
-  return e.leadingTrivia.find(({ kind: s }) => s === c.NEWLINE) !== void 0 || Tt(t);
+  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || Tt(t);
 }
 function Ve(t) {
-  return t.trailingTrivia.find(({ kind: e }) => e === c.SPACE) !== void 0;
+  return t.trailingTrivia.find(({ kind: e }) => e === u.SPACE) !== void 0;
 }
 function bt(t) {
   return t.trailingTrivia.length === 0 ? t.end : bt(I.last(t.trailingTrivia));
@@ -59,12 +59,12 @@ function bt(t) {
 function It(t) {
   return t.leadingTrivia.length === 0 ? t.start : It(t.leadingTrivia[0]);
 }
-function $t(t) {
-  return [c.SINGLE_LINE_COMMENT, c.MULTILINE_COMMENT].includes(
+function Wt(t) {
+  return [u.SINGLE_LINE_COMMENT, u.MULTILINE_COMMENT].includes(
     t.kind
   );
 }
-class Wt {
+class jt {
   constructor() {
     this.id = 0;
   }
@@ -75,32 +75,32 @@ class Wt {
     return this.id++;
   }
 }
-class y {
+class k {
   // 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 B ? It(i) : i.fullStart) : (this.startPos = {
+    i ? (this.startPos = i.startPos, this.fullStart = i instanceof V ? It(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 B ? bt(r) : r.fullEnd) : (this.endPos = {
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof V ? bt(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
     }, this.fullEnd = NaN), this.start = this.startPos.offset, this.end = this.endPos.offset;
   }
 }
-var pe = /* @__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))(pe || {});
-class C extends y {
+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 F extends k {
   constructor({ body: e = [], eof: n }, s) {
     super(s, "<program>", [...e, n]), this.body = e, this.eof = n;
   }
 }
-class _ extends y {
+class A extends k {
   constructor({
     type: e,
     name: n,
@@ -118,17 +118,17 @@ class _ extends y {
       r,
       a,
       l
-    ]), l && a && !(l instanceof k || l instanceof _))
+    ]), l && a && !(l instanceof w || l 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;
   }
 }
-class K extends y {
+class $ extends k {
   constructor({ identifiers: e = [] }, n) {
     super(n, "<identifer-stream>", e || []), this.identifiers = e;
   }
 }
-class ne extends y {
+class se extends k {
   constructor({
     name: e,
     colon: n,
@@ -137,12 +137,12 @@ class ne extends y {
     super(i, "<attribute>", [e, n, s]), this.name = e, this.value = s, this.colon = n;
   }
 }
-class Q extends y {
+class q extends k {
   constructor({ op: e, expression: n }, s) {
     super(s, "<prefix-expression>", [e, n]), this.op = e, this.expression = n;
   }
 }
-class q extends y {
+class H extends k {
   constructor({
     op: e,
     leftExpression: n,
@@ -151,22 +151,22 @@ class q extends y {
     super(i, "<infix-expression>", [n, e, s]), this.op = e, this.leftExpression = n, this.rightExpression = s;
   }
 }
-class Re extends y {
+class De extends k {
   constructor({ op: e, expression: n }, s) {
     super(s, "<postfix-expression>", [n, e]), this.op = e, this.expression = n;
   }
 }
-class ee extends y {
+class te extends k {
   constructor({ value: e }, n) {
     super(n, "<function-expression>", [e]), this.value = e;
   }
 }
-class k extends y {
+class w extends k {
   constructor({ callee: e, args: n = [] }, s) {
     super(s, "<function-application>", [e, ...n]), this.callee = e, this.args = n;
   }
 }
-class te extends y {
+class ne extends k {
   constructor({
     blockOpenBrace: e,
     body: n = [],
@@ -175,7 +175,7 @@ class te extends y {
     super(i, "<block-expression>", [e, ...n, s]), this.blockOpenBrace = e, this.body = n, this.blockCloseBrace = s;
   }
 }
-class P extends y {
+class P extends k {
   constructor({
     listOpenBracket: e,
     elementList: n = [],
@@ -189,7 +189,7 @@ class P extends y {
     ]), this.listOpenBracket = e, this.elementList = n, this.commaList = s, this.listCloseBracket = i;
   }
 }
-class J extends y {
+class Z extends k {
   constructor({
     tupleOpenParen: e,
     elementList: n = [],
@@ -203,7 +203,7 @@ class J extends y {
     ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
 }
-class Xe extends J {
+class Xe extends Z {
   constructor({
     groupOpenParen: e,
     expression: n,
@@ -220,7 +220,7 @@ class Xe extends J {
     ), this.kind = "<group-expression>";
   }
 }
-class H extends y {
+class J extends k {
   constructor({
     callee: e,
     argumentList: n
@@ -228,28 +228,28 @@ class H extends y {
     super(s, "<call-expression>", [e, n]), this.callee = e, this.argumentList = n;
   }
 }
-class Ee extends y {
+class me extends k {
   constructor({ literal: e }, n) {
     super(n, "<literal>", [e]), this.literal = e;
   }
 }
-class X extends y {
+class j extends k {
   constructor({ variable: e }, n) {
     super(n, "<variable>", [e]), this.variable = e;
   }
 }
-class D extends y {
+class D extends k {
   constructor({ expression: e }, n) {
     super(n, "<primary-expression>", [e]), this.expression = e;
   }
 }
-class we extends y {
+class ye extends k {
   constructor({ pre: e }, n) {
-    const s = B.create(c.SPACE, e.endPos, e.endPos, " ", !1);
+    const s = V.create(u.SPACE, e.endPos, e.endPos, " ", !1);
     super(n, "<dummy>", [s]);
   }
 }
-class le extends y {
+class ce extends k {
   constructor({ expression: e, indexer: n }, s) {
     super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
@@ -264,12 +264,12 @@ function Lt(t, e) {
     (i) => i !== null
   );
 }
-function is(t, e = !1) {
+function as(t, e = !1) {
   return JSON.stringify(
     t,
     function(n, s) {
       var i;
-      return !(this instanceof C) && n === "symbol" ? s == null ? void 0 : s.id : (
+      return !(this instanceof F) && n === "symbol" ? s == null ? void 0 : s.id : (
         /* this instanceof SyntaxNode && */
         n === "symbol" ? {
           symbolTable: s == null ? void 0 : s.symbolTable,
@@ -290,7 +290,7 @@ function is(t, e = !1) {
     e ? 2 : 0
   );
 }
-class O {
+class S {
   constructor(e) {
     this.value = e;
   }
@@ -305,14 +305,14 @@ class O {
     return e(this.value);
   }
   map(e) {
-    return new O(e(this.value));
+    return new S(e(this.value));
   }
   // eslint-disable-next-line class-methods-use-this
   isOk() {
     return !0;
   }
 }
-class A {
+class v {
   // eslint-disable-next-line class-methods-use-this
   unwrap() {
     throw new Error("Trying to unwrap a None value");
@@ -323,22 +323,22 @@ class A {
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars, class-methods-use-this
   and_then(e) {
-    return new A();
+    return new v();
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars, class-methods-use-this
   map(e) {
-    return new A();
+    return new v();
   }
   // eslint-disable-next-line class-methods-use-this
   isOk() {
     return !1;
   }
 }
-var m = /* @__PURE__ */ ((t) => (t.Schema = "Schema", t.Table = "Table", t.Column = "Column", t.TableGroup = "TableGroup", t.TableGroupField = "TableGroup field", t.Enum = "Enum", t.EnumField = "Enum field", t))(m || {});
+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 $e(t) {
   return `Schema:${t}`;
 }
-function ke(t) {
+function xe(t) {
   return `Table:${t}`;
 }
 function We(t) {
@@ -356,6 +356,9 @@ function ze(t) {
 function Qe(t) {
   return `TableGroup field:${t}`;
 }
+function Yt(t) {
+  return `Note:${t}`;
+}
 function Fe(t, e) {
   switch (e) {
     case "Column":
@@ -367,7 +370,7 @@ function Fe(t, e) {
     case "Schema":
       return $e(t);
     case "Table":
-      return ke(t);
+      return xe(t);
     case "TableGroup":
       return ze(t);
     case "TableGroup field":
@@ -376,24 +379,24 @@ function Fe(t, e) {
       throw new Error("Unreachable");
   }
 }
-function se(t) {
+function ie(t) {
   const [e, n] = t.split(":");
-  return Object.values(m).includes(e) ? new O({
+  return Object.values(m).includes(e) ? new S({
     name: n,
     kind: e
-  }) : new A();
+  }) : new v();
 }
-function jt(t) {
-  const e = se(t).unwrap_or(void 0);
+function zt(t) {
+  const e = ie(t).unwrap_or(void 0);
   if (!e)
     return !1;
   const { kind: n, name: s } = e;
   return n === "Schema" && s === "public";
 }
-function Yt(t) {
+function Qt(t) {
   return [
     $e,
-    ke,
+    xe,
     je,
     ze,
     We,
@@ -405,16 +408,16 @@ function qe(t) {
   const [e] = t;
   return e >= "a" && e <= "z" || e >= "A" && e <= "Z" || e === "_";
 }
-function xe(t) {
+function Se(t) {
   const [e] = t;
   return e >= "0" && e <= "9";
 }
-function zt(t) {
+function qt(t) {
   const [e] = t;
-  return xe(e) || qe(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
+  return Se(e) || qe(e) && e.toLowerCase() >= "a" && e.toLowerCase() <= "f";
 }
-function fe(t) {
-  return qe(t) || xe(t);
+function pe(t) {
+  return qe(t) || Se(t);
 }
 function ot(t, e) {
   const n = [], s = Math.min(t.length, e.length);
@@ -422,10 +425,10 @@ function ot(t, e) {
     n.push(t[i], e[i]);
   return n.push(...t.slice(s), ...e.slice(s)), n;
 }
-function be(t, e) {
+function Le(t, e) {
   return t >= e.start && t < e.end;
 }
-class Qt {
+class Ht {
   constructor() {
     this.id = 0;
   }
@@ -441,12 +444,12 @@ class gt {
     this.references = [], this.id = n, this.symbolTable = e;
   }
 }
-class qt {
+class Jt {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Ht {
+class Zt {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
@@ -456,28 +459,28 @@ class _t {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Jt {
+class Kt {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-class Zt {
+class en {
   constructor({ symbolTable: e, declaration: n }, s) {
     this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Kt {
+class tn {
   constructor({ declaration: e }, n) {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
 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_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 u extends Error {
+class c extends Error {
   constructor(e, n, s) {
-    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, u.prototype);
+    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, c.prototype);
   }
 }
-class F {
+class B {
   constructor(e, n) {
     this.value = e, this.errors = n === void 0 ? [] : n;
   }
@@ -489,21 +492,21 @@ class F {
   }
   chain(e) {
     const n = e(this.value), s = [...this.errors, ...n.errors];
-    return new F(n.value, s);
+    return new B(n.value, s);
   }
   map(e) {
-    return new F(e(this.value), this.errors);
+    return new B(e(this.value), this.errors);
   }
 }
-function en(t, e, n) {
-  if (!t || !de(t) || e.length === 0)
-    return new A();
+function nn(t, e, n) {
+  if (!t || !Ee(t) || e.length === 0)
+    return new v();
   const s = [...e], i = Be(t).unwrap(), r = s.pop();
-  if (!(r instanceof te))
-    return new A();
+  if (!(r instanceof ne))
+    return new v();
   const a = I.last(s) instanceof P ? s.pop() : void 0;
-  return s.length === 3 && Be(s[1]).unwrap().value === "as" ? new O(
-    n.create(_, {
+  return s.length === 3 && Be(s[1]).unwrap().value === "as" ? new S(
+    n.create(A, {
       type: i,
       name: s[0],
       as: Be(s[1]).unwrap(),
@@ -511,60 +514,60 @@ function en(t, e, n) {
       attributeList: a,
       body: r
     })
-  ) : s.length === 1 ? new O(
-    n.create(_, {
+  ) : s.length === 1 ? new S(
+    n.create(A, {
       type: i,
       name: s[0],
       attributeList: a,
       body: r
     })
-  ) : s.length === 0 ? new O(
-    n.create(_, {
+  ) : s.length === 0 ? new S(
+    n.create(A, {
       type: i,
       attributeList: a,
       body: r
     })
-  ) : new A();
+  ) : new v();
 }
 function lt(t) {
-  return t.kind === c.IDENTIFIER && t.value === "as";
+  return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function E(t) {
-  t && (t instanceof B ? tn(t) : nn(t));
+  t && (t instanceof V ? sn(t) : rn(t));
 }
-function tn(t) {
-  t.kind !== c.EOF && (t.isInvalid = !0);
+function sn(t) {
+  t.kind !== u.EOF && (t.isInvalid = !0);
 }
-function nn(t) {
-  if (t instanceof _)
+function rn(t) {
+  if (t instanceof A)
     E(t.type), E(t.name), E(t.as), E(t.alias), E(t.bodyColon), E(t.attributeList), E(t.body);
-  else if (t instanceof K)
+  else if (t instanceof $)
     t.identifiers.forEach(E);
-  else if (t instanceof ne)
+  else if (t instanceof se)
     E(t.name), E(t.colon), E(t.value);
-  else if (t instanceof Q)
-    E(t.op), E(t.expression);
   else if (t instanceof q)
+    E(t.op), E(t.expression);
+  else if (t instanceof H)
     E(t.leftExpression), E(t.op), E(t.rightExpression);
-  else if (t instanceof Re)
+  else if (t instanceof De)
     E(t.op), E(t.expression);
-  else if (t instanceof te)
+  else if (t instanceof ne)
     E(t.blockOpenBrace), t.body.forEach(E), E(t.blockCloseBrace);
   else if (t instanceof P)
     E(t.listOpenBracket), t.commaList.forEach(E), t.elementList.forEach(E), E(t.listCloseBracket);
-  else if (t instanceof J)
+  else if (t instanceof Z)
     E(t.tupleOpenParen), t.commaList.forEach(E), t.elementList.forEach(E), E(t.tupleCloseParen);
-  else if (t instanceof H)
+  else if (t instanceof J)
     E(t.callee), E(t.argumentList);
-  else if (t instanceof k)
+  else if (t instanceof w)
     E(t.callee), t.args.forEach(E);
   else if (t instanceof D)
     E(t.expression);
-  else if (t instanceof ee)
+  else if (t instanceof te)
     E(t.value);
-  else if (t instanceof X)
+  else if (t instanceof j)
     E(t.variable);
-  else if (t instanceof Ee)
+  else if (t instanceof me)
     E(t.literal);
   else
     throw t instanceof Xe ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
@@ -575,10 +578,10 @@ function At(t) {
 function U(...t) {
   return t.filter((e) => e !== void 0);
 }
-function sn(t) {
-  if (t instanceof C)
+function an(t) {
+  if (t instanceof F)
     return U(...t.body, t.eof);
-  if (t instanceof _)
+  if (t instanceof A)
     return U(
       t.type,
       t.name,
@@ -588,25 +591,25 @@ function sn(t) {
       t.bodyColon,
       t.body
     );
-  if (t instanceof ne)
+  if (t instanceof se)
     return U(t.name, t.colon, t.value);
-  if (t instanceof K)
+  if (t instanceof $)
     return t.identifiers;
-  if (t instanceof Ee)
+  if (t instanceof me)
     return t.literal ? [t.literal] : [];
-  if (t instanceof X)
+  if (t instanceof j)
     return U(t.variable);
-  if (t instanceof Q)
-    return U(t.op, t.expression);
   if (t instanceof q)
+    return U(t.op, t.expression);
+  if (t instanceof H)
     return U(t.leftExpression, t.op, t.rightExpression);
-  if (t instanceof Re)
+  if (t instanceof De)
     return U(t.expression, t.op);
-  if (t instanceof ee)
+  if (t instanceof te)
     return U(t.value);
-  if (t instanceof k)
+  if (t instanceof w)
     return U(t.callee, ...t.args);
-  if (t instanceof te)
+  if (t instanceof ne)
     return U(t.blockOpenBrace, ...t.body, t.blockCloseBrace);
   if (t instanceof P)
     return U(
@@ -614,17 +617,17 @@ function sn(t) {
       ...ot(t.elementList, t.commaList),
       t.listCloseBracket
     );
-  if (t instanceof J)
+  if (t instanceof Z)
     return U(
       t.tupleOpenParen,
       ...ot(t.elementList, t.commaList),
       t.tupleCloseParen
     );
-  if (t instanceof H)
+  if (t instanceof J)
     return U(t.callee, t.argumentList);
   if (t instanceof D)
     return U(t.expression);
-  if (t instanceof le)
+  if (t instanceof ce)
     return U(
       t.array,
       t.indexer
@@ -632,30 +635,30 @@ function sn(t) {
   throw t instanceof Xe ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
 function Be(t) {
-  return M(t) ? new O(t.expression.variable) : new A();
+  return M(t) ? new S(t.expression.variable) : new v();
 }
-function $(t) {
+function Y(t) {
   var e;
-  return t instanceof D && (t.expression instanceof X && t.expression.variable instanceof B && t.expression.variable.kind === c.QUOTED_STRING || t.expression instanceof Ee && ((e = t.expression.literal) == null ? void 0 : e.kind) === c.STRING_LITERAL);
+  return t instanceof D && (t.expression instanceof j && t.expression.variable instanceof V && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof me && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
 }
 function M(t) {
-  return t instanceof D && t.expression instanceof X && t.expression.variable instanceof B;
+  return t instanceof D && t.expression instanceof j && t.expression.variable instanceof V;
 }
-function de(t) {
+function Ee(t) {
   var e;
-  return t instanceof D && t.expression instanceof X && ((e = t.expression.variable) == null ? void 0 : e.kind) === c.IDENTIFIER;
+  return t instanceof D && t.expression instanceof j && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
 }
 function He(t) {
   var e;
-  return t instanceof q && t.leftExpression instanceof y && t.rightExpression instanceof y && ((e = t.op) == null ? void 0 : e.value) === ".";
+  return t instanceof H && t.leftExpression instanceof k && t.rightExpression instanceof k && ((e = t.op) == null ? void 0 : e.value) === ".";
 }
-function De(t) {
+function Ne(t) {
   if (t === void 0)
-    return new A();
+    return new v();
   const e = t.identifiers.map((n) => n.value).join(" ");
-  return e === "" ? new A() : new O(e);
+  return e === "" ? new v() : new S(e);
 }
-class rn {
+class on {
   // list of errors during lexing
   constructor(e) {
     this.start = {
@@ -695,7 +698,7 @@ class rn {
     this.tokens.push(this.createToken(e, n));
   }
   createToken(e, n = !1) {
-    return B.create(
+    return V.create(
       e,
       this.start,
       this.current,
@@ -704,50 +707,50 @@ class rn {
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(B.create(c.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new F(this.tokens, this.errors);
+    return this.scanTokens(), this.tokens.push(V.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
   }
   scanTokens() {
     for (; !this.isAtEnd(); ) {
       const e = this.advance();
       switch (e) {
         case " ":
-          this.addToken(c.SPACE);
+          this.addToken(u.SPACE);
           break;
         case "\r":
           break;
         case `
 `:
-          this.addToken(c.NEWLINE);
+          this.addToken(u.NEWLINE);
           break;
         case "	":
-          this.addToken(c.TAB);
+          this.addToken(u.TAB);
           break;
         case ",":
-          this.addToken(c.COMMA);
+          this.addToken(u.COMMA);
           break;
         case "(":
-          this.addToken(c.LPAREN);
+          this.addToken(u.LPAREN);
           break;
         case ")":
-          this.addToken(c.RPAREN);
+          this.addToken(u.RPAREN);
           break;
         case "[":
-          this.addToken(c.LBRACKET);
+          this.addToken(u.LBRACKET);
           break;
         case "]":
-          this.addToken(c.RBRACKET);
+          this.addToken(u.RBRACKET);
           break;
         case "{":
-          this.addToken(c.LBRACE);
+          this.addToken(u.LBRACE);
           break;
         case "}":
-          this.addToken(c.RBRACE);
+          this.addToken(u.RBRACE);
           break;
         case ";":
-          this.addToken(c.SEMICOLON);
+          this.addToken(u.SEMICOLON);
           break;
         case ":":
-          this.addToken(c.COLON);
+          this.addToken(u.COLON);
           break;
         case "'":
           this.match("''") ? this.multilineStringLiteral() : this.singleLineStringLiteral();
@@ -773,15 +776,15 @@ class rn {
             this.identifier();
             break;
           }
-          if (xe(e)) {
+          if (Se(e)) {
             this.numericLiteralOrIdentifier();
             break;
           }
-          this.addToken(c.OP, !0), this.errors.push(
-            new u(
+          this.addToken(u.OP, !0), this.errors.push(
+            new c(
               o.UNKNOWN_SYMBOL,
               `Unexpected token '${e}'`,
-              this.createToken(c.OP, !0)
+              this.createToken(u.OP, !0)
             )
           );
           break;
@@ -793,7 +796,7 @@ class rn {
     let e = !0, n = [], s;
     const i = [];
     for (const r of this.tokens)
-      Xt(r) ? (n.push(r), r.kind === c.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);
+      $t(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() {
@@ -825,7 +828,7 @@ class rn {
     if (this.isAtEnd() && !i) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new u(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
+        new c(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
       );
       return;
     }
@@ -833,7 +836,7 @@ class rn {
 `) && !s) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new u(
+        new c(
           o.UNEXPECTED_NEWLINE,
           "Invalid newline encountered while parsing",
           p
@@ -841,38 +844,38 @@ class rn {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(B.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(V.create(e, this.start, this.current, l, !1));
   }
   singleLineStringLiteral() {
-    this.consumeUntil(c.STRING_LITERAL, "'", {
+    this.consumeUntil(u.STRING_LITERAL, "'", {
       allowNewline: !1,
       allowEof: !1,
       raw: !1
     });
   }
   multilineStringLiteral() {
-    this.consumeUntil(c.STRING_LITERAL, "'''", {
+    this.consumeUntil(u.STRING_LITERAL, "'''", {
       allowNewline: !0,
       allowEof: !1,
       raw: !1
     });
   }
   functionExpression() {
-    this.consumeUntil(c.FUNCTION_EXPRESSION, "`", {
+    this.consumeUntil(u.FUNCTION_EXPRESSION, "`", {
       allowNewline: !1,
       allowEof: !1,
       raw: !0
     });
   }
   quotedVariable() {
-    this.consumeUntil(c.QUOTED_STRING, '"', {
+    this.consumeUntil(u.QUOTED_STRING, '"', {
       allowNewline: !1,
       allowEof: !1,
       raw: !1
     });
   }
   singleLineComment() {
-    this.consumeUntil(c.SINGLE_LINE_COMMENT, `
+    this.consumeUntil(u.SINGLE_LINE_COMMENT, `
 `, {
       allowNewline: !0,
       allowEof: !0,
@@ -881,55 +884,55 @@ class rn {
     });
   }
   multilineComment() {
-    this.consumeUntil(c.MULTILINE_COMMENT, "*/", {
+    this.consumeUntil(u.MULTILINE_COMMENT, "*/", {
       allowNewline: !0,
       allowEof: !1,
       raw: !0
     });
   }
   identifier() {
-    for (; !this.isAtEnd() && fe(this.peek()); )
+    for (; !this.isAtEnd() && pe(this.peek()); )
       this.advance();
-    this.addToken(c.IDENTIFIER);
+    this.addToken(u.IDENTIFIER);
   }
   operator() {
     for (; it(this.peek()); )
       this.advance();
-    this.addToken(c.OP);
+    this.addToken(u.OP);
   }
   // we accept identifiers starting with digits but must contain at least one char or underscore
   numericLiteralOrIdentifier() {
     let e = 0;
     if (this.isAtEnd())
-      return this.addToken(c.NUMERIC_LITERAL);
+      return this.addToken(u.NUMERIC_LITERAL);
     for (; !this.isAtEnd(); ) {
       const n = this.check(".");
       if (e += n ? 1 : 0, e > 1)
         break;
       if (!n && this.current.offset === this.text.length - 1)
-        return this.advance(), this.addToken(c.NUMERIC_LITERAL);
-      if (!n && !fe(this.peek()))
-        return this.addToken(c.NUMERIC_LITERAL);
-      if (!n && !xe(this.peek()))
+        return this.advance(), this.addToken(u.NUMERIC_LITERAL);
+      if (!n && !pe(this.peek()))
+        return this.addToken(u.NUMERIC_LITERAL);
+      if (!n && !Se(this.peek()))
         break;
       this.advance();
     }
     if (e > 0) {
-      for (; !this.isAtEnd() && (this.check(".") || fe(this.peek())); )
+      for (; !this.isAtEnd() && (this.check(".") || pe(this.peek())); )
         this.advance();
-      const n = this.createToken(c.NUMERIC_LITERAL, !0);
-      this.tokens.push(n), this.errors.push(new u(o.UNKNOWN_TOKEN, "Invalid number", n));
+      const n = this.createToken(u.NUMERIC_LITERAL, !0);
+      this.tokens.push(n), this.errors.push(new c(o.UNKNOWN_TOKEN, "Invalid number", n));
     } else {
-      for (; !this.isAtEnd() && fe(this.peek()); )
+      for (; !this.isAtEnd() && pe(this.peek()); )
         this.advance();
-      const n = this.createToken(c.IDENTIFIER, !1);
+      const n = this.createToken(u.IDENTIFIER, !1);
       this.tokens.push(n);
     }
   }
   colorLiteral() {
-    for (; !this.isAtEnd() && fe(this.peek()); )
+    for (; !this.isAtEnd() && pe(this.peek()); )
       this.advance();
-    this.addToken(c.COLOR_LITERAL);
+    this.addToken(u.COLOR_LITERAL);
   }
   escapedString() {
     if (this.isAtEnd())
@@ -959,7 +962,7 @@ class rn {
       case "u": {
         let e = "";
         for (let n = 0; n <= 3; n += 1) {
-          if (this.isAtEnd() || !fe(this.peek()))
+          if (this.isAtEnd() || !pe(this.peek()))
             return `\\u${e}`;
           e += this.advance();
         }
@@ -970,8 +973,8 @@ class rn {
     }
   }
 }
-var ye = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(ye || {});
-class an {
+var ke = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(ke || {});
+class ln {
   constructor() {
     this.stack = [], this.numberOfNestedLParens = 0, this.numberOfNestedLBrackets = 0, this.numberOfNestedLBraces = 0;
   }
@@ -1012,7 +1015,7 @@ class an {
     if (!(this.numberOfNestedLBraces <= 0 && this.numberOfNestedLBrackets <= 0 && this.numberOfNestedLParens <= 0))
       for (let s = n; s < e.length - 1; s += 1)
         switch (e[s].kind) {
-          case c.COMMA:
+          case u.COMMA:
             if (this.isWithinGroupExpressionContext() || this.isWithinListExpressionContext())
               return [...this.stack].reverse().find(
                 (r) => [
@@ -1022,22 +1025,22 @@ class an {
                 ].includes(r)
               );
             break;
-          case c.RPAREN:
+          case u.RPAREN:
             if (this.isWithinGroupExpressionContext())
               return 1;
             break;
-          case c.RBRACE:
+          case u.RBRACE:
             if (this.isWithinBlockExpressionContext())
               return 2;
             break;
-          case c.RBRACKET:
+          case u.RBRACKET:
             if (this.isWithinListExpressionContext())
               return 0;
             break;
         }
   }
 }
-class on {
+class cn {
   constructor(e) {
     this.generator = e;
   }
@@ -1050,29 +1053,29 @@ class d {
     this.token = e, this.partialNode = n, this.handlerContext = s;
   }
 }
-class ln {
+class un {
   constructor(e, n) {
-    this.current = 0, this.errors = [], this.contextStack = new an(), this.synchronizeProgram = () => {
+    this.current = 0, this.errors = [], this.contextStack = new ln(), this.synchronizeProgram = () => {
       const s = this.peek();
-      s.kind !== c.EOF ? E(this.advance()) : (E(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
+      s.kind !== u.EOF ? E(this.advance()) : (E(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (lt(s) || this.check(c.COLON, c.LBRACE, c.LBRACKET))
+        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         E(s), this.advance();
       }
     }, this.synchronizeElementDeclarationAlias = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(c.COLON, c.LBRACE, c.LBRACKET))
+        if (this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         E(s), this.advance();
       }
-    }, this.blockExpression = this.contextStack.withContextDo(ye.BlockExpression, () => {
-      const s = { body: [] }, i = () => this.nodeFactory.create(te, s);
+    }, this.blockExpression = this.contextStack.withContextDo(ke.BlockExpression, () => {
+      const s = { body: [] }, i = () => this.nodeFactory.create(ne, s);
       try {
-        this.consume("Expect an opening brace '{'", c.LBRACE), s.blockOpenBrace = this.previous();
+        this.consume("Expect an opening brace '{'", u.LBRACE), s.blockOpenBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1080,7 +1083,7 @@ class ln {
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeBlock();
       }
-      for (; !this.isAtEnd() && !this.check(c.RBRACE); )
+      for (; !this.isAtEnd() && !this.check(u.RBRACE); )
         try {
           s.body.push(this.canBeField() ? this.fieldDeclaration() : this.expression());
         } catch (r) {
@@ -1091,7 +1094,7 @@ class ln {
           this.synchronizeBlock();
         }
       try {
-        this.consume("Expect a closing brace '}'", c.RBRACE), s.blockCloseBrace = this.previous();
+        this.consume("Expect a closing brace '}'", u.RBRACE), s.blockCloseBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1101,21 +1104,21 @@ class ln {
       }
       return i();
     }), this.synchronizeBlock = () => {
-      if (!this.check(c.RBRACE))
+      if (!this.check(u.RBRACE))
         for (E(this.advance()); !this.isAtEnd(); ) {
           const s = this.peek();
-          if (this.check(c.RBRACE) || at(this.previous(), s))
+          if (this.check(u.RBRACE) || at(this.previous(), s))
             break;
           E(s), this.advance();
         }
-    }, this.tupleExpression = this.contextStack.withContextDo(ye.GroupExpression, () => {
+    }, this.tupleExpression = this.contextStack.withContextDo(ke.GroupExpression, () => {
       const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(Xe, {
         groupOpenParen: s.tupleOpenParen,
         groupCloseParen: s.tupleCloseParen,
         expression: s.elementList[0]
-      }), r = () => this.nodeFactory.create(J, s);
+      }), r = () => this.nodeFactory.create(Z, s);
       try {
-        this.consume("Expect an opening parenthesis '('", c.LPAREN), s.tupleOpenParen = this.previous();
+        this.consume("Expect an opening parenthesis '('", u.LPAREN), s.tupleOpenParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
@@ -1123,7 +1126,7 @@ class ln {
           throw new d(a.token, r(), a.handlerContext);
         this.synchronizeTuple();
       }
-      if (!this.isAtEnd() && !this.check(c.RPAREN))
+      if (!this.isAtEnd() && !this.check(u.RPAREN))
         try {
           s.elementList.push(this.normalExpression());
         } catch (a) {
@@ -1133,18 +1136,18 @@ class ln {
             throw new d(a.token, i(), a.handlerContext);
           this.synchronizeTuple();
         }
-      for (; !this.isAtEnd() && !this.check(c.RPAREN); )
+      for (; !this.isAtEnd() && !this.check(u.RPAREN); )
         try {
-          this.consume("Expect a comma ','", c.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.normalExpression());
+          this.consume("Expect a comma ','", u.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.normalExpression());
         } catch (a) {
           if (!(a instanceof d))
             throw a;
-          if (a.partialNode instanceof y && s.elementList.push(a.partialNode), !this.canHandle(a))
+          if (a.partialNode instanceof k && s.elementList.push(a.partialNode), !this.canHandle(a))
             throw new d(a.token, r(), a.handlerContext);
           this.synchronizeTuple();
         }
       try {
-        this.consume("Expect a closing parenthesis ')'", c.RPAREN), s.tupleCloseParen = this.previous();
+        this.consume("Expect a closing parenthesis ')'", u.RPAREN), s.tupleCloseParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
@@ -1156,14 +1159,14 @@ class ln {
     }), this.synchronizeTuple = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(c.RPAREN, c.COMMA))
+        if (this.check(u.RPAREN, u.COMMA))
           break;
         E(s), this.advance();
       }
-    }, this.listExpression = this.contextStack.withContextDo(ye.ListExpression, () => {
+    }, this.listExpression = this.contextStack.withContextDo(ke.ListExpression, () => {
       const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(P, s);
       try {
-        this.consume("Expect an opening bracket '['", c.LBRACKET), s.listOpenBracket = this.previous();
+        this.consume("Expect an opening bracket '['", u.LBRACKET), s.listOpenBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1171,7 +1174,7 @@ class ln {
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeList();
       }
-      if (!this.isAtEnd() && !this.check(c.RBRACKET))
+      if (!this.isAtEnd() && !this.check(u.RBRACKET))
         try {
           s.elementList.push(this.attribute());
         } catch (r) {
@@ -1181,18 +1184,18 @@ class ln {
             throw new d(r.token, i(), r.handlerContext);
           this.synchronizeList();
         }
-      for (; !this.isAtEnd() && !this.check(c.RBRACKET); )
+      for (; !this.isAtEnd() && !this.check(u.RBRACKET); )
         try {
-          this.consume("Expect a comma ','", c.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.attribute());
+          this.consume("Expect a comma ','", u.COMMA), s.commaList.push(this.previous()), s.elementList.push(this.attribute());
         } catch (r) {
           if (!(r instanceof d))
             throw r;
-          if (r.partialNode instanceof y && s.elementList.push(r.partialNode), !this.canHandle(r))
+          if (r.partialNode instanceof k && s.elementList.push(r.partialNode), !this.canHandle(r))
             throw new d(r.token, i(), r.handlerContext);
           this.synchronizeList();
         }
       try {
-        this.consume("Expect a closing bracket ']'", c.RBRACKET), s.listCloseBracket = this.previous();
+        this.consume("Expect a closing bracket ']'", u.RBRACKET), s.listCloseBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
@@ -1204,28 +1207,28 @@ class ln {
     }), this.synchronizeList = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET))
+        if (this.check(u.COMMA, u.RBRACKET))
           break;
         E(s), this.advance();
       }
     }, this.synchronizeAttributeName = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET, c.COLON))
+        if (this.check(u.COMMA, u.RBRACKET, u.COLON))
           break;
         E(s), this.advance();
       }
     }, this.synchronizeAttributeValue = () => {
       for (; !this.isAtEnd(); ) {
         const s = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET))
+        if (this.check(u.COMMA, u.RBRACKET))
           break;
         E(s), this.advance();
       }
-    }, this.tokens = e, this.nodeFactory = new on(n);
+    }, this.tokens = e, this.nodeFactory = new cn(n);
   }
   isAtEnd() {
-    return this.current >= this.tokens.length || this.tokens[this.current].kind === c.EOF;
+    return this.current >= this.tokens.length || this.tokens[this.current].kind === u.EOF;
   }
   advance() {
     return this.isAtEnd() ? I.last(this.tokens) : this.tokens[this.current++];
@@ -1278,8 +1281,8 @@ class ln {
     this.tokens = e;
   }
   parse() {
-    const e = this.program(), n = this.advance(), s = this.nodeFactory.create(C, { body: e, eof: n });
-    return this.gatherInvalid(), new F({ ast: s, tokens: this.tokens }, this.errors);
+    const e = this.program(), n = this.advance(), s = this.nodeFactory.create(F, { body: e, eof: n });
+    return this.gatherInvalid(), new B({ ast: s, tokens: this.tokens }, this.errors);
   }
   /* Parsing and synchronizing ProgramNode */
   program() {
@@ -1297,13 +1300,13 @@ class ln {
   }
   /* Parsing and synchronizing top-level ElementDeclarationNode */
   elementDeclaration() {
-    const e = {}, n = () => this.nodeFactory.create(_, e);
+    const e = {}, n = () => this.nodeFactory.create(A, e);
     try {
-      this.consume("Expect an identifier", c.IDENTIFIER), e.type = this.previous();
+      this.consume("Expect an identifier", u.IDENTIFIER), e.type = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.type = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
-    if (!this.check(c.COLON, c.LBRACE, c.LBRACKET))
+    if (!this.check(u.COLON, u.LBRACE, u.LBRACKET))
       try {
         e.name = this.normalExpression();
       } catch (s) {
@@ -1314,7 +1317,7 @@ class ln {
         this.synchronizeElementDeclarationName();
       }
     if (lt(this.peek()))
-      if (e.as = this.advance(), this.check(c.COLON, c.LBRACE, c.LBRACKET))
+      if (e.as = this.advance(), this.check(u.COLON, u.LBRACE, u.LBRACKET))
         this.logError(this.peek(), o.UNEXPECTED_TOKEN, "Expect an alias");
       else
         try {
@@ -1327,27 +1330,27 @@ class ln {
           this.synchronizeElementDeclarationAlias();
         }
     try {
-      e.attributeList = this.check(c.LBRACKET) ? this.listExpression() : void 0;
+      e.attributeList = this.check(u.LBRACKET) ? this.listExpression() : void 0;
     } catch (s) {
       throw s instanceof d ? (e.attributeList = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     if (!this.discardUntil(
       "Expect an opening brace '{' or a colon ':'",
-      c.LBRACE,
-      c.COLON
+      u.LBRACE,
+      u.COLON
     ))
       return n();
     try {
-      if (this.match(c.COLON)) {
+      if (this.match(u.COLON)) {
         e.bodyColon = this.previous();
         const s = this.expression();
-        s instanceof _ ? (E(s), this.logError(s, o.UNEXPECTED_ELEMENT_DECLARATION, "An element's simple body must not be an element declaration")) : e.body = s;
+        s instanceof A ? (E(s), this.logError(s, o.UNEXPECTED_ELEMENT_DECLARATION, "An element's simple body must not be an element declaration")) : e.body = s;
       } else
         e.body = this.blockExpression();
     } catch (s) {
       throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
-    return this.nodeFactory.create(_, e);
+    return this.nodeFactory.create(A, e);
   }
   /* Parsing nested element declarations with simple body */
   // e.g
@@ -1356,29 +1359,29 @@ class ln {
   //    Note: 'This is a note'  // fieldDeclaration() handles this
   //  }
   fieldDeclaration() {
-    const e = {}, n = () => this.nodeFactory.create(_, e);
+    const e = {}, n = () => this.nodeFactory.create(A, e);
     try {
-      this.consume("Expect an identifier", c.IDENTIFIER), e.type = this.previous();
+      this.consume("Expect an identifier", u.IDENTIFIER), e.type = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.type = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     try {
-      this.consume("Expect a colon ':'", c.COLON), e.bodyColon = this.previous();
+      this.consume("Expect a colon ':'", u.COLON), e.bodyColon = this.previous();
     } catch (s) {
       throw s instanceof d ? (e.bodyColon = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     try {
       const s = this.expression();
-      s instanceof _ ? this.errors.push(new u(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
+      s instanceof A ? this.errors.push(new c(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
     } catch (s) {
       throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
-    return this.nodeFactory.create(_, e);
+    return this.nodeFactory.create(A, e);
   }
   /* Parsing any ExpressionNode, including non-NormalExpression */
   expression() {
-    const e = { args: [] }, n = () => en(e.callee, e.args, this.nodeFactory).unwrap_or(
-      this.nodeFactory.create(k, e)
+    const e = { args: [] }, n = () => nn(e.callee, e.args, this.nodeFactory).unwrap_or(
+      this.nodeFactory.create(w, e)
     );
     try {
       e.callee = this.normalExpression();
@@ -1402,7 +1405,7 @@ class ln {
     if (this.isAtEnd() || Tt(this.previous()))
       return !0;
     const e = this.peek().kind;
-    return e === c.RBRACE || e === c.RBRACKET || e === c.RPAREN || e === c.COMMA || e === c.COLON;
+    return e === u.RBRACE || e === u.RBRACKET || e === u.RPAREN || e === u.COMMA || e === u.COLON;
   }
   normalExpression() {
     return this.expression_bp(0);
@@ -1412,7 +1415,7 @@ class ln {
     let n = this.leftExpression_bp();
     for (; !this.isAtEnd(); ) {
       const s = this.peek();
-      if (s.kind === c.LPAREN) {
+      if (s.kind === u.LPAREN) {
         const { left: i } = ct(s);
         if (i < e || // When '(' is encountered,
         // consider it part of another expression if
@@ -1421,26 +1424,26 @@ class ln {
         at(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
           break;
         try {
-          n = this.nodeFactory.create(H, {
+          n = this.nodeFactory.create(J, {
             callee: n,
             argumentList: this.tupleExpression()
           });
         } catch (r) {
-          throw r instanceof d ? (n = this.nodeFactory.create(H, {
+          throw r instanceof d ? (n = this.nodeFactory.create(J, {
             callee: n,
             argumentList: r.partialNode
           }), new d(r.token, n, r.handlerContext)) : r;
         }
-      } else if (s.kind === c.LBRACKET) {
+      } else if (s.kind === u.LBRACKET) {
         if (Ve(this.previous()))
           break;
         try {
-          n = this.nodeFactory.create(le, {
+          n = this.nodeFactory.create(ce, {
             expression: n,
             indexer: this.listExpression()
           });
         } catch (i) {
-          throw i instanceof d ? (n = this.nodeFactory.create(le, {
+          throw i instanceof d ? (n = this.nodeFactory.create(ce, {
             expression: n,
             indexer: i.partialNode
           }), new d(i.token, n, i.handlerContext)) : i;
@@ -1450,23 +1453,23 @@ class ln {
         if (r.left !== null) {
           if (r.left <= e)
             break;
-          this.advance(), n = this.nodeFactory.create(Re, {
+          this.advance(), n = this.nodeFactory.create(De, {
             expression: n,
             op: i
           });
         } else {
-          const a = un(i);
+          const a = fn(i);
           if (a.left === null || a.left <= e)
             break;
           this.advance();
           try {
-            n = this.nodeFactory.create(q, {
+            n = this.nodeFactory.create(H, {
               leftExpression: n,
               op: i,
               rightExpression: i.value === "." ? this.extractOperand() : this.expression_bp(a.right)
             });
           } catch (l) {
-            throw l instanceof d ? (n = this.nodeFactory.create(q, {
+            throw l instanceof d ? (n = this.nodeFactory.create(H, {
               leftExpression: n,
               op: i,
               rightExpression: l.partialNode
@@ -1483,7 +1486,7 @@ class ln {
     if (rt(this.peek())) {
       const n = {};
       n.op = this.peek();
-      const s = fn(n.op);
+      const s = dn(n.op);
       if (s.right === null)
         throw this.logError(
           n.op,
@@ -1491,7 +1494,7 @@ class ln {
           `Unexpected '${n.op.value}' in an expression`
         ), new d(
           n.op,
-          this.nodeFactory.create(we, { pre: n.op }),
+          this.nodeFactory.create(ye, { pre: n.op }),
           this.contextStack.findHandlerContext(this.tokens, this.current)
         );
       this.advance();
@@ -1500,15 +1503,15 @@ class ln {
       } catch (i) {
         throw i instanceof d ? (n.expression = i.partialNode, new d(
           i.token,
-          this.nodeFactory.create(Q, n),
+          this.nodeFactory.create(q, n),
           i.handlerContext
         )) : i;
       }
-      e = this.nodeFactory.create(Q, n);
-    } else if (e = this.extractOperand(), e instanceof we)
+      e = this.nodeFactory.create(q, n);
+    } else if (e = this.extractOperand(), e instanceof ye)
       throw new d(
         this.peek(),
-        this.nodeFactory.create(we, { pre: this.peek() }),
+        this.nodeFactory.create(ye, { pre: this.peek() }),
         this.contextStack.findHandlerContext(this.tokens, this.current)
       );
     return e;
@@ -1519,12 +1522,12 @@ class ln {
   // e.g { ... }
   extractOperand() {
     return this.check(
-      c.NUMERIC_LITERAL,
-      c.STRING_LITERAL,
-      c.COLOR_LITERAL,
-      c.QUOTED_STRING,
-      c.IDENTIFIER
-    ) ? this.primaryExpression() : this.check(c.FUNCTION_EXPRESSION) ? this.functionExpression() : this.check(c.LBRACKET) ? this.listExpression() : this.check(c.LBRACE) ? this.blockExpression() : this.check(c.LPAREN) ? this.tupleExpression() : (this.peek().kind === c.EOF ? this.logError(
+      u.NUMERIC_LITERAL,
+      u.STRING_LITERAL,
+      u.COLOR_LITERAL,
+      u.QUOTED_STRING,
+      u.IDENTIFIER
+    ) ? this.primaryExpression() : this.check(u.FUNCTION_EXPRESSION) ? this.functionExpression() : this.check(u.LBRACKET) ? this.listExpression() : this.check(u.LBRACE) ? this.blockExpression() : this.check(u.LPAREN) ? this.tupleExpression() : (this.peek().kind === u.EOF ? this.logError(
       this.peek(),
       o.UNEXPECTED_EOF,
       "Unexpected EOF"
@@ -1532,56 +1535,56 @@ class ln {
       this.peek(),
       o.INVALID_OPERAND,
       `Invalid start of operand "${this.peek().value}"`
-    ), this.nodeFactory.create(we, { pre: this.previous() }));
+    ), this.nodeFactory.create(ye, { pre: this.previous() }));
   }
   /* Parsing FunctionExpression */
   functionExpression() {
     const e = {};
     try {
-      this.consume("Expect a function expression", c.FUNCTION_EXPRESSION), e.value = this.previous();
+      this.consume("Expect a function expression", u.FUNCTION_EXPRESSION), e.value = this.previous();
     } catch (n) {
       throw n instanceof d ? (e.value = n.partialNode, new d(
         n.token,
-        this.nodeFactory.create(ee, e),
+        this.nodeFactory.create(te, e),
         n.handlerContext
       )) : n;
     }
-    return this.nodeFactory.create(ee, e);
+    return this.nodeFactory.create(te, e);
   }
   canBeField() {
-    return this.peek().kind === c.IDENTIFIER && this.peek(1).kind === c.COLON;
+    return this.peek().kind === u.IDENTIFIER && this.peek(1).kind === u.COLON;
   }
   /* Parsing PrimaryExpression */
   primaryExpression() {
     if (this.match(
-      c.COLOR_LITERAL,
-      c.STRING_LITERAL,
-      c.NUMERIC_LITERAL
+      u.COLOR_LITERAL,
+      u.STRING_LITERAL,
+      u.NUMERIC_LITERAL
     ))
       return this.nodeFactory.create(D, {
-        expression: this.nodeFactory.create(Ee, { literal: this.previous() })
+        expression: this.nodeFactory.create(me, { literal: this.previous() })
       });
-    if (this.match(c.QUOTED_STRING, c.IDENTIFIER))
+    if (this.match(u.QUOTED_STRING, u.IDENTIFIER))
       return this.nodeFactory.create(D, {
-        expression: this.nodeFactory.create(X, { variable: this.previous() })
+        expression: this.nodeFactory.create(j, { 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(X, {})
+        expression: this.nodeFactory.create(j, {})
       }),
       this.contextStack.findHandlerContext(this.tokens, this.current)
     );
   }
   attribute() {
     const e = {};
-    if (this.check(c.COLON, c.RBRACKET, c.COMMA)) {
+    if (this.check(u.COLON, u.RBRACKET, u.COMMA)) {
       const n = this.peek();
       this.logError(
         n,
         o.EMPTY_ATTRIBUTE_NAME,
         "Expect a non-empty attribute name"
-      ), e.name = this.nodeFactory.create(K, { identifiers: [] });
+      ), e.name = this.nodeFactory.create($, { identifiers: [] });
     } else
       try {
         e.name = this.attributeName();
@@ -1591,17 +1594,17 @@ class ln {
         if (e.name = n.partialNode, !this.canHandle(n))
           throw new d(
             n.token,
-            this.nodeFactory.create(ne, e),
+            this.nodeFactory.create(se, e),
             n.handlerContext
           );
         this.synchronizeAttributeName();
       }
-    return this.match(c.COLON) && (e.colon = this.previous(), e.value = this.attributeValue()), this.nodeFactory.create(ne, e);
+    return this.match(u.COLON) && (e.colon = this.previous(), e.value = this.attributeValue()), this.nodeFactory.create(se, e);
   }
   attributeValue() {
     let e;
     try {
-      e = this.peek().kind === c.IDENTIFIER && this.peek(1).kind === c.IDENTIFIER ? this.attributeName() : this.normalExpression();
+      e = this.peek().kind === u.IDENTIFIER && this.peek(1).kind === u.IDENTIFIER ? this.attributeName() : this.normalExpression();
     } catch (n) {
       if (!(n instanceof d) || !this.canHandle(n))
         throw n;
@@ -1611,25 +1614,25 @@ class ln {
   }
   attributeName() {
     const e = [];
-    if (this.peek().kind !== c.IDENTIFIER)
+    if (this.peek().kind !== u.IDENTIFIER)
       return this.primaryExpression();
-    for (; !this.isAtEnd() && !this.check(c.COLON, c.COMMA, c.RBRACKET); )
+    for (; !this.isAtEnd() && !this.check(u.COLON, u.COMMA, u.RBRACKET); )
       try {
-        this.consume("Expect an identifier", c.IDENTIFIER), e.push(this.previous());
+        this.consume("Expect an identifier", u.IDENTIFIER), e.push(this.previous());
       } catch (n) {
         throw n instanceof d ? new d(
           n.token,
-          this.nodeFactory.create(K, { identifiers: e }),
+          this.nodeFactory.create($, { identifiers: e }),
           n.handlerContext
         ) : n;
       }
-    return this.nodeFactory.create(K, { identifiers: e });
+    return this.nodeFactory.create($, { identifiers: e });
   }
   logError(e, n, s) {
-    this.errors.push(new u(n, s, e));
+    this.errors.push(new c(n, s, e));
   }
 }
-const cn = {
+const hn = {
   "+": { left: 9, right: 10 },
   "*": { left: 11, right: 12 },
   "-": { left: 9, right: 10 },
@@ -1645,10 +1648,10 @@ const cn = {
   "!=": { left: 4, right: 5 },
   ".": { left: 16, right: 17 }
 };
-function un(t) {
-  return cn[t.value] || { left: null, right: null };
+function fn(t) {
+  return hn[t.value] || { left: null, right: null };
 }
-const hn = {
+const pn = {
   "+": { left: null, right: 15 },
   "-": { left: null, right: 15 },
   "<": { left: null, right: 15 },
@@ -1656,17 +1659,17 @@ const hn = {
   "<>": { left: null, right: 15 },
   "!": { left: null, right: 15 }
 };
-function fn(t) {
-  return hn[t.value] || { left: null, right: null };
+function dn(t) {
+  return pn[t.value] || { left: null, right: null };
 }
-const pn = {
+const En = {
   "(": { left: 14, right: null }
 };
 function ct(t) {
-  return pn[t.value] || { left: null, right: null };
+  return En[t.value] || { left: null, right: null };
 }
 var b = /* @__PURE__ */ ((t) => (t.Table = "table", t.Enum = "enum", t.Ref = "ref", t.Note = "note", t.Project = "project", t.Indexes = "indexes", t.TableGroup = "tablegroup", t))(b || {});
-function ge(t) {
+function Ae(t) {
   var n;
   const e = (n = t == null ? void 0 : t.type) == null ? void 0 : n.value.toLowerCase();
   switch (e) {
@@ -1677,111 +1680,111 @@ function ge(t) {
     case b.Project:
     case b.Ref:
     case b.TableGroup:
-      return new O(e);
+      return new S(e);
     default:
-      return new A();
+      return new v();
   }
 }
-function ue(t) {
+function he(t) {
   if (!He(t))
-    return new O([t]);
-  const e = ue(t.leftExpression).unwrap_or(void 0);
-  return e ? (e.push(t.rightExpression), new O(e)) : new A();
+    return new S([t]);
+  const e = he(t.leftExpression).unwrap_or(void 0);
+  return e ? (e.push(t.rightExpression), new S(e)) : new v();
 }
-function W(t) {
+function C(t) {
   if (t === void 0)
-    return new A();
-  const e = ue(t).unwrap_or(void 0);
+    return new v();
+  const e = he(t).unwrap_or(void 0);
   if (!e)
-    return new A();
+    return new v();
   const n = [];
   for (const s of e) {
-    const i = G(s).unwrap_or(void 0);
+    const i = X(s).unwrap_or(void 0);
     if (!i)
-      return new A();
+      return new v();
     n.push(i);
   }
-  return new O(n);
+  return new S(n);
 }
-function Ie(t) {
+function ge(t) {
   if (t === void 0)
-    return new A();
-  const e = ue(t).unwrap_or(void 0);
+    return new v();
+  const e = he(t).unwrap_or(void 0);
   if (!e || e.length === 0)
-    return new A();
+    return new v();
   const n = [];
   let s;
   if (!M(I.last(e))) {
     const i = e.pop();
     if (yt(i))
       s = i.elementList.map(
-        (r) => V(r).unwrap()
+        (r) => G(r).unwrap()
       );
     else
-      return new A();
+      return new v();
   }
   for (const i of e) {
-    const r = G(i).unwrap_or(void 0);
+    const r = X(i).unwrap_or(void 0);
     if (!r)
-      return new A();
+      return new v();
     n.push(r);
   }
-  return new O({
+  return new S({
     variables: n,
     tupleElements: s
   });
 }
-function G(t) {
-  return M(t) ? new O(t.expression.variable.value) : new A();
+function X(t) {
+  return M(t) ? new S(t.expression.variable.value) : new v();
 }
 function Ge(t) {
   if (ut(t))
-    return t instanceof ee ? new O({ functional: [t], nonFunctional: [] }) : new O({ functional: [], nonFunctional: [t] });
-  if (t instanceof J && t.elementList.every(ut)) {
+    return t instanceof te ? new S({ functional: [t], nonFunctional: [] }) : new S({ functional: [], nonFunctional: [t] });
+  if (t instanceof Z && t.elementList.every(ut)) {
     const e = t.elementList.filter(
-      (s) => s instanceof ee
+      (s) => s instanceof te
     ), n = t.elementList.filter(M);
-    return new O({ functional: e, nonFunctional: n });
+    return new S({ functional: e, nonFunctional: n });
   }
-  return new A();
+  return new v();
 }
-function V(t) {
+function G(t) {
   var n;
   const e = (n = t == null ? void 0 : t.expression.variable) == null ? void 0 : n.value;
-  return e === void 0 ? new A() : new O(e);
+  return e === void 0 ? new v() : new S(e);
 }
-function Y(t) {
-  return $(t) ? t.expression instanceof X ? new O(t.expression.variable.value) : new O(t.expression.literal.value) : new A();
+function Q(t) {
+  return Y(t) ? t.expression instanceof j ? new S(t.expression.variable.value) : new S(t.expression.literal.value) : new v();
 }
-function dn(t) {
+function Nn(t) {
   var e;
-  return !(t instanceof q) || !wt((e = t.op) == null ? void 0 : e.value) ? !1 : Ie(t.leftExpression).and_then(() => Ie(t.rightExpression)).unwrap_or(void 0) !== void 0;
+  return !(t instanceof H) || !wt((e = t.op) == null ? void 0 : e.value) ? !1 : ge(t.leftExpression).and_then(() => ge(t.rightExpression)).unwrap_or(void 0) !== void 0;
 }
-function En(t) {
-  const e = Ie(t.leftExpression), n = Ie(t.rightExpression);
+function mn(t) {
+  const e = ge(t.leftExpression), n = ge(t.rightExpression);
   if (!e.isOk() || !n.isOk())
     return !1;
   const { tupleElements: s } = e.unwrap(), { tupleElements: i } = n.unwrap();
   return (s == null ? void 0 : s.length) === (i == null ? void 0 : i.length);
 }
 function ut(t) {
-  return t instanceof D && t.expression instanceof X || t instanceof ee;
+  return t instanceof D && t.expression instanceof j || t instanceof te;
 }
-function Nn(t, e) {
+function Tn(t, e) {
   var i, r, a, l;
   let n = e;
-  const s = jt(t);
+  const s = zt(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 C && s)
+    if (((l = n.symbol) == null ? void 0 : l.declaration) instanceof F && s)
       return n.symbol;
-    if (n instanceof C)
+    if (n instanceof F)
       return;
     n = n.parent;
   }
 }
-class mn {
+class bn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1789,27 +1792,27 @@ class mn {
     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 C || ge(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new u(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof F || Ae(this.declarationNode.parent).unwrap_or(void 0) !== b.Project ? [new c(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new u(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "A Custom element shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof te)
-      return [new u(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
+    if (e instanceof ne)
+      return [new c(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
     const n = [];
-    return $(e.callee) || n.push(new u(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 u(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), 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;
   }
 }
-class _e {
+class ve {
   constructor() {
     this.table = /* @__PURE__ */ new Map();
   }
@@ -1826,7 +1829,7 @@ class _e {
     return this.table.entries();
   }
 }
-class Tn {
+class In {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1834,55 +1837,55 @@ class Tn {
     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 _ ? [new u(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_PROJECT_CONTEXT, "An Enum can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Je(e) ? [] : [new u(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new u(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
+    return e ? Je(e) ? [] : [new c(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new c(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(qt, { declaration: this.declarationNode, symbolTable: new _e() });
-    const { name: n } = this.declarationNode, s = W(n);
+    this.declarationNode.symbol = this.symbolFactory.create(Jt, { declaration: this.declarationNode, symbolTable: new ve() });
+    const { name: n } = this.declarationNode, s = C(n);
     if (s.isOk()) {
       const i = s.unwrap(), r = i.pop(), a = Ze(i, this.publicSymbolTable, this.symbolFactory), l = je(r);
-      a.has(l) && e.push(new u(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(l, this.declarationNode.symbol);
+      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);
     }
     return e;
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
+    if (e instanceof w)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    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 u(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !M(n.callee) && s.push(new u(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
+      n.callee && !M(n.callee) && s.push(new c(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
       const i = [...n.args];
-      return I.last(i) instanceof 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 u(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 c(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
     });
   }
   validateFieldSettings(e) {
-    const n = z(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "note":
-          a.length > 1 && a.forEach((l) => s.push(new u(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            $(l.value) || s.push(new u(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", l));
+          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));
           });
           break;
         default:
-          a.forEach((l) => s.push(new u(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, l)));
+          a.forEach((l) => s.push(new c(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, l)));
       }
     }
     return s;
@@ -1891,20 +1894,20 @@ class Tn {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(Ht, { declaration: e });
+      const n = G(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(Zt, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -1912,7 +1915,7 @@ class Tn {
     return [];
   }
 }
-class bn {
+class Ln {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1920,23 +1923,23 @@ class bn {
     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 C || ge(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new u(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof F || Ae(this.declarationNode.parent).unwrap_or(void 0) !== b.Table ? [new c(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new u(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
+    return e ? [new c(o.UNEXPECTED_NAME, "An Indexes shouldn't have a name", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "An Indexes shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    if (e instanceof w)
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
@@ -1945,36 +1948,36 @@ class bn {
         return [];
       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 H; )
-          r.argumentList && !Ge(r.argumentList).isOk() && s.push(new u(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;
-        Ge(r).isOk() || s.push(new u(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
+        for (; r instanceof J; )
+          r.argumentList && !Ge(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;
+        Ge(r).isOk() || s.push(new c(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
       }), s;
     });
   }
   validateFieldSetting(e) {
-    const n = z(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "note":
         case "name":
-          a.length > 1 && a.forEach((l) => s.push(new u(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            $(l.value) || s.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, l));
+          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));
           });
           break;
         case "unique":
         case "pk":
-          a.length > 1 && a.forEach((l) => s.push(new u(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            oe(l.value) || s.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
+          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
+            le(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
           });
           break;
         case "type":
-          a.length > 1 && a.forEach((l) => s.push(new u(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
-            M(l.value) || s.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+          a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
+            M(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
           });
           break;
         default:
-          a.forEach((l) => s.push(new u(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, l)));
+          a.forEach((l) => s.push(new c(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, l)));
       }
     }
     return s;
@@ -1983,12 +1986,12 @@ class bn {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class In {
+class gn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -1996,39 +1999,47 @@ 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 C || ![b.Table, b.Project].includes(ge(this.declarationNode.parent).unwrap_or(void 0)) ? [new u(o.INVALID_NOTE_CONTEXT, "A Note can only appear inside a Table or a Project", this.declarationNode)] : [];
+    return !(this.declarationNode.parent instanceof F) && ![b.Table, b.Project].includes(Ae(this.declarationNode.parent).unwrap_or(void 0)) ? [new c(o.INVALID_NOTE_CONTEXT, "A Note can only appear inside a Table or a Project. Sticky note can only appear at the global scope.", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new u(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+    if (!(this.declarationNode.parent instanceof F))
+      return e ? [new c(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)];
+    const n = C(e);
+    if (!n.isOk())
+      return [];
+    const i = n.unwrap().join("."), r = Yt(i);
+    return this.publicSymbolTable.has(r) ? [new c(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
+    return e && !(this.declarationNode.parent instanceof F) ? [new c(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
+    if (e instanceof w)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     const n = [];
-    return e.length === 0 ? [new u(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new u(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), $(e[0].callee) || n.push(new u(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 u(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
+    return e.length === 0 ? [new c(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new c(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), 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);
   }
   validateSubElements(e) {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class Ln {
+class _n {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2036,25 +2047,25 @@ class Ln {
     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 _ ? [new u(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Pe(e) ? [] : [new u(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? Pe(e) ? [] : [new c(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    if (e instanceof w)
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [
-      ...n.map((i) => new u(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
+      ...n.map((i) => new c(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
       ...this.validateSubElements(s)
     ];
   }
@@ -2062,12 +2073,12 @@ class Ln {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class gn {
+class An {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2075,48 +2086,48 @@ 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 C ? [] : [new u(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
+    return this.declarationNode.parent instanceof F ? [] : [new c(o.INVALID_REF_CONTEXT, "A Ref must appear top-level", this.declarationNode)];
   }
   validateName(e) {
-    return e ? Pe(e) ? [] : [new u(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? Pe(e) ? [] : [new c(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
+    if (e instanceof w)
       return this.validateFields([e]);
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     if (e.length === 0)
-      return [new u(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
+      return [new c(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
     const n = [];
-    return e.length > 1 && n.push(...e.slice(1).map((s) => new u(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
-      s.callee && !dn(s.callee) && n.push(new u(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !En(s.callee) && n.push(new u(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
+    return e.length > 1 && n.push(...e.slice(1).map((s) => new c(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
+      s.callee && !Nn(s.callee) && n.push(new c(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !mn(s.callee) && n.push(new c(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee));
       const i = [...s.args];
-      I.last(i) instanceof 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 u(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 c(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", r)));
     }), n;
   }
   validateFieldSettings(e) {
-    const n = z(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "delete":
         case "update":
-          a.length > 1 && a.forEach((l) => s.push(new u(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            _n(l.value) || s.push(new u(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((l) => s.push(new c(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
+            vn(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));
           });
           break;
         default:
-          a.forEach((l) => s.push(new u(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, l)));
+          a.forEach((l) => s.push(new c(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, l)));
       }
     }
     return s;
@@ -2125,16 +2136,16 @@ class gn {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-function _n(t) {
-  if (!(M(t) && t.expression.variable.kind !== c.QUOTED_STRING) && !(t instanceof K))
+function vn(t) {
+  if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
     return !1;
   let e;
-  if (t instanceof K ? e = De(t).unwrap_or("") : e = t.expression.variable.value, e)
+  if (t instanceof $ ? e = Ne(t).unwrap_or("") : e = t.expression.variable.value, e)
     switch (e.toLowerCase()) {
       case "cascade":
       case "no action":
@@ -2147,7 +2158,7 @@ function _n(t) {
     }
   return !1;
 }
-class An {
+class wn {
   constructor(e, n, s) {
     this.declarationNode = e, this.symbolFactory = s, this.publicSymbolTable = n;
   }
@@ -2155,77 +2166,77 @@ class An {
     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 _ ? [new u(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof le ? [new u(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : Je(e) ? [] : [new u(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new u(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
+    return e ? e instanceof ce ? [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)] : Je(e) ? [] : [new c(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new c(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? kn(e) ? [] : [new u(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
+    return e ? Sn(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
   }
   validateSettingList(e) {
-    const n = z(e), s = n.getErrors(), i = n.getValue();
+    const n = W(e), s = n.getErrors(), i = n.getValue();
     for (const r in i) {
       const a = i[r];
       switch (r) {
         case "headercolor":
-          a.length > 1 && s.push(...a.map((l) => new u(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", l))), a.forEach((l) => {
-            xn(l.value) || s.push(new u(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((l) => new c(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", l))), a.forEach((l) => {
+            On(l.value) || s.push(new c(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
           });
           break;
         case "note":
-          a.length > 1 && s.push(...a.map((l) => new u(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            $(l.value) || s.push(new u(o.INVALID_TABLE_SETTING, "'note' must be a string literal", l.value || l.name));
+          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));
           });
           break;
         default:
-          s.push(...a.map((l) => new u(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
+          s.push(...a.map((l) => new c(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
       }
     }
     return s;
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(_t, { declaration: this.declarationNode, symbolTable: new _e() });
-    const { name: n, alias: s } = this.declarationNode, i = W(n);
+    this.declarationNode.symbol = this.symbolFactory.create(_t, { declaration: this.declarationNode, symbolTable: new ve() });
+    const { name: n, alias: s } = this.declarationNode, i = C(n);
     if (i.isOk()) {
-      const r = [...i.unwrap()], a = r.pop(), l = Ze(r, this.publicSymbolTable, this.symbolFactory), p = ke(a);
-      l.has(p) && e.push(new u(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(), l = Ze(r, this.publicSymbolTable, this.symbolFactory), p = xe(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);
     }
-    if (s && Pe(s) && !wn(s.expression.variable.value, i.unwrap_or([]))) {
-      const r = V(s).unwrap(), a = ke(r);
-      this.publicSymbolTable.has(a) && e.push(new u(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
+    if (s && Pe(s) && !kn(s.expression.variable.value, i.unwrap_or([]))) {
+      const r = G(s).unwrap(), a = xe(r);
+      this.publicSymbolTable.has(a) && e.push(new c(o.DUPLICATE_NAME, `Table name '${r}' already exists`, n)), this.publicSymbolTable.set(a, this.declarationNode.symbol);
     }
     return e;
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    if (e instanceof w)
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.length === 0 ? [new u(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
+    return e.length === 0 ? [new c(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
       if (!n.callee)
         return [];
       const s = [];
-      n.args.length === 0 && s.push(new u(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new u(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !vn(n.args[0]) && s.push(new u(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      n.args.length === 0 && s.push(new c(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new c(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !yn(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
       const i = n.args.slice(1);
       return s.push(...this.validateFieldSetting(i)), s.push(...this.registerField(n)), s;
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = We(n), i = this.symbolFactory.create(Jt, { declaration: e });
+      const n = G(e.callee).unwrap(), s = We(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 u(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
+          new c(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2234,75 +2245,75 @@ class An {
   }
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
-    if (!e.slice(0, -1).every(de) || !e.slice(-1).every((p) => de(p) || p instanceof P))
-      return [...e.map((p) => new u(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
+    if (!e.slice(0, -1).every(Ee) || !e.slice(-1).every((p) => Ee(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))];
     if (e.length === 0)
       return [];
     let n;
     I.last(e) instanceof P && (n = e.pop());
-    const s = z(n), i = s.getErrors(), r = s.getValue();
+    const s = W(n), i = s.getErrors(), r = s.getValue();
     for (const p of e) {
-      const h = V(p).unwrap_or("").toLowerCase();
+      const h = G(p).unwrap_or("").toLowerCase();
       if (h !== "pk" && h !== "unique") {
-        i.push(new u(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
+        i.push(new c(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
         continue;
       }
       r[h] === void 0 ? r[h] = [p] : r[h].push(p);
     }
     const a = r.pk || [], l = r["primary key"] || [];
-    a.length >= 1 && l.length >= 1 && i.push(...[...a, ...l].map((p) => new u(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
+    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)));
     for (const p in r) {
       const h = r[p];
       switch (p) {
         case "note":
-          h.length > 1 && i.push(...h.map((f) => new u(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
-            $(f.value) || i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", f.value || f.name));
+          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));
           });
           break;
         case "ref":
           h.forEach((f) => {
-            Sn(f.value) || i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", f.value || f.name));
+            Dn(f.value) || i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
-            oe(f.value) || i.push(new u(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 c(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
+            le(f.value) || i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", f))), h.forEach((f) => {
-            f instanceof ne && !oe(f.value) && i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
+          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 && !le(f.value) && i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
+          h.length > 1 && i.push(...h.map((f) => new c(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 u(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", f))), h.forEach((f) => {
-            oe(f.value) || i.push(new u(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 c(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", f))), h.forEach((f) => {
+            le(f.value) || i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
-            oe(f.value) || i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
+          h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
+            le(f.value) || i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", f))), h.forEach((f) => {
-            f instanceof ne && !oe(f.value) && i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
+          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 && !le(f.value) && i.push(new c(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 u(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", f))), h.forEach((f) => {
-            f instanceof ne && !oe(f.value) && i.push(new u(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
+          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 && !le(f.value) && i.push(new c(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 u(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
-            On(f.value) || i.push(new u(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 c(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
+            Rn(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));
           });
           break;
         default:
-          h.forEach((f) => i.push(new u(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
+          h.forEach((f) => i.push(new c(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
       }
     }
     return i;
@@ -2311,35 +2322,35 @@ class An {
     const n = e.flatMap((i) => {
       if (i.parent = this.declarationNode, !i.type)
         return [];
-      const r = ie(i);
+      const r = re(i);
       return new r(i, this.publicSymbolTable, this.symbolFactory).validate();
     }), s = e.filter((i) => {
       var r;
       return ((r = i.type) == null ? void 0 : r.value.toLowerCase()) === "note";
     });
-    return s.length > 1 && (n.push(...s.map((i) => new u(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
+    return s.length > 1 && (n.push(...s.map((i) => new c(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
   }
 }
-function vn(t) {
-  if (!(t instanceof H || He(t) || t instanceof D || t instanceof le))
+function yn(t) {
+  if (!(t instanceof J || He(t) || t instanceof D || t instanceof ce))
     return !1;
-  if (t instanceof H) {
-    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => ce(n) || $(n) || de(n)))
+  if (t instanceof J) {
+    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => ue(n) || Y(n) || Ee(n)))
       return !1;
     t = t.callee;
   }
-  for (; t instanceof le; ) {
-    if (t.array === void 0 || t.indexer === void 0 || !t.indexer.elementList.every((n) => !n.colon && !n.value && ce(n.name)))
+  for (; t instanceof ce; ) {
+    if (t.array === void 0 || t.indexer === void 0 || !t.indexer.elementList.every((n) => !n.colon && !n.value && ue(n.name)))
       return !1;
     t = t.array;
   }
-  const e = W(t).unwrap_or(void 0);
+  const e = C(t).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-function wn(t, e) {
+function kn(t, e) {
   return e.length === 1 && t === e[0];
 }
-class yn {
+class xn {
   constructor(e, n, s) {
     this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
@@ -2347,61 +2358,61 @@ 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 _ ? [new u(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof A ? [new c(o.INVALID_TABLEGROUP_CONTEXT, "TableGroup must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Je(e) ? [] : [new u(o.INVALID_NAME, "A TableGroup name must be of the form <tablegroup> or <schema>.<tablegroup>", e)] : [new u(o.NAME_NOT_FOUND, "A TableGroup must have a name", this.declarationNode)];
+    return e ? Je(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)];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
+    return e ? [new c(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const { name: e } = this.declarationNode;
-    this.declarationNode.symbol = this.symbolFactory.create(Zt, { declaration: this.declarationNode, symbolTable: new _e() });
-    const n = W(e);
+    this.declarationNode.symbol = this.symbolFactory.create(en, { declaration: this.declarationNode, symbolTable: new ve() });
+    const n = C(e);
     if (n.isOk()) {
       const s = n.unwrap(), i = s.pop(), r = Ze(s, this.publicSymbolTable, this.symbolFactory), a = ze(i);
       if (r.has(a))
-        return [new u(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
+        return [new c(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
       r.set(a, this.declarationNode.symbol);
     }
     return [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
+    return e ? [new c(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof k)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    if (e instanceof w)
+      return [new c(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
     return e.flatMap((n) => {
       const s = [];
-      return n.callee && !W(n.callee).isOk() && s.push(new u(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 u(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
+      return n.callee && !C(n.callee).isOk() && s.push(new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new c(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
     });
   }
   validateSubElements(e) {
     return e.flatMap((n) => {
       if (n.parent = this.declarationNode, !n.type)
         return [];
-      const s = ie(n);
+      const s = re(n);
       return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const n = V(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(Kt, { declaration: e });
+      const n = G(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(tn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
       if (r.has(s)) {
         const a = r.get(s);
         return [
-          new u(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
-          new u(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
+          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
+          new c(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
         ];
       }
       r.set(s, i);
@@ -2410,34 +2421,34 @@ class yn {
   }
 }
 const vt = ["-", "+"];
-function ie(t) {
+function re(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
-      return Tn;
+      return In;
     case b.Table:
-      return An;
+      return wn;
     case b.TableGroup:
-      return yn;
+      return xn;
     case b.Project:
-      return Ln;
+      return _n;
     case b.Ref:
-      return gn;
+      return An;
     case b.Note:
-      return In;
+      return gn;
     case b.Indexes:
-      return bn;
+      return Ln;
     default:
-      return mn;
+      return bn;
   }
 }
 function Je(t) {
-  return !!W(t).unwrap_or(!1);
+  return !!C(t).unwrap_or(!1);
 }
-function kn(t) {
+function Sn(t) {
   return Pe(t);
 }
 function Pe(t) {
-  return t instanceof D && t.expression instanceof X;
+  return t instanceof D && t.expression instanceof j;
 }
 function Ze(t, e, n) {
   var i;
@@ -2450,7 +2461,7 @@ function Ze(t, e, n) {
       if (a = (i = s.get(l)) == null ? void 0 : i.symbolTable, !a)
         throw new Error("Expect a symbol table in a schema symbol");
     } else {
-      a = new _e();
+      a = new ve();
       const p = n.create(gt, { symbolTable: a });
       s.set(l, p);
     }
@@ -2461,60 +2472,60 @@ function Ze(t, e, n) {
 function wt(t) {
   return t === "-" || t === "<>" || t === ">" || t === "<";
 }
-function xn(t) {
+function On(t) {
   var n;
-  if (!(t instanceof D) || !(t.expression instanceof Ee) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== c.COLOR_LITERAL)
+  if (!(t instanceof D) || !(t.expression instanceof me) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
     return !1;
   const e = t.expression.literal.value;
   if (e.length !== 4 && e.length !== 7 || e[0] !== "#")
     return !1;
   for (let s = 1; s < e.length; s += 1)
-    if (!zt(e[s]))
+    if (!qt(e[s]))
       return !1;
   return !0;
 }
-function oe(t) {
+function le(t) {
   return t === void 0;
 }
-function On(t) {
+function Rn(t) {
   var e;
-  return !!($(t) || ce(t) || de(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && vt.includes((e = t.op) == null ? void 0 : e.value) && ce(t.expression) || t instanceof ee);
+  return !!(Y(t) || ue(t) || Ee(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof q && vt.includes((e = t.op) == null ? void 0 : e.value) && ue(t.expression) || t instanceof te);
 }
-function ce(t) {
+function ue(t) {
   var e;
-  return t instanceof D && t.expression instanceof Ee && ((e = t.expression.literal) == null ? void 0 : e.kind) === c.NUMERIC_LITERAL;
+  return t instanceof D && t.expression instanceof me && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
 }
-function Sn(t) {
+function Dn(t) {
   var n;
-  if (!(t instanceof Q) || !wt((n = t.op) == null ? void 0 : n.value))
+  if (!(t instanceof q) || !wt((n = t.op) == null ? void 0 : n.value))
     return !1;
-  const e = W(t.expression).unwrap_or(void 0);
+  const e = C(t.expression).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
 function yt(t) {
-  return t instanceof J && t.elementList.every(M);
+  return t instanceof Z && t.elementList.every(M);
 }
-function z(t) {
+function W(t) {
   var s;
   const e = {}, n = [];
   if (!t)
-    return new F({});
+    return new B({});
   for (const i of t.elementList) {
     if (!i.name)
       continue;
     if (i.name instanceof D) {
-      n.push(new u(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
+      n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
-    const r = (s = De(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
+    const r = (s = Ne(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
     r && (e[r] === void 0 ? e[r] = [i] : e[r].push(i));
   }
-  return new F(e, n);
+  return new B(e, n);
 }
 class ht {
   constructor(e, n) {
     this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(gt, {
-      symbolTable: new _e()
+      symbolTable: new ve()
     }), this.ast.symbol = this.publicSchemaSymbol, this.ast.symbol.declaration = this.ast;
   }
   validate() {
@@ -2522,18 +2533,18 @@ class ht {
     this.ast.body.forEach((s) => {
       if (s.parent = this.ast, s.type === void 0)
         return;
-      const i = ie(s), r = new i(
+      const i = re(s), r = new i(
         s,
         this.publicSchemaSymbol.symbolTable,
         this.symbolFactory
       );
       e.push(...r.validate());
     });
-    const n = this.ast.body.filter((s) => ge(s).unwrap_or(void 0) === b.Project);
-    return n.length > 1 && n.forEach((s) => e.push(new u(o.PROJECT_REDEFINED, "Only one project can exist", s))), new F(this.ast, e);
+    const n = this.ast.body.filter((s) => Ae(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);
   }
 }
-class re {
+class ae {
   constructor(e, n) {
     this.declarationNode = e, this.errors = n;
   }
@@ -2545,7 +2556,7 @@ class re {
       for (const s of e.elementList) {
         if (s.name instanceof D)
           continue;
-        const i = De(s.name).unwrap_or(void 0);
+        const i = Ne(s.name).unwrap_or(void 0);
         if (!i)
           continue;
         const r = n[i.toLowerCase()];
@@ -2557,9 +2568,9 @@ class re {
     if (!e.body)
       return;
     const { body: n } = e;
-    if (n instanceof te)
+    if (n instanceof ne)
       for (const s of n.body)
-        if (s instanceof _) {
+        if (s instanceof A) {
           if (!s.type)
             continue;
           const i = kt(s);
@@ -2581,11 +2592,11 @@ class re {
     var s, i;
     if (e)
       if (e instanceof D) {
-        if (e.expression instanceof X && ((i = n.keywords) != null && i.includes((s = e.expression.variable) == null ? void 0 : s.value.toLowerCase())))
+        if (e.expression instanceof j && ((i = n.keywords) != null && i.includes((s = e.expression.variable) == null ? void 0 : s.value.toLowerCase())))
           return;
         this.bindFragments([e], n);
       } else
-        e instanceof q ? He(e) ? this.bindFragments(ue(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof Q ? this.scanAndBind(e.expression, n) : e instanceof Re ? this.scanAndBind(e.expression, n) : e instanceof J && e.elementList.forEach((r) => this.scanAndBind(r, n));
+        e instanceof H ? He(e) ? this.bindFragments(he(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof q ? this.scanAndBind(e.expression, n) : e instanceof De ? this.scanAndBind(e.expression, n) : e instanceof Z && e.elementList.forEach((r) => this.scanAndBind(r, n));
   }
   // Bind the fragments of a member access expression
   // which can be a simple expression like v1.User,
@@ -2601,14 +2612,14 @@ class re {
       return;
     const T = [];
     for (; s.length && h.length; ) {
-      const f = s.pop(), N = h.pop(), g = V(N).unwrap();
+      const f = s.pop(), N = h.pop(), g = G(N).unwrap();
       T.unshift({
         index: Fe(g, f),
         referrer: N
       });
     }
     for (; h.length; ) {
-      const f = h.pop(), N = V(f).unwrap();
+      const f = h.pop(), N = G(f).unwrap();
       T.unshift({
         index: Fe(N, i),
         referrer: f
@@ -2620,7 +2631,7 @@ class re {
           ...T,
           {
             index: Fe(
-              V(f).unwrap(),
+              G(f).unwrap(),
               p
             ),
             referrer: f
@@ -2635,16 +2646,16 @@ class re {
   resolveIndexStack(e, n) {
     if (e.length === 0)
       throw new Error("Unreachable - An unresolved name must have at least one name component");
-    const [s, ...i] = e, r = Nn(s.index, this.declarationNode);
+    const [s, ...i] = e, r = Tn(s.index, this.declarationNode);
     if (r === void 0) {
-      const { kind: h, name: T } = se(s.index).unwrap();
+      const { kind: h, name: T } = ie(s.index).unwrap();
       this.logError(s.referrer, `Can not find ${h} '${T}'`, n);
       return;
     }
     r.references.push(s.referrer), s.referrer.referee = r;
-    let a = r.symbolTable, { kind: l, name: p } = se(s.index).unwrap();
+    let a = r.symbolTable, { kind: l, name: p } = ie(s.index).unwrap();
     for (const h of i) {
-      const { kind: T, name: f } = se(h.index).unwrap(), N = a.get(h.index);
+      const { kind: T, name: f } = ie(h.index).unwrap(), N = a.get(h.index);
       if (!N) {
         this.logError(
           h.referrer,
@@ -2659,10 +2670,10 @@ class re {
     }
   }
   logError(e, n, s) {
-    s || this.errors.push(new u(o.BINDING_ERROR, n, e));
+    s || this.errors.push(new c(o.BINDING_ERROR, n, e));
   }
 }
-class Rn extends re {
+class Pn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2672,7 +2683,7 @@ class Rn extends re {
     }, this.settingList = {};
   }
 }
-class Dn extends re {
+class Un extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2682,7 +2693,7 @@ class Dn extends re {
     }, this.settingList = {};
   }
 }
-class Pn extends re {
+class Mn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2717,7 +2728,7 @@ class Pn extends re {
     }, this.settingList = {};
   }
 }
-class Un extends re {
+class Fn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2727,7 +2738,7 @@ class Un extends re {
     }, this.settingList = {};
   }
 }
-class Mn extends re {
+class Bn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2737,7 +2748,7 @@ class Mn extends re {
     }, this.settingList = {};
   }
 }
-class Fn extends re {
+class Vn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2754,7 +2765,7 @@ class Fn extends re {
     }, this.settingList = {};
   }
 }
-class Bn extends re {
+class Gn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2782,7 +2793,7 @@ class Bn extends re {
     }, this.settingList = {};
   }
 }
-class Vn extends re {
+class Cn extends ae {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2802,24 +2813,24 @@ class Vn extends re {
 function kt(t) {
   switch (t.type.value.toLowerCase()) {
     case b.Enum:
-      return Dn;
+      return Un;
     case b.Table:
-      return Bn;
+      return Gn;
     case b.TableGroup:
-      return Vn;
+      return Cn;
     case b.Project:
-      return Mn;
+      return Bn;
     case b.Ref:
-      return Fn;
+      return Vn;
     case b.Note:
-      return Un;
+      return Fn;
     case b.Indexes:
-      return Pn;
+      return Mn;
     default:
-      return Rn;
+      return Pn;
   }
 }
-class Gn {
+class Xn {
   constructor(e) {
     this.ast = e, this.errors = [];
   }
@@ -2829,10 +2840,10 @@ class Gn {
         const n = kt(e);
         new n(e, this.errors).bind();
       }
-    return new F(this.ast, this.errors);
+    return new B(this.ast, this.errors);
   }
 }
-class Cn {
+class $n {
   constructor(e) {
     this.generator = e;
   }
@@ -2840,21 +2851,21 @@ class Cn {
     return new e(n, this.generator.nextId());
   }
 }
-class Xn {
+class Wn {
   constructor(e, n) {
-    this.ast = e, this.symbolFactory = new Cn(n);
+    this.ast = e, this.symbolFactory = new $n(n);
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
-    return new ht(this.ast, this.symbolFactory).validate().chain((n) => new Gn(n).resolve());
+    return new ht(this.ast, this.symbolFactory).validate().chain((n) => new Xn(n).resolve());
   }
   // For invoking the validator only
   validate() {
-    return new ht(this.ast, this.symbolFactory).validate().chain((n) => new F(n, []));
+    return new ht(this.ast, this.symbolFactory).validate().chain((n) => new B(n, []));
   }
 }
 function ft(t, e) {
-  const { variables: n, tupleElements: s } = Ie(t).unwrap();
+  const { variables: n, tupleElements: s } = ge(t).unwrap();
   return s ? n.length === 0 ? {
     schemaName: e.schemaName,
     tableName: e.name,
@@ -2898,17 +2909,17 @@ function x(t) {
 }
 function Ce(t) {
   var n;
-  const e = (n = ue(t).unwrap_or(void 0)) == null ? void 0 : n.pop();
-  return e instanceof J ? e.elementList.map((s) => s.referee) : [e.referee];
+  const e = (n = he(t).unwrap_or(void 0)) == null ? void 0 : n.pop();
+  return e instanceof Z ? e.elementList.map((s) => s.referee) : [e.referee];
 }
-function Ae(t) {
-  const e = W(t).unwrap();
+function Te(t) {
+  const e = C(t).unwrap();
   return {
     name: e.pop(),
     schemaName: e
   };
 }
-function $n(t) {
+function St(t) {
   return t.expression.literal.value;
 }
 function Ot(t, e) {
@@ -2919,7 +2930,7 @@ function Ot(t, e) {
   const n = t.id, s = e.id;
   return n < s ? `${n}-${s}` : `${s}-${n}`;
 }
-function St(t, e) {
+function Rt(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);
@@ -2927,7 +2938,7 @@ function St(t, e) {
   const n = t.id, s = e.id;
   return n === s;
 }
-class Rt {
+class Dt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.table = { name: void 0, schemaName: void 0, alias: null, fields: [], token: void 0, indexes: [] }, this.pkColumns = [];
   }
@@ -2951,13 +2962,13 @@ class Rt {
     }), this.pkColumns.forEach((n) => n.pk = !1)), e;
   }
   interpretName(e) {
-    const { name: n, schemaName: s } = Ae(e);
-    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new u(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
+    const { name: n, schemaName: s } = Te(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, []);
   }
   interpretAlias(e) {
     if (!e)
       return [];
-    const n = V(e).unwrap_or(null);
+    const n = G(e).unwrap_or(null);
     return n && (this.env.aliases.push({
       name: n,
       kind: "table",
@@ -2969,16 +2980,16 @@ class Rt {
   }
   interpretSettingList(e) {
     var r, a, l;
-    const n = z(e).getValue();
-    this.table.headerColor = (r = n.headercolor) != null && r.length ? $n((l = (a = n.headercolor) == null ? void 0 : a.at(0)) == null ? void 0 : l.value) : void 0;
-    const [s] = n.note || [], i = Y(s == null ? void 0 : s.value).unwrap_or(void 0);
+    const n = W(e).getValue();
+    this.table.headerColor = (r = n.headercolor) != null && r.length ? St((l = (a = n.headercolor) == null ? void 0 : a.at(0)) == null ? void 0 : l.value) : void 0;
+    const [s] = n.note || [], i = Q(s == null ? void 0 : s.value).unwrap_or(void 0);
     return this.table.note = s && {
       value: i,
       token: x(s)
     }, [];
   }
   interpretBody(e) {
-    const [n, s] = I.partition(e.body, (i) => i instanceof k);
+    const [n, s] = I.partition(e.body, (i) => i instanceof w);
     return [...this.interpretFields(n), ...this.interpretSubElements(s)];
   }
   interpretSubElements(e) {
@@ -2987,7 +2998,7 @@ class Rt {
       switch ((s = n.type) == null ? void 0 : s.value.toLowerCase()) {
         case "note":
           return this.table.note = {
-            value: Y(n.body instanceof te ? n.body.body[0].callee : n.body.callee).unwrap(),
+            value: Q(n.body instanceof ne ? n.body.body[0].callee : n.body.callee).unwrap(),
             token: x(n)
           }, [];
         case "indexes":
@@ -3002,68 +3013,68 @@ class Rt {
   interpretColumn(e) {
     var a, l, p, h, T, f, N, g;
     const n = [], s = {};
-    s.name = V(e.callee).unwrap();
-    const i = Wn(e.args[0]);
+    s.name = G(e.callee).unwrap();
+    const i = jn(e.args[0]);
     s.type = i.getValue(), n.push(...i.getErrors()), s.token = x(e), s.inline_refs = [];
     const r = e.args.slice(1);
     if (I.last(r) instanceof P) {
-      const v = z(r.pop()).getValue();
-      s.pk = !!((a = v.pk) != null && a.length) || !!((l = v["primary key"]) != null && l.length), s.increment = !!((p = v.increment) != null && p.length), s.unique = !!((h = v.unique) != null && h.length), s.not_null = !!((T = v["not null"]) != null && T.length) && !0, s.dbdefault = jn((N = (f = v.default) == null ? void 0 : f.at(0)) == null ? void 0 : N.value);
-      const Ne = (g = v.note) == null ? void 0 : g.at(0);
-      s.note = Ne && {
-        value: Y(Ne.value).unwrap(),
-        token: x(Ne)
+      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 = Yn((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).unwrap(),
+        token: x(K)
       };
-      const me = v.ref || [];
-      s.inline_refs = me.flatMap((j) => {
-        const [tt] = Ce(j.value.expression);
-        if (St(tt, e.symbol))
-          return n.push(new u(o.SAME_ENDPOINT, "Two endpoints are the same", j)), [];
-        const ve = j.value.op, Z = W(j.value.expression).unwrap();
-        let he;
-        if (Z.length === 1) {
-          const [ae] = Z;
-          he = {
+      const be = _.ref || [];
+      s.inline_refs = be.flatMap((z) => {
+        const [tt] = Ce(z.value.expression);
+        if (Rt(tt, e.symbol))
+          return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
+        const we = z.value.op, ee = C(z.value.expression).unwrap();
+        let fe;
+        if (ee.length === 1) {
+          const [oe] = ee;
+          fe = {
             schemaName: this.table.schemaName,
             tableName: this.table.name,
-            fieldNames: [ae],
-            relation: ve.value,
-            token: x(j)
+            fieldNames: [oe],
+            relation: we.value,
+            token: x(z)
           };
-        } else if (Z.length === 2) {
-          const [ae, Te] = Z;
-          he = {
+        } else if (ee.length === 2) {
+          const [oe, Ie] = ee;
+          fe = {
             schemaName: null,
-            tableName: ae,
-            fieldNames: [Te],
-            relation: ve.value,
-            token: x(j)
+            tableName: oe,
+            fieldNames: [Ie],
+            relation: we.value,
+            token: x(z)
           };
-        } else if (Z.length === 3) {
-          const [ae, Te, st] = Z;
-          he = {
-            schemaName: ae,
-            tableName: Te,
+        } else if (ee.length === 3) {
+          const [oe, Ie, st] = ee;
+          fe = {
+            schemaName: oe,
+            tableName: Ie,
             fieldNames: [st],
-            relation: ve.value,
-            token: x(j)
+            relation: we.value,
+            token: x(z)
           };
         } else {
-          n.push(new u(o.UNSUPPORTED, "Nested schema is not supported", j));
-          const ae = Z.pop(), Te = Z.pop();
-          he = {
-            schemaName: Z.join("."),
-            tableName: Te,
-            fieldNames: [ae],
-            relation: ve.value,
-            token: x(j)
+          n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", z));
+          const oe = ee.pop(), Ie = ee.pop();
+          fe = {
+            schemaName: ee.join("."),
+            tableName: Ie,
+            fieldNames: [oe],
+            relation: we.value,
+            token: x(z)
           };
         }
-        const nt = this.registerInlineRefToEnv(e, tt, he, j);
-        return n.push(...nt), nt.length === 0 ? he : [];
+        const nt = this.registerInlineRefToEnv(e, tt, fe, z);
+        return n.push(...nt), nt.length === 0 ? fe : [];
       });
     }
-    return s.pk || (s.pk = r.some((v) => G(v).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((v) => G(v).unwrap().toLowerCase() === "unique")), this.table.fields.push(s), s.pk && this.pkColumns.push(s), n;
+    return s.pk || (s.pk = r.some((_) => X(_).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((_) => X(_).unwrap().toLowerCase() === "unique")), this.table.fields.push(s), s.pk && this.pkColumns.push(s), n;
   }
   interpretIndexes(e) {
     return this.table.indexes.push(...e.body.body.map((n) => {
@@ -3072,30 +3083,30 @@ class Rt {
       s.token = x(e);
       const r = [i.callee, ...i.args];
       if (I.last(r) instanceof P) {
-        const g = z(r.pop()).getValue();
-        s.pk = !!((a = g.pk) != null && a.length), s.unique = !!((l = g.unique) != null && l.length), s.name = Y((h = (p = g.name) == null ? void 0 : p.at(0)) == null ? void 0 : h.value).unwrap_or(void 0);
-        const v = (T = g.note) == null ? void 0 : T.at(0);
-        s.note = v && {
-          value: Y(v.value).unwrap(),
-          token: x(v)
-        }, s.type = G((N = (f = g.type) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
+        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 _ = (T = g.note) == null ? void 0 : T.at(0);
+        s.note = _ && {
+          value: Q(_.value).unwrap(),
+          token: x(_)
+        }, 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) => {
-        if (!(g instanceof H))
+        if (!(g instanceof J))
           return g;
-        const v = [];
-        for (; g instanceof H; )
-          v.push(g.argumentList), g = g.callee;
-        return v.push(g), v;
+        const _ = [];
+        for (; g instanceof J; )
+          _.push(g.argumentList), g = g.callee;
+        return _.push(g), _;
       }).forEach((g) => {
-        const { functional: v, nonFunctional: Ne } = Ge(g).unwrap();
+        const { functional: _, nonFunctional: K } = Ge(g).unwrap();
         s.columns.push(
-          ...v.map((me) => ({
-            value: me.value.value,
+          ..._.map((be) => ({
+            value: be.value.value,
             type: "expression"
           })),
-          ...Ne.map((me) => ({
-            value: V(me).unwrap(),
+          ...K.map((be) => ({
+            value: G(be).unwrap(),
             type: "column"
           }))
         );
@@ -3106,8 +3117,8 @@ class Rt {
     const r = Ot(e.symbol, n);
     if (this.env.refIds[r])
       return [
-        new u(o.CIRCULAR_REF, "References with same endpoints exist", i),
-        new u(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", i),
+        new c(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
       ];
     const a = xt(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
@@ -3122,7 +3133,7 @@ class Rt {
         {
           schemaName: this.table.schemaName,
           tableName: this.table.name,
-          fieldNames: [G(e.callee).unwrap()],
+          fieldNames: [X(e.callee).unwrap()],
           token: x(e),
           relation: a[0]
         }
@@ -3130,52 +3141,52 @@ class Rt {
     }), [];
   }
 }
-function Wn(t) {
+function jn(t) {
   let e = null;
-  t instanceof H && (e = t.argumentList.elementList.map((r) => ce(r) ? r.expression.literal.value : $(r) ? Y(r).unwrap() : G(r).unwrap()).join(","), t = t.callee);
+  t instanceof J && (e = t.argumentList.elementList.map((r) => ue(r) ? r.expression.literal.value : Y(r) ? Q(r).unwrap() : X(r).unwrap()).join(","), t = t.callee);
   let n = "";
-  for (; t instanceof le; )
+  for (; t instanceof ce; )
     n = `[${t.indexer.elementList.map((r) => r.name.expression.literal.value).join(",")}]${n}`, t = t.array;
-  const { name: s, schemaName: i } = Ae(t);
-  return i.length > 1 ? new F(
+  const { name: s, schemaName: i } = Te(t);
+  return i.length > 1 ? new B(
     {
       schemaName: i.length === 0 ? null : i[0],
       type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
-    [new u(o.UNSUPPORTED, "Nested schema is not supported", t)]
-  ) : new F({
+    [new c(o.UNSUPPORTED, "Nested schema is not supported", t)]
+  ) : new B({
     schemaName: i.length === 0 ? null : i[0],
     type_name: `${s}${n}${e ? `(${e})` : ""}`,
     args: e
   });
 }
-function jn(t) {
+function Yn(t) {
   var e, n, s;
   if (t) {
-    if ($(t))
+    if (Y(t))
       return {
-        value: Y(t).unwrap(),
+        value: Q(t).unwrap(),
         type: "string"
       };
-    if (ce(t))
+    if (ue(t))
       return {
         type: "number",
         value: Number.parseFloat(t.expression.literal.value)
       };
-    if (de(t))
+    if (Ee(t))
       return {
         value: t.expression.variable.value.toLowerCase(),
         type: "boolean"
       };
-    if (t instanceof Q && vt.includes((e = t.op) == null ? void 0 : e.value) && ce(t.expression)) {
+    if (t instanceof q && vt.includes((e = t.op) == null ? void 0 : e.value) && ue(t.expression)) {
       const i = Number.parseFloat(t.expression.expression.literal.value);
       return {
         value: ((n = t.op) == null ? void 0 : n.value) === "-" ? 0 - i : i,
         type: "number"
       };
     }
-    if (t instanceof ee)
+    if (t instanceof te)
       return {
         value: (s = t.value) == null ? void 0 : s.value,
         type: "expression"
@@ -3183,34 +3194,67 @@ function jn(t) {
     throw new Error("Unreachable");
   }
 }
-class Dt {
+class zn {
   constructor(e, n) {
-    this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof _ ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
+    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), [
+      ...this.interpretName(this.declarationNode.name),
+      ...this.interpretSettingList(this.declarationNode.attributeList),
+      ...this.interpretBody(this.declarationNode.body)
+    ];
+  }
+  interpretName(e) {
+    const { name: n } = Te(e);
+    return this.note.name = n, [];
+  }
+  interpretSettingList(e) {
+    var s, i, r;
+    const n = W(e).getValue();
+    return this.note.headerColor = (s = n.headercolor) != null && s.length ? St((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)
+    ] : [...this.interpretNote(n[0])];
+  }
+  interpretNote(e) {
+    const n = I.get(e, "callee.expression.literal.value", "");
+    return this.note.content = n, [];
+  }
+}
+class Pt {
+  constructor(e, n) {
+    this.declarationNode = e, this.env = n, this.container = this.declarationNode.parent instanceof A ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
   }
   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)];
   }
   interpretName(e) {
-    const n = [], s = W(this.declarationNode.name).unwrap_or([]);
-    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new u(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
+    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;
   }
   interpretBody(e) {
-    return e instanceof k ? this.interpretField(e) : this.interpretField(e.body[0]);
+    return e instanceof w ? this.interpretField(e) : this.interpretField(e.body[0]);
   }
   interpretField(e) {
     var h, T, f, N;
     const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = Ce(s), a = Ce(i);
-    if (St(r, a))
-      return [new u(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
+    if (Rt(r, a))
+      return [new c(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
     const l = Ot(r, a);
     if (this.env.refIds[l])
       return [
-        new u(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
-        new u(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[l])
+        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])
       ];
     if (e.args[0]) {
-      const g = z(e.args[0]).getValue();
-      this.ref.onDelete = G((T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value).unwrap_or(void 0), this.ref.onUpdate = G((N = (f = g.update) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
+      const g = W(e.args[0]).getValue(), _ = (T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value;
+      this.ref.onDelete = _ instanceof $ ? Ne(_).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 $ ? Ne(K).unwrap_or(void 0) : X(K).unwrap_or(void 0);
     }
     const p = xt(n);
     return this.ref.endpoints = [
@@ -3227,7 +3271,7 @@ class Dt {
     ], this.env.refIds[l] = this.declarationNode, [];
   }
 }
-class Pt {
+class Ut {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.tableGroup = { tables: [] };
   }
@@ -3239,18 +3283,18 @@ class Pt {
     ), e;
   }
   interpretName(e) {
-    const n = [], { name: s, schemaName: i } = Ae(e);
-    return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new u(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
+    const n = [], { name: s, schemaName: i } = Te(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;
   }
   interpretBody(e) {
     const n = [];
     return this.tableGroup.tables = this.declarationNode.body.body.map((s) => {
-      const i = W(s.callee).unwrap();
-      i.length > 2 && n.push(new u(o.UNSUPPORTED, "Nested schema is not supported", s));
-      const r = ue(s.callee).unwrap().pop().referee.id;
+      const i = C(s.callee).unwrap();
+      i.length > 2 && n.push(new c(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 u(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${h}"`, s));
+        n.push(new c(o.TABLE_REAPPEAR_IN_TABLEGROUP, `Table "${i.join(".")}" already appears in group "${h}"`, s));
       } else
         this.env.groupOfTable[r] = this.declarationNode;
       return {
@@ -3260,7 +3304,7 @@ class Pt {
     }), n;
   }
 }
-class Ut {
+class Mt {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.enum = { values: [] };
   }
@@ -3268,23 +3312,23 @@ class Ut {
     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)];
   }
   interpretName(e) {
-    const { name: n, schemaName: s } = Ae(e);
-    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new u(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
+    const { name: n, schemaName: s } = Te(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, []);
   }
   interpretBody(e) {
     return e.body.flatMap((n) => {
       var l;
       const s = n, i = {};
-      i.token = x(s), i.name = G(s.callee).unwrap();
-      const a = (l = z(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
+      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);
       return i.note = a && {
-        value: Y(a.value).unwrap(),
+        value: Q(a.value).unwrap(),
         token: x(a)
       }, this.enum.values.push(i), [];
     });
   }
 }
-class Yn {
+class Qn {
   constructor(e, n) {
     this.declarationNode = e, this.env = n, this.project = { enums: [], refs: [], tableGroups: [], tables: [] };
   }
@@ -3294,7 +3338,7 @@ class Yn {
   interpretName(e) {
     if (!e)
       return this.project.name = null, [];
-    const { name: n } = Ae(e);
+    const { name: n } = Te(e);
     return this.project.name = n, [];
   }
   interpretBody(e) {
@@ -3303,37 +3347,38 @@ class Yn {
       const s = n;
       switch ((i = s.type) == null ? void 0 : i.value.toLowerCase()) {
         case "table": {
-          const r = new Rt(s, this.env).interpret();
+          const r = new Dt(s, this.env).interpret();
           return this.project.tables.push(this.env.tables.get(s)), r;
         }
         case "ref": {
-          const r = new Dt(s, this.env).interpret();
+          const r = new Pt(s, this.env).interpret();
           return this.project.refs.push(this.env.ref.get(s)), r;
         }
         case "tablegroup": {
-          const r = new Pt(s, this.env).interpret();
+          const r = new Ut(s, this.env).interpret();
           return this.project.tableGroups.push(this.env.tableGroups.get(s)), r;
         }
         case "enum": {
-          const r = new Ut(s, this.env).interpret();
+          const r = new Mt(s, this.env).interpret();
           return this.project.enums.push(this.env.enums.get(s)), r;
         }
         case "note":
           return this.project.note = {
-            value: Y(s.body instanceof te ? s.body.body[0].callee : s.body.callee).unwrap(),
+            value: Q(s.body instanceof ne ? s.body.body[0].callee : s.body.callee).unwrap(),
             token: x(s)
           }, [];
         default:
-          return this.project[s.type.value.toLowerCase()] = Y(s.body.callee).unwrap(), [];
+          return this.project[s.type.value.toLowerCase()] = Q(s.body.callee).unwrap(), [];
       }
     });
   }
 }
-class zn {
+class qn {
   constructor(e) {
     this.ast = e, this.env = {
       schema: [],
       tables: /* @__PURE__ */ new Map(),
+      notes: /* @__PURE__ */ new Map(),
       refIds: {},
       ref: /* @__PURE__ */ new Map(),
       enums: /* @__PURE__ */ new Map(),
@@ -3345,28 +3390,31 @@ class zn {
   }
   interpret() {
     const e = this.ast.body.flatMap((n) => {
-      switch (ge(n).unwrap_or(void 0)) {
+      switch (Ae(n).unwrap_or(void 0)) {
         case b.Table:
-          return new Rt(n, this.env).interpret();
-        case b.Ref:
           return new Dt(n, this.env).interpret();
-        case b.TableGroup:
+        case b.Note:
+          return new zn(n, this.env).interpret();
+        case b.Ref:
           return new Pt(n, this.env).interpret();
-        case b.Enum:
+        case b.TableGroup:
           return new Ut(n, this.env).interpret();
+        case b.Enum:
+          return new Mt(n, this.env).interpret();
         case b.Project:
-          return new Yn(n, this.env).interpret();
+          return new Qn(n, this.env).interpret();
         default:
           return [];
       }
     });
-    return new F(Qn(this.env), e);
+    return new B(Hn(this.env), e);
   }
 }
-function Qn(t) {
+function Hn(t) {
   return {
     schemas: [],
     tables: Array.from(t.tables.values()),
+    notes: Array.from(t.notes.values()),
     refs: Array.from(t.ref.values()),
     enums: Array.from(t.enums.values()),
     tableGroups: Array.from(t.tableGroups.values()),
@@ -3374,8 +3422,8 @@ function Qn(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 || {}), w = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(w || {});
-function Le(t) {
+var L = /* @__PURE__ */ ((t) => (t[t.Function = 1] = "Function", t[t.Constructor = 2] = "Constructor", t[t.Field = 3] = "Field", t[t.Variable = 4] = "Variable", t[t.Class = 5] = "Class", t[t.Struct = 6] = "Struct", t[t.Interface = 7] = "Interface", t[t.Module = 8] = "Module", t[t.Property = 9] = "Property", t[t.Event = 10] = "Event", t[t.Operator = 11] = "Operator", t[t.Unit = 12] = "Unit", t[t.Value = 13] = "Value", t[t.Constant = 14] = "Constant", t[t.Enum = 15] = "Enum", t[t.EnumMember = 16] = "EnumMember", t[t.Keyword = 17] = "Keyword", t[t.Text = 18] = "Text", t[t.Color = 19] = "Color", t[t.File = 20] = "File", t[t.Reference = 21] = "Reference", t[t.Customcolor = 22] = "Customcolor", t[t.Folder = 23] = "Folder", t[t.TypeParameter = 24] = "TypeParameter", t[t.User = 25] = "User", t[t.Issue = 26] = "Issue", t[t.Snippet = 27] = "Snippet", t))(L || {}), y = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(y || {});
+function _e(t) {
   switch (t) {
     case m.Schema:
       return L.Module;
@@ -3401,17 +3449,17 @@ function Oe(t, e) {
   for (const n of t.trailingTrivia) {
     if (n.start > e)
       break;
-    if (n.kind === c.NEWLINE && n.end <= e)
+    if (n.kind === u.NEWLINE && n.end <= e)
       return !1;
   }
   return !0;
 }
-function S() {
+function O() {
   return {
     suggestions: []
   };
 }
-function Se(t) {
+function Re(t) {
   return {
     ...t,
     suggestions: t.suggestions.map((e) => ({
@@ -3432,7 +3480,7 @@ function Ue(t) {
 function Ke(t, e) {
   return t.getOffsetAt(e);
 }
-class Mt {
+class Ft {
   constructor(e, n = []) {
     this.compiler = e, this.triggerCharacters = n;
   }
@@ -3443,18 +3491,18 @@ class Mt {
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
       ...(l == null ? void 0 : l.leadingTrivia) || []
-    ].find((N) => $t(N) && be(s, N)))
-      return S();
+    ].find((N) => Wt(N) && Le(s, N)))
+      return O();
     if (a === void 0)
       return mt();
-    if ([c.STRING_LITERAL, c.QUOTED_STRING].includes(r.kind) && be(s, r))
-      return S();
+    if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && Le(s, r))
+      return O();
     const p = this.compiler.container.element(s);
-    if (this.compiler.container.scopeKind(s) === R.TOPLEVEL || p instanceof _ && p.type && p.type.start <= s && p.type.end >= s)
+    if (this.compiler.container.scopeKind(s) === R.TOPLEVEL || p instanceof A && p.type && p.type.start <= s && p.type.end >= s)
       return mt();
     const h = [...this.compiler.container.stack(s)].reverse();
     for (const N of h)
-      if (N instanceof Q)
+      if (N instanceof q)
         switch ((T = N.op) == null ? void 0 : T.value) {
           case ">":
           case "<":
@@ -3466,7 +3514,7 @@ class Mt {
               N
             );
         }
-      else if (N instanceof q)
+      else if (N instanceof H)
         switch ((f = N.op) == null ? void 0 : f.value) {
           case ">":
           case "<":
@@ -3478,25 +3526,25 @@ class Mt {
               N
             );
           case ".":
-            return Ft(
+            return Bt(
               this.compiler,
               s,
               N
             );
         }
       else {
-        if (N instanceof ne)
+        if (N instanceof se)
           return dt(this.compiler, s, N);
         if (N instanceof P)
           return dt(this.compiler, s, N);
-        if (N instanceof J)
-          return qn(this.compiler, s);
-        if (N instanceof k)
+        if (N instanceof Z)
+          return Jn(this.compiler, s);
+        if (N instanceof w)
           return Nt(this.compiler, s, N);
-        if (N instanceof _ && (N.bodyColon && s >= N.bodyColon.end || N.body && be(s, N.body)))
+        if (N instanceof A && (N.bodyColon && s >= N.bodyColon.end || N.body && Le(s, N.body)))
           return Nt(this.compiler, s, void 0);
       }
-    return S();
+    return O();
   }
 }
 function pt(t, e, n) {
@@ -3507,14 +3555,14 @@ function pt(t, e, n) {
       m.Schema,
       m.Column
     ]);
-    return Oe(n.op, e) ? Se(i) : i;
+    return Oe(n.op, e) ? Re(i) : i;
   }
-  return S();
+  return O();
 }
 function Me(t, e, n, s) {
   var a;
   if (n === void 0)
-    return S();
+    return O();
   let i = n;
   const r = { suggestions: [] };
   for (; i; ) {
@@ -3524,62 +3572,62 @@ function Me(t, e, n, s) {
         ...t.symbol.members(l).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: h }) => ({
           label: p,
           insertText: p,
-          insertTextRules: w.KeepWhitespace,
-          kind: Le(h),
-          sortText: Le(h).toString().padStart(2, "0"),
+          insertTextRules: y.KeepWhitespace,
+          kind: _e(h),
+          sortText: _e(h).toString().padStart(2, "0"),
           range: void 0
         }))
       );
     }
-    i = i instanceof _ ? i.parent : void 0;
+    i = i instanceof A ? i.parent : void 0;
   }
   return Ue(r);
 }
-function qn(t, e) {
+function Jn(t, e) {
   var s;
   switch (t.container.scopeKind(e)) {
     case R.INDEXES:
-      return Vt(t, e);
+      return Gt(t, e);
     case R.REF:
       {
         const i = [...t.container.stack(e)];
         for (; i.length > 0; ) {
           const r = i.pop();
-          if (r instanceof q && ((s = r.op) == null ? void 0 : s.value) === ".")
-            return Ft(
+          if (r instanceof H && ((s = r.op) == null ? void 0 : s.value) === ".")
+            return Bt(
               t,
               e,
               r
             );
         }
       }
-      return Bt(t, e);
+      return Vt(t, e);
   }
-  return S();
+  return O();
 }
 function dt(t, e, n) {
   const { token: s } = t.container.token(e);
-  if ([c.COMMA, c.LBRACKET].includes(s == null ? void 0 : s.kind)) {
+  if ([u.COMMA, u.LBRACKET].includes(s == null ? void 0 : s.kind)) {
     const i = Et(t, e);
-    return (s == null ? void 0 : s.kind) === c.COMMA && Oe(s, e) ? Se(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COMMA && Oe(s, e) ? Re(i) : i;
   }
   if (n.name && n.name.start <= e && n.name.end >= e)
     return Et(t, e);
-  if (n.name instanceof K) {
-    const i = Hn(
+  if (n.name instanceof $) {
+    const i = Zn(
       t,
       e,
-      De(n.name).unwrap()
+      Ne(n.name).unwrap()
     );
-    return (s == null ? void 0 : s.kind) === c.COLON && Oe(s, e) ? Se(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COLON && Oe(s, e) ? Re(i) : i;
   }
-  return S();
+  return O();
 }
 function Et(t, e) {
   const n = t.container.element(e), s = t.container.scopeKind(e);
-  if (n instanceof C)
-    return S();
-  if (n.body && !be(e, n.body))
+  if (n instanceof F)
+    return O();
+  if (n.body && !Le(e, n.body))
     switch (s) {
       case R.TABLE:
         return {
@@ -3588,20 +3636,20 @@ function Et(t, e) {
               label: "headercolor",
               insertText: "headercolor: ",
               kind: L.Field,
-              insertTextRules: w.KeepWhitespace,
+              insertTextRules: y.KeepWhitespace,
               range: void 0
             },
             {
               label: "note",
               insertText: "note: ",
               kind: L.Field,
-              insertTextRules: w.KeepWhitespace,
+              insertTextRules: y.KeepWhitespace,
               range: void 0
             }
           ]
         };
       default:
-        return S();
+        return O();
     }
   switch (s) {
     case R.TABLE:
@@ -3611,21 +3659,21 @@ function Et(t, e) {
             label: i,
             insertText: i,
             kind: L.Property,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           })),
           ...["ref", "default"].map((i) => ({
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           })),
           {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           }
         ]
@@ -3637,7 +3685,7 @@ function Et(t, e) {
             label: "note",
             insertText: "note: ",
             kind: L.Property,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           }
         ]
@@ -3648,7 +3696,7 @@ function Et(t, e) {
           ...["unique", "pk"].map((i) => ({
             label: i,
             insertText: i,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             kind: L.Property,
             range: void 0
           })),
@@ -3656,7 +3704,7 @@ function Et(t, e) {
             label: i,
             insertText: `${i}: `,
             kind: L.Property,
-            insertTextRules: w.KeepWhitespace,
+            insertTextRules: y.KeepWhitespace,
             range: void 0
           }))
         ]
@@ -3667,14 +3715,14 @@ function Et(t, e) {
           label: i,
           insertText: `${i}: `,
           kind: L.Property,
-          insertTextRules: w.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return S();
+  return O();
 }
-function Hn(t, e, n) {
+function Zn(t, e, n) {
   switch (n == null ? void 0 : n.toLowerCase()) {
     case "update":
     case "delete":
@@ -3683,7 +3731,7 @@ function Hn(t, e, n) {
           label: s,
           insertText: s,
           kind: L.Value,
-          insertTextRules: w.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           range: void 0
         }))
       };
@@ -3693,23 +3741,23 @@ function Hn(t, e, n) {
           label: s,
           insertText: `${s}`,
           kind: L.Value,
-          insertTextRules: w.KeepWhitespace,
+          insertTextRules: y.KeepWhitespace,
           range: void 0
         }))
       };
   }
-  return S();
+  return O();
 }
-function Ft(t, e, n) {
-  const s = ue(n).unwrap_or([]);
+function Bt(t, e, n) {
+  const s = he(n).unwrap_or([]);
   if (s.pop(), s.some((r) => !M(r)))
-    return S();
-  const i = s.map((r) => G(r).unwrap());
+    return O();
+  const i = s.map((r) => X(r).unwrap());
   return Ue({
     suggestions: t.symbol.ofName({ nameStack: i, owner: t.container.element(e) }).flatMap(({ symbol: r }) => t.symbol.members(r)).map(({ kind: r, name: a }) => ({
       label: a,
       insertText: a,
-      kind: Le(r),
+      kind: _e(r),
       range: void 0
     }))
   });
@@ -3718,21 +3766,21 @@ function Nt(t, e, n) {
   var i;
   switch (t.container.scopeKind(e)) {
     case R.TABLE:
-      return Zn(t, e, n);
+      return es(t, e, n);
     case R.PROJECT:
-      return Kn(t, e, n);
+      return ts(t, e, n);
     case R.INDEXES:
-      return ts(t, e);
+      return ss(t, e);
     case R.ENUM:
-      return Jn(t, e, n);
+      return Kn(t, e, n);
     case R.REF: {
-      const r = Bt(t, e);
-      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === c.COLON && Oe(t.container.token(e).token, e) ? Se(r) : r;
+      const r = Vt(t, e);
+      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === u.COLON && Oe(t.container.token(e).token, e) ? Re(r) : r;
     }
     case R.TABLEGROUP:
-      return es(t);
+      return ns(t);
     default:
-      return S();
+      return O();
   }
 }
 function mt() {
@@ -3740,26 +3788,26 @@ function mt() {
     suggestions: ["Table", "TableGroup", "Enum", "Project", "Ref"].map((t) => ({
       label: t,
       insertText: t,
-      insertTextRules: w.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
   };
 }
-function Jn(t, e, n) {
+function Kn(t, e, n) {
   return n != null && n.callee && et(e, n) === 1 ? Me(t, e, t.container.element(e), [
     m.Schema,
     m.Table,
     m.Column
-  ]) : S();
+  ]) : O();
 }
-function Zn(t, e, n) {
+function es(t, e, n) {
   if (!(n != null && n.callee))
     return {
       suggestions: ["Note", "indexes"].map((i) => ({
         label: i,
         insertText: i,
-        insertTextRules: w.KeepWhitespace,
+        insertTextRules: y.KeepWhitespace,
         kind: L.Keyword,
         range: void 0
       }))
@@ -3769,59 +3817,59 @@ function Zn(t, e, n) {
     suggestions: ["Note", "indexes"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: w.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : s === 1 ? ns(t, e) : S();
+  } : s === 1 ? is(t, e) : O();
 }
-function Kn(t, e, n) {
+function ts(t, e, n) {
   return n != null && n.callee ? et(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: w.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
-  } : S() : {
+  } : O() : {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
-      insertTextRules: w.KeepWhitespace,
+      insertTextRules: y.KeepWhitespace,
       kind: L.Keyword,
       range: void 0
     }))
   };
 }
-function Bt(t, e) {
+function Vt(t, e) {
   return Me(t, e, t.container.element(e), [
     m.Schema,
     m.Table,
     m.Column
   ]);
 }
-function es(t) {
+function ns(t) {
   return Ue({
     suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
-      const n = se(e).unwrap_or(void 0);
+      const n = ie(e).unwrap_or(void 0);
       if (n === void 0)
         return [];
       const { kind: s, name: i } = n;
       return s !== m.Table && s !== m.Schema ? [] : {
         label: i,
         insertText: i,
-        insertTextRules: w.KeepWhitespace,
-        kind: Le(s),
+        insertTextRules: y.KeepWhitespace,
+        kind: _e(s),
         range: void 0
       };
     })
   });
 }
-function ts(t, e) {
-  return Vt(t, e);
+function ss(t, e) {
+  return Gt(t, e);
 }
-function ns(t, e) {
+function is(t, e) {
   return {
     suggestions: [
       ...[
@@ -3884,7 +3932,7 @@ function ns(t, e) {
       ].map((n) => ({
         label: n,
         insertText: n,
-        insertTextRules: w.KeepWhitespace,
+        insertTextRules: y.KeepWhitespace,
         kind: L.TypeParameter,
         sortText: L.TypeParameter.toString().padStart(2, "0"),
         range: void 0
@@ -3896,22 +3944,22 @@ function ns(t, e) {
     ]
   };
 }
-function Vt(t, e) {
+function Gt(t, e) {
   const n = t.container.element(e), s = n == null ? void 0 : n.parent;
   if (!((s == null ? void 0 : s.symbol) instanceof _t))
-    return S();
+    return O();
   const { symbolTable: i } = s.symbol;
   return Ue({
     suggestions: [...i.entries()].flatMap(([r]) => {
-      const a = se(r).unwrap_or(void 0);
+      const a = ie(r).unwrap_or(void 0);
       if (a === void 0)
         return [];
       const { name: l } = a;
       return {
         label: l,
         insertText: l,
-        insertTextRules: w.KeepWhitespace,
-        kind: Le(m.Column),
+        insertTextRules: y.KeepWhitespace,
+        kind: _e(m.Column),
         range: void 0
       };
     })
@@ -3923,7 +3971,7 @@ function et(t, e) {
   const n = [e.callee, ...e.args], s = n.findIndex((i) => t <= i.end);
   return s === -1 ? n.length : s;
 }
-class Gt {
+class Ct {
   constructor(e) {
     this.compiler = e;
   }
@@ -3932,7 +3980,7 @@ class Gt {
     const { uri: s } = e, i = Ke(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 && [pe.PRIMARY_EXPRESSION, pe.VARIABLE].includes(l == null ? void 0 : l.kind)) {
+      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;
         return [
           {
@@ -3950,7 +3998,7 @@ class Gt {
     return [];
   }
 }
-class Ct {
+class Xt {
   constructor(e) {
     this.compiler = e;
   }
@@ -3959,9 +4007,9 @@ class Ct {
     for (; r.length !== 0; ) {
       const a = r.pop();
       if (a && [
-        pe.ELEMENT_DECLARATION,
-        pe.FUNCTION_APPLICATION,
-        pe.PRIMARY_EXPRESSION
+        de.ELEMENT_DECLARATION,
+        de.FUNCTION_APPLICATION,
+        de.PRIMARY_EXPRESSION
       ].includes(a == null ? void 0 : a.kind)) {
         const { symbol: l } = a;
         if (l != null && l.references.length)
@@ -3979,21 +4027,21 @@ class Ct {
     return [];
   }
 }
-const rs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  CompletionItemInsertTextRule: w,
+  CompletionItemInsertTextRule: y,
   CompletionItemKind: L,
-  DBMLCompletionItemProvider: Mt,
-  DBMLDefinitionProvider: Gt,
-  DBMLReferencesProvider: Ct
+  DBMLCompletionItemProvider: Ft,
+  DBMLDefinitionProvider: Ct,
+  DBMLReferencesProvider: Xt
 }, Symbol.toStringTag, { value: "Module" }));
 var R = /* @__PURE__ */ ((t) => (t[t.TABLE = 0] = "TABLE", t[t.ENUM = 1] = "ENUM", t[t.TABLEGROUP = 2] = "TABLEGROUP", t[t.INDEXES = 3] = "INDEXES", t[t.NOTE = 4] = "NOTE", t[t.REF = 5] = "REF", t[t.PROJECT = 6] = "PROJECT", t[t.CUSTOM = 7] = "CUSTOM", t[t.TOPLEVEL = 8] = "TOPLEVEL", t))(R || {});
-class as {
+class ls {
   constructor() {
     this.source = "", this.cache = new Array(
       16
       /* TOTAL_QUERY_COUNT */
-    ).fill(null), this.nodeIdGenerator = new Wt(), this.symbolIdGenerator = new Qt(), this.token = {
+    ).fill(null), this.nodeIdGenerator = new jt(), this.symbolIdGenerator = new Ht(), this.token = {
       invalidStream: this.createQuery(
         6,
         () => this.parse.tokens().filter(At)
@@ -4008,8 +4056,8 @@ class as {
       _: this.createQuery(
         0,
         () => {
-          const e = new rn(this.source).lex().chain((n) => new ln(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new Xn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
-          return e.getErrors().length > 0 ? e : e.chain(({ ast: n, tokens: s }) => new zn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
+          const e = new on(this.source).lex().chain((n) => new un(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 qn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
         }
       ),
       ast: this.createQuery(
@@ -4046,26 +4094,26 @@ class as {
           let a = this.parse.ast();
           const l = [a];
           for (; ; ) {
-            const h = sn(a).find((T) => be(r, T));
-            if (h === void 0 || h instanceof B)
+            const h = an(a).find((T) => Le(r, T));
+            if (h === void 0 || h instanceof V)
               break;
             l.push(h), a = h;
           }
-          if ((i == null ? void 0 : i.kind) === c.COLON)
+          if ((i == null ? void 0 : i.kind) === u.COLON)
             return l;
           for (; l.length > 0; ) {
             let p = !1;
             const h = I.last(l);
-            if (h instanceof k) {
+            if (h instanceof w) {
               const T = this.parse.source();
               for (let f = h.end; f < e; f += 1)
                 T[f] === `
 ` && (l.pop(), p = !0);
             } else
-              h instanceof Q || h instanceof q ? 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 J ? h.tupleCloseParen && h.end <= e && (l.pop(), p = !0) : h instanceof te ? h.blockCloseBrace && h.end <= e && (l.pop(), p = !0) : h instanceof K || h.end < e && (l.pop(), p = !0);
+              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);
             if (p) {
               const T = I.last(l);
-              T instanceof _ && T.end <= e && l.pop();
+              T instanceof A && T.end <= e && l.pop();
             }
             if (!p)
               break;
@@ -4088,7 +4136,7 @@ class as {
         (e) => {
           const n = this.container.stack(e);
           for (let s = n.length - 1; s >= 0; s -= 1)
-            if (n[s] instanceof _)
+            if (n[s] instanceof A)
               return n[s];
           return this.parse.ast();
         }
@@ -4102,7 +4150,7 @@ class as {
       ),
       scopeKind: this.createQuery(15, (e) => {
         var s;
-        if (this.container.element(e) instanceof C)
+        if (this.container.element(e) instanceof F)
           return 8;
         switch ((s = this.container.element(e).type) == null ? void 0 : s.value.toLowerCase()) {
           case "table":
@@ -4138,15 +4186,15 @@ class as {
           if (e.length === 0)
             return [];
           const s = [];
-          for (let r = n; r; r = r instanceof _ ? r.parent : void 0) {
+          for (let r = n; r; r = r instanceof A ? r.parent : void 0) {
             if (!((i = r.symbol) != null && i.symbolTable))
               continue;
             const { symbolTable: a } = r.symbol;
             let l = [a], p = [];
             for (const h of e)
               p = l.flatMap(
-                (T) => Yt(h).flatMap((f) => {
-                  const N = T.get(f), g = se(f).unwrap_or(void 0);
+                (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(
@@ -4161,7 +4209,7 @@ class as {
       members: this.createQuery(
         9,
         (e) => e.symbolTable ? [...e.symbolTable.entries()].map(([n, s]) => ({
-          ...se(n).unwrap(),
+          ...ie(n).unwrap(),
           symbol: s
         })) : []
       )
@@ -4188,14 +4236,14 @@ class as {
   }
   initMonacoServices() {
     return {
-      definitionProvider: new Gt(this),
-      referenceProvider: new Ct(this),
-      autocompletionProvider: new Mt(this)
+      definitionProvider: new Ct(this),
+      referenceProvider: new Xt(this),
+      autocompletionProvider: new Ft(this)
     };
   }
 }
 export {
-  as as Compiler,
-  is as serialize,
-  rs as services
+  ls as Compiler,
+  as as serialize,
+  os as services
 };