@aster-cloud/aster-lang-ts 1.0.28 → 1.0.30

package/dist/test/unit/strict-int-coercion.test.js

@@ -0,0 +1,96 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+import { compile } from '../../src/browser.js';
+import { evaluate } from '../../src/core/interpreter.js';
+/**
+ * 严格整型换算（issue aster-lang-ts#144）。
+ *
+ * ★真实缺陷：`Date.*` / `List.range` / `List.get` / `List.slice` / `Text.substring`
+ * 用裸 `Number()` 强转。`Number("x")` 得 `NaN` 后**所有防线同时失效**——
+ * `NaN < MIN || NaN > MAX` 两侧都是 false 于是放行；`size > MAX_RANGE_SIZE` 同理，
+ * 然后循环零次静默返回 `[]`。非法输入不报错，反而产出「看起来正常」的决策值。
+ *
+ * 实测（修复前）：
+ *
+ *     Date.daysBetween("x","b")            → success:true, value:NaN
+ *     Date.addDays("x",5) greater than 0   → success:true, value:false
+ *     List.length(List.range("a",5))       → success:true, value:0
+ *
+ * 而 truffle 同输入抛 `NumberFormatException`——**同一条规则两引擎一个静默出错答案、
+ * 一个响亮失败**。对合规引擎，静默的那个远更危险：错误答案会一路流进裁决结果。
+ */
+function run(body) {
+    const c = compile(`Module probe.\n${body}\n`);
+    assert.ok(c.core, `compile: ${JSON.stringify(c.parseErrors ?? [])}`);
+    const ev = evaluate(c.core, 'main', { seed: 0 });
+    return { success: ev.success, value: ev.value, error: String(ev.error ?? '') };
+}
+function expectLoudFailure(body, mustMention) {
+    const r = run(body);
+    assert.equal(r.success, false, `必须响亮失败，实际 success=true value=${JSON.stringify(r.value)}`);
+    assert.match(r.error, /expected Int/, `错误信息须指明期望 Int；实际：${r.error}`);
+    assert.ok(r.error.includes(mustMention), `错误信息须点名出问题的 builtin（${mustMention}），否则用户无从定位；实际：${r.error}`);
+}
+describe('非法整型入参必须响亮失败（不得静默产 NaN）', () => {
+    it('★Date.daysBetween 非数字字符串（此前 success:true, value:NaN）', () => {
+        expectLoudFailure('Rule main produce Int:\n  Return Date.daysBetween("x", "b").', 'Date.daysBetween');
+    });
+    it('★Date.addDays 非数字字符串（此前静默产出 false 决策）', () => {
+        // 这条最能说明危害：NaN 参与比较后产出一个**看似正常的布尔裁决**。
+        expectLoudFailure('Rule main produce Bool:\n  Return Date.addDays("x", 5) greater than 0.', 'Date.addDays');
+    });
+    it('★List.range 非数字字符串（此前静默返回空列表）', () => {
+        expectLoudFailure('Rule main produce Int:\n  Return List.length(List.range("a", 5)).', 'List.range');
+    });
+    it('List.get / List.slice / Text.substring 同样收口', () => {
+        expectLoudFailure('Rule main produce Int:\n  Return List.get([1, 2, 3], "x").', 'List.get');
+        expectLoudFailure('Rule main produce Int:\n  Return List.length(List.slice([1, 2, 3], "x", 2)).', 'List.slice');
+        expectLoudFailure('Rule main produce Text:\n  Return Text.substring("hello", "x").', 'Text.substring');
+    });
+    it('★小数字符串被拒（对齐 Integer.parseInt，不接受 "5.0"）', () => {
+        expectLoudFailure('Rule main produce Int:\n  Return List.length(List.range("5.0", 9)).', 'List.range');
+    });
+    it('★十六进制字符串被拒（裸 Number("0x10") 会读成 16，Java 侧拒绝）', () => {
+        // 与 decimalScale 里已记录的同一类分叉：JS 的宽松数字解析会与 Java 分叉。
+        expectLoudFailure('Rule main produce Int:\n  Return List.length(List.range("0x10", 99)).', 'List.range');
+    });
+    it('★空串与纯空白被拒（Number("") 是 0，会静默变成合法索引）', () => {
+        expectLoudFailure('Rule main produce Int:\n  Return List.get([1, 2, 3], "").', 'List.get');
+        expectLoudFailure('Rule main produce Int:\n  Return List.get([1, 2, 3], " ").', 'List.get');
+    });
+});
+describe('合法输入行为不变（反向护栏）', () => {
+    // ★没有这一组，把 toInt 写成「一律抛错」也能让上面全部变绿。
+    it('List.range 正常', () => {
+        const r = run('Rule main produce Int:\n  Return List.length(List.range(1, 5)).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 4);
+    });
+    it('Date.addDays 正常', () => {
+        const r = run('Rule main produce Int:\n  Return Date.addDays(Date.fromISO("2026-01-01"), 5).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 20459);
+    });
+    it('List.get 正常', () => {
+        const r = run('Rule main produce Int:\n  Return List.get([10, 20, 30], 1).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 20);
+    });
+    it('★数字字符串仍被接受（对齐 Integer.parseInt 收 "5"）', () => {
+        const r = run('Rule main produce Int:\n  Return List.length(List.range("1", 5)).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 4);
+    });
+    it('★负数与前后空白仍被接受（parseInt 亦然）', () => {
+        const r = run('Rule main produce Int:\n  Return List.length(List.range("-2", 2)).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 4);
+    });
+    it('★Double 入参按截断取整（对齐 Java Number.intValue()）', () => {
+        // 不是拒绝——truffle 的 toInt 对 Number 走 intValue() 截断，必须一致。
+        const r = run('Rule main produce Int:\n  Return List.get([10, 20, 30], 1.9).');
+        assert.equal(r.success, true, r.error);
+        assert.equal(r.value, 20, '1.9 应截断为 1');
+    });
+});
+//# sourceMappingURL=strict-int-coercion.test.js.map

package/dist/test/unit/strict-int-coercion.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strict-int-coercion.test.js","sourceRoot":"","sources":["../../../test/unit/strict-int-coercion.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,GAAG,CAAC,IAAY;IACvB,MAAM,CAAC,GAAG,OAAO,CAAC,kBAAkB,IAAI,IAAI,CAAC,CAAC;IAC9C,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,YAAY,IAAI,CAAC,SAAS,CAAE,CAA+B,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IACpG,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAK,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAClD,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;AACjF,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY,EAAE,WAAmB;IAC1D,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACpB,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,gCAAgC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC1F,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,cAAc,EAAE,oBAAoB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IACrE,MAAM,CAAC,EAAE,CACP,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,EAC7B,uBAAuB,WAAW,iBAAiB,CAAC,CAAC,KAAK,EAAE,CAC7D,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,iBAAiB,CAAC,8DAA8D,EAAE,kBAAkB,CAAC,CAAC;IACxG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,uCAAuC;QACvC,iBAAiB,CAAC,wEAAwE,EAAE,cAAc,CAAC,CAAC;IAC9G,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,iBAAiB,CAAC,mEAAmE,EAAE,YAAY,CAAC,CAAC;IACvG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,iBAAiB,CAAC,4DAA4D,EAAE,UAAU,CAAC,CAAC;QAC5F,iBAAiB,CAAC,8EAA8E,EAAE,YAAY,CAAC,CAAC;QAChH,iBAAiB,CAAC,iEAAiE,EAAE,gBAAgB,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,iBAAiB,CAAC,qEAAqE,EAAE,YAAY,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,kDAAkD;QAClD,iBAAiB,CAAC,uEAAuE,EAAE,YAAY,CAAC,CAAC;IAC3G,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,iBAAiB,CAAC,2DAA2D,EAAE,UAAU,CAAC,CAAC;QAC3F,iBAAiB,CAAC,4DAA4D,EAAE,UAAU,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,oCAAoC;IACpC,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,iEAAiE,CAAC,CAAC;QACjF,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,CAAC,GAAG,GAAG,CAAC,+EAA+E,CAAC,CAAC;QAC/F,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACrB,MAAM,CAAC,GAAG,GAAG,CAAC,6DAA6D,CAAC,CAAC;QAC7E,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,mEAAmE,CAAC,CAAC;QACnF,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,GAAG,CAAC,oEAAoE,CAAC,CAAC;QACpF,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,uDAAuD;QACvD,MAAM,CAAC,GAAG,GAAG,CAAC,+DAA+D,CAAC,CAAC;QAC/E,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,YAAY,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/unit/ufcs-receiver.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=ufcs-receiver.test.d.ts.map

package/dist/test/unit/ufcs-receiver.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ufcs-receiver.test.d.ts","sourceRoot":"","sources":["../../../test/unit/ufcs-receiver.test.ts"],"names":[],"mappings":""}

package/dist/test/unit/ufcs-receiver.test.js

@@ -0,0 +1,75 @@
+import { describe, it } from 'node:test';
+import assert from 'node:assert/strict';
+import { canonicalize } from '../../src/frontend/canonicalizer.js';
+import { lex } from '../../src/frontend/lexer.js';
+import { parse } from '../../src/parser.js';
+import { lowerModule } from '../../src/lower_to_core.js';
+/**
+ * UFCS（接收者转参数）：`value.sum(1, 2)` → `sum(value, 1, 2)`。
+ *
+ * <p>这是 Java 引擎有意设计的调用约定（`AstBuilder.applyCallSuffix`，由
+ * `AstBuilderTest.testMethodCallTransformsReceiver` 钉住），TS 侧此前缺失，
+ * 导致同一段源码在两个引擎上**实际传参个数不同**——不是表示差异，是行为差异：
+ *
+ * <pre>
+ *   io.verify(user, pass)
+ *     Java → Call(Name "verify",    [io, user, pass])   3 参
+ *     TS   → Call(Name "io.verify", [user, pass])       2 参   ← 分叉
+ * </pre>
+ *
+ * <p>★触发条件是 lexer 的 IDENT / TYPE_IDENT 之分，**不是**「首字母是否大写」：
+ * ASCII 小写或下划线开头 → IDENT → 走 UFCS；其余（大写、CJK…）→ TYPE_IDENT → 不拆分。
+ */
+function callOf(expr) {
+    const src = `Module p.\n\nRule r, produce:\n  Return ${expr}.\n`;
+    const ast = parse(lex(canonicalize(src))).ast;
+    const ir = JSON.parse(JSON.stringify(lowerModule(ast)));
+    const call = ir.decls[0].body.statements[0].expr;
+    return { target: call.target?.name, args: call.args };
+}
+describe('UFCS 接收者转参数（与 Java 引擎对齐）', () => {
+    it('★小写接收者：`value.sum(1, 2)` → `sum(value, 1, 2)`', () => {
+        const { target, args } = callOf('value.sum(1, 2)');
+        assert.strictEqual(target, 'sum', '调用目标应是方法名 `sum`（接收者已转为首个实参）。');
+        assert.strictEqual(args.length, 3, `实参应为 3 个（接收者 + 2 个原参），实际 ${args.length}`
+            + '\n★若为 2，说明未做 UFCS，与 Java 引擎的实际传参个数不一致。');
+        assert.strictEqual(args[0].name, 'value', '首个实参应是接收者 `value`。');
+    });
+    it('多段限定名：接收者只取**首段**（`a.b.c(1)` → 方法 `b.c`，接收者 `a`）', () => {
+        // 与 Java `combineName(null, pendingMembers)` 一致：除首段外全部并入方法名。
+        const { target, args } = callOf('a.b.c(1)');
+        assert.strictEqual(target, 'b.c', '方法名应是除首段外的全部段。');
+        assert.strictEqual(args[0].name, 'a', '接收者应只取首段。');
+        assert.strictEqual(args.length, 2);
+    });
+    it('★大写接收者不拆分：`Text.concat(a, b)` 保持限定名', () => {
+        // 反向守卫。没有这条，「UFCS」可以退化成「所有带点的名字都拆」——
+        // 那会把 Text.concat / Http.get / Map.get 这些**类型/模块限定名**一并拆坏，
+        // 而上面那条正向用例照样绿。
+        const { target, args } = callOf('Text.concat(1, 2)');
+        assert.strictEqual(target, 'Text.concat', '大写开头是类型/模块限定名，必须整体作为调用目标，不得拆分。');
+        assert.strictEqual(args.length, 2, '实参应仍为 2 个（没有多塞接收者）。');
+    });
+    it('★`Map.get` 同样不拆分（Map 有独立 lexer token，易被漏掉）', () => {
+        const { target, args } = callOf('Map.get(1, 2)');
+        assert.strictEqual(target, 'Map.get');
+        assert.strictEqual(args.length, 2);
+    });
+    it('无点的普通调用不受影响', () => {
+        const { target, args } = callOf('sum(1, 2)');
+        assert.strictEqual(target, 'sum');
+        assert.strictEqual(args.length, 2, '无接收者可转，实参个数不应变化。');
+    });
+    it('★拆出的接收者与方法名都必须带 origin（否则在 OriginMap 里不可达）', () => {
+        // 与 `Let "_"` 内层 Call 缺 origin 是同一类问题：节点没有位置信息时，
+        // ADR 0032 的 trace 锚点与 ADR 0037 的双向导航都定位不到它——不报错，
+        // 只是这段代码从导航里静默消失。
+        const src = 'Module p.\n\nRule r, produce:\n  Return value.sum(1).\n';
+        const ast = parse(lex(canonicalize(src))).ast;
+        const call = JSON.parse(JSON.stringify(lowerModule(ast)))
+            .decls[0].body.statements[0].expr;
+        assert.ok(call.target?.origin, '方法名节点缺少 origin。');
+        assert.ok(call.args[0]?.origin, '接收者节点缺少 origin。');
+    });
+});
+//# sourceMappingURL=ufcs-receiver.test.js.map

package/dist/test/unit/ufcs-receiver.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ufcs-receiver.test.js","sourceRoot":"","sources":["../../../test/unit/ufcs-receiver.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAClD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD;;;;;;;;;;;;;;;GAeG;AAEH,SAAS,MAAM,CAAC,IAAY;IAC1B,MAAM,GAAG,GAAG,2CAA2C,IAAI,KAAK,CAAC;IACjE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAgB,CAAC;IAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;AACxD,CAAC;AAED,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAEnD,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAC9B,8BAA8B,CAAC,CAAC;QAClC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAC/B,4BAA4B,IAAI,CAAC,MAAM,EAAE;cACvC,wCAAwC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAE,IAAI,CAAC,CAAC,CAAsB,CAAC,IAAI,EAAE,OAAO,EAC5D,oBAAoB,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,6DAA6D;QAC7D,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;QAE5C,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QACpD,MAAM,CAAC,WAAW,CAAE,IAAI,CAAC,CAAC,CAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC;QACzE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,qCAAqC;QACrC,2DAA2D;QAC3D,gBAAgB;QAChB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC;QAErD,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,aAAa,EACtC,gCAAgC,CAAC,CAAC;QACpC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;QAEjD,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACrB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7C,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAClC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,kBAAkB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,iDAAiD;QACjD,kDAAkD;QAClD,kBAAkB;QAClB,MAAM,GAAG,GAAG,yDAAyD,CAAC;QACtE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAgB,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aACtD,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEpC,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;QAClD,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@aster-cloud/aster-lang-ts",
-  "version": "1.0.28",
+  "version": "1.0.30",
   "description": "Aster CNL (Controlled Natural Language) TypeScript Compiler - Lexer, Parser, AST, Core IR, Type Checker",
   "type": "module",
   "main": "./dist/src/index.js",