@dbml/parse 3.1.2 → 3.1.3-alpha.0

package/dist/dbml-parse.mjs

@@ -1,6 +1,6 @@
 import L 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 rt(t) {
 function at(t) {
   return t !== void 0 && t.kind === "<op>";
 }
-class V {
-  constructor(e, s, n, i, r) {
-    this.kind = e, this.startPos = s, this.endPos = n, this.value = i, this.leadingTrivia = [], this.trailingTrivia = [], this.leadingInvalid = [], this.trailingInvalid = [], this.isInvalid = r, this.start = s.offset, this.end = n.offset;
+class G {
+  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, s, n, i, r) {
-    return new V(e, s, n, i, r);
+  static create(e, n, s, i, r) {
+    return new G(e, n, s, i, r);
   }
 }
 function bt(t) {
-  return t.trailingTrivia.find(({ kind: e }) => e === c.NEWLINE) !== void 0;
+  return t.trailingTrivia.find(({ kind: e }) => e === u.NEWLINE) !== void 0;
 }
 function ot(t, e) {
-  return e.leadingTrivia.find(({ kind: n }) => n === c.NEWLINE) !== void 0 || bt(t);
+  return e.leadingTrivia.find(({ kind: s }) => s === u.NEWLINE) !== void 0 || bt(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 It(t) {
   return t.trailingTrivia.length === 0 ? t.end : It(L.last(t.trailingTrivia));
@@ -59,12 +59,12 @@ function It(t) {
 function Lt(t) {
   return t.leadingTrivia.length === 0 ? t.start : Lt(t.leadingTrivia[0]);
 }
-function $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,19 +75,19 @@ class Wt {
     return this.id++;
   }
 }
-class v {
+class y {
   // The symbol that this syntax node refers to
   // args must be passed in order of appearance in the node
-  constructor(e, s, n) {
-    this.id = e, this.kind = s;
-    const i = n.find((a) => a !== void 0 && !Number.isNaN(a.start));
-    i ? (this.startPos = i.startPos, this.fullStart = i instanceof V ? Lt(i) : i.fullStart) : (this.startPos = {
+  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 G ? Lt(i) : i.fullStart) : (this.startPos = {
       offset: NaN,
       column: NaN,
       line: NaN
     }, this.fullStart = NaN);
-    const r = [...n].reverse().find((a) => a !== void 0 && !Number.isNaN(a.end));
-    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof V ? It(r) : r.fullEnd) : (this.endPos = {
+    const r = [...s].reverse().find((a) => a !== void 0 && !Number.isNaN(a.end));
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof G ? It(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
@@ -95,163 +95,163 @@ class v {
   }
 }
 var he = /* @__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))(he || {});
-class X extends v {
-  constructor({ body: e = [], eof: s }, n) {
-    super(n, "<program>", [...e, s]), this.body = e, this.eof = s;
+class B extends y {
+  constructor({ body: e = [], eof: n }, s) {
+    super(s, "<program>", [...e, n]), this.body = e, this.eof = n;
   }
 }
-class _ extends v {
+class _ extends y {
   constructor({
     type: e,
-    name: s,
-    as: n,
+    name: n,
+    as: s,
     alias: i,
     attributeList: r,
     bodyColon: a,
-    body: l
+    body: c
   }, p) {
     if (super(p, "<element-declaration>", [
       e,
-      s,
       n,
+      s,
       i,
       r,
       a,
-      l
-    ]), l && a && !(l instanceof y || l instanceof _))
+      c
+    ]), c && a && !(c instanceof v || c instanceof _))
       throw new Error("If an element has a simple body, it must be a function application node");
-    this.type = e, this.name = s, this.as = n, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = l;
+    this.type = e, this.name = n, this.as = s, this.alias = i, this.attributeList = r, this.bodyColon = a, this.body = c;
   }
 }
-class te extends v {
-  constructor({ identifiers: e = [] }, s) {
-    super(s, "<identifer-stream>", e || []), this.identifiers = e;
+class te extends y {
+  constructor({ identifiers: e = [] }, n) {
+    super(n, "<identifer-stream>", e || []), this.identifiers = e;
   }
 }
-class ne extends v {
+class ne extends y {
   constructor({
     name: e,
-    colon: s,
-    value: n
+    colon: n,
+    value: s
   }, i) {
-    super(i, "<attribute>", [e, s, n]), this.name = e, this.value = n, this.colon = s;
+    super(i, "<attribute>", [e, n, s]), this.name = e, this.value = s, this.colon = n;
   }
 }
-class Q extends v {
-  constructor({ op: e, expression: s }, n) {
-    super(n, "<prefix-expression>", [e, s]), this.op = e, this.expression = s;
+class Q extends y {
+  constructor({ op: e, expression: n }, s) {
+    super(s, "<prefix-expression>", [e, n]), this.op = e, this.expression = n;
   }
 }
-class q extends v {
+class q extends y {
   constructor({
     op: e,
-    leftExpression: s,
-    rightExpression: n
+    leftExpression: n,
+    rightExpression: s
   }, i) {
-    super(i, "<infix-expression>", [s, e, n]), this.op = e, this.leftExpression = s, this.rightExpression = n;
+    super(i, "<infix-expression>", [n, e, s]), this.op = e, this.leftExpression = n, this.rightExpression = s;
   }
 }
-class Oe extends v {
-  constructor({ op: e, expression: s }, n) {
-    super(n, "<postfix-expression>", [s, e]), this.op = e, this.expression = s;
+class Oe extends y {
+  constructor({ op: e, expression: n }, s) {
+    super(s, "<postfix-expression>", [n, e]), this.op = e, this.expression = n;
   }
 }
-class K extends v {
-  constructor({ value: e }, s) {
-    super(s, "<function-expression>", [e]), this.value = e;
+class K extends y {
+  constructor({ value: e }, n) {
+    super(n, "<function-expression>", [e]), this.value = e;
   }
 }
-class y extends v {
-  constructor({ callee: e, args: s = [] }, n) {
-    super(n, "<function-application>", [e, ...s]), this.callee = e, this.args = s;
+class v extends y {
+  constructor({ callee: e, args: n = [] }, s) {
+    super(s, "<function-application>", [e, ...n]), this.callee = e, this.args = n;
   }
 }
-class ee extends v {
+class ee extends y {
   constructor({
     blockOpenBrace: e,
-    body: s = [],
-    blockCloseBrace: n
+    body: n = [],
+    blockCloseBrace: s
   }, i) {
-    super(i, "<block-expression>", [e, ...s, n]), this.blockOpenBrace = e, this.body = s, this.blockCloseBrace = n;
+    super(i, "<block-expression>", [e, ...n, s]), this.blockOpenBrace = e, this.body = n, this.blockCloseBrace = s;
   }
 }
-class U extends v {
+class U extends y {
   constructor({
     listOpenBracket: e,
-    elementList: s = [],
-    commaList: n = [],
+    elementList: n = [],
+    commaList: s = [],
     listCloseBracket: i
   }, r) {
     super(r, "<list-expression>", [
       e,
-      ...gt(s, n),
+      ...gt(n, s),
       i
-    ]), this.listOpenBracket = e, this.elementList = s, this.commaList = n, this.listCloseBracket = i;
+    ]), this.listOpenBracket = e, this.elementList = n, this.commaList = s, this.listCloseBracket = i;
   }
 }
-class J extends v {
+class J extends y {
   constructor({
     tupleOpenParen: e,
-    elementList: s = [],
-    commaList: n = [],
+    elementList: n = [],
+    commaList: s = [],
     tupleCloseParen: i
   }, r) {
     super(r, "<tuple-expression>", [
       e,
-      ...gt(s, n),
+      ...gt(n, s),
       i
-    ]), this.tupleOpenParen = e, this.elementList = s, this.commaList = n, this.tupleCloseParen = i;
+    ]), this.tupleOpenParen = e, this.elementList = n, this.commaList = s, this.tupleCloseParen = i;
   }
 }
 class Xe extends J {
   constructor({
     groupOpenParen: e,
-    expression: s,
-    groupCloseParen: n
+    expression: n,
+    groupCloseParen: s
   }, i) {
     super(
       {
         tupleOpenParen: e,
-        elementList: s && [s],
+        elementList: n && [n],
         commaList: [],
-        tupleCloseParen: n
+        tupleCloseParen: s
       },
       i
     ), this.kind = "<group-expression>";
   }
 }
-class H extends v {
+class H extends y {
   constructor({
     callee: e,
-    argumentList: s
-  }, n) {
-    super(n, "<call-expression>", [e, s]), this.callee = e, this.argumentList = s;
+    argumentList: n
+  }, s) {
+    super(s, "<call-expression>", [e, n]), this.callee = e, this.argumentList = n;
   }
 }
-class de extends v {
-  constructor({ literal: e }, s) {
-    super(s, "<literal>", [e]), this.literal = e;
+class de extends y {
+  constructor({ literal: e }, n) {
+    super(n, "<literal>", [e]), this.literal = e;
   }
 }
-class $ extends v {
-  constructor({ variable: e }, s) {
-    super(s, "<variable>", [e]), this.variable = e;
+class j extends y {
+  constructor({ variable: e }, n) {
+    super(n, "<variable>", [e]), this.variable = e;
   }
 }
-class D extends v {
-  constructor({ expression: e }, s) {
-    super(s, "<primary-expression>", [e]), this.expression = e;
+class D extends y {
+  constructor({ expression: e }, n) {
+    super(n, "<primary-expression>", [e]), this.expression = e;
   }
 }
-class we extends v {
-  constructor({ pre: e }, s) {
-    const n = V.create(c.SPACE, e.endPos, e.endPos, " ", !1);
-    super(s, "<dummy>", [n]);
+class ve extends y {
+  constructor({ pre: e }, n) {
+    const s = G.create(u.SPACE, e.endPos, e.endPos, " ", !1);
+    super(n, "<dummy>", [s]);
   }
 }
-class fe extends v {
-  constructor({ expression: e, indexer: s }, n) {
-    super(n, "<array>", [e, s]), this.array = e, this.indexer = s;
+class fe extends y {
+  constructor({ expression: e, indexer: n }, s) {
+    super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
 }
 function gt(t, e) {
@@ -259,30 +259,30 @@ function gt(t, e) {
     return e || [];
   if (!e || e.length === 0)
     return t || [];
-  const [s] = t, [n] = e;
-  return (s.start < n.start ? L.flatten(L.zip(t, e)) : L.flatten(L.zip(e, t))).filter(
+  const [n] = t, [s] = e;
+  return (n.start < s.start ? L.flatten(L.zip(t, e)) : L.flatten(L.zip(e, t))).filter(
     (i) => i !== null
   );
 }
-function ss(t, e = !1) {
+function rs(t, e = !1) {
   return JSON.stringify(
     t,
-    function(s, n) {
+    function(n, s) {
       var i;
-      return !(this instanceof X) && s === "symbol" ? n == null ? void 0 : n.id : (
+      return !(this instanceof B) && n === "symbol" ? s == null ? void 0 : s.id : (
         /* this instanceof SyntaxNode && */
-        s === "symbol" ? {
-          symbolTable: n == null ? void 0 : n.symbolTable,
-          id: n == null ? void 0 : n.id,
-          references: n == null ? void 0 : n.references.map((r) => r.id),
-          declaration: (i = n == null ? void 0 : n.declaration) == null ? void 0 : i.id
+        n === "symbol" ? {
+          symbolTable: s == null ? void 0 : s.symbolTable,
+          id: s == null ? void 0 : s.id,
+          references: s == null ? void 0 : s.references.map((r) => r.id),
+          declaration: (i = s == null ? void 0 : s.declaration) == null ? void 0 : i.id
         } : (
           /* this instanceof SyntaxNode && */
-          s === "referee" || /* this instanceof SyntaxNode && */
-          s === "parent" || /* this instanceof NodeSymbol && */
-          s === "declaration" ? n == null ? void 0 : n.id : (
+          n === "referee" || /* this instanceof SyntaxNode && */
+          n === "parent" || /* this instanceof NodeSymbol && */
+          n === "declaration" ? s == null ? void 0 : s.id : (
             /* this instanceof NodeSymbol && */
-            s === "symbolTable" ? Object.fromEntries(n.table) : n
+            n === "symbolTable" ? Object.fromEntries(s.table) : s
           )
         )
       );
@@ -334,7 +334,7 @@ class A {
     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}`;
 }
@@ -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":
@@ -377,20 +380,20 @@ function Fe(t, e) {
   }
 }
 function se(t) {
-  const [e, s] = t.split(":");
+  const [e, n] = t.split(":");
   return Object.values(m).includes(e) ? new k({
-    name: s,
+    name: n,
     kind: e
   }) : new A();
 }
-function jt(t) {
+function zt(t) {
   const e = se(t).unwrap_or(void 0);
   if (!e)
     return !1;
-  const { kind: s, name: n } = e;
-  return s === "Schema" && n === "public";
+  const { kind: n, name: s } = e;
+  return n === "Schema" && s === "public";
 }
-function Yt(t) {
+function Qt(t) {
   return [
     $e,
     ye,
@@ -409,23 +412,23 @@ function xe(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";
 }
-function Te(t) {
+function be(t) {
   return qe(t) || xe(t);
 }
-function lt(t, e) {
-  const s = [], n = Math.min(t.length, e.length);
-  for (let i = 0; i < n; i += 1)
-    s.push(t[i], e[i]);
-  return s.push(...t.slice(n), ...e.slice(n)), s;
+function ct(t, e) {
+  const n = [], s = Math.min(t.length, e.length);
+  for (let i = 0; i < s; i += 1)
+    n.push(t[i], e[i]);
+  return n.push(...t.slice(s), ...e.slice(s)), n;
 }
-function be(t, e) {
+function Ie(t, e) {
   return t >= e.start && t < e.end;
 }
-class Qt {
+class Ht {
   constructor() {
     this.id = 0;
   }
@@ -437,49 +440,49 @@ class Qt {
   }
 }
 class _t {
-  constructor({ symbolTable: e }, s) {
-    this.references = [], this.id = s, this.symbolTable = e;
+  constructor({ symbolTable: e }, n) {
+    this.references = [], this.id = n, this.symbolTable = e;
   }
 }
-class qt {
-  constructor({ symbolTable: e, declaration: s }, n) {
-    this.references = [], this.id = n, this.symbolTable = e, this.declaration = s;
+class Jt {
+  constructor({ symbolTable: e, declaration: n }, s) {
+    this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Ht {
-  constructor({ declaration: e }, s) {
-    this.references = [], this.id = s, this.declaration = e;
+class Zt {
+  constructor({ declaration: e }, n) {
+    this.references = [], this.id = n, this.declaration = e;
   }
 }
 class At {
-  constructor({ symbolTable: e, declaration: s }, n) {
-    this.references = [], this.id = n, this.symbolTable = e, this.declaration = s;
+  constructor({ symbolTable: e, declaration: n }, s) {
+    this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Jt {
-  constructor({ declaration: e }, s) {
-    this.references = [], this.id = s, this.declaration = e;
+class Kt {
+  constructor({ declaration: e }, n) {
+    this.references = [], this.id = n, this.declaration = e;
   }
 }
-class Zt {
-  constructor({ symbolTable: e, declaration: s }, n) {
-    this.references = [], this.id = n, this.symbolTable = e, this.declaration = s;
+class en {
+  constructor({ symbolTable: e, declaration: n }, s) {
+    this.references = [], this.id = s, this.symbolTable = e, this.declaration = n;
   }
 }
-class Kt {
-  constructor({ declaration: e }, s) {
-    this.references = [], this.id = s, this.declaration = e;
+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))(o || {});
-class u extends Error {
-  constructor(e, s, n) {
-    super(s), this.code = e, this.diagnostic = s, this.nodeOrToken = n, this.start = n.start, this.end = n.end, this.name = this.constructor.name, Object.setPrototypeOf(this, u.prototype);
+class l extends Error {
+  constructor(e, n, s) {
+    super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, l.prototype);
   }
 }
-class B {
-  constructor(e, s) {
-    this.value = e, this.errors = s === void 0 ? [] : s;
+class V {
+  constructor(e, n) {
+    this.value = e, this.errors = n === void 0 ? [] : n;
   }
   getValue() {
     return this.value;
@@ -488,54 +491,54 @@ class B {
     return this.errors;
   }
   chain(e) {
-    const s = e(this.value), n = [...this.errors, ...s.errors];
-    return new B(s.value, n);
+    const n = e(this.value), s = [...this.errors, ...n.errors];
+    return new V(n.value, s);
   }
   map(e) {
-    return new B(e(this.value), this.errors);
+    return new V(e(this.value), this.errors);
   }
 }
-function en(t, e, s) {
+function nn(t, e, n) {
   if (!t || !pe(t) || e.length === 0)
     return new A();
-  const n = [...e], i = Be(t).unwrap(), r = n.pop();
+  const s = [...e], i = Be(t).unwrap(), r = s.pop();
   if (!(r instanceof ee))
     return new A();
-  const a = L.last(n) instanceof U ? n.pop() : void 0;
-  return n.length === 3 && Be(n[1]).unwrap().value === "as" ? new k(
-    s.create(_, {
+  const a = L.last(s) instanceof U ? s.pop() : void 0;
+  return s.length === 3 && Be(s[1]).unwrap().value === "as" ? new k(
+    n.create(_, {
       type: i,
-      name: n[0],
-      as: Be(n[1]).unwrap(),
-      alias: n[2],
+      name: s[0],
+      as: Be(s[1]).unwrap(),
+      alias: s[2],
       attributeList: a,
       body: r
     })
-  ) : n.length === 1 ? new k(
-    s.create(_, {
+  ) : s.length === 1 ? new k(
+    n.create(_, {
       type: i,
-      name: n[0],
+      name: s[0],
       attributeList: a,
       body: r
     })
-  ) : n.length === 0 ? new k(
-    s.create(_, {
+  ) : s.length === 0 ? new k(
+    n.create(_, {
       type: i,
       attributeList: a,
       body: r
     })
   ) : new A();
 }
-function ct(t) {
-  return t.kind === c.IDENTIFIER && t.value === "as";
+function lt(t) {
+  return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function E(t) {
-  t && (t instanceof V ? tn(t) : nn(t));
+  t && (t instanceof G ? 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) {
+function rn(t) {
   if (t instanceof _)
     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 te)
@@ -556,27 +559,27 @@ function nn(t) {
     E(t.tupleOpenParen), t.commaList.forEach(E), t.elementList.forEach(E), E(t.tupleCloseParen);
   else if (t instanceof H)
     E(t.callee), E(t.argumentList);
-  else if (t instanceof y)
+  else if (t instanceof v)
     E(t.callee), t.args.forEach(E);
   else if (t instanceof D)
     E(t.expression);
   else if (t instanceof K)
     E(t.value);
-  else if (t instanceof $)
+  else if (t instanceof j)
     E(t.variable);
   else if (t instanceof de)
     E(t.literal);
   else
     throw t instanceof Xe ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
 }
-function wt(t) {
+function vt(t) {
   return !!(t != null && t.isInvalid);
 }
 function P(...t) {
   return t.filter((e) => e !== void 0);
 }
-function sn(t) {
-  if (t instanceof X)
+function an(t) {
+  if (t instanceof B)
     return P(...t.body, t.eof);
   if (t instanceof _)
     return P(
@@ -594,7 +597,7 @@ function sn(t) {
     return t.identifiers;
   if (t instanceof de)
     return t.literal ? [t.literal] : [];
-  if (t instanceof $)
+  if (t instanceof j)
     return P(t.variable);
   if (t instanceof Q)
     return P(t.op, t.expression);
@@ -604,20 +607,20 @@ function sn(t) {
     return P(t.expression, t.op);
   if (t instanceof K)
     return P(t.value);
-  if (t instanceof y)
+  if (t instanceof v)
     return P(t.callee, ...t.args);
   if (t instanceof ee)
     return P(t.blockOpenBrace, ...t.body, t.blockCloseBrace);
   if (t instanceof U)
     return P(
       t.listOpenBracket,
-      ...lt(t.elementList, t.commaList),
+      ...ct(t.elementList, t.commaList),
       t.listCloseBracket
     );
   if (t instanceof J)
     return P(
       t.tupleOpenParen,
-      ...lt(t.elementList, t.commaList),
+      ...ct(t.elementList, t.commaList),
       t.tupleCloseParen
     );
   if (t instanceof H)
@@ -629,28 +632,28 @@ function sn(t) {
 function Be(t) {
   return M(t) ? new k(t.expression.variable) : new A();
 }
-function W(t) {
+function Y(t) {
   var e;
-  return t instanceof D && (t.expression instanceof $ && t.expression.variable instanceof V && t.expression.variable.kind === c.QUOTED_STRING || t.expression instanceof de && ((e = t.expression.literal) == null ? void 0 : e.kind) === c.STRING_LITERAL);
+  return t instanceof D && (t.expression instanceof j && t.expression.variable instanceof G && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof de && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
 }
 function M(t) {
-  return t instanceof D && t.expression instanceof $ && t.expression.variable instanceof V;
+  return t instanceof D && t.expression instanceof j && t.expression.variable instanceof G;
 }
 function pe(t) {
   var e;
-  return t instanceof D && t.expression instanceof $ && ((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 v && t.rightExpression instanceof v && ((e = t.op) == null ? void 0 : e.value) === ".";
+  return t instanceof q && t.leftExpression instanceof y && t.rightExpression instanceof y && ((e = t.op) == null ? void 0 : e.value) === ".";
 }
 function De(t) {
   if (t === void 0)
     return new A();
-  const e = t.identifiers.map((s) => s.value).join(" ");
+  const e = t.identifiers.map((n) => n.value).join(" ");
   return e === "" ? new A() : new k(e);
 }
-class rn {
+class on {
   // list of errors during lexing
   constructor(e) {
     this.start = {
@@ -677,8 +680,8 @@ class rn {
   }
   // Check if the sequence ahead matches `sequence`
   check(e) {
-    for (let s = 0; s < e.length; s += 1)
-      if (e[s] !== this.peek(s))
+    for (let n = 0; n < e.length; n += 1)
+      if (e[n] !== this.peek(n))
         return !1;
     return !0;
   }
@@ -686,63 +689,63 @@ class rn {
   match(e) {
     return this.check(e) ? (e.split("").forEach(() => this.advance()), !0) : !1;
   }
-  addToken(e, s = !1) {
-    this.tokens.push(this.createToken(e, s));
+  addToken(e, n = !1) {
+    this.tokens.push(this.createToken(e, n));
   }
-  createToken(e, s = !1) {
-    return V.create(
+  createToken(e, n = !1) {
+    return G.create(
       e,
       this.start,
       this.current,
       this.text.substring(this.start.offset, this.current.offset),
-      s
+      n
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(V.create(c.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
+    return this.scanTokens(), this.tokens.push(G.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new V(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();
@@ -772,11 +775,11 @@ class rn {
             this.numericLiteral();
             break;
           }
-          this.addToken(c.OP, !0), this.errors.push(
-            new u(
+          this.addToken(u.OP, !0), this.errors.push(
+            new l(
               o.UNKNOWN_SYMBOL,
               `Unexpected token '${e}'`,
-              this.createToken(c.OP, !0)
+              this.createToken(u.OP, !0)
             )
           );
           break;
@@ -785,27 +788,27 @@ class rn {
     }
   }
   gatherTrivia() {
-    let e = !0, s = [], n;
+    let e = !0, n = [], s;
     const i = [];
     for (const r of this.tokens)
-      Xt(r) ? (s.push(r), r.kind === c.NEWLINE && n && (n.trailingTrivia = s, e = !0, n = void 0, s = [])) : (e ? r.leadingTrivia = s : n.trailingTrivia = s, i.push(r), s = [], n = 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() {
     let e;
-    const s = [], n = [];
-    for (e = 0; e < this.tokens.length && wt(this.tokens[e]); e += 1)
-      n.push(this.tokens[e]);
+    const n = [], s = [];
+    for (e = 0; e < this.tokens.length && vt(this.tokens[e]); e += 1)
+      s.push(this.tokens[e]);
     let i = this.tokens[e];
-    for (i.leadingInvalid = [...n, ...i.leadingInvalid]; e < this.tokens.length; e += 1) {
+    for (i.leadingInvalid = [...s, ...i.leadingInvalid]; e < this.tokens.length; e += 1) {
       const r = this.tokens[e];
-      r.isInvalid ? i.trailingInvalid.push(r) : (i = r, s.push(r));
+      r.isInvalid ? i.trailingInvalid.push(r) : (i = r, n.push(r));
     }
-    this.tokens = s;
+    this.tokens = n;
   }
   // Consuming characters until the `stopSequence` is encountered
-  consumeUntil(e, s, {
-    allowNewline: n,
+  consumeUntil(e, n, {
+    allowNewline: s,
     // Whether newline is allowed
     allowEof: i,
     // Whether EOF is allowed
@@ -813,22 +816,22 @@ class rn {
     // Whether to interpret '\' as a backlash
     consumeStopSequence: a = !0
   }) {
-    let l = "";
-    for (; !this.isAtEnd() && (n || !this.check(`
-`)) && !this.check(s); )
-      this.peek() === "\\" && !r ? (this.advance(), l += this.escapedString()) : l += this.advance();
+    let c = "";
+    for (; !this.isAtEnd() && (s || !this.check(`
+`)) && !this.check(n); )
+      this.peek() === "\\" && !r ? (this.advance(), c += this.escapedString()) : c += this.advance();
     if (this.isAtEnd() && !i) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new u(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
+        new l(o.UNEXPECTED_EOF, "EOF reached while parsing", p)
       );
       return;
     }
     if (this.check(`
-`) && !n) {
+`) && !s) {
       const p = this.createToken(e, !0);
       this.tokens.push(p), this.errors.push(
-        new u(
+        new l(
           o.UNEXPECTED_NEWLINE,
           "Invalid newline encountered while parsing",
           p
@@ -836,38 +839,38 @@ class rn {
       );
       return;
     }
-    a && this.match(s), this.tokens.push(V.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(G.create(e, this.start, this.current, c, !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,
@@ -876,47 +879,47 @@ class rn {
     });
   }
   multilineComment() {
-    this.consumeUntil(c.MULTILINE_COMMENT, "*/", {
+    this.consumeUntil(u.MULTILINE_COMMENT, "*/", {
       allowNewline: !0,
       allowEof: !1,
       raw: !0
     });
   }
   identifier() {
-    for (; !this.isAtEnd() && Te(this.peek()); )
+    for (; !this.isAtEnd() && be(this.peek()); )
       this.advance();
-    this.addToken(c.IDENTIFIER);
+    this.addToken(u.IDENTIFIER);
   }
   operator() {
     for (; rt(this.peek()); )
       this.advance();
-    this.addToken(c.OP);
+    this.addToken(u.OP);
   }
   numericLiteral() {
     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)
+      const s = this.check(".");
+      if (e += s ? 1 : 0, e > 1)
         break;
-      if (!n && this.current.offset === this.text.length - 1)
-        return this.advance(), this.addToken(c.NUMERIC_LITERAL);
-      if (!n && !Te(this.peek()))
-        return this.addToken(c.NUMERIC_LITERAL);
-      if (!n && !xe(this.peek()))
+      if (!s && this.current.offset === this.text.length - 1)
+        return this.advance(), this.addToken(u.NUMERIC_LITERAL);
+      if (!s && !be(this.peek()))
+        return this.addToken(u.NUMERIC_LITERAL);
+      if (!s && !xe(this.peek()))
         break;
       this.advance();
     }
-    for (; !this.isAtEnd() && (this.check(".") || Te(this.peek())); )
+    for (; !this.isAtEnd() && (this.check(".") || be(this.peek())); )
       this.advance();
-    const s = this.createToken(c.NUMERIC_LITERAL, !0);
-    this.tokens.push(s), this.errors.push(new u(o.UNKNOWN_TOKEN, "Invalid number", s));
+    const n = this.createToken(u.NUMERIC_LITERAL, !0);
+    this.tokens.push(n), this.errors.push(new l(o.UNKNOWN_TOKEN, "Invalid number", n));
   }
   colorLiteral() {
-    for (; !this.isAtEnd() && Te(this.peek()); )
+    for (; !this.isAtEnd() && be(this.peek()); )
       this.advance();
-    this.addToken(c.COLOR_LITERAL);
+    this.addToken(u.COLOR_LITERAL);
   }
   escapedString() {
     if (this.isAtEnd())
@@ -945,8 +948,8 @@ class rn {
         return "\f";
       case "u": {
         let e = "";
-        for (let s = 0; s <= 3; s += 1) {
-          if (this.isAtEnd() || !Te(this.peek()))
+        for (let n = 0; n <= 3; n += 1) {
+          if (this.isAtEnd() || !be(this.peek()))
             return `\\u${e}`;
           e += this.advance();
         }
@@ -957,8 +960,8 @@ class rn {
     }
   }
 }
-var ve = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(ve || {});
-class an {
+var we = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(we || {});
+class cn {
   constructor() {
     this.stack = [], this.numberOfNestedLParens = 0, this.numberOfNestedLBrackets = 0, this.numberOfNestedLBraces = 0;
   }
@@ -984,22 +987,22 @@ class an {
   // Call the passed in callback
   // with the guarantee that the passed in context will be pushed and popped properly
   // even in cases of exceptions
-  withContextDo(e, s) {
+  withContextDo(e, n) {
     return () => {
       this.push(e);
       try {
-        return s();
+        return n();
       } finally {
         this.pop();
       }
     };
   }
   // Return the type of the handler context currently in the context stack to handle `token`
-  findHandlerContext(e, s) {
+  findHandlerContext(e, n) {
     if (!(this.numberOfNestedLBraces <= 0 && this.numberOfNestedLBrackets <= 0 && this.numberOfNestedLParens <= 0))
-      for (let n = s; n < e.length - 1; n += 1)
-        switch (e[n].kind) {
-          case c.COMMA:
+      for (let s = n; s < e.length - 1; s += 1)
+        switch (e[s].kind) {
+          case u.COMMA:
             if (this.isWithinGroupExpressionContext() || this.isWithinListExpressionContext())
               return [...this.stack].reverse().find(
                 (r) => [
@@ -1009,210 +1012,210 @@ 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 ln {
   constructor(e) {
     this.generator = e;
   }
-  create(e, s) {
-    return new e(s, this.generator.nextId());
+  create(e, n) {
+    return new e(n, this.generator.nextId());
   }
 }
 class d {
-  constructor(e, s, n) {
-    this.token = e, this.partialNode = s, this.handlerContext = n;
+  constructor(e, n, s) {
+    this.token = e, this.partialNode = n, this.handlerContext = s;
   }
 }
-class ln {
-  constructor(e, s) {
-    this.current = 0, this.errors = [], this.contextStack = new an(), this.synchronizeProgram = () => {
-      const n = this.peek();
-      n.kind !== c.EOF ? E(this.advance()) : (E(this.peek()), this.logError(n, o.UNEXPECTED_EOF, "Unexpected EOF"));
+class un {
+  constructor(e, n) {
+    this.current = 0, this.errors = [], this.contextStack = new cn(), this.synchronizeProgram = () => {
+      const s = this.peek();
+      s.kind !== u.EOF ? E(this.advance()) : (E(this.peek()), this.logError(s, o.UNEXPECTED_EOF, "Unexpected EOF"));
     }, this.synchronizeElementDeclarationName = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (ct(n) || this.check(c.COLON, c.LBRACE, c.LBRACKET))
+        const s = this.peek();
+        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
     }, this.synchronizeElementDeclarationAlias = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (this.check(c.COLON, c.LBRACE, c.LBRACKET))
+        const s = this.peek();
+        if (this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
-    }, this.blockExpression = this.contextStack.withContextDo(ve.BlockExpression, () => {
-      const n = { body: [] }, i = () => this.nodeFactory.create(ee, n);
+    }, this.blockExpression = this.contextStack.withContextDo(we.BlockExpression, () => {
+      const s = { body: [] }, i = () => this.nodeFactory.create(ee, s);
       try {
-        this.consume("Expect an opening brace '{'", c.LBRACE), n.blockOpenBrace = this.previous();
+        this.consume("Expect an opening brace '{'", u.LBRACE), s.blockOpenBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
-        if (n.blockOpenBrace = r.partialNode, !this.canHandle(r))
+        if (s.blockOpenBrace = r.partialNode, !this.canHandle(r))
           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 {
-          n.body.push(this.canBeField() ? this.fieldDeclaration() : this.expression());
+          s.body.push(this.canBeField() ? this.fieldDeclaration() : this.expression());
         } catch (r) {
           if (!(r instanceof d))
             throw r;
-          if (n.body.push(r.partialNode), !this.canHandle(r))
+          if (s.body.push(r.partialNode), !this.canHandle(r))
             throw new d(r.token, i(), r.handlerContext);
           this.synchronizeBlock();
         }
       try {
-        this.consume("Expect a closing brace '}'", c.RBRACE), n.blockCloseBrace = this.previous();
+        this.consume("Expect a closing brace '}'", u.RBRACE), s.blockCloseBrace = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
-        if (n.blockCloseBrace = r.partialNode, !this.canHandle(r))
+        if (s.blockCloseBrace = r.partialNode, !this.canHandle(r))
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeBlock();
       }
       return i();
     }), this.synchronizeBlock = () => {
-      if (!this.check(c.RBRACE))
+      if (!this.check(u.RBRACE))
         for (E(this.advance()); !this.isAtEnd(); ) {
-          const n = this.peek();
-          if (this.check(c.RBRACE) || ot(this.previous(), n))
+          const s = this.peek();
+          if (this.check(u.RBRACE) || ot(this.previous(), s))
             break;
-          E(n), this.advance();
+          E(s), this.advance();
         }
-    }, this.tupleExpression = this.contextStack.withContextDo(ve.GroupExpression, () => {
-      const n = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(Xe, {
-        groupOpenParen: n.tupleOpenParen,
-        groupCloseParen: n.tupleCloseParen,
-        expression: n.elementList[0]
-      }), r = () => this.nodeFactory.create(J, n);
+    }, this.tupleExpression = this.contextStack.withContextDo(we.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);
       try {
-        this.consume("Expect an opening parenthesis '('", c.LPAREN), n.tupleOpenParen = this.previous();
+        this.consume("Expect an opening parenthesis '('", u.LPAREN), s.tupleOpenParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
-        if (n.tupleOpenParen = a.partialNode, !this.canHandle(a))
+        if (s.tupleOpenParen = a.partialNode, !this.canHandle(a))
           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 {
-          n.elementList.push(this.normalExpression());
+          s.elementList.push(this.normalExpression());
         } catch (a) {
           if (!(a instanceof d))
             throw a;
-          if (n.elementList.push(a.partialNode), !this.canHandle(a))
+          if (s.elementList.push(a.partialNode), !this.canHandle(a))
             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), n.commaList.push(this.previous()), n.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 v && n.elementList.push(a.partialNode), !this.canHandle(a))
+          if (a.partialNode instanceof y && 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), n.tupleCloseParen = this.previous();
+        this.consume("Expect a closing parenthesis ')'", u.RPAREN), s.tupleCloseParen = this.previous();
       } catch (a) {
         if (!(a instanceof d))
           throw a;
-        if (n.tupleCloseParen = a.partialNode, !this.canHandle(a))
+        if (s.tupleCloseParen = a.partialNode, !this.canHandle(a))
           throw new d(a.token, r(), a.handlerContext);
         this.synchronizeTuple();
       }
-      return n.elementList.length === 1 ? i() : r();
+      return s.elementList.length === 1 ? i() : r();
     }), this.synchronizeTuple = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (this.check(c.RPAREN, c.COMMA))
+        const s = this.peek();
+        if (this.check(u.RPAREN, u.COMMA))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
-    }, this.listExpression = this.contextStack.withContextDo(ve.ListExpression, () => {
-      const n = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(U, n);
+    }, this.listExpression = this.contextStack.withContextDo(we.ListExpression, () => {
+      const s = { elementList: [], commaList: [] }, i = () => this.nodeFactory.create(U, s);
       try {
-        this.consume("Expect an opening bracket '['", c.LBRACKET), n.listOpenBracket = this.previous();
+        this.consume("Expect an opening bracket '['", u.LBRACKET), s.listOpenBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
-        if (n.listOpenBracket = r.partialNode, !this.canHandle(r))
+        if (s.listOpenBracket = r.partialNode, !this.canHandle(r))
           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 {
-          n.elementList.push(this.attribute());
+          s.elementList.push(this.attribute());
         } catch (r) {
           if (!(r instanceof d))
             throw r;
-          if (n.elementList.push(r.partialNode), !this.canHandle(r))
+          if (s.elementList.push(r.partialNode), !this.canHandle(r))
             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), n.commaList.push(this.previous()), n.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 v && n.elementList.push(r.partialNode), !this.canHandle(r))
+          if (r.partialNode instanceof y && 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), n.listCloseBracket = this.previous();
+        this.consume("Expect a closing bracket ']'", u.RBRACKET), s.listCloseBracket = this.previous();
       } catch (r) {
         if (!(r instanceof d))
           throw r;
-        if (n.listCloseBracket = r.partialNode, !this.canHandle(r))
+        if (s.listCloseBracket = r.partialNode, !this.canHandle(r))
           throw new d(r.token, i(), r.handlerContext);
         this.synchronizeList();
       }
       return i();
     }), this.synchronizeList = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET))
+        const s = this.peek();
+        if (this.check(u.COMMA, u.RBRACKET))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
     }, this.synchronizeAttributeName = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET, c.COLON))
+        const s = this.peek();
+        if (this.check(u.COMMA, u.RBRACKET, u.COLON))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
     }, this.synchronizeAttributeValue = () => {
       for (; !this.isAtEnd(); ) {
-        const n = this.peek();
-        if (this.check(c.COMMA, c.RBRACKET))
+        const s = this.peek();
+        if (this.check(u.COMMA, u.RBRACKET))
           break;
-        E(n), this.advance();
+        E(s), this.advance();
       }
-    }, this.tokens = e, this.nodeFactory = new on(s);
+    }, this.tokens = e, this.nodeFactory = new ln(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() ? L.last(this.tokens) : this.tokens[this.current++];
@@ -1221,12 +1224,12 @@ class ln {
     return e + this.current >= this.tokens.length ? L.last(this.tokens) : this.tokens[this.current + e];
   }
   match(...e) {
-    const s = this.check(...e);
-    return s && this.advance(), s;
+    const n = this.check(...e);
+    return n && this.advance(), n;
   }
   check(...e) {
-    const s = this.peek();
-    return e.includes(s.kind);
+    const n = this.peek();
+    return e.includes(n.kind);
   }
   previous() {
     return this.tokens[this.current - 1];
@@ -1234,8 +1237,8 @@ class ln {
   canHandle(e) {
     return e.handlerContext === void 0 || e.handlerContext === this.contextStack.top();
   }
-  consume(e, ...s) {
-    if (!this.match(...s))
+  consume(e, ...n) {
+    if (!this.match(...n))
       throw this.logError(this.peek(), o.UNEXPECTED_TOKEN, e), new d(
         this.peek(),
         void 0,
@@ -1245,94 +1248,94 @@ class ln {
   // Discard tokens until one of `kind` is found
   // If any tokens are discarded, the error message is logged
   // Return whether the token of one of the listed kinds are eventually reached
-  discardUntil(e, ...s) {
-    if (this.isAtEnd() || !this.check(...s)) {
-      for (E(this.peek()), this.logError(this.advance(), o.UNEXPECTED_TOKEN, e); !this.isAtEnd() && !this.check(...s); )
+  discardUntil(e, ...n) {
+    if (this.isAtEnd() || !this.check(...n)) {
+      for (E(this.peek()), this.logError(this.advance(), o.UNEXPECTED_TOKEN, e); !this.isAtEnd() && !this.check(...n); )
         E(this.advance());
       return !this.isAtEnd();
     }
     return !0;
   }
   gatherInvalid() {
-    const e = [], s = [];
-    let n, i = 0;
+    const e = [], n = [];
+    let s, i = 0;
     for (; i < this.tokens.length && this.tokens[i].isInvalid; i += 1)
-      s.push(this.tokens[i]);
-    for (n = this.tokens[i], n.leadingInvalid = s, e.push(n), i += 1; i < this.tokens.length; i += 1) {
+      n.push(this.tokens[i]);
+    for (s = this.tokens[i], s.leadingInvalid = n, e.push(s), i += 1; i < this.tokens.length; i += 1) {
       const r = this.tokens[i];
-      r.isInvalid ? n.trailingInvalid.push(r) : (n = r, e.push(n));
+      r.isInvalid ? s.trailingInvalid.push(r) : (s = r, e.push(s));
     }
     this.tokens = e;
   }
   parse() {
-    const e = this.program(), s = this.advance(), n = this.nodeFactory.create(X, { body: e, eof: s });
-    return this.gatherInvalid(), new B({ ast: n, tokens: this.tokens }, this.errors);
+    const e = this.program(), n = this.advance(), s = this.nodeFactory.create(B, { body: e, eof: n });
+    return this.gatherInvalid(), new V({ ast: s, tokens: this.tokens }, this.errors);
   }
   /* Parsing and synchronizing ProgramNode */
   program() {
     const e = [];
     for (; !this.isAtEnd(); )
       try {
-        const s = this.elementDeclaration();
-        e.push(s);
-      } catch (s) {
-        if (!(s instanceof d))
-          throw s;
-        e.push(s.partialNode), this.synchronizeProgram();
+        const n = this.elementDeclaration();
+        e.push(n);
+      } catch (n) {
+        if (!(n instanceof d))
+          throw n;
+        e.push(n.partialNode), this.synchronizeProgram();
       }
     return e;
   }
   /* Parsing and synchronizing top-level ElementDeclarationNode */
   elementDeclaration() {
-    const e = {}, s = () => this.nodeFactory.create(_, e);
+    const e = {}, n = () => this.nodeFactory.create(_, e);
     try {
-      this.consume("Expect an identifier", c.IDENTIFIER), e.type = this.previous();
-    } catch (n) {
-      throw n instanceof d ? (e.type = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+      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 (n) {
-        if (!(n instanceof d))
-          throw n;
-        if (e.name = n.partialNode, !this.canHandle(n))
-          throw new d(n.token, s(), n.handlerContext);
+      } catch (s) {
+        if (!(s instanceof d))
+          throw s;
+        if (e.name = s.partialNode, !this.canHandle(s))
+          throw new d(s.token, n(), s.handlerContext);
         this.synchronizeElementDeclarationName();
       }
-    if (ct(this.peek()))
-      if (e.as = this.advance(), this.check(c.COLON, c.LBRACE, c.LBRACKET))
+    if (lt(this.peek()))
+      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 {
           e.alias = this.normalExpression();
-        } catch (n) {
-          if (!(n instanceof d))
-            throw n;
-          if (e.alias = n.partialNode, !this.canHandle(n))
-            throw new d(n.token, s(), n.handlerContext);
+        } catch (s) {
+          if (!(s instanceof d))
+            throw s;
+          if (e.alias = s.partialNode, !this.canHandle(s))
+            throw new d(s.token, n(), s.handlerContext);
           this.synchronizeElementDeclarationAlias();
         }
     try {
-      e.attributeList = this.check(c.LBRACKET) ? this.listExpression() : void 0;
-    } catch (n) {
-      throw n instanceof d ? (e.attributeList = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+      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 s();
+      return n();
     try {
-      if (this.match(c.COLON)) {
+      if (this.match(u.COLON)) {
         e.bodyColon = this.previous();
-        const n = this.expression();
-        n instanceof _ ? (E(n), this.logError(n, o.UNEXPECTED_ELEMENT_DECLARATION, "An element's simple body must not be an element declaration")) : e.body = n;
+        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;
       } else
         e.body = this.blockExpression();
-    } catch (n) {
-      throw n instanceof d ? (e.body = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+    } catch (s) {
+      throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     return this.nodeFactory.create(_, e);
   }
@@ -1343,159 +1346,159 @@ class ln {
   //    Note: 'This is a note'  // fieldDeclaration() handles this
   //  }
   fieldDeclaration() {
-    const e = {}, s = () => this.nodeFactory.create(_, e);
+    const e = {}, n = () => this.nodeFactory.create(_, e);
     try {
-      this.consume("Expect an identifier", c.IDENTIFIER), e.type = this.previous();
-    } catch (n) {
-      throw n instanceof d ? (e.type = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+      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();
-    } catch (n) {
-      throw n instanceof d ? (e.bodyColon = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+      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 n = this.expression();
-      n instanceof _ ? this.errors.push(new u(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", n)) : e.body = n;
-    } catch (n) {
-      throw n instanceof d ? (e.body = n.partialNode, new d(n.token, s(), n.handlerContext)) : n;
+      const s = this.expression();
+      s instanceof _ ? this.errors.push(new l(o.INVALID_ELEMENT_IN_SIMPLE_BODY, "Simple body cannot be an element declaration", s)) : e.body = s;
+    } catch (s) {
+      throw s instanceof d ? (e.body = s.partialNode, new d(s.token, n(), s.handlerContext)) : s;
     }
     return this.nodeFactory.create(_, e);
   }
   /* Parsing any ExpressionNode, including non-NormalExpression */
   expression() {
-    const e = { args: [] }, s = () => en(e.callee, e.args, this.nodeFactory).unwrap_or(
-      this.nodeFactory.create(y, e)
+    const e = { args: [] }, n = () => nn(e.callee, e.args, this.nodeFactory).unwrap_or(
+      this.nodeFactory.create(v, e)
     );
     try {
       e.callee = this.normalExpression();
     } catch (i) {
-      throw i instanceof d ? (e.callee = i.partialNode, new d(i.token, s(), i.handlerContext)) : i;
+      throw i instanceof d ? (e.callee = i.partialNode, new d(i.token, n(), i.handlerContext)) : i;
     }
     if (this.shouldStopExpression())
-      return s();
-    let n = e.callee;
+      return n();
+    let s = e.callee;
     for (; !this.shouldStopExpression(); ) {
-      Ve(this.previous()) || this.logError(n, o.MISSING_SPACES, "Expect a following space");
+      Ve(this.previous()) || this.logError(s, o.MISSING_SPACES, "Expect a following space");
       try {
-        n = this.normalExpression(), e.args.push(n);
+        s = this.normalExpression(), e.args.push(s);
       } catch (i) {
-        throw i instanceof d ? (n = i.partialNode, e.args.push(n), new d(i.token, s(), i.handlerContext)) : i;
+        throw i instanceof d ? (s = i.partialNode, e.args.push(s), new d(i.token, n(), i.handlerContext)) : i;
       }
     }
-    return s();
+    return n();
   }
   shouldStopExpression() {
     if (this.isAtEnd() || bt(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);
   }
   // Pratt's parsing algorithm
   expression_bp(e) {
-    let s = this.leftExpression_bp();
+    let n = this.leftExpression_bp();
     for (; !this.isAtEnd(); ) {
-      const n = this.peek();
-      if (n.kind === c.LPAREN) {
-        const { left: i } = ut(n);
+      const s = this.peek();
+      if (s.kind === u.LPAREN) {
+        const { left: i } = ut(s);
         if (i < e || // When '(' is encountered,
         // consider it part of another expression if
         // it's at the start of a new line
         // and we're currently not having unmatched '(' or '['
-        ot(this.previous(), n) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
+        ot(this.previous(), s) && !this.contextStack.isWithinGroupExpressionContext() && !this.contextStack.isWithinListExpressionContext())
           break;
         try {
-          s = this.nodeFactory.create(H, {
-            callee: s,
+          n = this.nodeFactory.create(H, {
+            callee: n,
             argumentList: this.tupleExpression()
           });
         } catch (r) {
-          throw r instanceof d ? (s = this.nodeFactory.create(H, {
-            callee: s,
+          throw r instanceof d ? (n = this.nodeFactory.create(H, {
+            callee: n,
             argumentList: r.partialNode
-          }), new d(r.token, s, r.handlerContext)) : r;
+          }), new d(r.token, n, r.handlerContext)) : r;
         }
-      } else if (n.kind === c.LBRACKET) {
+      } else if (s.kind === u.LBRACKET) {
         if (Ve(this.previous()))
           break;
         try {
-          s = this.nodeFactory.create(fe, {
-            expression: s,
+          n = this.nodeFactory.create(fe, {
+            expression: n,
             indexer: this.listExpression()
           });
         } catch (i) {
-          throw i instanceof d ? (s = this.nodeFactory.create(fe, {
-            expression: s,
+          throw i instanceof d ? (n = this.nodeFactory.create(fe, {
+            expression: n,
             indexer: i.partialNode
-          }), new d(i.token, s, i.handlerContext)) : i;
+          }), new d(i.token, n, i.handlerContext)) : i;
         }
-      } else if (at(n)) {
-        const i = n, r = ut(i);
+      } else if (at(s)) {
+        const i = s, r = ut(i);
         if (r.left !== null) {
           if (r.left <= e)
             break;
-          this.advance(), s = this.nodeFactory.create(Oe, {
-            expression: s,
+          this.advance(), n = this.nodeFactory.create(Oe, {
+            expression: n,
             op: i
           });
         } else {
-          const a = un(i);
+          const a = fn(i);
           if (a.left === null || a.left <= e)
             break;
           this.advance();
           try {
-            s = this.nodeFactory.create(q, {
-              leftExpression: s,
+            n = this.nodeFactory.create(q, {
+              leftExpression: n,
               op: i,
               rightExpression: i.value === "." ? this.extractOperand() : this.expression_bp(a.right)
             });
-          } catch (l) {
-            throw l instanceof d ? (s = this.nodeFactory.create(q, {
-              leftExpression: s,
+          } catch (c) {
+            throw c instanceof d ? (n = this.nodeFactory.create(q, {
+              leftExpression: n,
               op: i,
-              rightExpression: l.partialNode
-            }), new d(l.token, s, l.handlerContext)) : l;
+              rightExpression: c.partialNode
+            }), new d(c.token, n, c.handlerContext)) : c;
           }
         }
       } else
         break;
     }
-    return s;
+    return n;
   }
   leftExpression_bp() {
     let e;
     if (at(this.peek())) {
-      const s = {};
-      s.op = this.peek();
-      const n = fn(s.op);
-      if (n.right === null)
+      const n = {};
+      n.op = this.peek();
+      const s = dn(n.op);
+      if (s.right === null)
         throw this.logError(
-          s.op,
+          n.op,
           o.UNKNOWN_PREFIX_OP,
-          `Unexpected '${s.op.value}' in an expression`
+          `Unexpected '${n.op.value}' in an expression`
         ), new d(
-          s.op,
-          this.nodeFactory.create(we, { pre: s.op }),
+          n.op,
+          this.nodeFactory.create(ve, { pre: n.op }),
           this.contextStack.findHandlerContext(this.tokens, this.current)
         );
       this.advance();
       try {
-        s.expression = this.expression_bp(n.right);
+        n.expression = this.expression_bp(s.right);
       } catch (i) {
-        throw i instanceof d ? (s.expression = i.partialNode, new d(
+        throw i instanceof d ? (n.expression = i.partialNode, new d(
           i.token,
-          this.nodeFactory.create(Q, s),
+          this.nodeFactory.create(Q, n),
           i.handlerContext
         )) : i;
       }
-      e = this.nodeFactory.create(Q, s);
-    } else if (e = this.extractOperand(), e instanceof we)
+      e = this.nodeFactory.create(Q, n);
+    } else if (e = this.extractOperand(), e instanceof ve)
       throw new d(
         this.peek(),
-        this.nodeFactory.create(we, { pre: this.peek() }),
+        this.nodeFactory.create(ve, { pre: this.peek() }),
         this.contextStack.findHandlerContext(this.tokens, this.current)
       );
     return e;
@@ -1506,12 +1509,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"
@@ -1519,104 +1522,104 @@ class ln {
       this.peek(),
       o.INVALID_OPERAND,
       `Invalid start of operand "${this.peek().value}"`
-    ), this.nodeFactory.create(we, { pre: this.previous() }));
+    ), this.nodeFactory.create(ve, { pre: this.previous() }));
   }
   /* Parsing FunctionExpression */
   functionExpression() {
     const e = {};
     try {
-      this.consume("Expect a function expression", c.FUNCTION_EXPRESSION), e.value = this.previous();
-    } catch (s) {
-      throw s instanceof d ? (e.value = s.partialNode, new d(
-        s.token,
+      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(K, e),
-        s.handlerContext
-      )) : s;
+        n.handlerContext
+      )) : n;
     }
     return this.nodeFactory.create(K, 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(de, { 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($, { 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($, {})
+        expression: this.nodeFactory.create(j, {})
       }),
       this.contextStack.findHandlerContext(this.tokens, this.current)
     );
   }
   attribute() {
     const e = {};
-    if (this.check(c.COLON, c.RBRACKET, c.COMMA)) {
-      const s = this.peek();
+    if (this.check(u.COLON, u.RBRACKET, u.COMMA)) {
+      const n = this.peek();
       this.logError(
-        s,
+        n,
         o.EMPTY_ATTRIBUTE_NAME,
         "Expect a non-empty attribute name"
       ), e.name = this.nodeFactory.create(te, { identifiers: [] });
     } else
       try {
         e.name = this.attributeName();
-      } catch (s) {
-        if (!(s instanceof d))
-          throw s;
-        if (e.name = s.partialNode, !this.canHandle(s))
+      } catch (n) {
+        if (!(n instanceof d))
+          throw n;
+        if (e.name = n.partialNode, !this.canHandle(n))
           throw new d(
-            s.token,
+            n.token,
             this.nodeFactory.create(ne, e),
-            s.handlerContext
+            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(ne, e);
   }
   attributeValue() {
     let e;
     try {
-      e = this.peek().kind === c.IDENTIFIER && this.peek(1).kind === c.IDENTIFIER ? this.attributeName() : this.normalExpression();
-    } catch (s) {
-      if (!(s instanceof d) || !this.canHandle(s))
-        throw s;
-      e = s.partialNode, this.synchronizeAttributeValue();
+      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;
+      e = n.partialNode, this.synchronizeAttributeValue();
     }
     return e;
   }
   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());
-      } catch (s) {
-        throw s instanceof d ? new d(
-          s.token,
+        this.consume("Expect an identifier", u.IDENTIFIER), e.push(this.previous());
+      } catch (n) {
+        throw n instanceof d ? new d(
+          n.token,
           this.nodeFactory.create(te, { identifiers: e }),
-          s.handlerContext
-        ) : s;
+          n.handlerContext
+        ) : n;
       }
     return this.nodeFactory.create(te, { identifiers: e });
   }
-  logError(e, s, n) {
-    this.errors.push(new u(s, n, e));
+  logError(e, n, s) {
+    this.errors.push(new l(n, s, e));
   }
 }
-const cn = {
+const hn = {
   "+": { left: 9, right: 10 },
   "*": { left: 11, right: 12 },
   "-": { left: 9, right: 10 },
@@ -1632,10 +1635,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 },
@@ -1643,19 +1646,19 @@ 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 ut(t) {
-  return pn[t.value] || { left: null, right: null };
+  return En[t.value] || { left: null, right: null };
 }
 var I = /* @__PURE__ */ ((t) => (t.Table = "table", t.Enum = "enum", t.Ref = "ref", t.Note = "note", t.Project = "project", t.Indexes = "indexes", t.TableGroup = "tablegroup", t))(I || {});
 function Ee(t) {
-  var s;
-  const e = (s = t == null ? void 0 : t.type) == null ? void 0 : s.value.toLowerCase();
+  var n;
+  const e = (n = t == null ? void 0 : t.type) == null ? void 0 : n.value.toLowerCase();
   switch (e) {
     case I.Enum:
     case I.Table:
@@ -1675,50 +1678,50 @@ function Ne(t) {
   const e = Ne(t.leftExpression).unwrap_or(void 0);
   return e ? (e.push(t.rightExpression), new k(e)) : new A();
 }
-function j(t) {
+function X(t) {
   if (t === void 0)
     return new A();
   const e = Ne(t).unwrap_or(void 0);
   if (!e)
     return new A();
-  const s = [];
-  for (const n of e) {
-    const i = C(n).unwrap_or(void 0);
+  const n = [];
+  for (const s of e) {
+    const i = $(s).unwrap_or(void 0);
     if (!i)
       return new A();
-    s.push(i);
+    n.push(i);
   }
-  return new k(s);
+  return new k(n);
 }
-function Ie(t) {
+function Le(t) {
   if (t === void 0)
     return new A();
   const e = Ne(t).unwrap_or(void 0);
   if (!e || e.length === 0)
     return new A();
-  const s = [];
-  let n;
+  const n = [];
+  let s;
   if (!M(L.last(e))) {
     const i = e.pop();
     if (xt(i))
-      n = i.elementList.map(
-        (r) => G(r).unwrap()
+      s = i.elementList.map(
+        (r) => C(r).unwrap()
       );
     else
       return new A();
   }
   for (const i of e) {
-    const r = C(i).unwrap_or(void 0);
+    const r = $(i).unwrap_or(void 0);
     if (!r)
       return new A();
-    s.push(r);
+    n.push(r);
   }
   return new k({
-    variables: s,
-    tupleElements: n
+    variables: n,
+    tupleElements: s
   });
 }
-function C(t) {
+function $(t) {
   return M(t) ? new k(t.expression.variable.value) : new A();
 }
 function Ge(t) {
@@ -1726,395 +1729,403 @@ function Ge(t) {
     return t instanceof K ? new k({ functional: [t], nonFunctional: [] }) : new k({ functional: [], nonFunctional: [t] });
   if (t instanceof J && t.elementList.every(ht)) {
     const e = t.elementList.filter(
-      (n) => n instanceof K
-    ), s = t.elementList.filter(M);
-    return new k({ functional: e, nonFunctional: s });
+      (s) => s instanceof K
+    ), n = t.elementList.filter(M);
+    return new k({ functional: e, nonFunctional: n });
   }
   return new A();
 }
-function G(t) {
-  var s;
-  const e = (s = t == null ? void 0 : t.expression.variable) == null ? void 0 : s.value;
+function C(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 k(e);
 }
-function Y(t) {
-  return W(t) ? t.expression instanceof $ ? new k(t.expression.variable.value) : new k(t.expression.literal.value) : new A();
+function z(t) {
+  return Y(t) ? t.expression instanceof j ? new k(t.expression.variable.value) : new k(t.expression.literal.value) : new A();
 }
-function dn(t) {
+function Nn(t) {
   var e;
-  return !(t instanceof q) || !yt((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 q) || !yt((e = t.op) == null ? void 0 : e.value) ? !1 : Le(t.leftExpression).and_then(() => Le(t.rightExpression)).unwrap_or(void 0) !== void 0;
 }
-function En(t) {
-  const e = Ie(t.leftExpression), s = Ie(t.rightExpression);
-  if (!e.isOk() || !s.isOk())
+function mn(t) {
+  const e = Le(t.leftExpression), n = Le(t.rightExpression);
+  if (!e.isOk() || !n.isOk())
     return !1;
-  const { tupleElements: n } = e.unwrap(), { tupleElements: i } = s.unwrap();
-  return (n == null ? void 0 : n.length) === (i == null ? void 0 : i.length);
+  const { tupleElements: s } = e.unwrap(), { tupleElements: i } = n.unwrap();
+  return (s == null ? void 0 : s.length) === (i == null ? void 0 : i.length);
 }
 function ht(t) {
-  return t instanceof D && t.expression instanceof $ || t instanceof K;
+  return t instanceof D && t.expression instanceof j || t instanceof K;
 }
-function Nn(t, e) {
-  var i, r, a, l;
-  let s = e;
-  const n = jt(t);
-  for (; s; ) {
-    if ((r = (i = s.symbol) == null ? void 0 : i.symbolTable) != null && r.has(t))
-      return (a = s.symbol.symbolTable) == null ? void 0 : a.get(t);
-    if (((l = s.symbol) == null ? void 0 : l.declaration) instanceof X && n)
-      return s.symbol;
-    if (s instanceof X)
+function Tn(t, e) {
+  var i, r, a, c;
+  let n = e;
+  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 (((c = n.symbol) == null ? void 0 : c.declaration) instanceof B && s)
+      return n.symbol;
+    if (n instanceof B)
       return;
-    s = s.parent;
+    n = n.parent;
   }
 }
-class mn {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class bn {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 X || Ee(this.declarationNode.parent).unwrap_or(void 0) !== I.Project ? [new u(o.INVALID_CUSTOM_CONTEXT, "A custom element can only appear in a Project", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof B || Ee(this.declarationNode.parent).unwrap_or(void 0) !== I.Project ? [new l(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 l(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 l(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 l(o.UNEXPECTED_SETTINGS, "A Custom element shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
     if (e instanceof ee)
-      return [new u(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
-    const s = [];
-    return W(e.callee) || s.push(new u(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && s.push(...e.args.map((n) => new u(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", n))), s;
+      return [new l(o.UNEXPECTED_COMPLEX_BODY, "A Custom element can only have an inline field", e)];
+    const n = [];
+    return Y(e.callee) || n.push(new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", e)), e.args.length > 0 && n.push(...e.args.map((s) => new l(o.INVALID_CUSTOM_ELEMENT_VALUE, "A Custom element value can only be a string", s))), n;
   }
 }
-class ge {
+class _e {
   constructor() {
     this.table = /* @__PURE__ */ new Map();
   }
   has(e) {
     return this.table.has(e);
   }
-  set(e, s) {
-    this.table.set(e, s);
+  set(e, n) {
+    this.table.set(e, n);
   }
-  get(e, s) {
-    return this.table.get(e) || s !== void 0 && this.set(e, s) || s;
+  get(e, n) {
+    return this.table.get(e) || n !== void 0 && this.set(e, n) || n;
   }
   entries() {
     return this.table.entries();
   }
 }
-class Tn {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class In {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 _ ? [new l(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 l(o.INVALID_NAME, "An Enum name must be of the form <enum> or <schema>.<enum>", e)] : [new l(o.NAME_NOT_FOUND, "An Enum must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(qt, { declaration: this.declarationNode, symbolTable: new ge() });
-    const { name: s } = this.declarationNode, n = j(s);
-    if (n.isOk()) {
-      const i = n.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"}'`, s)), a.set(l, this.declarationNode.symbol);
+    this.declarationNode.symbol = this.symbolFactory.create(Jt, { declaration: this.declarationNode, symbolTable: new _e() });
+    const { name: n } = this.declarationNode, s = X(n);
+    if (s.isOk()) {
+      const i = s.unwrap(), r = i.pop(), a = Ze(i, this.publicSymbolTable, this.symbolFactory), c = je(r);
+      a.has(c) && e.push(new l(o.DUPLICATE_NAME, `Enum name ${r} already exists in schema '${i.join(".") || "public"}'`, n)), a.set(c, this.declarationNode.symbol);
     }
     return e;
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "An Enum shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
+    if (e instanceof v)
       return this.validateFields([e]);
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    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((s) => {
-      const n = [];
-      return s.callee && !M(s.callee) && n.push(new u(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", s.callee)), L.last(s.args) instanceof U && n.push(...this.validateFieldSetting(L.last(s.args))), s.args.length > 1 && n.push(...s.args.map((i) => new u(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", i))), n.push(...this.registerField(s)), n;
+    return e.length === 0 ? [new l(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
+      const s = [];
+      return n.callee && !M(n.callee) && s.push(new l(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), L.last(n.args) instanceof U && s.push(...this.validateFieldSetting(L.last(n.args))), n.args.length > 1 && s.push(...n.args.map((i) => new l(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", i))), s.push(...this.registerField(n)), s;
     });
   }
   validateFieldSetting(e) {
-    const s = z(e), n = s.getErrors(), i = s.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) => n.push(new u(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            W(l.value) || n.push(new u(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_ENUM_ELEMENT_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_ENUM_ELEMENT_SETTING, "'note' must be a string", c));
           });
           break;
         default:
-          a.forEach((l) => n.push(new u(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_ENUM_ELEMENT_SETTING, `Unknown enum field setting '${r}'`, c)));
       }
     }
-    return n;
+    return s;
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(n);
+      return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const s = G(e.callee).unwrap(), n = Ye(s), i = this.symbolFactory.create(Ht, { declaration: e });
+      const n = C(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(n)) {
-        const a = r.get(n);
+      if (r.has(s)) {
+        const a = r.get(s);
         return [
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${s}`, e),
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${s}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate enum field ${n}`, a.declaration)
         ];
       }
-      r.set(n, i);
+      r.set(s, i);
     }
     return [];
   }
 }
-class bn {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class Ln {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 X || Ee(this.declarationNode.parent).unwrap_or(void 0) !== I.Table ? [new u(o.INVALID_NOTE_CONTEXT, "An Indexes can only appear inside a Table", this.declarationNode)] : [];
+    return this.declarationNode.parent instanceof B || Ee(this.declarationNode.parent).unwrap_or(void 0) !== I.Table ? [new l(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 l(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 l(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 l(o.UNEXPECTED_SETTINGS, "An Indexes shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    if (e instanceof v)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "An Indexes must have a complex body", e)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.flatMap((s) => {
-      if (!s.callee)
+    return e.flatMap((n) => {
+      if (!n.callee)
         return [];
-      const n = [], i = [s.callee, ...s.args];
-      return L.last(i) instanceof U && n.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
+      const s = [], i = [n.callee, ...n.args];
+      return L.last(i) instanceof U && s.push(...this.validateFieldSetting(i.pop())), i.forEach((r) => {
         for (; r instanceof H; )
-          r.argumentList && !Ge(r.argumentList).isOk() && n.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() || n.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));
-      }), n;
+          r.argumentList && !Ge(r.argumentList).isOk() && s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r.argumentList)), r = r.callee;
+        Ge(r).isOk() || s.push(new l(o.INVALID_INDEXES_FIELD, "An index field must be an identifier, a quoted identifier, a functional expression or a tuple of such", r));
+      }), s;
     });
   }
   validateFieldSetting(e) {
-    const s = z(e), n = s.getErrors(), i = s.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) => n.push(new u(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            W(l.value) || n.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must be a string`, c));
           });
           break;
         case "unique":
         case "pk":
-          a.length > 1 && a.forEach((l) => n.push(new u(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            oe(l.value) || n.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            oe(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, c));
           });
           break;
         case "type":
-          a.length > 1 && a.forEach((l) => n.push(new u(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
-            M(l.value) || n.push(new u(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+          a.length > 1 && a.forEach((c) => s.push(new l(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", c))), a.forEach((c) => {
+            M(c.value) || s.push(new l(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, c));
           });
           break;
         default:
-          a.forEach((l) => n.push(new u(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_INDEX_SETTING, `Unknown index setting '${r}'`, c)));
       }
     }
-    return n;
+    return s;
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(n);
+      return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class In {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class gn {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 X || ![I.Table, I.Project].includes(Ee(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 B) && ![I.Table, I.Project].includes(Ee(this.declarationNode.parent).unwrap_or(void 0)) ? [new l(o.INVALID_NOTE_CONTEXT, "A Note can only appear inside a Table or a Project. Sticky note can only appear at the global scope.", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? [new u(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+    if (!(this.declarationNode.parent instanceof B))
+      return e ? [new l(o.UNEXPECTED_NAME, "A Note shouldn't have a name", e)] : [];
+    if (!e)
+      return [new l(o.INVALID_NAME, "Sticky note must have a name", this.declarationNode)];
+    const n = X(e);
+    if (!n.isOk())
+      return [];
+    const i = n.unwrap().join("."), r = Yt(i);
+    return this.publicSymbolTable.has(r) ? [new l(o.DUPLICATE_NAME, `Sticky note "${i}" has already been defined`, e)] : (this.publicSymbolTable.set(r, this.declarationNode.symbol), []);
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
+    return e && !(this.declarationNode.parent instanceof B) ? [new l(o.UNEXPECTED_SETTINGS, "A Note shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
+    if (e instanceof v)
       return this.validateFields([e]);
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    const s = [];
-    return e.length === 0 ? [new u(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((n) => s.push(new u(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", n))), W(e[0].callee) || s.push(new u(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && s.push(...e[0].args.map((n) => new u(o.INVALID_NOTE, "A Note can only contain one quoted string", n))), s);
+    const n = [];
+    return e.length === 0 ? [new l(o.EMPTY_NOTE, "A Note must have a content", this.declarationNode)] : (e.length > 1 && e.slice(1).forEach((s) => n.push(new l(o.NOTE_CONTENT_REDEFINED, "A Note can only contain one string", s))), Y(e[0].callee) || n.push(new l(o.INVALID_NOTE, "A Note content must be a quoted string", e[0])), e[0].args.length > 0 && n.push(...e[0].args.map((s) => new l(o.INVALID_NOTE, "A Note can only contain one quoted string", s))), n);
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(n);
+      return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class Ln {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class _n {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 _ ? [new l(o.INVALID_PROJECT_CONTEXT, "A Project can only appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? Re(e) ? [] : [new u(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? Re(e) ? [] : [new l(o.INVALID_NAME, "A Project's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Project shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Project shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
+    if (e instanceof v)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Project's body must be a block", e)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
     return [
-      ...s.map((i) => new u(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
-      ...this.validateSubElements(n)
+      ...n.map((i) => new l(o.INVALID_PROJECT_FIELD, "A Project can not have inline fields", i)),
+      ...this.validateSubElements(s)
     ];
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(n);
+      return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
 }
-class gn {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class An {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 X || Ee(this.declarationNode.parent).unwrap_or(void 0) === I.Table ? [] : [new u(o.INVALID_REF_CONTEXT, "A Ref must appear top-level or inside a table", this.declarationNode)];
+    return this.declarationNode.parent instanceof B || Ee(this.declarationNode.parent).unwrap_or(void 0) === I.Table ? [] : [new l(o.INVALID_REF_CONTEXT, "A Ref must appear top-level or inside a table", this.declarationNode)];
   }
   validateName(e) {
-    return e ? Re(e) ? [] : [new u(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
+    return e ? Re(e) ? [] : [new l(o.INVALID_NAME, "A Ref's name is optional or must be an identifier or a quoted identifer", e)] : [];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A Ref shouldn't have an alias", e)] : [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A Ref shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
+    if (e instanceof v)
       return this.validateFields([e]);
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    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)];
-    const s = [];
-    return e.length > 1 && s.push(...e.slice(1).map((n) => new u(o.REF_REDEFINED, "A Ref can only contain one binary relationship", n))), e.forEach((n) => {
-      n.callee && !dn(n.callee) && s.push(new u(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", n.callee)), n.callee && !En(n.callee) && s.push(new u(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", n.callee)), L.last(n.args) instanceof U && this.validateFieldSettings(L.last(n.args)), n.args.length > 1 && s.push(...n.args.map((i) => new u(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", i)));
-    }), s;
+      return [new l(o.EMPTY_REF, "A Ref must have at least one field", this.declarationNode)];
+    const n = [];
+    return e.length > 1 && n.push(...e.slice(1).map((s) => new l(o.REF_REDEFINED, "A Ref can only contain one binary relationship", s))), e.forEach((s) => {
+      s.callee && !Nn(s.callee) && n.push(new l(o.INVALID_REF_FIELD, "A Ref field must be a binary relationship", s.callee)), s.callee && !mn(s.callee) && n.push(new l(o.UNEQUAL_FIELDS_BINARY_REF, "Unequal fields in ref endpoints", s.callee)), L.last(s.args) instanceof U && this.validateFieldSettings(L.last(s.args)), s.args.length > 1 && n.push(...s.args.map((i) => new l(o.INVALID_REF_FIELD, "A Ref field should only have a single binary relationship", i)));
+    }), n;
   }
   validateFieldSettings(e) {
-    const s = z(e), n = s.getErrors(), i = s.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) => n.push(new u(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            _n(l.value) || n.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((c) => s.push(new l(o.DUPLICATE_REF_SETTING, `'${r}' can only appear once`, c))), a.forEach((c) => {
+            vn(c.value) || s.push(new l(o.INVALID_REF_SETTING_VALUE, `'${r}' can only have values "cascade", "no action", "set null", "set default" or "restrict"`, c));
           });
           break;
         default:
-          a.forEach((l) => n.push(new u(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, l)));
+          a.forEach((c) => s.push(new l(o.UNKNOWN_REF_SETTING, `Unknown ref setting '${r}'`, c)));
       }
     }
-    return n;
+    return s;
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(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 te))
+function vn(t) {
+  if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof te))
     return !1;
   let e;
   if (t instanceof te ? e = De(t).unwrap_or("") : e = t.expression.variable.value, e)
@@ -2130,519 +2141,519 @@ function _n(t) {
     }
   return !1;
 }
-class An {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.symbolFactory = n, this.publicSymbolTable = s;
+class wn {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.symbolFactory = s, this.publicSymbolTable = n;
   }
   validate() {
     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 _ ? [new l(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof fe ? [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 fe ? [new l(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : Je(e) ? [] : [new l(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new l(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? yn(e) ? [] : [new u(o.INVALID_ALIAS, "A Table alias must be of the form <alias>", e)] : [];
+    return e ? kn(e) ? [] : [new l(o.INVALID_ALIAS, "A Table alias must be of the form <alias>", e)] : [];
   }
   validateSettingList(e) {
-    const s = z(e), n = s.getErrors(), i = s.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 && n.push(...a.map((l) => new u(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", l))), a.forEach((l) => {
-            xn(l.value) || n.push(new u(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'headercolor' can only appear once", c))), a.forEach((c) => {
+            Sn(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'headercolor' must be a color literal", c.value || c.name));
           });
           break;
         case "note":
-          a.length > 1 && n.push(...a.map((l) => new u(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", l))), a.forEach((l) => {
-            W(l.value) || n.push(new u(o.INVALID_TABLE_SETTING, "'note' must be a string literal", l.value || l.name));
+          a.length > 1 && s.push(...a.map((c) => new l(o.DUPLICATE_TABLE_SETTING, "'note' can only appear once", c))), a.forEach((c) => {
+            Y(c.value) || s.push(new l(o.INVALID_TABLE_SETTING, "'note' must be a string literal", c.value || c.name));
           });
           break;
         default:
-          n.push(...a.map((l) => new u(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, l)));
+          s.push(...a.map((c) => new l(o.INVALID_TABLE_SETTING, `Unknown '${r}' setting`, c)));
       }
     }
-    return n;
+    return s;
   }
   registerElement() {
     const e = [];
-    this.declarationNode.symbol = this.symbolFactory.create(At, { declaration: this.declarationNode, symbolTable: new ge() });
-    const { name: s, alias: n } = this.declarationNode, i = j(s);
+    this.declarationNode.symbol = this.symbolFactory.create(At, { declaration: this.declarationNode, symbolTable: new _e() });
+    const { name: n, alias: s } = this.declarationNode, i = X(n);
     if (i.isOk()) {
-      const r = i.unwrap(), a = r.pop(), l = Ze(r, this.publicSymbolTable, this.symbolFactory), p = ye(a);
-      l.has(p) && e.push(new u(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, s)), l.set(p, this.declarationNode.symbol);
+      const r = i.unwrap(), a = r.pop(), c = Ze(r, this.publicSymbolTable, this.symbolFactory), p = ye(a);
+      c.has(p) && e.push(new l(o.DUPLICATE_NAME, `Table name '${a}' already exists in schema '${r.join(".") || "public"}'`, n)), c.set(p, this.declarationNode.symbol);
     }
-    if (n && Re(n)) {
-      const r = ye(G(n).unwrap());
-      this.publicSymbolTable.has(r) && e.push(new u(o.DUPLICATE_NAME, `Table name '${n}' already exists`, s)), this.publicSymbolTable.set(r, this.declarationNode.symbol);
+    if (s && Re(s)) {
+      const r = ye(C(s).unwrap());
+      this.publicSymbolTable.has(r) && e.push(new l(o.DUPLICATE_NAME, `Table name '${s}' already exists`, n)), this.publicSymbolTable.set(r, this.declarationNode.symbol);
     }
     return e;
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    if (e instanceof v)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A Table's body must be a block", e)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    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((s) => {
-      if (!s.callee)
+    return e.length === 0 ? [new l(o.EMPTY_TABLE, "A Table must have at least one column", this.declarationNode)] : e.flatMap((n) => {
+      if (!n.callee)
         return [];
-      const n = [];
-      s.args.length === 0 && n.push(new u(o.INVALID_COLUMN, "A column must have a type", s.callee)), M(s.callee) || n.push(new u(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", s.callee)), s.args[0] && !wn(s.args[0]) && n.push(new u(o.INVALID_COLUMN_TYPE, "Invalid column type", s.args[0]));
-      const i = s.args.slice(1);
-      return n.push(...this.validateFieldSetting(i)), n.push(...this.registerField(s)), n;
+      const s = [];
+      n.args.length === 0 && s.push(new l(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new l(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !yn(n.args[0]) && s.push(new l(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      const i = n.args.slice(1);
+      return s.push(...this.validateFieldSetting(i)), s.push(...this.registerField(n)), s;
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const s = G(e.callee).unwrap(), n = We(s), i = this.symbolFactory.create(Jt, { declaration: e });
+      const n = C(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(n)) {
-        const a = r.get(n);
+      if (r.has(s)) {
+        const a = r.get(s);
         return [
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${s}`, e),
-          new u(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${s}`, a.declaration)
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, e),
+          new l(o.DUPLICATE_COLUMN_NAME, `Duplicate column ${n}`, a.declaration)
         ];
       }
-      r.set(n, i);
+      r.set(s, i);
     }
     return [];
   }
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
     if (!e.slice(0, -1).every(pe) || !e.slice(-1).every((p) => pe(p) || p instanceof U))
-      return [...e.map((p) => new u(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
+      return [...e.map((p) => new l(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
     if (e.length === 0)
       return [];
-    let s;
-    L.last(e) instanceof U && (s = e.pop());
-    const n = z(s), i = n.getErrors(), r = n.getValue();
+    let n;
+    L.last(e) instanceof U && (n = e.pop());
+    const s = W(n), i = s.getErrors(), r = s.getValue();
     for (const p of e) {
-      const h = G(p).unwrap_or("").toLowerCase();
+      const h = C(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 l(o.INVALID_SETTINGS, "Inline column settings can only be `pk` or `unique`", p));
         continue;
       }
       r[h] === void 0 ? r[h] = [p] : r[h].push(p);
     }
-    const a = r.pk || [], l = r["primary key"] || [];
-    a.length >= 1 && l.length >= 1 && i.push(...[...a, ...l].map((p) => new u(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
+    const a = r.pk || [], c = r["primary key"] || [];
+    a.length >= 1 && c.length >= 1 && i.push(...[...a, ...c].map((p) => new l(o.DUPLICATE_COLUMN_SETTING, "Either one of 'primary key' and 'pk' can appear", p)));
     for (const p in r) {
       const h = r[p];
       switch (p) {
         case "note":
-          h.length > 1 && i.push(...h.map((f) => new u(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
-            W(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 l(o.DUPLICATE_COLUMN_SETTING, "note can only appear once", f))), h.forEach((f) => {
+            Y(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'note' must be a quoted string", f.value || f.name));
           });
           break;
         case "ref":
           h.forEach((f) => {
-            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 l(o.INVALID_COLUMN_SETTING_VALUE, "'ref' must be a valid unary relationship", f.value || f.name));
           });
           break;
         case "primary key":
-          h.length > 1 && i.push(...h.map((f) => new 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 l(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
+            oe(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
           });
           break;
         case "pk":
-          h.length > 1 && i.push(...h.map((f) => new 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 l(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", f))), h.forEach((f) => {
+            f instanceof ne && !oe(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
           });
           break;
         case "not null":
-          h.length > 1 && i.push(...h.map((f) => new u(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
+          h.length > 1 && i.push(...h.map((f) => new l(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
           const T = r.null || [];
-          h.length >= 1 && T.length >= 1 && i.push(...[...h, ...T].map((f) => new 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 l(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 l(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
           });
           break;
         case "null":
-          h.length > 1 && i.push(...h.map((f) => new 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 l(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
+            oe(f.value) || i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
           });
           break;
         case "unique":
-          h.length > 1 && i.push(...h.map((f) => new 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 l(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", f))), h.forEach((f) => {
+            f instanceof ne && !oe(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
           });
           break;
         case "increment":
-          h.length > 1 && i.push(...h.map((f) => new 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 l(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", f))), h.forEach((f) => {
+            f instanceof ne && !oe(f.value) && i.push(new l(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
           });
           break;
         case "default":
-          h.length > 1 && i.push(...h.map((f) => new u(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
-            kn(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 l(o.DUPLICATE_TABLE_SETTING, "'default' can only appear once", f))), h.forEach((f) => {
+            On(f.value) || i.push(new l(o.INVALID_TABLE_SETTING, "'default' must be a string literal, number literal, function expression, true, false or null", f.value || f.name));
           });
           break;
         default:
-          h.forEach((f) => i.push(new u(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
+          h.forEach((f) => i.push(new l(o.UNKNOWN_COLUMN_SETTING, `Unknown column setting '${p}'`, f)));
       }
     }
     return i;
   }
   validateSubElements(e) {
-    const s = e.flatMap((i) => {
+    const n = e.flatMap((i) => {
       if (i.parent = this.declarationNode, !i.type)
         return [];
       const r = ie(i);
       return new r(i, this.publicSymbolTable, this.symbolFactory).validate();
-    }), n = e.filter((i) => {
+    }), s = e.filter((i) => {
       var r;
       return ((r = i.type) == null ? void 0 : r.value.toLowerCase()) === "note";
     });
-    return n.length > 1 && (s.push(...n.map((i) => new u(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), s.push()), s;
+    return s.length > 1 && (n.push(...s.map((i) => new l(o.NOTE_REDEFINED, "Duplicate notes are defined", i))), n.push()), n;
   }
 }
-function wn(t) {
+function yn(t) {
   if (!(t instanceof H || He(t) || t instanceof D || t instanceof fe))
     return !1;
   if (t instanceof H) {
-    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((s) => le(s) || W(s) || pe(s)))
+    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => ce(n) || Y(n) || pe(n)))
       return !1;
     t = t.callee;
   }
   for (; t instanceof fe; ) {
-    if (t.array === void 0 || t.indexer === void 0 || !t.indexer.elementList.every((s) => !s.colon && !s.value && le(s.name)))
+    if (t.array === void 0 || t.indexer === void 0 || !t.indexer.elementList.every((n) => !n.colon && !n.value && ce(n.name)))
       return !1;
     t = t.array;
   }
-  const e = j(t).unwrap_or(void 0);
+  const e = X(t).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
-class vn {
-  constructor(e, s, n) {
-    this.declarationNode = e, this.publicSymbolTable = s, this.symbolFactory = n;
+class xn {
+  constructor(e, n, s) {
+    this.declarationNode = e, this.publicSymbolTable = n, this.symbolFactory = s;
   }
   validate() {
     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 _ ? [new l(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 l(o.INVALID_NAME, "A TableGroup name must be of the form <tablegroup> or <schema>.<tablegroup>", e)] : [new l(o.NAME_NOT_FOUND, "A TableGroup must have a name", this.declarationNode)];
   }
   validateAlias(e) {
-    return e ? [new u(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
+    return e ? [new l(o.UNEXPECTED_ALIAS, "A TableGroup shouldn't have an alias", e)] : [];
   }
   registerElement() {
     const { name: e } = this.declarationNode;
-    this.declarationNode.symbol = this.symbolFactory.create(Zt, { declaration: this.declarationNode, symbolTable: new ge() });
-    const s = j(e);
-    if (s.isOk()) {
-      const n = s.unwrap(), i = n.pop(), r = Ze(n, this.publicSymbolTable, this.symbolFactory), a = ze(i);
+    this.declarationNode.symbol = this.symbolFactory.create(en, { declaration: this.declarationNode, symbolTable: new _e() });
+    const n = X(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 '${n.join(".") || "public"}'`, e)];
+        return [new l(o.DUPLICATE_NAME, `TableGroup name '${i}' already exists in schema '${s.join(".") || "public"}'`, e)];
       r.set(a, this.declarationNode.symbol);
     }
     return [];
   }
   validateSettingList(e) {
-    return e ? [new u(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
+    return e ? [new l(o.UNEXPECTED_SETTINGS, "A TableGroup shouldn't have a setting list", e)] : [];
   }
   validateBody(e) {
     if (!e)
       return [];
-    if (e instanceof y)
-      return [new u(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.validateFields(s), ...this.validateSubElements(n)];
+    if (e instanceof v)
+      return [new l(o.UNEXPECTED_SIMPLE_BODY, "A TableGroup's body must be a block", e)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    return [...this.validateFields(n), ...this.validateSubElements(s)];
   }
   validateFields(e) {
-    return e.flatMap((s) => {
-      const n = [];
-      return s.callee && !j(s.callee).isOk() && n.push(new u(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", s.callee)), this.registerField(s), s.args.length > 0 && n.push(...s.args.map((i) => new u(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), n;
+    return e.flatMap((n) => {
+      const s = [];
+      return n.callee && !X(n.callee).isOk() && s.push(new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field must be of the form <table> or <schema>.<table>", n.callee)), this.registerField(n), n.args.length > 0 && s.push(...n.args.map((i) => new l(o.INVALID_TABLEGROUP_FIELD, "A TableGroup field should only have a single Table name", i))), s;
     });
   }
   validateSubElements(e) {
-    return e.flatMap((s) => {
-      if (s.parent = this.declarationNode, !s.type)
+    return e.flatMap((n) => {
+      if (n.parent = this.declarationNode, !n.type)
         return [];
-      const n = ie(s);
-      return new n(s, this.publicSymbolTable, this.symbolFactory).validate();
+      const s = ie(n);
+      return new s(n, this.publicSymbolTable, this.symbolFactory).validate();
     });
   }
   registerField(e) {
     if (e.callee && M(e.callee)) {
-      const s = G(e.callee).unwrap(), n = Qe(s), i = this.symbolFactory.create(Kt, { declaration: e });
+      const n = C(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(n)) {
-        const a = r.get(n);
+      if (r.has(s)) {
+        const a = r.get(s);
         return [
-          new u(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${s} already exists in the group`, e),
-          new u(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${s} already exists in the group`, a.declaration)
+          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, e),
+          new l(o.DUPLICATE_TABLEGROUP_FIELD_NAME, `${n} already exists in the group`, a.declaration)
         ];
       }
-      r.set(n, i);
+      r.set(s, i);
     }
     return [];
   }
 }
-const vt = ["-", "+"];
+const wt = ["-", "+"];
 function ie(t) {
   switch (t.type.value.toLowerCase()) {
     case I.Enum:
-      return Tn;
+      return In;
     case I.Table:
-      return An;
+      return wn;
     case I.TableGroup:
-      return vn;
+      return xn;
     case I.Project:
-      return Ln;
+      return _n;
     case I.Ref:
-      return gn;
+      return An;
     case I.Note:
-      return In;
+      return gn;
     case I.Indexes:
-      return bn;
+      return Ln;
     default:
-      return mn;
+      return bn;
   }
 }
 function Je(t) {
-  return !!j(t).unwrap_or(!1);
+  return !!X(t).unwrap_or(!1);
 }
-function yn(t) {
+function kn(t) {
   return Re(t);
 }
 function Re(t) {
-  return t instanceof D && t.expression instanceof $;
+  return t instanceof D && t.expression instanceof j;
 }
-function Ze(t, e, s) {
+function Ze(t, e, n) {
   var i;
   t[0] === "public" && (t = t.slice(1));
-  let n = e;
+  let s = e;
   for (const r of t) {
     let a;
-    const l = $e(r);
-    if (n.has(l)) {
-      if (a = (i = n.get(l)) == null ? void 0 : i.symbolTable, !a)
+    const c = $e(r);
+    if (s.has(c)) {
+      if (a = (i = s.get(c)) == null ? void 0 : i.symbolTable, !a)
         throw new Error("Expect a symbol table in a schema symbol");
     } else {
-      a = new ge();
-      const p = s.create(_t, { symbolTable: a });
-      n.set(l, p);
+      a = new _e();
+      const p = n.create(_t, { symbolTable: a });
+      s.set(c, p);
     }
-    n = a;
+    s = a;
   }
-  return n;
+  return s;
 }
 function yt(t) {
   return t === "-" || t === "<>" || t === ">" || t === "<";
 }
-function xn(t) {
-  var s;
-  if (!(t instanceof D) || !(t.expression instanceof de) || ((s = t.expression.literal) == null ? void 0 : s.kind) !== c.COLOR_LITERAL)
+function Sn(t) {
+  var n;
+  if (!(t instanceof D) || !(t.expression instanceof de) || ((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 n = 1; n < e.length; n += 1)
-    if (!zt(e[n]))
+  for (let s = 1; s < e.length; s += 1)
+    if (!qt(e[s]))
       return !1;
   return !0;
 }
 function oe(t) {
   return t === void 0;
 }
-function kn(t) {
+function On(t) {
   var e;
-  return !!(W(t) || le(t) || pe(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && vt.includes((e = t.op) == null ? void 0 : e.value) && le(t.expression) || t instanceof K);
+  return !!(Y(t) || ce(t) || pe(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && ce(t.expression) || t instanceof K);
 }
-function le(t) {
+function ce(t) {
   var e;
-  return t instanceof D && t.expression instanceof de && ((e = t.expression.literal) == null ? void 0 : e.kind) === c.NUMERIC_LITERAL;
+  return t instanceof D && t.expression instanceof de && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
 }
-function Sn(t) {
-  var s;
-  if (!(t instanceof Q) || !yt((s = t.op) == null ? void 0 : s.value))
+function Dn(t) {
+  var n;
+  if (!(t instanceof Q) || !yt((n = t.op) == null ? void 0 : n.value))
     return !1;
-  const e = j(t.expression).unwrap_or(void 0);
+  const e = X(t.expression).unwrap_or(void 0);
   return e !== void 0 && e.length > 0;
 }
 function xt(t) {
   return t instanceof J && t.elementList.every(M);
 }
-function z(t) {
-  var n;
-  const e = {}, s = [];
+function W(t) {
+  var s;
+  const e = {}, n = [];
   if (!t)
-    return new B({});
+    return new V({});
   for (const i of t.elementList) {
     if (!i.name)
       continue;
     if (i.name instanceof D) {
-      s.push(new u(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
+      n.push(new l(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
-    const r = (n = De(i.name).unwrap_or(void 0)) == null ? void 0 : n.toLowerCase();
+    const r = (s = De(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 B(e, s);
+  return new V(e, n);
 }
 class ft {
-  constructor(e, s) {
-    this.ast = e, this.symbolFactory = s, this.publicSchemaSymbol = this.symbolFactory.create(_t, {
-      symbolTable: new ge()
+  constructor(e, n) {
+    this.ast = e, this.symbolFactory = n, this.publicSchemaSymbol = this.symbolFactory.create(_t, {
+      symbolTable: new _e()
     }), this.ast.symbol = this.publicSchemaSymbol, this.ast.symbol.declaration = this.ast;
   }
   validate() {
     const e = [];
-    this.ast.body.forEach((n) => {
-      if (n.parent = this.ast, n.type === void 0)
+    this.ast.body.forEach((s) => {
+      if (s.parent = this.ast, s.type === void 0)
         return;
-      const i = ie(n), r = new i(
-        n,
+      const i = ie(s), r = new i(
+        s,
         this.publicSchemaSymbol.symbolTable,
         this.symbolFactory
       );
       e.push(...r.validate());
     });
-    const s = this.ast.body.filter((n) => Ee(n).unwrap_or(void 0) === I.Project);
-    return s.length > 1 && s.forEach((n) => e.push(new u(o.PROJECT_REDEFINED, "Only one project can exist", n))), new B(this.ast, e);
+    const n = this.ast.body.filter((s) => Ee(s).unwrap_or(void 0) === I.Project);
+    return n.length > 1 && n.forEach((s) => e.push(new l(o.PROJECT_REDEFINED, "Only one project can exist", s))), new V(this.ast, e);
   }
 }
 class re {
-  constructor(e, s) {
-    this.declarationNode = e, this.errors = s;
+  constructor(e, n) {
+    this.declarationNode = e, this.errors = n;
   }
   bind() {
     this.bindSettingList(this.declarationNode.attributeList, this.settingList), this.bindBody();
   }
-  bindSettingList(e, s) {
+  bindSettingList(e, n) {
     if (e)
-      for (const n of e.elementList) {
-        if (n.name instanceof D)
+      for (const s of e.elementList) {
+        if (s.name instanceof D)
           continue;
-        const i = De(n.name).unwrap_or(void 0);
+        const i = De(s.name).unwrap_or(void 0);
         if (!i)
           continue;
-        const r = s[i.toLowerCase()];
-        r != null && r.shouldBind && this.scanAndBind(n.value, r);
+        const r = n[i.toLowerCase()];
+        r != null && r.shouldBind && this.scanAndBind(s.value, r);
       }
   }
   bindBody() {
     const e = this.declarationNode;
     if (!e.body)
       return;
-    const { body: s } = e;
-    if (s instanceof ee)
-      for (const n of s.body)
-        if (n instanceof _) {
-          if (!n.type)
+    const { body: n } = e;
+    if (n instanceof ee)
+      for (const s of n.body)
+        if (s instanceof _) {
+          if (!s.type)
             continue;
-          const i = kt(n);
-          new i(n, this.errors).bind();
+          const i = kt(s);
+          new i(s, this.errors).bind();
         } else
-          this.bindSubfield(n);
+          this.bindSubfield(s);
     else
-      this.bindSubfield(s);
+      this.bindSubfield(n);
   }
   bindSubfield(e) {
-    const s = [e.callee, ...e.args], n = L.last(s);
-    n instanceof U && (s.pop(), this.bindSettingList(n, this.subfield.settingList));
+    const n = [e.callee, ...e.args], s = L.last(n);
+    s instanceof U && (n.pop(), this.bindSettingList(s, this.subfield.settingList));
     const { argBinderRules: i } = this.subfield.arg;
-    for (let r = 0; r < Math.min(s.length, i.length); r += 1)
-      i[r].shouldBind && this.scanAndBind(s[r], i[r]);
+    for (let r = 0; r < Math.min(n.length, i.length); r += 1)
+      i[r].shouldBind && this.scanAndBind(n[r], i[r]);
   }
   // Scan for variable node and member access expression in the node to bind
-  scanAndBind(e, s) {
-    var n, i;
+  scanAndBind(e, n) {
+    var s, i;
     if (e)
       if (e instanceof D) {
-        if (e.expression instanceof $ && ((i = s.keywords) != null && i.includes((n = e.expression.variable) == null ? void 0 : n.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], s);
+        this.bindFragments([e], n);
       } else
-        e instanceof q ? He(e) ? this.bindFragments(Ne(e).unwrap_or([]), s) : (this.scanAndBind(e.leftExpression, s), this.scanAndBind(e.rightExpression, s)) : e instanceof Q ? this.scanAndBind(e.expression, s) : e instanceof Oe ? this.scanAndBind(e.expression, s) : e instanceof J && e.elementList.forEach((r) => this.scanAndBind(r, s));
+        e instanceof q ? He(e) ? this.bindFragments(Ne(e).unwrap_or([]), n) : (this.scanAndBind(e.leftExpression, n), this.scanAndBind(e.rightExpression, n)) : e instanceof Q ? this.scanAndBind(e.expression, n) : e instanceof Oe ? this.scanAndBind(e.expression, n) : e instanceof J && e.elementList.forEach((r) => this.scanAndBind(r, n));
   }
   // Bind the fragments of a member access expression
   // which can be a simple expression like v1.User,
   // or a complex tuple like v1.User.(id, name)
-  bindFragments(e, s) {
+  bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const n = [...s.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = s, r = e.findIndex((f) => !M(f)), l = r !== -1 && xt(e[r]) ? e[r] : void 0, p = r >= 0 ? n.pop() : void 0, h = e.slice(
+    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((f) => !M(f)), c = r !== -1 && xt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, h = e.slice(
       0,
       r === -1 ? void 0 : r
     );
     if (h.length === 0)
       return;
     const T = [];
-    for (; n.length && h.length; ) {
-      const f = n.pop(), N = h.pop(), b = G(N).unwrap();
+    for (; s.length && h.length; ) {
+      const f = s.pop(), N = h.pop(), b = C(N).unwrap();
       T.unshift({
         index: Fe(b, f),
         referrer: N
       });
     }
     for (; h.length; ) {
-      const f = h.pop(), N = G(f).unwrap();
+      const f = h.pop(), N = C(f).unwrap();
       T.unshift({
         index: Fe(N, i),
         referrer: f
       });
     }
-    return l ? l.elementList.forEach(
+    return c ? c.elementList.forEach(
       (f) => this.resolveIndexStack(
         [
           ...T,
           {
             index: Fe(
-              G(f).unwrap(),
+              C(f).unwrap(),
               p
             ),
             referrer: f
           }
         ],
-        s.ignoreNameNotFound
+        n.ignoreNameNotFound
       )
-    ) : this.resolveIndexStack(T, s.ignoreNameNotFound);
+    ) : this.resolveIndexStack(T, n.ignoreNameNotFound);
   }
   // Looking up the indexes in the subname stack from the current declaration node
   // Each time the index resolves to a symbol, the referrer's symbol is bound to it
-  resolveIndexStack(e, s) {
+  resolveIndexStack(e, n) {
     if (e.length === 0)
       throw new Error("Unreachable - An unresolved name must have at least one name component");
-    const [n, ...i] = e, r = Nn(n.index, this.declarationNode);
+    const [s, ...i] = e, r = Tn(s.index, this.declarationNode);
     if (r === void 0) {
-      const { kind: h, name: T } = se(n.index).unwrap();
-      this.logError(n.referrer, `Can not find ${h} '${T}'`, s);
+      const { kind: h, name: T } = se(s.index).unwrap();
+      this.logError(s.referrer, `Can not find ${h} '${T}'`, n);
       return;
     }
-    r.references.push(n.referrer), n.referrer.referee = r;
-    let a = r.symbolTable, { kind: l, name: p } = se(n.index).unwrap();
+    r.references.push(s.referrer), s.referrer.referee = r;
+    let a = r.symbolTable, { kind: c, name: p } = se(s.index).unwrap();
     for (const h of i) {
       const { kind: T, name: f } = se(h.index).unwrap(), N = a.get(h.index);
       if (!N) {
         this.logError(
           h.referrer,
-          `${l} '${p}' does not have ${T} '${f}'`,
-          s
+          `${c} '${p}' does not have ${T} '${f}'`,
+          n
         );
         return;
       }
-      if (l = T, p = f, h.referrer.referee = N, N.references.push(h.referrer), !N.symbolTable)
+      if (c = T, p = f, h.referrer.referee = N, N.references.push(h.referrer), !N.symbolTable)
         break;
       a = N.symbolTable;
     }
   }
-  logError(e, s, n) {
-    n || this.errors.push(new u(o.BINDING_ERROR, s, e));
+  logError(e, n, s) {
+    s || this.errors.push(new l(o.BINDING_ERROR, n, e));
   }
 }
-class On extends re {
+class Rn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2652,7 +2663,7 @@ class On extends re {
     }, this.settingList = {};
   }
 }
-class Dn extends re {
+class Pn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2662,7 +2673,7 @@ class Dn extends re {
     }, this.settingList = {};
   }
 }
-class Rn extends re {
+class Un extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2697,7 +2708,7 @@ class Rn extends re {
     }, this.settingList = {};
   }
 }
-class Pn extends re {
+class Mn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2707,7 +2718,7 @@ class Pn extends re {
     }, this.settingList = {};
   }
 }
-class Un extends re {
+class Fn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2717,7 +2728,7 @@ class Un extends re {
     }, this.settingList = {};
   }
 }
-class Mn extends re {
+class Bn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2734,7 +2745,7 @@ class Mn extends re {
     }, this.settingList = {};
   }
 }
-class Fn extends re {
+class Vn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2762,7 +2773,7 @@ class Fn extends re {
     }, this.settingList = {};
   }
 }
-class Bn extends re {
+class Gn extends re {
   constructor() {
     super(...arguments), this.subfield = {
       arg: {
@@ -2782,75 +2793,75 @@ class Bn extends re {
 function kt(t) {
   switch (t.type.value.toLowerCase()) {
     case I.Enum:
-      return Dn;
+      return Pn;
     case I.Table:
-      return Fn;
+      return Vn;
     case I.TableGroup:
-      return Bn;
+      return Gn;
     case I.Project:
-      return Un;
+      return Fn;
     case I.Ref:
-      return Mn;
+      return Bn;
     case I.Note:
-      return Pn;
+      return Mn;
     case I.Indexes:
-      return Rn;
+      return Un;
     default:
-      return On;
+      return Rn;
   }
 }
-class Vn {
+class Cn {
   constructor(e) {
     this.ast = e, this.errors = [];
   }
   resolve() {
     for (const e of this.ast.body)
       if (e.type) {
-        const s = kt(e);
-        new s(e, this.errors).bind();
+        const n = kt(e);
+        new n(e, this.errors).bind();
       }
-    return new B(this.ast, this.errors);
+    return new V(this.ast, this.errors);
   }
 }
-class Gn {
+class Xn {
   constructor(e) {
     this.generator = e;
   }
-  create(e, s) {
-    return new e(s, this.generator.nextId());
+  create(e, n) {
+    return new e(n, this.generator.nextId());
   }
 }
-class Cn {
-  constructor(e, s) {
-    this.ast = e, this.symbolFactory = new Gn(s);
+class $n {
+  constructor(e, n) {
+    this.ast = e, this.symbolFactory = new Xn(n);
   }
   // Analyzing: Invoking both the validator and binder
   analyze() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((s) => new Vn(s).resolve());
+    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new Cn(n).resolve());
   }
   // For invoking the validator only
   validate() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((s) => new B(s, []));
+    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new V(n, []));
   }
 }
 function pt(t, e) {
-  const { variables: s, tupleElements: n } = Ie(t).unwrap();
-  return n ? s.length === 0 ? {
+  const { variables: n, tupleElements: s } = Le(t).unwrap();
+  return s ? n.length === 0 ? {
     schemaName: e.schemaName,
     tableName: e.name,
-    fieldNames: n
+    fieldNames: s
   } : {
-    tableName: s.pop(),
-    schemaName: s.pop() || null,
-    fieldNames: n
-  } : s.length === 1 ? {
+    tableName: n.pop(),
+    schemaName: n.pop() || null,
+    fieldNames: s
+  } : n.length === 1 ? {
     schemaName: e.schemaName,
     tableName: e.name,
-    fieldNames: [s[0]]
+    fieldNames: [n[0]]
   } : {
-    fieldNames: [s.pop()],
-    tableName: s.pop(),
-    schemaName: s.pop() || null
+    fieldNames: [n.pop()],
+    tableName: n.pop(),
+    schemaName: n.pop() || null
   };
 }
 function St(t) {
@@ -2877,88 +2888,88 @@ function x(t) {
   };
 }
 function Ce(t) {
-  var s;
-  const e = (s = Ne(t).unwrap_or(void 0)) == null ? void 0 : s.pop();
-  return e instanceof J ? e.elementList.map((n) => n.referee) : [e.referee];
+  var n;
+  const e = (n = Ne(t).unwrap_or(void 0)) == null ? void 0 : n.pop();
+  return e instanceof J ? e.elementList.map((s) => s.referee) : [e.referee];
 }
 function ue(t) {
   return t.split(`
 `).map((e) => e.trim()).join(`
 `);
 }
-function _e(t) {
-  const e = j(t).unwrap();
+function me(t) {
+  const e = X(t).unwrap();
   return {
     name: e.pop(),
     schemaName: e
   };
 }
-function Xn(t) {
+function Ot(t) {
   return t.expression.literal.value;
 }
-function Ot(t, e) {
+function Dt(t, e) {
   if (Array.isArray(t)) {
     const i = t.map(({ id: a }) => a).sort().join(","), r = e.map(({ id: a }) => a).sort().join(",");
     return i < r ? `${i}-${r}` : `${i}-${r}`;
   }
-  const s = t.id, n = e.id;
-  return s < n ? `${s}-${n}` : `${n}-${s}`;
+  const n = t.id, s = e.id;
+  return n < s ? `${n}-${s}` : `${s}-${n}`;
 }
-function Dt(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 L.zip(i, r).every(([a, l]) => a === l);
+    return L.zip(i, r).every(([a, c]) => a === c);
   }
-  const s = t.id, n = e.id;
-  return s === n;
+  const n = t.id, s = e.id;
+  return n === s;
 }
 class Ke {
-  constructor(e, s) {
-    this.declarationNode = e, this.env = s, this.container = this.declarationNode.parent instanceof _ ? this.env.tables.get(this.declarationNode.parent) : void 0, this.ref = {};
+  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 = {};
   }
   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 s = [], n = j(this.declarationNode.name).unwrap_or([]);
-    return this.ref.name = n.pop() || null, n.length > 1 && s.push(new u(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = n.join(".") || null, s;
+    const n = [], s = X(this.declarationNode.name).unwrap_or([]);
+    return this.ref.name = s.pop() || null, s.length > 1 && n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name)), this.ref.schemaName = s.join(".") || null, n;
   }
   interpretBody(e) {
-    return e instanceof y ? this.interpretField(e) : this.interpretField(e.body[0]);
+    return e instanceof v ? this.interpretField(e) : this.interpretField(e.body[0]);
   }
   interpretField(e) {
     var h, T, f, N;
-    const s = e.callee.op.value, { leftExpression: n, rightExpression: i } = e.callee, r = Ce(n), a = Ce(i);
-    if (Dt(r, a))
-      return [new u(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
-    const l = Ot(r, a);
-    if (this.env.refIds[l])
+    const n = e.callee.op.value, { leftExpression: s, rightExpression: i } = e.callee, r = Ce(s), a = Ce(i);
+    if (Rt(r, a))
+      return [new l(o.SAME_ENDPOINT, "Two endpoints are the same", e)];
+    const c = Dt(r, a);
+    if (this.env.refIds[c])
       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 l(o.CIRCULAR_REF, "References with same endpoints exist", this.declarationNode),
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[c])
       ];
     if (e.args[0]) {
-      const b = z(e.args[0]).getValue();
-      this.ref.onDelete = C((T = (h = b.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value).unwrap_or(void 0), this.ref.onDelete = C((N = (f = b.delete) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
+      const b = W(e.args[0]).getValue();
+      this.ref.onDelete = $((T = (h = b.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value).unwrap_or(void 0), this.ref.onDelete = $((N = (f = b.delete) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
     }
-    const p = St(s);
+    const p = St(n);
     return this.ref.endpoints = [
       {
-        ...pt(n, this.container),
+        ...pt(s, this.container),
         relation: p[0],
-        token: x(n)
+        token: x(s)
       },
       {
         ...pt(i, this.container),
         relation: p[1],
         token: x(i)
       }
-    ], this.env.refIds[l] = this.declarationNode, [];
+    ], this.env.refIds[c] = this.declarationNode, [];
   }
 }
-class Rt {
-  constructor(e, s) {
-    this.declarationNode = e, this.env = s, this.table = { name: void 0, schemaName: void 0, alias: null, fields: [], token: void 0, indexes: [] }, this.pkColumns = [];
+class Pt {
+  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 = [];
   }
   interpret() {
     this.table.token = x(this.declarationNode), this.env.tables.set(this.declarationNode, this.table);
@@ -2969,7 +2980,7 @@ class Rt {
       ...this.interpretBody(this.declarationNode.body)
     ];
     return this.pkColumns.length >= 2 && (this.table.indexes.push({
-      columns: this.pkColumns.map(({ name: s }) => ({ value: s, type: "column" })),
+      columns: this.pkColumns.map(({ name: n }) => ({ value: n, type: "column" })),
       token: {
         start: { offset: -1, line: -1, column: -1 },
         // do not make sense to have a meaningful start (?)
@@ -2977,84 +2988,84 @@ class Rt {
         // do not make sense to have a meaningful end (?)
       },
       pk: !0
-    }), this.pkColumns.forEach((s) => s.pk = !1)), e;
+    }), this.pkColumns.forEach((n) => n.pk = !1)), e;
   }
   interpretName(e) {
-    const { name: s, schemaName: n } = _e(e);
-    return n.length > 1 ? (this.table.name = s, this.table.schemaName = n.join("."), [new u(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = s, this.table.schemaName = n.length ? n[0] : null, []);
+    const { name: n, schemaName: s } = me(e);
+    return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
   }
   interpretAlias(e) {
     if (!e)
       return [];
-    const s = G(e).unwrap_or(null);
-    return s && (this.env.aliases.push({
-      name: s,
+    const n = C(e).unwrap_or(null);
+    return n && (this.env.aliases.push({
+      name: n,
       kind: "table",
       value: {
         tableName: this.table.name,
         schemaName: this.table.schemaName
       }
-    }), this.table.alias = s), [];
+    }), this.table.alias = n), [];
   }
   interpretSettingList(e) {
-    var r, a, l;
-    const s = z(e).getValue();
-    this.table.headerColor = (r = s.headercolor) != null && r.length ? Xn((l = (a = s.headercolor) == null ? void 0 : a.at(0)) == null ? void 0 : l.value) : void 0;
-    const [n] = s.note || [], i = Y(n == null ? void 0 : n.value).unwrap_or(void 0);
-    return this.table.note = n && {
+    var r, a, c;
+    const n = W(e).getValue();
+    this.table.headerColor = (r = n.headercolor) != null && r.length ? Ot((c = (a = n.headercolor) == null ? void 0 : a.at(0)) == null ? void 0 : c.value) : void 0;
+    const [s] = n.note || [], i = z(s == null ? void 0 : s.value).unwrap_or(void 0);
+    return this.table.note = s && {
       value: ue(i),
-      token: x(n)
+      token: x(s)
     }, [];
   }
   interpretBody(e) {
-    const [s, n] = L.partition(e.body, (i) => i instanceof y);
-    return [...this.interpretFields(s), ...this.interpretSubElements(n)];
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    return [...this.interpretFields(n), ...this.interpretSubElements(s)];
   }
   interpretSubElements(e) {
-    return e.flatMap((s) => {
-      var n;
-      switch ((n = s.type) == null ? void 0 : n.value.toLowerCase()) {
+    return e.flatMap((n) => {
+      var s;
+      switch ((s = n.type) == null ? void 0 : s.value.toLowerCase()) {
         case "note":
           return this.table.note = {
-            value: ue(Y(s.body instanceof ee ? s.body.body[0].callee : s.body.callee).unwrap()),
-            token: x(s)
+            value: ue(z(n.body instanceof ee ? n.body.body[0].callee : n.body.callee).unwrap()),
+            token: x(n)
           }, [];
         case "indexes":
-          return this.interpretIndexes(s);
+          return this.interpretIndexes(n);
         case "ref":
-          return new Ke(s, this.env).interpret();
+          return new Ke(n, this.env).interpret();
       }
       return [];
     });
   }
   interpretFields(e) {
-    return e.flatMap((s) => this.interpretColumn(s));
+    return e.flatMap((n) => this.interpretColumn(n));
   }
   interpretColumn(e) {
-    var a, l, p, h, T, f, N;
-    const s = [], n = {};
-    n.name = G(e.callee).unwrap();
-    const i = $n(e.args[0]);
-    n.type = i.getValue(), s.push(...i.getErrors()), n.token = x(e), n.inline_refs = [];
+    var a, c, p, h, T, f, N;
+    const n = [], s = {};
+    s.name = C(e.callee).unwrap();
+    const i = Wn(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 (L.last(r) instanceof U) {
-      const b = z(r.pop()).getValue();
-      n.pk = !!((a = b.pk) != null && a.length), n.increment = !!((l = b.increment) != null && l.length), n.unique = !!((p = b.unique) != null && p.length), n.not_null = !!((h = b["not null"]) != null && h.length) && !0, n.dbdefault = Wn((f = (T = b.default) == null ? void 0 : T.at(0)) == null ? void 0 : f.value);
+      const b = W(r.pop()).getValue();
+      s.pk = !!((a = b.pk) != null && a.length), s.increment = !!((c = b.increment) != null && c.length), s.unique = !!((p = b.unique) != null && p.length), s.not_null = !!((h = b["not null"]) != null && h.length) && !0, s.dbdefault = jn((f = (T = b.default) == null ? void 0 : T.at(0)) == null ? void 0 : f.value);
       const F = (N = b.note) == null ? void 0 : N.at(0);
-      n.note = F && {
-        value: ue(Y(F.value).unwrap()),
+      s.note = F && {
+        value: ue(z(F.value).unwrap()),
         token: x(F)
       };
       const Me = b.ref || [];
-      n.inline_refs = Me.flatMap((R) => {
+      s.inline_refs = Me.flatMap((R) => {
         const [nt] = Ce(R.value.expression);
-        if (Dt(nt, e.symbol))
-          return s.push(new u(o.SAME_ENDPOINT, "Two endpoints are the same", R)), [];
-        const Ae = R.value.op, Z = j(R.value.expression).unwrap();
-        let ce;
+        if (Rt(nt, e.symbol))
+          return n.push(new l(o.SAME_ENDPOINT, "Two endpoints are the same", R)), [];
+        const Ae = R.value.op, Z = X(R.value.expression).unwrap();
+        let le;
         if (Z.length === 1) {
           const [ae] = Z;
-          ce = {
+          le = {
             schemaName: this.table.schemaName,
             tableName: this.table.name,
             fieldNames: [ae],
@@ -3062,54 +3073,54 @@ class Rt {
             token: x(R)
           };
         } else if (Z.length === 2) {
-          const [ae, me] = Z;
-          ce = {
+          const [ae, Te] = Z;
+          le = {
             schemaName: null,
             tableName: ae,
-            fieldNames: [me],
+            fieldNames: [Te],
             relation: Ae.value,
             token: x(R)
           };
         } else if (Z.length === 3) {
-          const [ae, me, it] = Z;
-          ce = {
+          const [ae, Te, it] = Z;
+          le = {
             schemaName: ae,
-            tableName: me,
+            tableName: Te,
             fieldNames: [it],
             relation: Ae.value,
             token: x(R)
           };
         } else {
-          s.push(new u(o.UNSUPPORTED, "Nested schema is not supported", R));
-          const ae = Z.pop(), me = Z.pop();
-          ce = {
+          n.push(new l(o.UNSUPPORTED, "Nested schema is not supported", R));
+          const ae = Z.pop(), Te = Z.pop();
+          le = {
             schemaName: Z.join("."),
-            tableName: me,
+            tableName: Te,
             fieldNames: [ae],
             relation: Ae.value,
             token: x(R)
           };
         }
-        const st = this.registerInlineRefToEnv(e, nt, ce, R);
-        return s.push(...st), st.length === 0 ? ce : [];
+        const st = this.registerInlineRefToEnv(e, nt, le, R);
+        return n.push(...st), st.length === 0 ? le : [];
       });
     }
-    return n.pk || (n.pk = r.some((b) => C(b).unwrap().toLowerCase() === "pk")), n.unique || (n.unique = r.some((b) => C(b).unwrap().toLowerCase() === "unique")), this.table.fields.push(n), n.pk && this.pkColumns.push(n), s;
+    return s.pk || (s.pk = r.some((b) => $(b).unwrap().toLowerCase() === "pk")), s.unique || (s.unique = r.some((b) => $(b).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((s) => {
-      var a, l, p, h, T, f, N;
-      const n = { columns: [] }, i = s;
-      n.token = x(e);
+    return this.table.indexes.push(...e.body.body.map((n) => {
+      var a, c, p, h, T, f, N;
+      const s = { columns: [] }, i = n;
+      s.token = x(e);
       const r = [i.callee, ...i.args];
       if (L.last(r) instanceof U) {
-        const b = z(r.pop()).getValue();
-        n.pk = !!((a = b.pk) != null && a.length), n.unique = !!((l = b.unique) != null && l.length), n.name = Y((h = (p = b.name) == null ? void 0 : p.at(0)) == null ? void 0 : h.value).unwrap_or(void 0);
+        const b = W(r.pop()).getValue();
+        s.pk = !!((a = b.pk) != null && a.length), s.unique = !!((c = b.unique) != null && c.length), s.name = z((h = (p = b.name) == null ? void 0 : p.at(0)) == null ? void 0 : h.value).unwrap_or(void 0);
         const F = (T = b.note) == null ? void 0 : T.at(0);
-        n.note = F && {
-          value: ue(Y(F.value).unwrap()),
+        s.note = F && {
+          value: ue(z(F.value).unwrap()),
           token: x(F)
-        }, n.type = C((N = (f = b.type) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
+        }, s.type = $((N = (f = b.type) == null ? void 0 : f.at(0)) == null ? void 0 : N.value).unwrap_or(void 0);
       }
       return r.flatMap((b) => {
         if (!(b instanceof H))
@@ -3120,76 +3131,76 @@ class Rt {
         return F.push(b), F;
       }).forEach((b) => {
         const { functional: F, nonFunctional: Me } = Ge(b).unwrap();
-        n.columns.push(
+        s.columns.push(
           ...F.map((R) => ({
             value: R.value.value,
             type: "expression"
           })),
           ...Me.map((R) => ({
-            value: G(R).unwrap(),
+            value: C(R).unwrap(),
             type: "column"
           }))
         );
-      }), n;
+      }), s;
     })), [];
   }
-  registerInlineRefToEnv(e, s, n, i) {
-    const r = Ot(e.symbol, s);
+  registerInlineRefToEnv(e, n, s, i) {
+    const r = Dt(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 l(o.CIRCULAR_REF, "References with same endpoints exist", i),
+        new l(o.CIRCULAR_REF, "References with same endpoints exist", this.env.refIds[r])
       ];
-    const a = St(n.relation);
+    const a = St(s.relation);
     return this.env.refIds[r] = i, this.env.ref.set(i, {
       name: null,
       schemaName: null,
-      token: n.token,
+      token: s.token,
       endpoints: [
         {
           schemaName: this.table.schemaName,
           tableName: this.table.name,
-          fieldNames: [C(e.callee).unwrap()],
+          fieldNames: [$(e.callee).unwrap()],
           token: x(e),
           relation: a[0]
         },
         {
-          ...n,
+          ...s,
           relation: a[1]
         }
       ]
     }), [];
   }
 }
-function $n(t) {
+function Wn(t) {
   let e = null;
-  t instanceof H && (e = t.argumentList.elementList.map((r) => le(r) ? r.expression.literal.value : W(r) ? Y(r).unwrap() : C(r).unwrap()).join(","), t = t.callee);
-  let s = "";
+  t instanceof H && (e = t.argumentList.elementList.map((r) => ce(r) ? r.expression.literal.value : Y(r) ? z(r).unwrap() : $(r).unwrap()).join(","), t = t.callee);
+  let n = "";
   for (; t instanceof fe; )
-    s = `[${t.indexer.elementList.map((r) => r.name.expression.literal.value).join(",")}]${s}`, t = t.array;
-  const { name: n, schemaName: i } = _e(t);
-  return i.length > 1 && new B(
+    n = `[${t.indexer.elementList.map((r) => r.name.expression.literal.value).join(",")}]${n}`, t = t.array;
+  const { name: s, schemaName: i } = me(t);
+  return i.length > 1 && new V(
     {
       schemaName: i.length === 0 ? null : i[0],
-      type_name: `${n}${s}${e ? `(${e})` : ""}`,
+      type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
-    [new u(o.UNSUPPORTED, "Nested schema is not supported", t)]
-  ), new B({
+    [new l(o.UNSUPPORTED, "Nested schema is not supported", t)]
+  ), new V({
     schemaName: i.length === 0 ? null : i[0],
-    type_name: `${n}${s}${e ? `(${e})` : ""}`,
+    type_name: `${s}${n}${e ? `(${e})` : ""}`,
     args: e
   });
 }
-function Wn(t) {
-  var e, s, n;
+function jn(t) {
+  var e, n, s;
   if (t) {
-    if (W(t))
+    if (Y(t))
       return {
-        value: Y(t).unwrap(),
+        value: z(t).unwrap(),
         type: "string"
       };
-    if (le(t))
+    if (ce(t))
       return {
         type: "number",
         value: Number.parseFloat(t.expression.literal.value)
@@ -3199,65 +3210,96 @@ function Wn(t) {
         value: t.expression.variable.value.toLowerCase(),
         type: "boolean"
       };
-    if (t instanceof Q && vt.includes((e = t.op) == null ? void 0 : e.value) && le(t.expression)) {
+    if (t instanceof Q && wt.includes((e = t.op) == null ? void 0 : e.value) && ce(t.expression)) {
       const i = Number.parseFloat(t.expression.expression.literal.value);
       return {
-        value: ((s = t.op) == null ? void 0 : s.value) === "-" ? 0 - i : i,
+        value: ((n = t.op) == null ? void 0 : n.value) === "-" ? 0 - i : i,
         type: "number"
       };
     }
     if (t instanceof K)
       return {
-        value: (n = t.value) == null ? void 0 : n.value,
+        value: (s = t.value) == null ? void 0 : s.value,
         type: "expression"
       };
     throw new Error("Unreachable");
   }
 }
-class Pt {
-  constructor(e, s) {
-    this.declarationNode = e, this.env = s, this.tableGroup = { tables: [] };
+class Yn {
+  constructor(e, n) {
+    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 } = me(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 ? Ot((r = (i = n.headercolor) == null ? void 0 : i.at(0)) == null ? void 0 : r.value) : void 0, [];
+  }
+  interpretBody(e) {
+    const [n, s] = L.partition(e.body, (i) => i instanceof v);
+    return n.length !== 1 || s.length > 0 ? [
+      new l(o.INVALID_NOTE, "Invalid note syntax", e)
+    ] : [...this.interpretNote(n[0])];
+  }
+  interpretNote(e) {
+    const n = L.get(e, "callee.expression.literal.value", "");
+    return this.note.content = n, [];
+  }
+}
+class Ut {
+  constructor(e, n) {
+    this.declarationNode = e, this.env = n, this.tableGroup = { tables: [] };
   }
   interpret() {
     const e = [];
     this.tableGroup.token = x(this.declarationNode), this.env.tableGroups.set(this.declarationNode, this.tableGroup);
-    const { name: s, schemaName: n } = _e(this.declarationNode.name);
-    return n.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = n.join("."), e.push(new u(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = n[0] || null, this.tableGroup.tables = this.declarationNode.body.body.map((i) => {
-      const r = j(i.callee).unwrap();
-      return r.length > 2 && e.push(new u(o.UNSUPPORTED, "Nested schema is not supported", i)), {
+    const { name: n, schemaName: s } = me(this.declarationNode.name);
+    return s.length >= 2 && (this.tableGroup.name = n, this.tableGroup.schemaName = s.join("."), e.push(new l(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = n, this.tableGroup.schemaName = s[0] || null, this.tableGroup.tables = this.declarationNode.body.body.map((i) => {
+      const r = X(i.callee).unwrap();
+      return r.length > 2 && e.push(new l(o.UNSUPPORTED, "Nested schema is not supported", i)), {
         name: r.pop(),
         schemaName: r.join(".")
       };
     }), e;
   }
 }
-class Ut {
-  constructor(e, s) {
-    this.declarationNode = e, this.env = s, this.enum = { values: [] };
+class Mt {
+  constructor(e, n) {
+    this.declarationNode = e, this.env = n, this.enum = { values: [] };
   }
   interpret() {
     return this.enum.token = x(this.declarationNode), this.env.enums.set(this.declarationNode, this.enum), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
   }
   interpretName(e) {
-    const { name: s, schemaName: n } = _e(e);
-    return n.length > 1 ? (this.enum.name = s, this.enum.schemaName = n.join("."), [new u(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = s, this.enum.schemaName = n.length ? n[0] : null, []);
+    const { name: n, schemaName: s } = me(e);
+    return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new l(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
   }
   interpretBody(e) {
-    return e.body.flatMap((s) => {
-      var l;
-      const n = s, i = {};
-      i.token = x(n), i.name = C(n.callee).unwrap();
-      const a = (l = z(n.args[0]).getValue().note) == null ? void 0 : l.at(0);
+    return e.body.flatMap((n) => {
+      var c;
+      const s = n, i = {};
+      i.token = x(s), i.name = $(s.callee).unwrap();
+      const a = (c = W(s.args[0]).getValue().note) == null ? void 0 : c.at(0);
       return i.note = a && {
-        value: ue(Y(a.value).unwrap()),
+        value: ue(z(a.value).unwrap()),
         token: x(a)
       }, this.enum.values.push(i), [];
     });
   }
 }
-class jn {
-  constructor(e, s) {
-    this.declarationNode = e, this.env = s, this.project = { enums: [], refs: [], tableGroups: [], tables: [] };
+class zn {
+  constructor(e, n) {
+    this.declarationNode = e, this.env = n, this.project = { enums: [], refs: [], tableGroups: [], tables: [] };
   }
   interpret() {
     return this.env.project.set(this.declarationNode, this.project), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
@@ -3265,46 +3307,47 @@ class jn {
   interpretName(e) {
     if (!e)
       return this.project.name = null, [];
-    const { name: s } = _e(e);
-    return this.project.name = s, [];
+    const { name: n } = me(e);
+    return this.project.name = n, [];
   }
   interpretBody(e) {
-    return e.body.flatMap((s) => {
+    return e.body.flatMap((n) => {
       var i;
-      const n = s;
-      switch ((i = n.type) == null ? void 0 : i.value.toLowerCase()) {
+      const s = n;
+      switch ((i = s.type) == null ? void 0 : i.value.toLowerCase()) {
         case "table": {
-          const r = new Rt(n, this.env).interpret();
-          return this.project.tables.push(this.env.tables.get(n)), r;
+          const r = new Pt(s, this.env).interpret();
+          return this.project.tables.push(this.env.tables.get(s)), r;
         }
         case "ref": {
-          const r = new Ke(n, this.env).interpret();
-          return this.project.refs.push(this.env.ref.get(n)), r;
+          const r = new Ke(s, this.env).interpret();
+          return this.project.refs.push(this.env.ref.get(s)), r;
         }
         case "tablegroup": {
-          const r = new Pt(n, this.env).interpret();
-          return this.project.tableGroups.push(this.env.tableGroups.get(n)), r;
+          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(n, this.env).interpret();
-          return this.project.enums.push(this.env.enums.get(n)), r;
+          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: ue(Y(n.body instanceof ee ? n.body.body[0].callee : n.body.callee).unwrap()),
-            token: x(n)
+            value: ue(z(s.body instanceof ee ? s.body.body[0].callee : s.body.callee).unwrap()),
+            token: x(s)
           }, [];
         default:
-          return this.project[n.type.value.toLowerCase()] = Y(n.body.callee).unwrap(), [];
+          return this.project[s.type.value.toLowerCase()] = z(s.body.callee).unwrap(), [];
       }
     });
   }
 }
-class Yn {
+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(),
@@ -3314,29 +3357,32 @@ class Yn {
     };
   }
   interpret() {
-    const e = this.ast.body.flatMap((s) => {
-      switch (Ee(s).unwrap_or(void 0)) {
+    const e = this.ast.body.flatMap((n) => {
+      switch (Ee(n).unwrap_or(void 0)) {
         case I.Table:
-          return new Rt(s, this.env).interpret();
+          return new Pt(n, this.env).interpret();
+        case I.Note:
+          return new Yn(n, this.env).interpret();
         case I.Ref:
-          return new Ke(s, this.env).interpret();
+          return new Ke(n, this.env).interpret();
         case I.TableGroup:
-          return new Pt(s, this.env).interpret();
+          return new Ut(n, this.env).interpret();
         case I.Enum:
-          return new Ut(s, this.env).interpret();
+          return new Mt(n, this.env).interpret();
         case I.Project:
-          return new jn(s, this.env).interpret();
+          return new zn(n, this.env).interpret();
         default:
           return [];
       }
     });
-    return new B(zn(this.env), e);
+    return new V(qn(this.env), e);
   }
 }
-function zn(t) {
+function qn(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()),
@@ -3345,7 +3391,7 @@ function zn(t) {
   };
 }
 var g = /* @__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))(g || {}), w = /* @__PURE__ */ ((t) => (t[t.None = 0] = "None", t[t.KeepWhitespace = 1] = "KeepWhitespace", t[t.InsertAsSnippet = 4] = "InsertAsSnippet", t))(w || {});
-function Le(t) {
+function ge(t) {
   switch (t) {
     case m.Schema:
       return g.Module;
@@ -3368,10 +3414,10 @@ function Le(t) {
 function ke(t, e) {
   if (!t || Ve(t))
     return !1;
-  for (const s of t.trailingTrivia) {
-    if (s.start > e)
+  for (const n of t.trailingTrivia) {
+    if (n.start > e)
       break;
-    if (s.kind === c.NEWLINE && s.end <= e)
+    if (n.kind === u.NEWLINE && n.end <= e)
       return !1;
   }
   return !0;
@@ -3402,27 +3448,27 @@ function Pe(t) {
 function et(t, e) {
   return t.getOffsetAt(e);
 }
-class Mt {
-  constructor(e, s = []) {
-    this.compiler = e, this.triggerCharacters = s;
+class Ft {
+  constructor(e, n = []) {
+    this.compiler = e, this.triggerCharacters = n;
   }
-  provideCompletionItems(e, s) {
+  provideCompletionItems(e, n) {
     var T, f;
-    const n = et(e, s), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(n), l = a === void 0 ? i[0] : i[a + 1];
+    const s = et(e, n), i = this.compiler.token.flatStream(), { token: r, index: a } = this.compiler.container.token(s), c = a === void 0 ? i[0] : i[a + 1];
     if ([
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
-      ...(l == null ? void 0 : l.leadingTrivia) || []
-    ].find((N) => $t(N) && be(n, N)))
+      ...(c == null ? void 0 : c.leadingTrivia) || []
+    ].find((N) => Wt(N) && Ie(s, N)))
       return S();
     if (a === void 0)
       return Tt();
-    if ([c.STRING_LITERAL, c.QUOTED_STRING].includes(r.kind) && be(n, r))
+    if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && Ie(s, r))
       return S();
-    const p = this.compiler.container.element(n);
-    if (this.compiler.container.scopeKind(n) === O.TOPLEVEL || p instanceof _ && p.type && p.type.start <= n && p.type.end >= n)
+    const p = this.compiler.container.element(s);
+    if (this.compiler.container.scopeKind(s) === O.TOPLEVEL || p instanceof _ && p.type && p.type.start <= s && p.type.end >= s)
       return Tt();
-    const h = [...this.compiler.container.stack(n)].reverse();
+    const h = [...this.compiler.container.stack(s)].reverse();
     for (const N of h)
       if (N instanceof Q)
         switch ((T = N.op) == null ? void 0 : T.value) {
@@ -3432,7 +3478,7 @@ class Mt {
           case "-":
             return dt(
               this.compiler,
-              n,
+              s,
               N
             );
         }
@@ -3444,59 +3490,59 @@ class Mt {
           case "-":
             return dt(
               this.compiler,
-              n,
+              s,
               N
             );
           case ".":
-            return Ft(
+            return Bt(
               this.compiler,
-              n,
+              s,
               N
             );
         }
       else {
         if (N instanceof ne)
-          return Et(this.compiler, n, N);
+          return Et(this.compiler, s, N);
         if (N instanceof U)
-          return Et(this.compiler, n, N);
+          return Et(this.compiler, s, N);
         if (N instanceof J)
-          return Qn(this.compiler, n);
-        if (N instanceof y)
-          return mt(this.compiler, n, N);
-        if (N instanceof _ && (N.bodyColon && n >= N.bodyColon.end || N.body && be(n, N.body)))
-          return mt(this.compiler, n, void 0);
+          return Hn(this.compiler, s);
+        if (N instanceof v)
+          return mt(this.compiler, s, N);
+        if (N instanceof _ && (N.bodyColon && s >= N.bodyColon.end || N.body && Ie(s, N.body)))
+          return mt(this.compiler, s, void 0);
       }
     return S();
   }
 }
-function dt(t, e, s) {
-  const n = t.container.scopeKind(e);
-  if ([O.REF, O.TABLE].includes(n)) {
+function dt(t, e, n) {
+  const s = t.container.scopeKind(e);
+  if ([O.REF, O.TABLE].includes(s)) {
     const i = Ue(t, e, t.container.element(e), [
       m.Table,
       m.Schema,
       m.Column
     ]);
-    return ke(s.op, e) ? Se(i) : i;
+    return ke(n.op, e) ? Se(i) : i;
   }
   return S();
 }
-function Ue(t, e, s, n) {
+function Ue(t, e, n, s) {
   var a;
-  if (s === void 0)
+  if (n === void 0)
     return S();
-  let i = s;
+  let i = n;
   const r = { suggestions: [] };
   for (; i; ) {
     if ((a = i == null ? void 0 : i.symbol) != null && a.symbolTable) {
-      const { symbol: l } = i;
+      const { symbol: c } = i;
       r.suggestions.push(
-        ...t.symbol.members(l).filter(({ kind: p }) => n.includes(p)).map(({ name: p, kind: h }) => ({
+        ...t.symbol.members(c).filter(({ kind: p }) => s.includes(p)).map(({ name: p, kind: h }) => ({
           label: p,
           insertText: p,
           insertTextRules: w.KeepWhitespace,
-          kind: Le(h),
-          sortText: Le(h).toString().padStart(2, "0"),
+          kind: ge(h),
+          sortText: ge(h).toString().padStart(2, "0"),
           range: void 0
         }))
       );
@@ -3505,52 +3551,52 @@ function Ue(t, e, s, n) {
   }
   return Pe(r);
 }
-function Qn(t, e) {
-  var n;
+function Hn(t, e) {
+  var s;
   switch (t.container.scopeKind(e)) {
     case O.INDEXES:
-      return Vt(t, e);
+      return Gt(t, e);
     case O.REF:
       {
         const i = [...t.container.stack(e)];
         for (; i.length > 0; ) {
           const r = i.pop();
-          if (r instanceof q && ((n = r.op) == null ? void 0 : n.value) === ".")
-            return Ft(
+          if (r instanceof q && ((s = r.op) == null ? void 0 : s.value) === ".")
+            return Bt(
               t,
               e,
               r
             );
         }
       }
-      return Bt(t, e);
+      return Vt(t, e);
   }
   return S();
 }
-function Et(t, e, s) {
-  const { token: n } = t.container.token(e);
-  if ([c.COMMA, c.LBRACKET].includes(n == null ? void 0 : n.kind)) {
+function Et(t, e, n) {
+  const { token: s } = t.container.token(e);
+  if ([u.COMMA, u.LBRACKET].includes(s == null ? void 0 : s.kind)) {
     const i = Nt(t, e);
-    return (n == null ? void 0 : n.kind) === c.COMMA && ke(n, e) ? Se(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COMMA && ke(s, e) ? Se(i) : i;
   }
-  if (s.name && s.name.start <= e && s.name.end >= e)
+  if (n.name && n.name.start <= e && n.name.end >= e)
     return Nt(t, e);
-  if (s.name) {
-    const i = qn(
+  if (n.name) {
+    const i = Jn(
       t,
       e,
-      De(s.name).unwrap()
+      De(n.name).unwrap()
     );
-    return (n == null ? void 0 : n.kind) === c.COLON && ke(n, e) ? Se(i) : i;
+    return (s == null ? void 0 : s.kind) === u.COLON && ke(s, e) ? Se(i) : i;
   }
   return S();
 }
 function Nt(t, e) {
-  const s = t.container.element(e), n = t.container.scopeKind(e);
-  if (s instanceof X)
+  const n = t.container.element(e), s = t.container.scopeKind(e);
+  if (n instanceof B)
     return S();
-  if (s.body && !be(e, s.body))
-    switch (n) {
+  if (n.body && !Ie(e, n.body))
+    switch (s) {
       case O.TABLE:
         return {
           suggestions: [
@@ -3573,7 +3619,7 @@ function Nt(t, e) {
       default:
         return S();
     }
-  switch (n) {
+  switch (s) {
     case O.TABLE:
       return {
         suggestions: [
@@ -3644,14 +3690,14 @@ function Nt(t, e) {
   }
   return S();
 }
-function qn(t, e, s) {
-  switch (s == null ? void 0 : s.toLowerCase()) {
+function Jn(t, e, n) {
+  switch (n == null ? void 0 : n.toLowerCase()) {
     case "update":
     case "delete":
       return {
-        suggestions: ["cascade", "set default", "set null", "restrict"].map((n) => ({
-          label: n,
-          insertText: n,
+        suggestions: ["cascade", "set default", "set null", "restrict"].map((s) => ({
+          label: s,
+          insertText: s,
           kind: g.Value,
           insertTextRules: w.KeepWhitespace,
           range: void 0
@@ -3659,9 +3705,9 @@ function qn(t, e, s) {
       };
     case "type":
       return {
-        suggestions: ["btree", "hash"].map((n) => ({
-          label: n,
-          insertText: `${n}`,
+        suggestions: ["btree", "hash"].map((s) => ({
+          label: s,
+          insertText: `${s}`,
           kind: g.Value,
           insertTextRules: w.KeepWhitespace,
           range: void 0
@@ -3670,37 +3716,37 @@ function qn(t, e, s) {
   }
   return S();
 }
-function Ft(t, e, s) {
-  const n = Ne(s).unwrap_or([]);
-  if (n.pop(), n.some((r) => !M(r)))
+function Bt(t, e, n) {
+  const s = Ne(n).unwrap_or([]);
+  if (s.pop(), s.some((r) => !M(r)))
     return S();
-  const i = n.map((r) => C(r).unwrap());
+  const i = s.map((r) => $(r).unwrap());
   return Pe({
     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: ge(r),
       range: void 0
     }))
   });
 }
-function mt(t, e, s) {
+function mt(t, e, n) {
   var i;
   switch (t.container.scopeKind(e)) {
     case O.TABLE:
-      return Jn(t, e, s);
+      return Kn(t, e, n);
     case O.PROJECT:
-      return Zn(t, e, s);
+      return es(t, e, n);
     case O.INDEXES:
-      return es(t, e);
+      return ns(t, e);
     case O.ENUM:
-      return Hn(t, e, s);
+      return Zn(t, e, n);
     case O.REF: {
-      const r = Bt(t, e);
-      return ((i = t.container.token(e).token) == null ? void 0 : i.kind) === c.COLON && ke(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 && ke(t.container.token(e).token, e) ? Se(r) : r;
     }
     case O.TABLEGROUP:
-      return Kn(t);
+      return ts(t);
     default:
       return S();
   }
@@ -3716,15 +3762,15 @@ function Tt() {
     }))
   };
 }
-function Hn(t, e, s) {
-  return s != null && s.callee && tt(e, s) === 1 ? Ue(t, e, t.container.element(e), [
+function Zn(t, e, n) {
+  return n != null && n.callee && tt(e, n) === 1 ? Ue(t, e, t.container.element(e), [
     m.Schema,
     m.Table,
     m.Column
   ]) : S();
 }
-function Jn(t, e, s) {
-  if (!(s != null && s.callee))
+function Kn(t, e, n) {
+  if (!(n != null && n.callee))
     return {
       suggestions: ["Ref", "Note", "indexes"].map((i) => ({
         label: i,
@@ -3734,8 +3780,8 @@ function Jn(t, e, s) {
         range: void 0
       }))
     };
-  const n = tt(e, s);
-  return n === 0 ? {
+  const s = tt(e, n);
+  return s === 0 ? {
     suggestions: ["Ref", "Note", "indexes"].map((i) => ({
       label: i,
       insertText: i,
@@ -3743,10 +3789,10 @@ function Jn(t, e, s) {
       kind: g.Keyword,
       range: void 0
     }))
-  } : n === 1 ? ts(t, e) : S();
+  } : s === 1 ? ss(t, e) : S();
 }
-function Zn(t, e, s) {
-  return s != null && s.callee ? tt(e, s) === 0 ? {
+function es(t, e, n) {
+  return n != null && n.callee ? tt(e, n) === 0 ? {
     suggestions: ["Table", "TableGroup", "Enum", "Note", "Ref"].map((i) => ({
       label: i,
       insertText: i,
@@ -3764,34 +3810,34 @@ function Zn(t, e, s) {
     }))
   };
 }
-function Bt(t, e) {
+function Vt(t, e) {
   return Ue(t, e, t.container.element(e), [
     m.Schema,
     m.Table,
     m.Column
   ]);
 }
-function Kn(t) {
+function ts(t) {
   return Pe({
     suggestions: [...t.parse.publicSymbolTable().entries()].flatMap(([e]) => {
-      const s = se(e).unwrap_or(void 0);
-      if (s === void 0)
+      const n = se(e).unwrap_or(void 0);
+      if (n === void 0)
         return [];
-      const { kind: n, name: i } = s;
-      return n !== m.Table && n !== m.Schema ? [] : {
+      const { kind: s, name: i } = n;
+      return s !== m.Table && s !== m.Schema ? [] : {
         label: i,
         insertText: i,
         insertTextRules: w.KeepWhitespace,
-        kind: Le(n),
+        kind: ge(s),
         range: void 0
       };
     })
   });
 }
-function es(t, e) {
-  return Vt(t, e);
+function ns(t, e) {
+  return Gt(t, e);
 }
-function ts(t, e) {
+function ss(t, e) {
   return {
     suggestions: [
       ...[
@@ -3851,9 +3897,9 @@ function ts(t, e) {
         "CLOB",
         "NCLOB",
         "RAW"
-      ].map((s) => ({
-        label: s,
-        insertText: s,
+      ].map((n) => ({
+        label: n,
+        insertText: n,
         insertTextRules: w.KeepWhitespace,
         kind: g.TypeParameter,
         sortText: g.TypeParameter.toString().padStart(2, "0"),
@@ -3866,22 +3912,22 @@ function ts(t, e) {
     ]
   };
 }
-function Vt(t, e) {
-  const n = t.container.element(e).parent;
-  if (!((n == null ? void 0 : n.symbol) instanceof At))
+function Gt(t, e) {
+  const s = t.container.element(e).parent;
+  if (!((s == null ? void 0 : s.symbol) instanceof At))
     return S();
-  const { symbolTable: i } = n.symbol;
+  const { symbolTable: i } = s.symbol;
   return Pe({
     suggestions: [...i.entries()].flatMap(([r]) => {
       const a = se(r).unwrap_or(void 0);
       if (a === void 0)
         return [];
-      const { name: l } = a;
+      const { name: c } = a;
       return {
-        label: l,
-        insertText: l,
+        label: c,
+        insertText: c,
         insertTextRules: w.KeepWhitespace,
-        kind: Le(m.Column),
+        kind: ge(m.Column),
         range: void 0
       };
     })
@@ -3890,20 +3936,20 @@ function Vt(t, e) {
 function tt(t, e) {
   if (!e.callee)
     return -1;
-  const s = [e.callee, ...e.args], n = s.findIndex((i) => t <= i.end);
-  return n === -1 ? s.length : n;
+  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;
   }
-  provideDefinition(e, s) {
+  provideDefinition(e, n) {
     var a;
-    const { uri: n } = e, i = et(e, s), r = [...this.compiler.container.stack(i)];
+    const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
-      const l = r.pop();
-      if ((a = l == null ? void 0 : l.referee) != null && a.declaration && [he.PRIMARY_EXPRESSION, he.VARIABLE].includes(l == null ? void 0 : l.kind)) {
-        const { startPos: p, endPos: h } = l.referee.declaration;
+      const c = r.pop();
+      if ((a = c == null ? void 0 : c.referee) != null && a.declaration && [he.PRIMARY_EXPRESSION, he.VARIABLE].includes(c == null ? void 0 : c.kind)) {
+        const { startPos: p, endPos: h } = c.referee.declaration;
         return [
           {
             range: {
@@ -3912,7 +3958,7 @@ class Gt {
               endColumn: h.column + 1,
               endLineNumber: h.line + 1
             },
-            uri: n
+            uri: s
           }
         ];
       }
@@ -3920,12 +3966,12 @@ class Gt {
     return [];
   }
 }
-class Ct {
+class Xt {
   constructor(e) {
     this.compiler = e;
   }
-  provideReferences(e, s) {
-    const { uri: n } = e, i = et(e, s), r = [...this.compiler.container.stack(i)];
+  provideReferences(e, n) {
+    const { uri: s } = e, i = et(e, n), r = [...this.compiler.container.stack(i)];
     for (; r.length !== 0; ) {
       const a = r.pop();
       if (a && [
@@ -3933,40 +3979,40 @@ class Ct {
         he.FUNCTION_APPLICATION,
         he.PRIMARY_EXPRESSION
       ].includes(a == null ? void 0 : a.kind)) {
-        const { symbol: l } = a;
-        if (l != null && l.references.length)
-          return l.references.map(({ startPos: p, endPos: h }) => ({
+        const { symbol: c } = a;
+        if (c != null && c.references.length)
+          return c.references.map(({ startPos: p, endPos: h }) => ({
             range: {
               startColumn: p.column + 1,
               startLineNumber: p.line + 1,
               endColumn: h.column + 1,
               endLineNumber: h.line + 1
             },
-            uri: n
+            uri: s
           }));
       }
     }
     return [];
   }
 }
-const is = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const as = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   CompletionItemInsertTextRule: w,
   CompletionItemKind: g,
-  DBMLCompletionItemProvider: Mt,
-  DBMLDefinitionProvider: Gt,
-  DBMLReferencesProvider: Ct
+  DBMLCompletionItemProvider: Ft,
+  DBMLDefinitionProvider: Ct,
+  DBMLReferencesProvider: Xt
 }, Symbol.toStringTag, { value: "Module" }));
 var O = /* @__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))(O || {});
-class rs {
+class os {
   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(wt)
+        () => this.parse.tokens().filter(vt)
       ),
       // Valid + Invalid tokens (which are guarenteed to be non-trivials) are included in the stream
       flatStream: this.createQuery(
@@ -3978,8 +4024,8 @@ class rs {
       _: this.createQuery(
         0,
         () => {
-          const e = new rn(this.source).lex().chain((s) => new ln(s, this.nodeIdGenerator).parse()).chain(({ ast: s, tokens: n }) => new Cn(s, this.symbolIdGenerator).analyze().map(() => ({ ast: s, tokens: n })));
-          return e.getErrors().length > 0 ? e : e.chain(({ ast: s, tokens: n }) => new Yn(s).interpret().map((r) => ({ ast: s, tokens: n, rawDb: r })));
+          const e = new on(this.source).lex().chain((n) => new un(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new $n(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(
@@ -4003,78 +4049,78 @@ class rs {
       stack: this.createQuery(
         10,
         (e) => {
-          const s = this.parse.tokens();
-          let { index: n } = this.container.token(e);
+          const n = this.parse.tokens();
+          let { index: s } = this.container.token(e);
           const { token: i } = this.container.token(e);
-          if (n === void 0)
+          if (s === void 0)
             return [this.parse.ast()];
-          for (; s[n].isInvalid && n >= 0; )
-            n -= 1;
-          if (n === -1)
+          for (; n[s].isInvalid && s >= 0; )
+            s -= 1;
+          if (s === -1)
             return [this.parse.ast()];
-          const r = s[n].start;
+          const r = n[s].start;
           let a = this.parse.ast();
-          const l = [a];
+          const c = [a];
           for (; ; ) {
-            const h = sn(a).find((T) => be(r, T));
-            if (h === void 0 || h instanceof V)
+            const h = an(a).find((T) => Ie(r, T));
+            if (h === void 0 || h instanceof G)
               break;
-            l.push(h), a = h;
+            c.push(h), a = h;
           }
-          if ((i == null ? void 0 : i.kind) === c.COLON)
-            return l;
-          for (; l.length > 0; ) {
+          if ((i == null ? void 0 : i.kind) === u.COLON)
+            return c;
+          for (; c.length > 0; ) {
             let p = !1;
-            const h = L.last(l);
-            if (h instanceof y) {
+            const h = L.last(c);
+            if (h instanceof v) {
               const T = this.parse.source();
               for (let f = h.end; f < e; f += 1)
                 T[f] === `
-` && (l.pop(), p = !0);
+` && (c.pop(), p = !0);
             } else
-              h instanceof Q || h instanceof q ? this.container.token(e).token !== h.op && (l.pop(), p = !0) : h instanceof U ? h.listCloseBracket && h.end <= e && (l.pop(), p = !0) : h instanceof J ? h.tupleCloseParen && h.end <= e && (l.pop(), p = !0) : h instanceof ee ? h.blockCloseBrace && h.end <= e && (l.pop(), p = !0) : h instanceof te || h.end < e && (l.pop(), p = !0);
+              h instanceof Q || h instanceof q ? this.container.token(e).token !== h.op && (c.pop(), p = !0) : h instanceof U ? h.listCloseBracket && h.end <= e && (c.pop(), p = !0) : h instanceof J ? h.tupleCloseParen && h.end <= e && (c.pop(), p = !0) : h instanceof ee ? h.blockCloseBrace && h.end <= e && (c.pop(), p = !0) : h instanceof te || h.end < e && (c.pop(), p = !0);
             if (p) {
-              const T = L.last(l);
-              T instanceof _ && T.end <= e && l.pop();
+              const T = L.last(c);
+              T instanceof _ && T.end <= e && c.pop();
             }
             if (!p)
               break;
           }
-          return l;
+          return c;
         }
       ),
       token: this.createQuery(
         11,
         (e) => {
-          const s = this.token.flatStream().findIndex((n) => n.start >= e);
-          return s === void 0 ? { token: void 0, index: void 0 } : s <= 0 ? { token: void 0, index: void 0 } : {
-            token: this.token.flatStream()[s - 1],
-            index: s - 1
+          const n = this.token.flatStream().findIndex((s) => s.start >= e);
+          return n === void 0 ? { token: void 0, index: void 0 } : n <= 0 ? { token: void 0, index: void 0 } : {
+            token: this.token.flatStream()[n - 1],
+            index: n - 1
           };
         }
       ),
       element: this.createQuery(
         12,
         (e) => {
-          const s = this.container.stack(e);
-          for (let n = s.length - 1; n >= 0; n -= 1)
-            if (s[n] instanceof _)
-              return s[n];
+          const n = this.container.stack(e);
+          for (let s = n.length - 1; s >= 0; s -= 1)
+            if (n[s] instanceof _)
+              return n[s];
           return this.parse.ast();
         }
       ),
       scope: this.createQuery(
         14,
         (e) => {
-          var s, n;
-          return (n = (s = this.container.element(e)) == null ? void 0 : s.symbol) == null ? void 0 : n.symbolTable;
+          var n, s;
+          return (s = (n = this.container.element(e)) == null ? void 0 : n.symbol) == null ? void 0 : s.symbolTable;
         }
       ),
       scopeKind: this.createQuery(15, (e) => {
-        var n;
-        if (this.container.element(e) instanceof X)
+        var s;
+        if (this.container.element(e) instanceof B)
           return 8;
-        switch ((n = this.container.element(e).type) == null ? void 0 : n.value.toLowerCase()) {
+        switch ((s = this.container.element(e).type) == null ? void 0 : s.value.toLowerCase()) {
           case "table":
             return 0;
           case "enum":
@@ -4102,52 +4148,52 @@ class rs {
         8,
         ({
           nameStack: e,
-          owner: s = this.parse.ast()
+          owner: n = this.parse.ast()
         }) => {
           var i;
           if (e.length === 0)
             return [];
-          const n = [];
-          for (let r = s; r; r = r instanceof _ ? r.parent : void 0) {
+          const s = [];
+          for (let r = n; r; r = r instanceof _ ? r.parent : void 0) {
             if (!((i = r.symbol) != null && i.symbolTable))
               continue;
             const { symbolTable: a } = r.symbol;
-            let l = [a], p = [];
+            let c = [a], p = [];
             for (const h of e)
-              p = l.flatMap(
-                (T) => Yt(h).flatMap((f) => {
+              p = c.flatMap(
+                (T) => Qt(h).flatMap((f) => {
                   const N = T.get(f), b = se(f).unwrap_or(void 0);
                   return !N || !b ? [] : { ...b, symbol: N };
                 })
-              ), l = p.flatMap(
+              ), c = p.flatMap(
                 (T) => T.symbol.symbolTable ? T.symbol.symbolTable : []
               );
-            n.push(...p);
+            s.push(...p);
           }
-          return n;
+          return s;
         },
-        ({ nameStack: e, owner: s }) => `${e.join(".")}@${s.id}`
+        ({ nameStack: e, owner: n }) => `${e.join(".")}@${n.id}`
       ),
       members: this.createQuery(
         9,
-        (e) => e.symbolTable ? [...e.symbolTable.entries()].map(([s, n]) => ({
-          ...se(s).unwrap(),
-          symbol: n
+        (e) => e.symbolTable ? [...e.symbolTable.entries()].map(([n, s]) => ({
+          ...se(n).unwrap(),
+          symbol: s
         })) : []
       )
     };
   }
-  createQuery(e, s, n) {
+  createQuery(e, n, s) {
     return (i) => {
-      const r = this.cache[e], a = i && n ? n(i) : i;
+      const r = this.cache[e], a = i && s ? s(i) : i;
       if (r !== null) {
         if (!(r instanceof Map))
           return r;
         if (r.has(a))
           return r.get(a);
       }
-      const l = s(i);
-      return i !== void 0 ? r instanceof Map ? r.set(a, l) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, l)) : this.cache[e] = l, l;
+      const c = n(i);
+      return i !== void 0 ? r instanceof Map ? r.set(a, c) : (this.cache[e] = /* @__PURE__ */ new Map(), this.cache[e].set(a, c)) : this.cache[e] = c, c;
     };
   }
   setSource(e) {
@@ -4158,14 +4204,14 @@ class rs {
   }
   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 {
-  rs as Compiler,
-  ss as serialize,
-  is as services
+  os as Compiler,
+  rs as serialize,
+  as as services
 };