@dbml/parse 3.3.0 → 3.4.1-alpha.0

package/dist/dbml-parse.mjs

@@ -36,12 +36,12 @@ function rt(t) {
 function at(t) {
   return t !== void 0 && t.kind === "<op>";
 }
-class B {
+class M {
   constructor(e, n, s, i, r) {
     this.kind = e, this.startPos = n, this.endPos = s, this.value = i, this.leadingTrivia = [], this.trailingTrivia = [], this.leadingInvalid = [], this.trailingInvalid = [], this.isInvalid = r, this.start = n.offset, this.end = s.offset;
   }
   static create(e, n, s, i, r) {
-    return new B(e, n, s, i, r);
+    return new M(e, n, s, i, r);
   }
 }
 function bt(t) {
@@ -81,13 +81,13 @@ class k {
   constructor(e, n, s) {
     this.id = e, this.kind = n;
     const i = s.find((a) => a !== void 0 && !Number.isNaN(a.start));
-    i ? (this.startPos = i.startPos, this.fullStart = i instanceof B ? Lt(i) : i.fullStart) : (this.startPos = {
+    i ? (this.startPos = i.startPos, this.fullStart = i instanceof M ? Lt(i) : i.fullStart) : (this.startPos = {
       offset: NaN,
       column: NaN,
       line: NaN
     }, this.fullStart = NaN);
     const r = [...s].reverse().find((a) => a !== void 0 && !Number.isNaN(a.end));
-    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof B ? It(r) : r.fullEnd) : (this.endPos = {
+    r ? (this.endPos = r.endPos, this.fullEnd = r instanceof M ? It(r) : r.fullEnd) : (this.endPos = {
       offset: NaN,
       column: NaN,
       line: NaN
@@ -228,7 +228,7 @@ class J extends k {
     super(s, "<call-expression>", [e, n]), this.callee = e, this.argumentList = n;
   }
 }
-class me extends k {
+class Te extends k {
   constructor({ literal: e }, n) {
     super(n, "<literal>", [e]), this.literal = e;
   }
@@ -245,11 +245,11 @@ class D extends k {
 }
 class ke extends k {
   constructor({ pre: e }, n) {
-    const s = B.create(u.SPACE, e.endPos, e.endPos, " ", !1);
+    const s = M.create(u.SPACE, e.endPos, e.endPos, " ", !1);
     super(n, "<dummy>", [s]);
   }
 }
-class ce extends k {
+class le extends k {
   constructor({ expression: e, indexer: n }, s) {
     super(s, "<array>", [e, n]), this.array = e, this.indexer = n;
   }
@@ -418,13 +418,13 @@ function Ht(t) {
 function pe(t) {
   return Ue(t) || Oe(t);
 }
-function lt(t, e) {
+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 Le(t, e) {
+function ge(t, e) {
   return t >= e.start && t < e.end;
 }
 class Jt {
@@ -473,13 +473,13 @@ class nn {
     this.references = [], this.id = n, this.declaration = e;
   }
 }
-var o = /* @__PURE__ */ ((t) => (t[t.UNKNOWN_SYMBOL = 1e3] = "UNKNOWN_SYMBOL", t[t.UNEXPECTED_SYMBOL = 1001] = "UNEXPECTED_SYMBOL", t[t.UNEXPECTED_EOF = 1002] = "UNEXPECTED_EOF", t[t.UNEXPECTED_NEWLINE = 1003] = "UNEXPECTED_NEWLINE", t[t.UNKNOWN_TOKEN = 1004] = "UNKNOWN_TOKEN", t[t.UNEXPECTED_TOKEN = 1005] = "UNEXPECTED_TOKEN", t[t.UNEXPECTED_ELEMENT_DECLARATION = 1006] = "UNEXPECTED_ELEMENT_DECLARATION", t[t.MISSING_SPACES = 1007] = "MISSING_SPACES", t[t.UNKNOWN_PREFIX_OP = 1008] = "UNKNOWN_PREFIX_OP", t[t.INVALID_OPERAND = 1009] = "INVALID_OPERAND", t[t.EMPTY_ATTRIBUTE_NAME = 1010] = "EMPTY_ATTRIBUTE_NAME", t[t.INVALID_NAME = 3e3] = "INVALID_NAME", t[t.UNEXPECTED_NAME = 3001] = "UNEXPECTED_NAME", t[t.NAME_NOT_FOUND = 3002] = "NAME_NOT_FOUND", t[t.DUPLICATE_NAME = 3003] = "DUPLICATE_NAME", t[t.INVALID_ALIAS = 3004] = "INVALID_ALIAS", t[t.UNEXPECTED_ALIAS = 3005] = "UNEXPECTED_ALIAS", t[t.UNEXPECTED_SETTINGS = 3006] = "UNEXPECTED_SETTINGS", t[t.INVALID_SETTINGS = 3007] = "INVALID_SETTINGS", t[t.UNEXPECTED_SIMPLE_BODY = 3008] = "UNEXPECTED_SIMPLE_BODY", t[t.UNEXPECTED_COMPLEX_BODY = 3009] = "UNEXPECTED_COMPLEX_BODY", t[t.INVALID_TABLE_CONTEXT = 3010] = "INVALID_TABLE_CONTEXT", t[t.INVALID_TABLE_SETTING = 3011] = "INVALID_TABLE_SETTING", t[t.DUPLICATE_TABLE_SETTING = 3012] = "DUPLICATE_TABLE_SETTING", t[t.INVALID_TABLEGROUP_CONTEXT = 3013] = "INVALID_TABLEGROUP_CONTEXT", t[t.INVALID_TABLEGROUP_ELEMENT_NAME = 3014] = "INVALID_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_ELEMENT_NAME = 3015] = "DUPLICATE_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_FIELD_NAME = 3016] = "DUPLICATE_TABLEGROUP_FIELD_NAME", t[t.INVALID_TABLEGROUP_FIELD = 3017] = "INVALID_TABLEGROUP_FIELD", t[t.EMPTY_TABLE = 3018] = "EMPTY_TABLE", t[t.INVALID_COLUMN = 3019] = "INVALID_COLUMN", t[t.INVALID_COLUMN_NAME = 3020] = "INVALID_COLUMN_NAME", t[t.UNKNOWN_COLUMN_SETTING = 3021] = "UNKNOWN_COLUMN_SETTING", t[t.INVALID_COLUMN_TYPE = 3022] = "INVALID_COLUMN_TYPE", t[t.DUPLICATE_COLUMN_NAME = 3023] = "DUPLICATE_COLUMN_NAME", t[t.DUPLICATE_COLUMN_SETTING = 3024] = "DUPLICATE_COLUMN_SETTING", t[t.INVALID_COLUMN_SETTING_VALUE = 3025] = "INVALID_COLUMN_SETTING_VALUE", t[t.INVALID_ENUM_CONTEXT = 3026] = "INVALID_ENUM_CONTEXT", t[t.INVALID_ENUM_ELEMENT_NAME = 3027] = "INVALID_ENUM_ELEMENT_NAME", t[t.INVALID_ENUM_ELEMENT = 3028] = "INVALID_ENUM_ELEMENT", t[t.DUPLICATE_ENUM_ELEMENT_NAME = 3029] = "DUPLICATE_ENUM_ELEMENT_NAME", t[t.UNKNOWN_ENUM_ELEMENT_SETTING = 3030] = "UNKNOWN_ENUM_ELEMENT_SETTING", t[t.DUPLICATE_ENUM_ELEMENT_SETTING = 3031] = "DUPLICATE_ENUM_ELEMENT_SETTING", t[t.INVALID_ENUM_ELEMENT_SETTING = 3032] = "INVALID_ENUM_ELEMENT_SETTING", t[t.EMPTY_ENUM = 3033] = "EMPTY_ENUM", t[t.INVALID_REF_CONTEXT = 3034] = "INVALID_REF_CONTEXT", t[t.UNKNOWN_REF_SETTING = 3035] = "UNKNOWN_REF_SETTING", t[t.DUPLICATE_REF_SETTING = 3036] = "DUPLICATE_REF_SETTING", t[t.INVALID_REF_SETTING_VALUE = 3037] = "INVALID_REF_SETTING_VALUE", t[t.INVALID_REF_RELATIONSHIP = 3038] = "INVALID_REF_RELATIONSHIP", t[t.INVALID_REF_FIELD = 3039] = "INVALID_REF_FIELD", t[t.EMPTY_REF = 3040] = "EMPTY_REF", t[t.REF_REDEFINED = 3041] = "REF_REDEFINED", t[t.INVALID_NOTE_CONTEXT = 3042] = "INVALID_NOTE_CONTEXT", t[t.INVALID_NOTE = 3043] = "INVALID_NOTE", t[t.NOTE_REDEFINED = 3044] = "NOTE_REDEFINED", t[t.NOTE_CONTENT_REDEFINED = 3045] = "NOTE_CONTENT_REDEFINED", t[t.EMPTY_NOTE = 3046] = "EMPTY_NOTE", t[t.INVALID_INDEXES_CONTEXT = 3047] = "INVALID_INDEXES_CONTEXT", t[t.INVALID_INDEXES_FIELD = 3048] = "INVALID_INDEXES_FIELD", t[t.INVALID_INDEX = 3049] = "INVALID_INDEX", t[t.UNKNOWN_INDEX_SETTING = 3050] = "UNKNOWN_INDEX_SETTING", t[t.DUPLICATE_INDEX_SETTING = 3051] = "DUPLICATE_INDEX_SETTING", t[t.UNEXPECTED_INDEX_SETTING_VALUE = 3052] = "UNEXPECTED_INDEX_SETTING_VALUE", t[t.INVALID_INDEX_SETTING_VALUE = 3053] = "INVALID_INDEX_SETTING_VALUE", t[t.INVALID_PROJECT_CONTEXT = 3054] = "INVALID_PROJECT_CONTEXT", t[t.PROJECT_REDEFINED = 3055] = "PROJECT_REDEFINED", t[t.INVALID_PROJECT_FIELD = 3056] = "INVALID_PROJECT_FIELD", t[t.INVALID_CUSTOM_CONTEXT = 3057] = "INVALID_CUSTOM_CONTEXT", t[t.INVALID_CUSTOM_ELEMENT_VALUE = 3058] = "INVALID_CUSTOM_ELEMENT_VALUE", t[t.INVALID_ELEMENT_IN_SIMPLE_BODY = 3059] = "INVALID_ELEMENT_IN_SIMPLE_BODY", t[t.BINDING_ERROR = 4e3] = "BINDING_ERROR", t[t.UNSUPPORTED = 5e3] = "UNSUPPORTED", t[t.CIRCULAR_REF = 5001] = "CIRCULAR_REF", t[t.SAME_ENDPOINT = 5002] = "SAME_ENDPOINT", t[t.UNEQUAL_FIELDS_BINARY_REF = 5003] = "UNEQUAL_FIELDS_BINARY_REF", t[t.CONFLICTING_SETTING = 5004] = "CONFLICTING_SETTING", t[t.TABLE_REAPPEAR_IN_TABLEGROUP = 5005] = "TABLE_REAPPEAR_IN_TABLEGROUP", t))(o || {});
+var o = /* @__PURE__ */ ((t) => (t[t.UNKNOWN_SYMBOL = 1e3] = "UNKNOWN_SYMBOL", t[t.UNEXPECTED_SYMBOL = 1001] = "UNEXPECTED_SYMBOL", t[t.UNEXPECTED_EOF = 1002] = "UNEXPECTED_EOF", t[t.UNEXPECTED_NEWLINE = 1003] = "UNEXPECTED_NEWLINE", t[t.UNKNOWN_TOKEN = 1004] = "UNKNOWN_TOKEN", t[t.UNEXPECTED_TOKEN = 1005] = "UNEXPECTED_TOKEN", t[t.UNEXPECTED_ELEMENT_DECLARATION = 1006] = "UNEXPECTED_ELEMENT_DECLARATION", t[t.MISSING_SPACES = 1007] = "MISSING_SPACES", t[t.UNKNOWN_PREFIX_OP = 1008] = "UNKNOWN_PREFIX_OP", t[t.INVALID_OPERAND = 1009] = "INVALID_OPERAND", t[t.EMPTY_ATTRIBUTE_NAME = 1010] = "EMPTY_ATTRIBUTE_NAME", t[t.INVALID_ESCAPE_SEQUENCE = 1011] = "INVALID_ESCAPE_SEQUENCE", t[t.INVALID_NAME = 3e3] = "INVALID_NAME", t[t.UNEXPECTED_NAME = 3001] = "UNEXPECTED_NAME", t[t.NAME_NOT_FOUND = 3002] = "NAME_NOT_FOUND", t[t.DUPLICATE_NAME = 3003] = "DUPLICATE_NAME", t[t.INVALID_ALIAS = 3004] = "INVALID_ALIAS", t[t.UNEXPECTED_ALIAS = 3005] = "UNEXPECTED_ALIAS", t[t.UNEXPECTED_SETTINGS = 3006] = "UNEXPECTED_SETTINGS", t[t.INVALID_SETTINGS = 3007] = "INVALID_SETTINGS", t[t.UNEXPECTED_SIMPLE_BODY = 3008] = "UNEXPECTED_SIMPLE_BODY", t[t.UNEXPECTED_COMPLEX_BODY = 3009] = "UNEXPECTED_COMPLEX_BODY", t[t.INVALID_TABLE_CONTEXT = 3010] = "INVALID_TABLE_CONTEXT", t[t.INVALID_TABLE_SETTING = 3011] = "INVALID_TABLE_SETTING", t[t.DUPLICATE_TABLE_SETTING = 3012] = "DUPLICATE_TABLE_SETTING", t[t.INVALID_TABLEGROUP_CONTEXT = 3013] = "INVALID_TABLEGROUP_CONTEXT", t[t.INVALID_TABLEGROUP_ELEMENT_NAME = 3014] = "INVALID_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_ELEMENT_NAME = 3015] = "DUPLICATE_TABLEGROUP_ELEMENT_NAME", t[t.DUPLICATE_TABLEGROUP_FIELD_NAME = 3016] = "DUPLICATE_TABLEGROUP_FIELD_NAME", t[t.INVALID_TABLEGROUP_FIELD = 3017] = "INVALID_TABLEGROUP_FIELD", t[t.EMPTY_TABLE = 3018] = "EMPTY_TABLE", t[t.INVALID_COLUMN = 3019] = "INVALID_COLUMN", t[t.INVALID_COLUMN_NAME = 3020] = "INVALID_COLUMN_NAME", t[t.UNKNOWN_COLUMN_SETTING = 3021] = "UNKNOWN_COLUMN_SETTING", t[t.INVALID_COLUMN_TYPE = 3022] = "INVALID_COLUMN_TYPE", t[t.DUPLICATE_COLUMN_NAME = 3023] = "DUPLICATE_COLUMN_NAME", t[t.DUPLICATE_COLUMN_SETTING = 3024] = "DUPLICATE_COLUMN_SETTING", t[t.INVALID_COLUMN_SETTING_VALUE = 3025] = "INVALID_COLUMN_SETTING_VALUE", t[t.INVALID_ENUM_CONTEXT = 3026] = "INVALID_ENUM_CONTEXT", t[t.INVALID_ENUM_ELEMENT_NAME = 3027] = "INVALID_ENUM_ELEMENT_NAME", t[t.INVALID_ENUM_ELEMENT = 3028] = "INVALID_ENUM_ELEMENT", t[t.DUPLICATE_ENUM_ELEMENT_NAME = 3029] = "DUPLICATE_ENUM_ELEMENT_NAME", t[t.UNKNOWN_ENUM_ELEMENT_SETTING = 3030] = "UNKNOWN_ENUM_ELEMENT_SETTING", t[t.DUPLICATE_ENUM_ELEMENT_SETTING = 3031] = "DUPLICATE_ENUM_ELEMENT_SETTING", t[t.INVALID_ENUM_ELEMENT_SETTING = 3032] = "INVALID_ENUM_ELEMENT_SETTING", t[t.EMPTY_ENUM = 3033] = "EMPTY_ENUM", t[t.INVALID_REF_CONTEXT = 3034] = "INVALID_REF_CONTEXT", t[t.UNKNOWN_REF_SETTING = 3035] = "UNKNOWN_REF_SETTING", t[t.DUPLICATE_REF_SETTING = 3036] = "DUPLICATE_REF_SETTING", t[t.INVALID_REF_SETTING_VALUE = 3037] = "INVALID_REF_SETTING_VALUE", t[t.INVALID_REF_RELATIONSHIP = 3038] = "INVALID_REF_RELATIONSHIP", t[t.INVALID_REF_FIELD = 3039] = "INVALID_REF_FIELD", t[t.EMPTY_REF = 3040] = "EMPTY_REF", t[t.REF_REDEFINED = 3041] = "REF_REDEFINED", t[t.INVALID_NOTE_CONTEXT = 3042] = "INVALID_NOTE_CONTEXT", t[t.INVALID_NOTE = 3043] = "INVALID_NOTE", t[t.NOTE_REDEFINED = 3044] = "NOTE_REDEFINED", t[t.NOTE_CONTENT_REDEFINED = 3045] = "NOTE_CONTENT_REDEFINED", t[t.EMPTY_NOTE = 3046] = "EMPTY_NOTE", t[t.INVALID_INDEXES_CONTEXT = 3047] = "INVALID_INDEXES_CONTEXT", t[t.INVALID_INDEXES_FIELD = 3048] = "INVALID_INDEXES_FIELD", t[t.INVALID_INDEX = 3049] = "INVALID_INDEX", t[t.UNKNOWN_INDEX_SETTING = 3050] = "UNKNOWN_INDEX_SETTING", t[t.DUPLICATE_INDEX_SETTING = 3051] = "DUPLICATE_INDEX_SETTING", t[t.UNEXPECTED_INDEX_SETTING_VALUE = 3052] = "UNEXPECTED_INDEX_SETTING_VALUE", t[t.INVALID_INDEX_SETTING_VALUE = 3053] = "INVALID_INDEX_SETTING_VALUE", t[t.INVALID_PROJECT_CONTEXT = 3054] = "INVALID_PROJECT_CONTEXT", t[t.PROJECT_REDEFINED = 3055] = "PROJECT_REDEFINED", t[t.INVALID_PROJECT_FIELD = 3056] = "INVALID_PROJECT_FIELD", t[t.INVALID_CUSTOM_CONTEXT = 3057] = "INVALID_CUSTOM_CONTEXT", t[t.INVALID_CUSTOM_ELEMENT_VALUE = 3058] = "INVALID_CUSTOM_ELEMENT_VALUE", t[t.INVALID_ELEMENT_IN_SIMPLE_BODY = 3059] = "INVALID_ELEMENT_IN_SIMPLE_BODY", t[t.BINDING_ERROR = 4e3] = "BINDING_ERROR", t[t.UNSUPPORTED = 5e3] = "UNSUPPORTED", t[t.CIRCULAR_REF = 5001] = "CIRCULAR_REF", t[t.SAME_ENDPOINT = 5002] = "SAME_ENDPOINT", t[t.UNEQUAL_FIELDS_BINARY_REF = 5003] = "UNEQUAL_FIELDS_BINARY_REF", t[t.CONFLICTING_SETTING = 5004] = "CONFLICTING_SETTING", t[t.TABLE_REAPPEAR_IN_TABLEGROUP = 5005] = "TABLE_REAPPEAR_IN_TABLEGROUP", t))(o || {});
 class c extends Error {
   constructor(e, n, s) {
     super(n), this.code = e, this.diagnostic = n, this.nodeOrToken = s, this.start = s.start, this.end = s.end, this.name = this.constructor.name, Object.setPrototypeOf(this, c.prototype);
   }
 }
-class F {
+class B {
   constructor(e, n) {
     this.value = e, this.errors = n === void 0 ? [] : n;
   }
@@ -491,14 +491,14 @@ class F {
   }
   chain(e) {
     const n = e(this.value), s = [...this.errors, ...n.errors];
-    return new F(n.value, s);
+    return new B(n.value, s);
   }
   map(e) {
-    return new F(e(this.value), this.errors);
+    return new B(e(this.value), this.errors);
   }
 }
 function sn(t, e, n) {
-  if (!t || !Ee(t) || e.length === 0)
+  if (!t || !Ne(t) || e.length === 0)
     return new v();
   const s = [...e], i = Ge(t).unwrap(), r = s.pop();
   if (!(r instanceof ne))
@@ -528,11 +528,11 @@ function sn(t, e, n) {
     })
   ) : new v();
 }
-function ct(t) {
+function lt(t) {
   return t.kind === u.IDENTIFIER && t.value === "as";
 }
 function E(t) {
-  t && (t instanceof B ? rn(t) : an(t));
+  t && (t instanceof M ? rn(t) : an(t));
 }
 function rn(t) {
   t.kind !== u.EOF && (t.isInvalid = !0);
@@ -566,7 +566,7 @@ function an(t) {
     E(t.value);
   else if (t instanceof j)
     E(t.variable);
-  else if (t instanceof me)
+  else if (t instanceof Te)
     E(t.literal);
   else
     throw t instanceof We ? new Error("This case is handled by the TupleExpressionNode case") : new Error("Unreachable case in markInvalidNode");
@@ -594,7 +594,7 @@ function on(t) {
     return U(t.name, t.colon, t.value);
   if (t instanceof $)
     return t.identifiers;
-  if (t instanceof me)
+  if (t instanceof Te)
     return t.literal ? [t.literal] : [];
   if (t instanceof j)
     return U(t.variable);
@@ -613,20 +613,20 @@ function on(t) {
   if (t instanceof P)
     return U(
       t.listOpenBracket,
-      ...lt(t.elementList, t.commaList),
+      ...ct(t.elementList, t.commaList),
       t.listCloseBracket
     );
   if (t instanceof Z)
     return U(
       t.tupleOpenParen,
-      ...lt(t.elementList, t.commaList),
+      ...ct(t.elementList, t.commaList),
       t.tupleCloseParen
     );
   if (t instanceof J)
     return U(t.callee, t.argumentList);
   if (t instanceof D)
     return U(t.expression);
-  if (t instanceof ce)
+  if (t instanceof le)
     return U(
       t.array,
       t.indexer
@@ -634,16 +634,16 @@ function on(t) {
   throw t instanceof We ? new Error("This case is already handled by TupleExpressionNode") : new Error("Unreachable - no other possible cases");
 }
 function Ge(t) {
-  return M(t) ? new S(t.expression.variable) : new v();
+  return F(t) ? new S(t.expression.variable) : new v();
 }
 function Y(t) {
   var e;
-  return t instanceof D && (t.expression instanceof j && t.expression.variable instanceof B && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof me && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
+  return t instanceof D && (t.expression instanceof j && t.expression.variable instanceof M && t.expression.variable.kind === u.QUOTED_STRING || t.expression instanceof Te && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.STRING_LITERAL);
 }
-function M(t) {
-  return t instanceof D && t.expression instanceof j && t.expression.variable instanceof B;
+function F(t) {
+  return t instanceof D && t.expression instanceof j && t.expression.variable instanceof M;
 }
-function Ee(t) {
+function Ne(t) {
   var e;
   return t instanceof D && t.expression instanceof j && ((e = t.expression.variable) == null ? void 0 : e.kind) === u.IDENTIFIER;
 }
@@ -651,13 +651,13 @@ function Je(t) {
   var e;
   return t instanceof H && t.leftExpression instanceof k && t.rightExpression instanceof k && ((e = t.op) == null ? void 0 : e.value) === ".";
 }
-function Ne(t) {
+function me(t) {
   if (t === void 0)
     return new v();
   const e = t.identifiers.map((n) => n.value).join(" ");
   return e === "" ? new v() : new S(e);
 }
-class ln {
+class cn {
   // list of errors during lexing
   constructor(e) {
     this.start = {
@@ -697,7 +697,7 @@ class ln {
     this.tokens.push(this.createToken(e, n));
   }
   createToken(e, n = !1) {
-    return B.create(
+    return M.create(
       e,
       this.start,
       this.current,
@@ -706,7 +706,7 @@ class ln {
     );
   }
   lex() {
-    return this.scanTokens(), this.tokens.push(B.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new F(this.tokens, this.errors);
+    return this.scanTokens(), this.tokens.push(M.create(u.EOF, this.start, this.current, "", !1)), this.gatherTrivia(), this.gatherInvalid(), new B(this.tokens, this.errors);
   }
   scanTokens() {
     for (; !this.isAtEnd(); ) {
@@ -843,7 +843,7 @@ class ln {
       );
       return;
     }
-    a && this.match(n), this.tokens.push(B.create(e, this.start, this.current, l, !1));
+    a && this.match(n), this.tokens.push(M.create(e, this.start, this.current, l, !1));
   }
   singleLineStringLiteral() {
     this.consumeUntil(u.STRING_LITERAL, "'", {
@@ -934,9 +934,16 @@ class ln {
     this.addToken(u.COLOR_LITERAL);
   }
   escapedString() {
+    const e = { column: this.current.column - 1, offset: this.current.offset - 1, line: this.current.line };
     if (this.isAtEnd())
       return "\\";
     switch (this.advance()) {
+      case "\r":
+        return this.check(`
+`) && this.advance(), "";
+      case `
+`:
+        return "";
       case "t":
         return "	";
       case "n":
@@ -947,7 +954,7 @@ class ln {
       case "r":
         return "\r";
       case "'":
-        return "'";
+        return this.peek() === "'" && this.peek(1) === "'" ? (this.advance(), this.advance(), "'''") : "'";
       case '"':
         return '"';
       case "0":
@@ -958,22 +965,26 @@ class ln {
         return "\v";
       case "f":
         return "\f";
+      case " ":
+        return "\\ ";
       case "u": {
-        let e = "";
-        for (let n = 0; n <= 3; n += 1) {
+        let n = "";
+        for (let s = 0; s <= 3; s += 1) {
           if (this.isAtEnd() || !pe(this.peek()))
-            return `\\u${e}`;
-          e += this.advance();
+            return this.errors.push(new c(o.INVALID_ESCAPE_SEQUENCE, `Invalid unicode escape sequence '\\u${n}', only unicode escape sequences of the form '\\uHHHH' where H is a hexadecimal number are allowed`, M.create(u.STRING_LITERAL, e, this.current, `\\u${n}`, !0))), `\\u${n}`;
+          n += this.advance();
         }
-        return String.fromCharCode(parseInt(e, 16));
+        return String.fromCharCode(parseInt(n, 16));
+      }
+      default: {
+        const n = `\\${this.text[this.current.offset - 1]}`;
+        return this.errors.push(new c(o.INVALID_ESCAPE_SEQUENCE, `Invalid escape sequence '${n}'`, M.create(u.STRING_LITERAL, e, this.current, n, !0))), n;
       }
-      default:
-        return `\\${this.tokens[this.current.offset - 1]}`;
     }
   }
 }
 var xe = /* @__PURE__ */ ((t) => (t[t.ListExpression = 0] = "ListExpression", t[t.GroupExpression = 1] = "GroupExpression", t[t.BlockExpression = 2] = "BlockExpression", t))(xe || {});
-class cn {
+class ln {
   constructor() {
     this.stack = [], this.numberOfNestedLParens = 0, this.numberOfNestedLBrackets = 0, this.numberOfNestedLBraces = 0;
   }
@@ -1054,13 +1065,13 @@ class d {
 }
 class hn {
   constructor(e, n) {
-    this.current = 0, this.errors = [], this.contextStack = new cn(), this.synchronizeProgram = () => {
+    this.current = 0, this.errors = [], this.contextStack = new ln(), 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 s = this.peek();
-        if (ct(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
+        if (lt(s) || this.check(u.COLON, u.LBRACE, u.LBRACKET))
           break;
         E(s), this.advance();
       }
@@ -1281,7 +1292,7 @@ class hn {
   }
   parse() {
     const e = this.program(), n = this.advance(), s = this.nodeFactory.create(G, { body: e, eof: n });
-    return this.gatherInvalid(), new F({ ast: s, tokens: this.tokens }, this.errors);
+    return this.gatherInvalid(), new B({ ast: s, tokens: this.tokens }, this.errors);
   }
   /* Parsing and synchronizing ProgramNode */
   program() {
@@ -1315,7 +1326,7 @@ class hn {
           throw new d(s.token, n(), s.handlerContext);
         this.synchronizeElementDeclarationName();
       }
-    if (ct(this.peek()))
+    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
@@ -1437,12 +1448,12 @@ class hn {
         if (Ce(this.previous()))
           break;
         try {
-          n = this.nodeFactory.create(ce, {
+          n = this.nodeFactory.create(le, {
             expression: n,
             indexer: this.listExpression()
           });
         } catch (i) {
-          throw i instanceof d ? (n = this.nodeFactory.create(ce, {
+          throw i instanceof d ? (n = this.nodeFactory.create(le, {
             expression: n,
             indexer: i.partialNode
           }), new d(i.token, n, i.handlerContext)) : i;
@@ -1561,7 +1572,7 @@ class hn {
       u.NUMERIC_LITERAL
     ))
       return this.nodeFactory.create(D, {
-        expression: this.nodeFactory.create(me, { literal: this.previous() })
+        expression: this.nodeFactory.create(Te, { literal: this.previous() })
       });
     if (this.match(u.QUOTED_STRING, u.IDENTIFIER))
       return this.nodeFactory.create(D, {
@@ -1713,7 +1724,7 @@ function _e(t) {
     return new v();
   const n = [];
   let s;
-  if (!M(I.last(e))) {
+  if (!F(I.last(e))) {
     const i = e.pop();
     if (kt(i))
       s = i.elementList.map(
@@ -1734,7 +1745,7 @@ function _e(t) {
   });
 }
 function X(t) {
-  return M(t) ? new S(t.expression.variable.value) : new v();
+  return F(t) ? new S(t.expression.variable.value) : new v();
 }
 function Xe(t) {
   if (ht(t))
@@ -1742,7 +1753,7 @@ function Xe(t) {
   if (t instanceof Z && t.elementList.every(ht)) {
     const e = t.elementList.filter(
       (s) => s instanceof te
-    ), n = t.elementList.filter(M);
+    ), n = t.elementList.filter(F);
     return new S({ functional: e, nonFunctional: n });
   }
   return new v();
@@ -1868,7 +1879,7 @@ class Ln {
   validateFields(e) {
     return e.length === 0 ? [new c(o.EMPTY_ENUM, "An Enum must have at least one element", this.declarationNode)] : e.flatMap((n) => {
       const s = [];
-      n.callee && !M(n.callee) && s.push(new c(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
+      n.callee && !F(n.callee) && s.push(new c(o.INVALID_ENUM_ELEMENT_NAME, "An enum field must be an identifier or a quoted identifier", n.callee));
       const i = [...n.args];
       return I.last(i) instanceof P ? (s.push(...this.validateFieldSettings(I.last(i))), i.pop()) : i[0] instanceof P && (s.push(...this.validateFieldSettings(i[0])), i.shift()), i.length > 0 && s.push(...i.map((r) => new c(o.INVALID_ENUM_ELEMENT, "An Enum must have only a field and optionally a setting list", r))), s.push(...this.registerField(n)), s;
     });
@@ -1898,7 +1909,7 @@ class Ln {
     });
   }
   registerField(e) {
-    if (e.callee && M(e.callee)) {
+    if (e.callee && F(e.callee)) {
       const n = V(e.callee).unwrap(), s = Qe(n), i = this.symbolFactory.create(Kt, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
@@ -1967,12 +1978,12 @@ class gn {
         case "unique":
         case "pk":
           a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, `'${r}' can only appear once`, l))), a.forEach((l) => {
-            le(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
+            ce(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'${r}' must not have a value`, l));
           });
           break;
         case "type":
           a.length > 1 && a.forEach((l) => s.push(new c(o.DUPLICATE_INDEX_SETTING, "'type' can only appear once", l))), a.forEach((l) => {
-            M(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
+            F(l.value) || s.push(new c(o.INVALID_INDEX_SETTING_VALUE, `'type' must be "btree" or "hash"`, l));
           });
           break;
         default:
@@ -2141,10 +2152,10 @@ class vn {
   }
 }
 function wn(t) {
-  if (!(M(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
+  if (!(F(t) && t.expression.variable.kind !== u.QUOTED_STRING) && !(t instanceof $))
     return !1;
   let e;
-  if (t instanceof $ ? e = Ne(t).unwrap_or("") : e = t.expression.variable.value, e)
+  if (t instanceof $ ? e = me(t).unwrap_or("") : e = t.expression.variable.value, e)
     switch (e.toLowerCase()) {
       case "cascade":
       case "no action":
@@ -2168,7 +2179,7 @@ class yn {
     return this.declarationNode.parent instanceof A ? [new c(o.INVALID_TABLE_CONTEXT, "Table must appear top-level", this.declarationNode)] : [];
   }
   validateName(e) {
-    return e ? e instanceof ce ? [new c(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : Ze(e) ? [] : [new c(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new c(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
+    return e ? e instanceof le ? [new c(o.INVALID_NAME, "Invalid array as Table name, maybe you forget to add a space between the name and the setting list?", e)] : Ze(e) ? [] : [new c(o.INVALID_NAME, "A Table name must be of the form <table> or <schema>.<table>", e)] : [new c(o.NAME_NOT_FOUND, "A Table must have a name", this.declarationNode)];
   }
   validateAlias(e) {
     return e ? On(e) ? [] : [new c(o.INVALID_ALIAS, "Table aliases can only contains alphanumeric and underscore unless surrounded by double quotes", e)] : [];
@@ -2221,13 +2232,13 @@ class yn {
       if (!n.callee)
         return [];
       const s = [];
-      n.args.length === 0 && s.push(new c(o.INVALID_COLUMN, "A column must have a type", n.callee)), M(n.callee) || s.push(new c(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !kn(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
+      n.args.length === 0 && s.push(new c(o.INVALID_COLUMN, "A column must have a type", n.callee)), F(n.callee) || s.push(new c(o.INVALID_COLUMN_NAME, "A column name must be an identifier or a quoted identifier", n.callee)), n.args[0] && !kn(n.args[0]) && s.push(new c(o.INVALID_COLUMN_TYPE, "Invalid column type", n.args[0]));
       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)) {
+    if (e.callee && F(e.callee)) {
       const n = V(e.callee).unwrap(), s = Ye(n), i = this.symbolFactory.create(en, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
@@ -2244,7 +2255,7 @@ class yn {
   }
   // This is needed to support legacy inline settings
   validateFieldSetting(e) {
-    if (!e.slice(0, -1).every(Ee) || !e.slice(-1).every((p) => Ee(p) || p instanceof P))
+    if (!e.slice(0, -1).every(Ne) || !e.slice(-1).every((p) => Ne(p) || p instanceof P))
       return [...e.map((p) => new c(o.INVALID_COLUMN, "These fields must be some inline settings optionally ended with a setting list", p))];
     if (e.length === 0)
       return [];
@@ -2276,34 +2287,34 @@ class yn {
           break;
         case "primary key":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "primary key can only appear once", f))), h.forEach((f) => {
-            le(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
+            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'primary key' must not have a value", f.value || f.name));
           });
           break;
         case "pk":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'pk' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
+            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'pk' must not have a value", f.value || f.name));
           });
           break;
         case "not null":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'not null' can only appear once", f)));
           const T = r.null || [];
           h.length >= 1 && T.length >= 1 && i.push(...[...h, ...T].map((f) => new c(o.CONFLICTING_SETTING, "'not null' and 'null' can not be set at the same time", f))), h.forEach((f) => {
-            le(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
+            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'not null' must not have a value", f.value || f.name));
           });
           break;
         case "null":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'null' can only appear once", f))), h.forEach((f) => {
-            le(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
+            ce(f.value) || i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'null' must not have a value", f.value || f.name));
           });
           break;
         case "unique":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'unique' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
+            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'unique' must not have a value", f.value || f.name));
           });
           break;
         case "increment":
           h.length > 1 && i.push(...h.map((f) => new c(o.DUPLICATE_COLUMN_SETTING, "'increment' can only appear once", f))), h.forEach((f) => {
-            f instanceof se && !le(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
+            f instanceof se && !ce(f.value) && i.push(new c(o.INVALID_COLUMN_SETTING_VALUE, "'increment' must not have a value", f.value || f.name));
           });
           break;
         case "default":
@@ -2331,14 +2342,14 @@ class yn {
   }
 }
 function kn(t) {
-  if (!(t instanceof J || Je(t) || t instanceof D || t instanceof ce))
+  if (!(t instanceof J || Je(t) || t instanceof D || t instanceof le))
     return !1;
   if (t instanceof J) {
-    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => ue(n) || Y(n) || Ee(n)))
+    if (t.callee === void 0 || t.argumentList === void 0 || !t.argumentList.elementList.every((n) => ue(n) || Y(n) || Ne(n)))
       return !1;
     t = t.callee;
   }
-  for (; t instanceof ce; ) {
+  for (; t instanceof le; ) {
     if (t.array === void 0 || t.indexer === void 0 || !t.indexer.elementList.every((n) => !n.colon && !n.value && ue(n.name)))
       return !1;
     t = t.array;
@@ -2403,7 +2414,7 @@ class Sn {
     });
   }
   registerField(e) {
-    if (e.callee && M(e.callee)) {
+    if (e.callee && F(e.callee)) {
       const n = V(e.callee).unwrap(), s = He(n), i = this.symbolFactory.create(nn, { declaration: e });
       e.symbol = i;
       const r = this.declarationNode.symbol.symbolTable;
@@ -2473,7 +2484,7 @@ function yt(t) {
 }
 function Rn(t) {
   var n;
-  if (!(t instanceof D) || !(t.expression instanceof me) || ((n = t.expression.literal) == null ? void 0 : n.kind) !== u.COLOR_LITERAL)
+  if (!(t instanceof D) || !(t.expression instanceof Te) || ((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] !== "#")
@@ -2483,16 +2494,16 @@ function Rn(t) {
       return !1;
   return !0;
 }
-function le(t) {
+function ce(t) {
   return t === void 0;
 }
 function Dn(t) {
   var e;
-  return !!(Y(t) || ue(t) || Ee(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof q && wt.includes((e = t.op) == null ? void 0 : e.value) && ue(t.expression) || t instanceof te);
+  return !!(Y(t) || ue(t) || Ne(t) && ["true", "false", "null"].includes(t.expression.variable.value.toLowerCase()) || t instanceof q && wt.includes((e = t.op) == null ? void 0 : e.value) && ue(t.expression) || t instanceof te);
 }
 function ue(t) {
   var e;
-  return t instanceof D && t.expression instanceof me && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
+  return t instanceof D && t.expression instanceof Te && ((e = t.expression.literal) == null ? void 0 : e.kind) === u.NUMERIC_LITERAL;
 }
 function Pn(t) {
   var n;
@@ -2502,13 +2513,13 @@ function Pn(t) {
   return e !== void 0 && e.length > 0;
 }
 function kt(t) {
-  return t instanceof Z && t.elementList.every(M);
+  return t instanceof Z && t.elementList.every(F);
 }
 function W(t) {
   var s;
   const e = {}, n = [];
   if (!t)
-    return new F({});
+    return new B({});
   for (const i of t.elementList) {
     if (!i.name)
       continue;
@@ -2516,10 +2527,10 @@ function W(t) {
       n.push(new c(o.INVALID_SETTINGS, "A setting name must be a stream of identifiers", i.name));
       continue;
     }
-    const r = (s = Ne(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
+    const r = (s = me(i.name).unwrap_or(void 0)) == null ? void 0 : s.toLowerCase();
     r && (e[r] === void 0 ? e[r] = [i] : e[r].push(i));
   }
-  return new F(e, n);
+  return new B(e, n);
 }
 class ft {
   constructor(e, n) {
@@ -2540,7 +2551,7 @@ class ft {
       e.push(...r.validate());
     });
     const n = this.ast.body.filter((s) => ve(s).unwrap_or(void 0) === b.Project);
-    return n.length > 1 && n.forEach((s) => e.push(new c(o.PROJECT_REDEFINED, "Only one project can exist", s))), new F(this.ast, e);
+    return n.length > 1 && n.forEach((s) => e.push(new c(o.PROJECT_REDEFINED, "Only one project can exist", s))), new B(this.ast, e);
   }
 }
 class ae {
@@ -2555,7 +2566,7 @@ class ae {
       for (const s of e.elementList) {
         if (s.name instanceof D)
           continue;
-        const i = Ne(s.name).unwrap_or(void 0);
+        const i = me(s.name).unwrap_or(void 0);
         if (!i)
           continue;
         const r = n[i.toLowerCase()];
@@ -2603,7 +2614,7 @@ class ae {
   bindFragments(e, n) {
     if (e.length === 0)
       return;
-    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((f) => !M(f)), l = r !== -1 && kt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, h = e.slice(
+    const s = [...n.topSubnamesSymbolKind], { remainingSubnamesSymbolKind: i } = n, r = e.findIndex((f) => !F(f)), l = r !== -1 && kt(e[r]) ? e[r] : void 0, p = r >= 0 ? s.pop() : void 0, h = e.slice(
       0,
       r === -1 ? void 0 : r
     );
@@ -2839,7 +2850,7 @@ class $n {
         const n = xt(e);
         new n(e, this.errors).bind();
       }
-    return new F(this.ast, this.errors);
+    return new B(this.ast, this.errors);
   }
 }
 class Wn {
@@ -2860,7 +2871,7 @@ class jn {
   }
   // For invoking the validator only
   validate() {
-    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new F(n, []));
+    return new ft(this.ast, this.symbolFactory).validate().chain((n) => new B(n, []));
   }
 }
 function pt(t, e) {
@@ -2911,7 +2922,7 @@ function $e(t) {
   const e = (n = he(t).unwrap_or(void 0)) == null ? void 0 : n.pop();
   return e instanceof Z ? e.elementList.map((s) => s.referee) : [e.referee];
 }
-function Te(t) {
+function be(t) {
   const e = C(t).unwrap();
   return {
     name: e.pop(),
@@ -2937,10 +2948,10 @@ function Dt(t, e) {
   const n = t.id, s = e.id;
   return n === s;
 }
-function ge(t) {
+function Ee(t) {
   const e = t.split(`
-`), n = e.filter((i) => i.trimStart()), s = Math.min(...n.map((i) => i.length - i.trimStart().length));
-  return e.map((i) => i.slice(s)).join(`
+`), n = e.slice(e.findIndex((r) => r.trimStart() !== "")), s = n.filter((r) => r.trimStart()), i = Math.min(...s.map((r) => r.length - r.trimStart().length));
+  return n.map((r) => r.slice(i)).join(`
 `);
 }
 class Pt {
@@ -2967,7 +2978,7 @@ class Pt {
     }), this.pkColumns.forEach((n) => n.pk = !1)), e;
   }
   interpretName(e) {
-    const { name: n, schemaName: s } = Te(e);
+    const { name: n, schemaName: s } = be(e);
     return s.length > 1 ? (this.table.name = n, this.table.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.table.name = n, this.table.schemaName = s.length ? s[0] : null, []);
   }
   interpretAlias(e) {
@@ -2989,7 +3000,7 @@ class Pt {
     this.table.headerColor = (i = n.headercolor) != null && i.length ? Ot((a = (r = n.headercolor) == null ? void 0 : r.at(0)) == null ? void 0 : a.value) : void 0;
     const [s] = n.note || [];
     return this.table.note = s && {
-      value: Q(s == null ? void 0 : s.value).map(ge).unwrap(),
+      value: Q(s == null ? void 0 : s.value).map(Ee).unwrap(),
       token: x(s)
     }, [];
   }
@@ -3003,7 +3014,7 @@ class Pt {
       switch ((s = n.type) == null ? void 0 : s.value.toLowerCase()) {
         case "note":
           return this.table.note = {
-            value: Q(n.body instanceof ne ? n.body.body[0].callee : n.body.callee).map(ge).unwrap(),
+            value: Q(n.body instanceof ne ? n.body.body[0].callee : n.body.callee).map(Ee).unwrap(),
             token: x(n)
           }, [];
         case "indexes":
@@ -3027,11 +3038,11 @@ class Pt {
       s.pk = !!((a = _.pk) != null && a.length) || !!((l = _["primary key"]) != null && l.length), s.increment = !!((p = _.increment) != null && p.length), s.unique = !!((h = _.unique) != null && h.length), s.not_null = !!((T = _["not null"]) != null && T.length) && !0, s.dbdefault = zn((N = (f = _.default) == null ? void 0 : f.at(0)) == null ? void 0 : N.value);
       const K = (g = _.note) == null ? void 0 : g.at(0);
       s.note = K && {
-        value: Q(K.value).map(ge).unwrap(),
+        value: Q(K.value).map(Ee).unwrap(),
         token: x(K)
       };
-      const be = _.ref || [];
-      s.inline_refs = be.flatMap((z) => {
+      const Ie = _.ref || [];
+      s.inline_refs = Ie.flatMap((z) => {
         const [nt] = $e(z.value.expression);
         if (Dt(nt, e.symbol))
           return n.push(new c(o.SAME_ENDPOINT, "Two endpoints are the same", z)), [];
@@ -3047,29 +3058,29 @@ class Pt {
             token: x(z)
           };
         } else if (ee.length === 2) {
-          const [oe, Ie] = ee;
+          const [oe, Le] = ee;
           fe = {
             schemaName: null,
             tableName: oe,
-            fieldNames: [Ie],
+            fieldNames: [Le],
             relation: ye.value,
             token: x(z)
           };
         } else if (ee.length === 3) {
-          const [oe, Ie, it] = ee;
+          const [oe, Le, it] = ee;
           fe = {
             schemaName: oe,
-            tableName: Ie,
+            tableName: Le,
             fieldNames: [it],
             relation: ye.value,
             token: x(z)
           };
         } else {
           n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", z));
-          const oe = ee.pop(), Ie = ee.pop();
+          const oe = ee.pop(), Le = ee.pop();
           fe = {
             schemaName: ee.join("."),
-            tableName: Ie,
+            tableName: Le,
             fieldNames: [oe],
             relation: ye.value,
             token: x(z)
@@ -3106,12 +3117,12 @@ class Pt {
       }).forEach((g) => {
         const { functional: _, nonFunctional: K } = Xe(g).unwrap();
         s.columns.push(
-          ..._.map((be) => ({
-            value: be.value.value,
+          ..._.map((Ie) => ({
+            value: Ie.value.value,
             type: "expression"
           })),
-          ...K.map((be) => ({
-            value: V(be).unwrap(),
+          ...K.map((Ie) => ({
+            value: V(Ie).unwrap(),
             type: "column"
           }))
         );
@@ -3150,17 +3161,17 @@ function Yn(t) {
   let e = null;
   t instanceof J && (e = t.argumentList.elementList.map((r) => ue(r) ? r.expression.literal.value : Y(r) ? Q(r).unwrap() : X(r).unwrap()).join(","), t = t.callee);
   let n = "";
-  for (; t instanceof ce; )
+  for (; t instanceof le; )
     n = `[${t.indexer.elementList.map((r) => r.name.expression.literal.value).join(",")}]${n}`, t = t.array;
-  const { name: s, schemaName: i } = Te(t);
-  return i.length > 1 ? new F(
+  const { name: s, schemaName: i } = be(t);
+  return i.length > 1 ? new B(
     {
       schemaName: i.length === 0 ? null : i[0],
       type_name: `${s}${n}${e ? `(${e})` : ""}`,
       args: e
     },
     [new c(o.UNSUPPORTED, "Nested schema is not supported", t)]
-  ) : new F({
+  ) : new B({
     schemaName: i.length === 0 ? null : i[0],
     type_name: `${s}${n}${e ? `(${e})` : ""}`,
     args: e
@@ -3179,7 +3190,7 @@ function zn(t) {
         type: "number",
         value: Number.parseFloat(t.expression.literal.value)
       };
-    if (Ee(t))
+    if (Ne(t))
       return {
         value: t.expression.variable.value.toLowerCase(),
         type: "boolean"
@@ -3211,7 +3222,7 @@ class Qn {
     ];
   }
   interpretName(e) {
-    const { name: n } = Te(e);
+    const { name: n } = be(e);
     return this.note.name = n, [];
   }
   interpretSettingList(e) {
@@ -3227,7 +3238,7 @@ class Qn {
   }
   interpretNote(e) {
     const n = I.get(e, "callee.expression.literal.value", "");
-    return this.note.content = ge(n), [];
+    return this.note.content = Ee(n), [];
   }
 }
 class Ut {
@@ -3257,9 +3268,9 @@ class Ut {
       ];
     if (e.args[0]) {
       const g = W(e.args[0]).getValue(), _ = (T = (h = g.delete) == null ? void 0 : h.at(0)) == null ? void 0 : T.value;
-      this.ref.onDelete = _ instanceof $ ? Ne(_).unwrap_or(void 0) : X(_).unwrap_or(void 0);
+      this.ref.onDelete = _ instanceof $ ? me(_).unwrap_or(void 0) : X(_).unwrap_or(void 0);
       const K = (N = (f = g.update) == null ? void 0 : f.at(0)) == null ? void 0 : N.value;
-      this.ref.onUpdate = K instanceof $ ? Ne(K).unwrap_or(void 0) : X(K).unwrap_or(void 0);
+      this.ref.onUpdate = K instanceof $ ? me(K).unwrap_or(void 0) : X(K).unwrap_or(void 0);
     }
     const p = St(n);
     return this.ref.endpoints = [
@@ -3288,7 +3299,7 @@ class Mt {
     ), e;
   }
   interpretName(e) {
-    const n = [], { name: s, schemaName: i } = Te(e);
+    const n = [], { name: s, schemaName: i } = be(e);
     return i.length >= 2 && (this.tableGroup.name = s, this.tableGroup.schemaName = i.join("."), n.push(new c(o.UNSUPPORTED, "Nested schema is not supported", this.declarationNode.name))), this.tableGroup.name = s, this.tableGroup.schemaName = i[0] || null, n;
   }
   interpretBody(e) {
@@ -3317,7 +3328,7 @@ class Ft {
     return this.enum.token = x(this.declarationNode), this.env.enums.set(this.declarationNode, this.enum), [...this.interpretName(this.declarationNode.name), ...this.interpretBody(this.declarationNode.body)];
   }
   interpretName(e) {
-    const { name: n, schemaName: s } = Te(e);
+    const { name: n, schemaName: s } = be(e);
     return s.length > 1 ? (this.enum.name = n, this.enum.schemaName = s.join("."), [new c(o.UNSUPPORTED, "Nested schema is not supported", e)]) : (this.enum.name = n, this.enum.schemaName = s.length ? s[0] : null, []);
   }
   interpretBody(e) {
@@ -3327,7 +3338,7 @@ class Ft {
       i.token = x(s), i.name = X(s.callee).unwrap();
       const a = (l = W(s.args[0]).getValue().note) == null ? void 0 : l.at(0);
       return i.note = a && {
-        value: Q(a.value).map(ge).unwrap(),
+        value: Q(a.value).map(Ee).unwrap(),
         token: x(a)
       }, this.enum.values.push(i), [];
     });
@@ -3343,7 +3354,7 @@ class qn {
   interpretName(e) {
     if (!e)
       return this.project.name = null, [];
-    const { name: n } = Te(e);
+    const { name: n } = be(e);
     return this.project.name = n, [];
   }
   interpretBody(e) {
@@ -3369,7 +3380,7 @@ class qn {
         }
         case "note":
           return this.project.note = {
-            value: Q(s.body instanceof ne ? s.body.body[0].callee : s.body.callee).unwrap(),
+            value: Q(s.body instanceof ne ? s.body.body[0].callee : s.body.callee).map(Ee).unwrap(),
             token: x(s)
           }, [];
         default:
@@ -3412,7 +3423,7 @@ class Hn {
           return [];
       }
     });
-    return new F(Jn(this.env), e);
+    return new B(Jn(this.env), e);
   }
 }
 function Jn(t) {
@@ -3496,11 +3507,11 @@ class Bt {
       ...(r == null ? void 0 : r.trailingTrivia) || [],
       ...(r == null ? void 0 : r.leadingTrivia) || [],
       ...(l == null ? void 0 : l.leadingTrivia) || []
-    ].find((N) => jt(N) && Le(s, N)))
+    ].find((N) => jt(N) && ge(s, N)))
       return O();
     if (a === void 0)
       return Tt();
-    if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && Le(s, r))
+    if ([u.STRING_LITERAL, u.QUOTED_STRING].includes(r.kind) && ge(s, r))
       return O();
     const p = this.compiler.container.element(s);
     if (this.compiler.container.scopeKind(s) === R.TOPLEVEL || p instanceof A && p.type && p.type.start <= s && p.type.end >= s)
@@ -3546,7 +3557,7 @@ class Bt {
           return Zn(this.compiler, s);
         if (N instanceof w)
           return mt(this.compiler, s, N);
-        if (N instanceof A && (N.bodyColon && s >= N.bodyColon.end || N.body && Le(s, N.body)))
+        if (N instanceof A && (N.bodyColon && s >= N.bodyColon.end || N.body && ge(s, N.body)))
           return mt(this.compiler, s, void 0);
       }
     return O();
@@ -3622,7 +3633,7 @@ function Et(t, e, n) {
     const i = Kn(
       t,
       e,
-      Ne(n.name).unwrap()
+      me(n.name).unwrap()
     );
     return (s == null ? void 0 : s.kind) === u.COLON && Re(s, e) ? De(i) : i;
   }
@@ -3632,7 +3643,7 @@ function Nt(t, e) {
   const n = t.container.element(e), s = t.container.scopeKind(e);
   if (n instanceof G)
     return O();
-  if (n.body && !Le(e, n.body))
+  if (n.body && !ge(e, n.body))
     switch (s) {
       case R.TABLE:
         return {
@@ -3755,7 +3766,7 @@ function Kn(t, e, n) {
 }
 function Vt(t, e, n) {
   const s = he(n).unwrap_or([]);
-  if (s.pop(), s.some((r) => !M(r)))
+  if (s.pop(), s.some((r) => !F(r)))
     return O();
   const i = s.map((r) => X(r).unwrap());
   return Fe({
@@ -4032,7 +4043,7 @@ class $t {
     return [];
   }
 }
-const ls = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const cs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   CompletionItemInsertTextRule: y,
   CompletionItemKind: L,
@@ -4041,7 +4052,7 @@ const ls = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   DBMLReferencesProvider: $t
 }, Symbol.toStringTag, { value: "Module" }));
 var R = /* @__PURE__ */ ((t) => (t[t.TABLE = 0] = "TABLE", t[t.ENUM = 1] = "ENUM", t[t.TABLEGROUP = 2] = "TABLEGROUP", t[t.INDEXES = 3] = "INDEXES", t[t.NOTE = 4] = "NOTE", t[t.REF = 5] = "REF", t[t.PROJECT = 6] = "PROJECT", t[t.CUSTOM = 7] = "CUSTOM", t[t.TOPLEVEL = 8] = "TOPLEVEL", t))(R || {});
-class cs {
+class ls {
   constructor() {
     this.source = "", this.cache = new Array(
       16
@@ -4061,7 +4072,7 @@ class cs {
       _: this.createQuery(
         0,
         () => {
-          const e = new ln(this.source).lex().chain((n) => new hn(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new jn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
+          const e = new cn(this.source).lex().chain((n) => new hn(n, this.nodeIdGenerator).parse()).chain(({ ast: n, tokens: s }) => new jn(n, this.symbolIdGenerator).analyze().map(() => ({ ast: n, tokens: s })));
           return e.getErrors().length > 0 ? e : e.chain(({ ast: n, tokens: s }) => new Hn(n).interpret().map((r) => ({ ast: n, tokens: s, rawDb: r })));
         }
       ),
@@ -4099,8 +4110,8 @@ class cs {
           let a = this.parse.ast();
           const l = [a];
           for (; ; ) {
-            const h = on(a).find((T) => Le(r, T));
-            if (h === void 0 || h instanceof B)
+            const h = on(a).find((T) => ge(r, T));
+            if (h === void 0 || h instanceof M)
               break;
             l.push(h), a = h;
           }
@@ -4248,7 +4259,7 @@ class cs {
   }
 }
 export {
-  cs as Compiler,
+  ls as Compiler,
   os as serialize,
-  ls as services
+  cs as services
 };