@aid-framework/ir 0.0.0 → 0.1.48

package/dist/policy/lexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lexer.js","sourceRoot":"","sources":["../../src/policy/lexer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACL,mBAAmB,EAEnB,OAAO,EACP,cAAc,EACd,YAAY,GACb,MAAM,mBAAmB,CAAC;AA+B3B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AAEhE,MAAM,UAAU,gBAAgB,CAC9B,MAAc,EACd,OAAsB,EACtB,MAAc,EACd,IAAoE,EACpE,OAAe,EACf,IAAa;IAEb,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxD,OAAO,YAAY,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;QACxE,IAAI,EAAE,OAAO,CAAC,IAAI;QAClB,IAAI;QACJ,MAAM;KACP,CAAC,CAAC;AACL,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,MAAc,EAAE,OAAO,GAAkB,EAAE;IAClE,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,WAAW,GAAmB,EAAE,CAAC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;QAErC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACpE,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjD,MAAM,IAAI,GAAoB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1F,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YACjE,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAC5C,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,WAAW,CAAC,IAAI,CACd,gBAAgB,CACd,MAAM,EACN,OAAO,EACP,KAAK,EACL,mBAAmB,CAAC,wBAAwB,EAC5C,6BAA6B,EAC7B,+DAA+D,CAChE,CACF,CAAC;gBACF,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;gBACtB,SAAS;YACX,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;gBACV,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;gBACrD,KAAK,EAAE,KAAK;gBACZ,GAAG;aACJ,CAAC,CAAC;YACH,KAAK,GAAG,GAAG,CAAC;YACZ,SAAS;QACX,CAAC;QACD,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5F,KAAK,GAAG,GAAG,CAAC;YACZ,SAAS;QACX,CAAC;QACD,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtC,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;gBACxC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9E,CAAC;iBAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACtE,CAAC;YACD,KAAK,GAAG,GAAG,CAAC;YACZ,SAAS;QACX,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YACrE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7E,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7E,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QAED,WAAW,CAAC,IAAI,CACd,gBAAgB,CACd,MAAM,EACN,OAAO,EACP,KAAK,EACL,mBAAmB,CAAC,YAAY,EAChC,wBAAwB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAC9C,uHAAuH,CACxH,CACF,CAAC;QACF,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAClF,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACjC,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,SAAS,CAAC,KAAkB;IAC1C,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChE,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,UAAU,CAAC,MAAc,EAAE,KAAa,EAAE,KAAa;IAC9D,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;IACtB,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAW,CAAC;QACrC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,CAAC,CAAC;QACrC,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,SAAS,YAAY,CAAC,GAAW;IAC/B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACnD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAW,CAAC;QAClC,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAW,CAAC;YACtC,OAAO,IAAI,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAClF,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,OAAO,IAAI,IAAI,CAAC;IAClB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,UAAU,CAAC,MAAc,EAAE,KAAa;IAC/C,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAW,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAC7E,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC;QACnD,KAAK,IAAI,CAAC,CAAC;QACX,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,KAAK,CAAW,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;IAC/E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CAAC,MAAc,EAAE,KAAa;IACnD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAW,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IACtF,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC;AACpC,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY;IACrC,OAAO,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,KAAK,GAAG,CAAC;AACtF,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY;IACpC,OAAO,iBAAiB,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;AAClD,CAAC"}

package/dist/policy/parser.d.ts

@@ -0,0 +1,15 @@
+/**
+ * PolicyExpr recursive-descent parser. Total: it returns either an AST or
+ * diagnostics, and never lets an exception escape. An unparseable policy is a
+ * validation error and never treated as `true` — a policy the runtime cannot
+ * evaluate must fail closed.
+ */
+import { type IrDiagnostic } from '../diagnostics.js';
+import { type PolicyNode } from './ast.js';
+import { type PolicyContext } from './lexer.js';
+export interface PolicyParseResult {
+    ast?: PolicyNode;
+    diagnostics: IrDiagnostic[];
+}
+export declare function parsePolicyExpr(source: string, context?: PolicyContext): PolicyParseResult;
+//# sourceMappingURL=parser.d.ts.map

package/dist/policy/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../src/policy/parser.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAuB,KAAK,YAAY,EAAyB,MAAM,mBAAmB,CAAC;AAClG,OAAO,EAOL,KAAK,UAAU,EAChB,MAAM,UAAU,CAAC;AAClB,OAAO,EACL,KAAK,aAAa,EAKnB,MAAM,YAAY,CAAC;AAEpB,MAAM,WAAW,iBAAiB;IAChC,GAAG,CAAC,EAAE,UAAU,CAAC;IACjB,WAAW,EAAE,YAAY,EAAE,CAAC;CAC7B;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,GAAE,aAAkB,GAAG,iBAAiB,CAqD9F"}

package/dist/policy/parser.js

@@ -0,0 +1,202 @@
+/**
+ * PolicyExpr recursive-descent parser. Total: it returns either an AST or
+ * diagnostics, and never lets an exception escape. An unparseable policy is a
+ * validation error and never treated as `true` — a policy the runtime cannot
+ * evaluate must fail closed.
+ */
+import { IR_DIAGNOSTIC_CODES, irError, withPosition } from '../diagnostics.js';
+import { COMPARISON_OPERATORS, isPolicyBuiltin, POLICY_BUILTIN_ARITY, } from './ast.js';
+import { policyDiagnostic, tokenize, tokenText, } from './lexer.js';
+export function parsePolicyExpr(source, context = {}) {
+    const diagnostics = [];
+    if (source.trim() === '') {
+        diagnostics.push(policyDiagnostic(source, context, 0, IR_DIAGNOSTIC_CODES.policyEmpty, 'empty policy expression', 'a policy must evaluate to true or false; there is no implicit "allow"'));
+        return { diagnostics };
+    }
+    const lexed = tokenize(source, context);
+    diagnostics.push(...lexed.diagnostics);
+    try {
+        const parser = new Parser(source, context, lexed.tokens, diagnostics);
+        const ast = parser.parseExpression();
+        if (ast !== undefined && !parser.atEnd()) {
+            const token = parser.peek();
+            diagnostics.push(policyDiagnostic(source, context, token.start, IR_DIAGNOSTIC_CODES.policyTrailingToken, `unexpected trailing ${tokenText(token)} after a complete expression`, 'a policy is a single expression; combine conditions with and/or'));
+        }
+        if (diagnostics.some((entry) => entry.severity === 'error'))
+            return { diagnostics };
+        return ast === undefined ? { diagnostics } : { ast, diagnostics };
+    }
+    catch (error) {
+        diagnostics.push(withPosition(irError({
+            code: IR_DIAGNOSTIC_CODES.policySyntax,
+            message: `policy expression could not be parsed: ${error instanceof Error ? error.message : String(error)}`,
+            path: context.path,
+        }), { file: context.file }));
+        return { diagnostics };
+    }
+}
+class Parser {
+    source;
+    context;
+    tokens;
+    diagnostics;
+    index = 0;
+    constructor(source, context, tokens, diagnostics) {
+        this.source = source;
+        this.context = context;
+        this.tokens = tokens;
+        this.diagnostics = diagnostics;
+    }
+    atEnd() {
+        return this.peek().type === 'eof';
+    }
+    peek(offset = 0) {
+        const token = this.tokens[Math.min(this.index + offset, this.tokens.length - 1)];
+        return token;
+    }
+    parseExpression() {
+        return this.parseOr();
+    }
+    parseOr() {
+        let left = this.parseAnd();
+        while (this.isOperator('or')) {
+            this.index += 1;
+            const right = this.parseAnd();
+            if (left === undefined || right === undefined)
+                return left ?? right;
+            left = { kind: 'or', left, right };
+        }
+        return left;
+    }
+    parseAnd() {
+        let left = this.parseComparison();
+        while (this.isOperator('and')) {
+            this.index += 1;
+            const right = this.parseComparison();
+            if (left === undefined || right === undefined)
+                return left ?? right;
+            left = { kind: 'and', left, right };
+        }
+        return left;
+    }
+    parseComparison() {
+        const left = this.parseUnary();
+        const token = this.peek();
+        const op = token.type === 'operator' ? toComparisonOperator(String(token.value)) : undefined;
+        if (op === undefined)
+            return left;
+        this.index += 1;
+        const right = this.parseUnary();
+        if (left === undefined || right === undefined)
+            return left ?? right;
+        return { kind: 'comparison', op, left, right };
+    }
+    parseUnary() {
+        if (this.isOperator('not')) {
+            this.index += 1;
+            const operand = this.parseUnary();
+            return operand === undefined ? undefined : { kind: 'not', operand };
+        }
+        return this.parsePrimary();
+    }
+    parsePrimary() {
+        const token = this.peek();
+        if (token.type === 'boolean') {
+            this.index += 1;
+            return { kind: 'boolean', value: Boolean(token.value) };
+        }
+        if (token.type === 'number') {
+            this.index += 1;
+            return { kind: 'number', value: Number(token.value) };
+        }
+        if (token.type === 'string') {
+            this.index += 1;
+            return { kind: 'string', value: String(token.value) };
+        }
+        if (token.type === 'lparen') {
+            this.index += 1;
+            const inner = this.parseExpression();
+            if (this.peek().type !== 'rparen') {
+                this.report(this.peek().start, IR_DIAGNOSTIC_CODES.policyUnclosedParen, 'unclosed parenthesis in policy expression', 'add the matching ")"');
+                return inner;
+            }
+            this.index += 1;
+            return inner;
+        }
+        if (token.type === 'identifier') {
+            return this.parseCallOrIdentifier();
+        }
+        this.report(token.start, IR_DIAGNOSTIC_CODES.policyExpected, token.type === 'eof'
+            ? 'unexpected end of policy expression'
+            : `unexpected ${tokenText(token)} in policy expression`, 'expected a builtin call such as isAuthenticated(), true/false, or a parenthesized expression');
+        return undefined;
+    }
+    parseCallOrIdentifier() {
+        const token = this.peek();
+        const name = String(token.value);
+        this.index += 1;
+        if (this.peek().type !== 'lparen') {
+            this.report(token.start, IR_DIAGNOSTIC_CODES.policyUnknownIdentifier, `unknown identifier "${name}"`, 'bare identifiers are not values; call one of the builtins hasRole, hasScope, isAuthenticated');
+            return undefined;
+        }
+        if (!isPolicyBuiltin(name)) {
+            this.report(token.start, IR_DIAGNOSTIC_CODES.policyUnknownBuiltin, `unknown builtin "${name}"`, 'a policy naming a builtin the runtime cannot evaluate is rejected rather than treated as true');
+            this.skipCallArguments();
+            return undefined;
+        }
+        this.index += 1;
+        const args = [];
+        if (this.peek().type !== 'rparen') {
+            for (;;) {
+                const argument = this.parsePrimary();
+                if (argument === undefined)
+                    break;
+                args.push(argument);
+                if (this.peek().type !== 'comma')
+                    break;
+                this.index += 1;
+            }
+        }
+        if (this.peek().type !== 'rparen') {
+            this.report(this.peek().start, IR_DIAGNOSTIC_CODES.policyUnclosedParen, `unclosed argument list for ${name}(...)`, 'add the matching ")"');
+            return undefined;
+        }
+        this.index += 1;
+        const arity = POLICY_BUILTIN_ARITY[name];
+        if (args.length !== arity) {
+            this.report(token.start, IR_DIAGNOSTIC_CODES.policyArity, `${name}() takes ${arity} argument${arity === 1 ? '' : 's'}, received ${args.length}`);
+            return undefined;
+        }
+        if (arity === 1 && args[0]?.kind !== 'string') {
+            this.report(token.start, IR_DIAGNOSTIC_CODES.policyArgumentType, `${name}() expects a string literal argument`);
+            return undefined;
+        }
+        const call = { kind: 'call', name: name, args };
+        return call;
+    }
+    /** Consumes a rejected call's arguments so one bad builtin yields one error. */
+    skipCallArguments() {
+        let depth = 1;
+        while (!this.atEnd() && depth > 0) {
+            const token = this.peek();
+            if (token.type === 'lparen')
+                depth += 1;
+            if (token.type === 'rparen')
+                depth -= 1;
+            this.index += 1;
+        }
+    }
+    isOperator(value) {
+        const token = this.peek();
+        return token.type === 'operator' && token.value === value;
+    }
+    report(offset, code, message, hint) {
+        this.diagnostics.push(policyDiagnostic(this.source, this.context, offset, code, message, hint));
+    }
+}
+function toComparisonOperator(value) {
+    return COMPARISON_OPERATORS.includes(value)
+        ? value
+        : undefined;
+}
+//# sourceMappingURL=parser.js.map

package/dist/policy/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../src/policy/parser.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,mBAAmB,EAAqB,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAClG,OAAO,EACL,oBAAoB,EAEpB,eAAe,EACf,oBAAoB,GAIrB,MAAM,UAAU,CAAC;AAClB,OAAO,EAGL,gBAAgB,EAChB,QAAQ,EACR,SAAS,GACV,MAAM,YAAY,CAAC;AAOpB,MAAM,UAAU,eAAe,CAAC,MAAc,EAAE,OAAO,GAAkB,EAAE;IACzE,MAAM,WAAW,GAAmB,EAAE,CAAC;IAEvC,IAAI,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACzB,WAAW,CAAC,IAAI,CACd,gBAAgB,CACd,MAAM,EACN,OAAO,EACP,CAAC,EACD,mBAAmB,CAAC,WAAW,EAC/B,yBAAyB,EACzB,uEAAuE,CACxE,CACF,CAAC;QACF,OAAO,EAAE,WAAW,EAAE,CAAC;IACzB,CAAC;IAED,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACxC,WAAW,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC;IAEvC,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACtE,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,EAAE,CAAC;QACrC,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC5B,WAAW,CAAC,IAAI,CACd,gBAAgB,CACd,MAAM,EACN,OAAO,EACP,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,mBAAmB,EACvC,uBAAuB,SAAS,CAAC,KAAK,CAAC,8BAA8B,EACrE,iEAAiE,CAClE,CACF,CAAC;QACJ,CAAC;QACD,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC;YAAE,OAAO,EAAE,WAAW,EAAE,CAAC;QACpF,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC;IACpE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,WAAW,CAAC,IAAI,CACd,YAAY,CACV,OAAO,CAAC;YACN,IAAI,EAAE,mBAAmB,CAAC,YAAY;YACtC,OAAO,EAAE,0CACP,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CACvD,EAAE;YACF,IAAI,EAAE,OAAO,CAAC,IAAI;SACnB,CAAC,EACF,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CACvB,CACF,CAAC;QACF,OAAO,EAAE,WAAW,EAAE,CAAC;IACzB,CAAC;AACH,CAAC;AAED,MAAM,MAAM;IAIS,MAAM;IACN,OAAO;IACP,MAAM;IACN,WAAW;IANtB,KAAK,GAAG,CAAC,CAAC;IAElB,YACmB,MAAc,EACd,OAAsB,EACtB,MAAqB,EACrB,WAA2B;sBAH3B,MAAM;uBACN,OAAO;sBACP,MAAM;2BACN,WAAW;IAC3B,CAAC;IAEJ,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK,CAAC;IACpC,CAAC;IAED,IAAI,CAAC,MAAM,GAAG,CAAC;QACb,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACjF,OAAO,KAAoB,CAAC;IAC9B,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAEO,OAAO;QACb,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,IAAI,IAAI,KAAK,CAAC;YACpE,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,QAAQ;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACrC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO,IAAI,IAAI,KAAK,CAAC;YACpE,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,eAAe;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7F,IAAI,EAAE,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QAClC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,IAAI,KAAK,CAAC;QACpE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACjD,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAClC,OAAO,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACtE,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC7B,CAAC;IAEO,YAAY;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAE1B,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACxD,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACxD,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,MAAM,CACT,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,EACjB,mBAAmB,CAAC,mBAAmB,EACvC,2CAA2C,EAC3C,sBAAsB,CACvB,CAAC;gBACF,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAChB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,MAAM,CACT,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,cAAc,EAClC,KAAK,CAAC,IAAI,KAAK,KAAK;YAClB,CAAC,CAAC,qCAAqC;YACvC,CAAC,CAAC,cAAc,SAAS,CAAC,KAAK,CAAC,uBAAuB,EACzD,8FAA8F,CAC/F,CAAC;QACF,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,qBAAqB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAEhB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CACT,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,uBAAuB,EAC3C,uBAAuB,IAAI,GAAG,EAC9B,8FAA8F,CAC/F,CAAC;YACF,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CACT,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,oBAAoB,EACxC,oBAAoB,IAAI,GAAG,EAC3B,+FAA+F,CAChG,CAAC;YACF,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,MAAM,IAAI,GAAiB,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAClC,SAAS,CAAC;gBACR,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,IAAI,QAAQ,KAAK,SAAS;oBAAE,MAAM;gBAClC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACpB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO;oBAAE,MAAM;gBACxC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,CACT,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,EACjB,mBAAmB,CAAC,mBAAmB,EACvC,8BAA8B,IAAI,OAAO,EACzC,sBAAsB,CACvB,CAAC;YACF,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAEhB,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CACT,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,WAAW,EAC/B,GAAG,IAAI,YAAY,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,cAAc,IAAI,CAAC,MAAM,EAAE,CACtF,CAAC;YACF,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9C,IAAI,CAAC,MAAM,CACT,KAAK,CAAC,KAAK,EACX,mBAAmB,CAAC,kBAAkB,EACtC,GAAG,IAAI,sCAAsC,CAC9C,CAAC;YACF,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,IAAI,GAAe,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAqB,EAAE,IAAI,EAAE,CAAC;QAC7E,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gFAAgF;IACxE,iBAAiB;QACvB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;gBAAE,KAAK,IAAI,CAAC,CAAC;YACxC,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;gBAAE,KAAK,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC;IAC5D,CAAC;IAEO,MAAM,CACZ,MAAc,EACd,IAAoE,EACpE,OAAe,EACf,IAAa;QAEb,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IAClG,CAAC;CACF;AAED,SAAS,oBAAoB,CAAC,KAAa;IACzC,OAAQ,oBAA0C,CAAC,QAAQ,CAAC,KAAK,CAAC;QAChE,CAAC,CAAE,KAA4B;QAC/B,CAAC,CAAC,SAAS,CAAC;AAChB,CAAC"}

package/dist/predicate/ast.d.ts

@@ -0,0 +1,125 @@
+/**
+ * PredicateExpr AST. The eval-time counterpart to `PolicyExpr`: a closed grammar for
+ * an `assert` metric's condition, evaluated against one `(case, prediction)` pair.
+ *
+ * It is deliberately *not* `PolicyExpr`. A policy answers "who is asking?" from a
+ * `Principal`; a predicate answers "is this output acceptable?" from a dataset case
+ * and a prediction. They share no operand, so reusing the policy grammar would mean
+ * leaving three builtins the evaluator could never bind and adding a path production
+ * it has no context for -- a grammar that documents two contexts at once.
+ *
+ *   expression  := or
+ *   or          := and ('or' and)*
+ *   and         := not ('and' not)*
+ *   not         := 'not' not | comparison
+ *   comparison  := primary (('==' | '!=' | '<' | '<=' | '>' | '>=') primary)?
+ *   primary     := 'true' | 'false' | string | number | path | call | '(' expression ')'
+ *   path        := 'prediction' | 'case' '.' 'id' | 'case' '.' 'metadata' '.' NAME
+ *   call        := builtin '(' primary (',' primary)* ')'
+ *
+ * Precedence, tightest first: comparison, `not`, `and`, `or`. `not` is looser than
+ * a comparison so that `not prediction == "a"` negates the comparison; tighter and
+ * it would negate a string and reach the evaluator as a well-typed-looking tree.
+ *
+ * The AST is plain JSON so it can be embedded in the IR and interpreted by any
+ * target without a second parser.
+ */
+/**
+ * The three things an expression may read.
+ *
+ * Nothing else: there is no step counter, no loop variable, and no ambient config,
+ * because an eval case is the whole of the context at the point a metric scores.
+ * Every one of these is statically a string, which is what makes an unbound
+ * `case.metadata.<name>` the only dynamic lookup in the language.
+ */
+export declare const PREDICATE_PATHS: readonly ['prediction', 'case.id', 'case.metadata'];
+export type PredicatePathRoot = (typeof PREDICATE_PATHS)[number];
+/** Closed builtin set. No regex, no model call, no I/O: every call is total. */
+export declare const PREDICATE_BUILTINS: readonly ['contains', 'startswith', 'endswith', 'length'];
+export type PredicateBuiltin = (typeof PREDICATE_BUILTINS)[number];
+/** Arity of each builtin; the parser rejects any other argument count. */
+export declare const PREDICATE_BUILTIN_ARITY: Record<PredicateBuiltin, number>;
+export declare const PREDICATE_OPERATORS: readonly ['==', '!=', '<=', '>=', '<', '>'];
+export type PredicateOperator = (typeof PREDICATE_OPERATORS)[number];
+/**
+ * Operators that order rather than test equality.
+ *
+ * Numeric-only on purpose. Python compares `str` by code point and JavaScript by
+ * UTF-16 code unit, so `<` on strings is the one place a shared grammar would give
+ * the two runtimes different answers; refusing it keeps them identical instead of
+ * documenting the divergence and hoping nobody hits it.
+ */
+export declare const ORDERING_OPERATORS: readonly ['<=', '>=', '<', '>'];
+export type OrderingOperator = (typeof ORDERING_OPERATORS)[number];
+export interface PredicatePrediction {
+    kind: 'path';
+    path: 'prediction';
+}
+export interface PredicateCaseId {
+    kind: 'path';
+    path: 'case.id';
+}
+export interface PredicateMetadata {
+    kind: 'path';
+    path: 'case.metadata';
+    name: string;
+}
+export type PredicatePath = PredicateMetadata | PredicateCaseId | PredicatePrediction;
+/** A builtin call. Arguments are nodes; only the builtins above are accepted. */
+export interface PredicateCall {
+    kind: 'call';
+    name: PredicateBuiltin;
+    args: PredicateNode[];
+}
+export interface PredicateComparison {
+    kind: 'comparison';
+    op: PredicateOperator;
+    left: PredicateNode;
+    right: PredicateNode;
+}
+export interface PredicateLogical {
+    kind: 'and' | 'or';
+    left: PredicateNode;
+    right: PredicateNode;
+}
+export interface PredicateNot {
+    kind: 'not';
+    operand: PredicateNode;
+}
+/**
+ * A source that could not be parsed.
+ *
+ * Carried as a node rather than as `undefined` so a parse failure can never be
+ * mistaken for "no condition": the caller holds a node either way, and the
+ * accompanying diagnostic is what stops the build.
+ */
+export interface PredicateInvalid {
+    kind: 'invalid';
+    reason: string;
+}
+export type PredicateNode = PredicateCall | PredicateComparison | PredicateInvalid | PredicateLogical | PredicateNot | PredicatePath | {
+    kind: 'string';
+    value: string;
+} | {
+    kind: 'number';
+    value: number;
+} | {
+    kind: 'boolean';
+    value: boolean;
+};
+/** A parsed predicate expression; always a node, never the source string. */
+export type PredicateExpr = PredicateNode;
+export declare function isPredicateBuiltin(name: string): name is PredicateBuiltin;
+export declare function isOrderingOperator(op: PredicateOperator): op is OrderingOperator;
+/**
+ * Whether a node is boolean by construction.
+ *
+ * Checked at build time so a whole expression that evaluates to a string or a
+ * number is refused with a parse error instead of surfacing as "not a pass" at
+ * eval time. `length(prediction)` is the reachable case: a metric whose score
+ * hinges on it is a mistake, not a false assertion.
+ */
+export declare function predicateIsBoolean(node: PredicateNode): boolean;
+/** Renders an AST back to a normalized source form, for diagnostic messages. */
+export declare function formatPredicateExpr(node: PredicateNode): string;
+//# sourceMappingURL=ast.d.ts.map

package/dist/predicate/ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../src/predicate/ast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;;;;;GAOG;AACH,eAAO,MAAM,eAAe,YAAI,YAAY,EAAE,SAAS,EAAE,eAAe,CAAU,CAAC;AAEnF,MAAM,MAAM,iBAAiB,GAAG,CAAC,OAAO,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC;AAEjE,gFAAgF;AAChF,eAAO,MAAM,kBAAkB,YAAI,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,CAAU,CAAC;AAE5F,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE,0EAA0E;AAC1E,eAAO,MAAM,uBAAuB,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAKpE,CAAC;AAEF,eAAO,MAAM,mBAAmB,YAAI,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAE/E,MAAM,MAAM,iBAAiB,GAAG,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,CAAC,CAAC;AAErE;;;;;;;GAOG;AACH,eAAO,MAAM,kBAAkB,YAAI,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAElE,MAAM,MAAM,gBAAgB,GAAG,CAAC,OAAO,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;AAEnE,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,YAAY,CAAC;CACpB;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,SAAS,CAAC;CACjB;AAED,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,MAAM,aAAa,GAAG,iBAAiB,GAAG,eAAe,GAAG,mBAAmB,CAAC;AAEtF,iFAAiF;AACjF,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,gBAAgB,CAAC;IACvB,IAAI,EAAE,aAAa,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAClC,IAAI,EAAE,YAAY,CAAC;IACnB,EAAE,EAAE,iBAAiB,CAAC;IACtB,IAAI,EAAE,aAAa,CAAC;IACpB,KAAK,EAAE,aAAa,CAAC;CACtB;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC;IACnB,IAAI,EAAE,aAAa,CAAC;IACpB,KAAK,EAAE,aAAa,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,KAAK,CAAC;IACZ,OAAO,EAAE,aAAa,CAAC;CACxB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,MAAM,aAAa,GACrB,aAAa,GACb,mBAAmB,GACnB,gBAAgB,GAChB,gBAAgB,GAChB,YAAY,GACZ,aAAa,GACb;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACjC;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACjC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAExC,6EAA6E;AAC7E,MAAM,MAAM,aAAa,GAAG,aAAa,CAAC;AAE1C,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,IAAI,gBAAgB,CAEzE;AAED,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,iBAAiB,GAAG,EAAE,IAAI,gBAAgB,CAEhF;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO,CAiB/D;AAED,gFAAgF;AAChF,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAsB/D"}

package/dist/predicate/ast.js

@@ -0,0 +1,111 @@
+/**
+ * PredicateExpr AST. The eval-time counterpart to `PolicyExpr`: a closed grammar for
+ * an `assert` metric's condition, evaluated against one `(case, prediction)` pair.
+ *
+ * It is deliberately *not* `PolicyExpr`. A policy answers "who is asking?" from a
+ * `Principal`; a predicate answers "is this output acceptable?" from a dataset case
+ * and a prediction. They share no operand, so reusing the policy grammar would mean
+ * leaving three builtins the evaluator could never bind and adding a path production
+ * it has no context for -- a grammar that documents two contexts at once.
+ *
+ *   expression  := or
+ *   or          := and ('or' and)*
+ *   and         := not ('and' not)*
+ *   not         := 'not' not | comparison
+ *   comparison  := primary (('==' | '!=' | '<' | '<=' | '>' | '>=') primary)?
+ *   primary     := 'true' | 'false' | string | number | path | call | '(' expression ')'
+ *   path        := 'prediction' | 'case' '.' 'id' | 'case' '.' 'metadata' '.' NAME
+ *   call        := builtin '(' primary (',' primary)* ')'
+ *
+ * Precedence, tightest first: comparison, `not`, `and`, `or`. `not` is looser than
+ * a comparison so that `not prediction == "a"` negates the comparison; tighter and
+ * it would negate a string and reach the evaluator as a well-typed-looking tree.
+ *
+ * The AST is plain JSON so it can be embedded in the IR and interpreted by any
+ * target without a second parser.
+ */
+/**
+ * The three things an expression may read.
+ *
+ * Nothing else: there is no step counter, no loop variable, and no ambient config,
+ * because an eval case is the whole of the context at the point a metric scores.
+ * Every one of these is statically a string, which is what makes an unbound
+ * `case.metadata.<name>` the only dynamic lookup in the language.
+ */
+export const PREDICATE_PATHS = ['prediction', 'case.id', 'case.metadata'];
+/** Closed builtin set. No regex, no model call, no I/O: every call is total. */
+export const PREDICATE_BUILTINS = ['contains', 'startswith', 'endswith', 'length'];
+/** Arity of each builtin; the parser rejects any other argument count. */
+export const PREDICATE_BUILTIN_ARITY = {
+    contains: 2,
+    startswith: 2,
+    endswith: 2,
+    length: 1,
+};
+export const PREDICATE_OPERATORS = ['==', '!=', '<=', '>=', '<', '>'];
+/**
+ * Operators that order rather than test equality.
+ *
+ * Numeric-only on purpose. Python compares `str` by code point and JavaScript by
+ * UTF-16 code unit, so `<` on strings is the one place a shared grammar would give
+ * the two runtimes different answers; refusing it keeps them identical instead of
+ * documenting the divergence and hoping nobody hits it.
+ */
+export const ORDERING_OPERATORS = ['<=', '>=', '<', '>'];
+export function isPredicateBuiltin(name) {
+    return PREDICATE_BUILTINS.includes(name);
+}
+export function isOrderingOperator(op) {
+    return ORDERING_OPERATORS.includes(op);
+}
+/**
+ * Whether a node is boolean by construction.
+ *
+ * Checked at build time so a whole expression that evaluates to a string or a
+ * number is refused with a parse error instead of surfacing as "not a pass" at
+ * eval time. `length(prediction)` is the reachable case: a metric whose score
+ * hinges on it is a mistake, not a false assertion.
+ */
+export function predicateIsBoolean(node) {
+    switch (node.kind) {
+        case 'and':
+        case 'comparison':
+        case 'not':
+        case 'or':
+            return true;
+        case 'boolean':
+            return true;
+        case 'call':
+            return node.name !== 'length';
+        case 'invalid':
+        case 'number':
+        case 'path':
+        case 'string':
+            return false;
+    }
+}
+/** Renders an AST back to a normalized source form, for diagnostic messages. */
+export function formatPredicateExpr(node) {
+    switch (node.kind) {
+        case 'string':
+            return JSON.stringify(node.value);
+        case 'number':
+            return String(node.value);
+        case 'boolean':
+            return node.value ? 'true' : 'false';
+        case 'invalid':
+            return `<invalid: ${node.reason}>`;
+        case 'path':
+            return node.path === 'case.metadata' ? `case.metadata.${node.name}` : node.path;
+        case 'call':
+            return `${node.name}(${node.args.map(formatPredicateExpr).join(', ')})`;
+        case 'comparison':
+            return `${formatPredicateExpr(node.left)} ${node.op} ${formatPredicateExpr(node.right)}`;
+        case 'and':
+        case 'or':
+            return `(${formatPredicateExpr(node.left)} ${node.kind} ${formatPredicateExpr(node.right)})`;
+        case 'not':
+            return `not ${formatPredicateExpr(node.operand)}`;
+    }
+}
+//# sourceMappingURL=ast.js.map

package/dist/predicate/ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast.js","sourceRoot":"","sources":["../../src/predicate/ast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,YAAY,EAAE,SAAS,EAAE,eAAe,CAAU,CAAC;AAInF,gFAAgF;AAChF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,UAAU,EAAE,YAAY,EAAE,UAAU,EAAE,QAAQ,CAAU,CAAC;AAI5F,0EAA0E;AAC1E,MAAM,CAAC,MAAM,uBAAuB,GAAqC;IACvE,QAAQ,EAAE,CAAC;IACX,UAAU,EAAE,CAAC;IACb,QAAQ,EAAE,CAAC;IACX,MAAM,EAAE,CAAC;CACV,CAAC;AAEF,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAI/E;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAyElE,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAQ,kBAAwC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAClE,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,EAAqB;IACtD,OAAQ,kBAAwC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAmB;IACpD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,YAAY,CAAC;QAClB,KAAK,KAAK,CAAC;QACX,KAAK,IAAI;YACP,OAAO,IAAI,CAAC;QACd,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC;QAChC,KAAK,SAAS,CAAC;QACf,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,mBAAmB,CAAC,IAAmB;IACrD,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,KAAK,QAAQ;YACX,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC;QACvC,KAAK,SAAS;YACZ,OAAO,aAAa,IAAI,CAAC,MAAM,GAAG,CAAC;QACrC,KAAK,MAAM;YACT,OAAO,IAAI,CAAC,IAAI,KAAK,eAAe,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QAClF,KAAK,MAAM;YACT,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QAC1E,KAAK,YAAY;YACf,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3F,KAAK,KAAK,CAAC;QACX,KAAK,IAAI;YACP,OAAO,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,IAAI,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC/F,KAAK,KAAK;YACR,OAAO,OAAO,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;IACtD,CAAC;AACH,CAAC"}

package/dist/predicate/index.d.ts

@@ -0,0 +1,7 @@
+export type { OrderingOperator, PredicateBuiltin, PredicateCall, PredicateCaseId, PredicateComparison, PredicateExpr, PredicateInvalid, PredicateLogical, PredicateMetadata, PredicateNode, PredicateNot, PredicateOperator, PredicatePath, PredicatePathRoot, PredicatePrediction, } from './ast.js';
+export { formatPredicateExpr, isOrderingOperator, isPredicateBuiltin, ORDERING_OPERATORS, PREDICATE_BUILTIN_ARITY, PREDICATE_BUILTINS, PREDICATE_OPERATORS, PREDICATE_PATHS, predicateIsBoolean, } from './ast.js';
+export type { PredicateContext, PredicateLexResult, PredicateToken, PredicateTokenType, } from './lexer.js';
+export { tokenizePredicate, tokenText } from './lexer.js';
+export type { PredicateParseResult } from './parser.js';
+export { parsePredicateExpr } from './parser.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/predicate/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/predicate/index.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,gBAAgB,EAChB,gBAAgB,EAChB,aAAa,EACb,eAAe,EACf,mBAAmB,EACnB,aAAa,EACb,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,GACpB,MAAM,UAAU,CAAC;AAClB,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,uBAAuB,EACvB,kBAAkB,EAClB,mBAAmB,EACnB,eAAe,EACf,kBAAkB,GACnB,MAAM,UAAU,CAAC;AAClB,YAAY,EACV,gBAAgB,EAChB,kBAAkB,EAClB,cAAc,EACd,kBAAkB,GACnB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAC1D,YAAY,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC"}

package/dist/predicate/index.js

@@ -0,0 +1,4 @@
+export { formatPredicateExpr, isOrderingOperator, isPredicateBuiltin, ORDERING_OPERATORS, PREDICATE_BUILTIN_ARITY, PREDICATE_BUILTINS, PREDICATE_OPERATORS, PREDICATE_PATHS, predicateIsBoolean, } from './ast.js';
+export { tokenizePredicate, tokenText } from './lexer.js';
+export { parsePredicateExpr } from './parser.js';
+//# sourceMappingURL=index.js.map

package/dist/predicate/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/predicate/index.ts"],"names":[],"mappings":"AAiBA,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,uBAAuB,EACvB,kBAAkB,EAClB,mBAAmB,EACnB,eAAe,EACf,kBAAkB,GACnB,MAAM,UAAU,CAAC;AAOlB,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE1D,OAAO,EAAE,kBAAkB,EAAE,MAAM,aAAa,CAAC"}

package/dist/predicate/lexer.d.ts

@@ -0,0 +1,30 @@
+/**
+ * PredicateExpr lexer. Tracks byte offsets so every diagnostic points at the
+ * offending span. Never throws: malformed input yields tokens plus diagnostics.
+ *
+ * The only difference from the policy lexer is `.`, which is what makes
+ * `case.metadata.<name>` one path rather than three identifiers.
+ */
+import type { DiagnosticPath } from '@aid-framework/spec';
+import { IR_DIAGNOSTIC_CODES, type IrDiagnostic } from '../diagnostics.js';
+export type PredicateTokenType = 'boolean' | 'number' | 'string' | 'identifier' | 'operator' | 'lparen' | 'rparen' | 'comma' | 'dot' | 'eof';
+export interface PredicateToken {
+    type: PredicateTokenType;
+    /** Decoded value for literals and identifiers; the raw text for operators. */
+    value: string | number | boolean;
+    start: number;
+    end: number;
+}
+export interface PredicateContext {
+    path?: DiagnosticPath;
+    file?: string;
+}
+export interface PredicateLexResult {
+    tokens: PredicateToken[];
+    diagnostics: IrDiagnostic[];
+}
+export declare function predicateDiagnostic(source: string, context: PredicateContext, offset: number, code: (typeof IR_DIAGNOSTIC_CODES)[keyof typeof IR_DIAGNOSTIC_CODES], message: string, hint?: string): IrDiagnostic;
+export declare function tokenizePredicate(source: string, context?: PredicateContext): PredicateLexResult;
+/** The token's text as written, for messages. */
+export declare function tokenText(token: PredicateToken): string;
+//# sourceMappingURL=lexer.d.ts.map

package/dist/predicate/lexer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lexer.d.ts","sourceRoot":"","sources":["../../src/predicate/lexer.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EACL,mBAAmB,EACnB,KAAK,YAAY,EAIlB,MAAM,mBAAmB,CAAC;AAE3B,MAAM,MAAM,kBAAkB,GAC1B,SAAS,GACT,QAAQ,GACR,QAAQ,GACR,YAAY,GACZ,UAAU,GACV,QAAQ,GACR,QAAQ,GACR,OAAO,GACP,KAAK,GACL,KAAK,CAAC;AAEV,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,kBAAkB,CAAC;IACzB,8EAA8E;IAC9E,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,CAAC,EAAE,cAAc,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,cAAc,EAAE,CAAC;IACzB,WAAW,EAAE,YAAY,EAAE,CAAC;CAC7B;AAID,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,gBAAgB,EACzB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,CAAC,OAAO,mBAAmB,CAAC,CAAC,MAAM,OAAO,mBAAmB,CAAC,EACpE,OAAO,EAAE,MAAM,EACf,IAAI,CAAC,EAAE,MAAM,GACZ,YAAY,CAOd;AAED,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,gBAAqB,GAC7B,kBAAkB,CA4FpB;AAED,iDAAiD;AACjD,wBAAgB,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAIvD"}