@proposit/proposit-core 0.12.3 → 1.0.1

package/dist/lib/grammar/validators/derivable.js

@@ -0,0 +1,502 @@
+// Derivable-tier validators (D-1..D-6). Code 'D-7' is reserved — see spec
+// §4.3 (derivation premise cardinality was restated as Evaluable E-6).
+//
+// D-1 derivation premise canonical shape (naked-Q or populated)
+// D-2 single-citation derivation form (IMPLIES(c, Q), no surrounding OR)
+// D-3 no mixing axioms and citations in one derivation
+// D-4 axiomatic claim placement (only in derivation antecedent)
+// D-5 citation claim placement (only in derivation antecedent)
+// D-6 derivation premise role (supporting, not conclusion)
+import { isClaimBound } from "../../schemata/propositional.js";
+/**
+ * Build a Map<parentId, children-sorted-by-position> view of the expression
+ * tree.
+ */
+function buildTChildMap(expressions) {
+    const out = new Map();
+    for (const e of expressions) {
+        if (e.parentId === null)
+            continue;
+        const list = out.get(e.parentId) ?? [];
+        list.push(e);
+        out.set(e.parentId, list);
+    }
+    for (const list of out.values()) {
+        list.sort((a, b) => a.position - b.position);
+    }
+    return out;
+}
+/**
+ * Walks down through transparent `formula` nodes, returning the first
+ * descendant that is not a formula. Per spec §4.3 D-1: the Presentable
+ * tier wraps `OR` in a formula buffer; validators must treat the buffer
+ * as transparent when matching the populated-form skeleton.
+ *
+ * Returns the input expression itself if it is not a formula. Returns
+ * undefined if a malformed formula (0 or >1 children) breaks the walk —
+ * higher-level callers can treat that as a shape-mismatch.
+ */
+function peelFormulas(expr, children) {
+    let cursor = expr;
+    while (cursor?.type === "formula") {
+        const kids = children.get(cursor.id) ?? [];
+        if (kids.length !== 1)
+            return undefined;
+        cursor = kids[0];
+    }
+    return cursor;
+}
+/**
+ * Group expressions by premise.
+ */
+function groupExpressionsByPremise(expressions) {
+    const out = new Map();
+    for (const e of expressions) {
+        const list = out.get(e.premiseId) ?? [];
+        list.push(e);
+        out.set(e.premiseId, list);
+    }
+    return out;
+}
+/**
+ * Map variableId → its claim record (claim-bound variables only).
+ */
+function buildVarToClaim(ctx) {
+    const claimById = new Map();
+    for (const c of ctx.claims)
+        claimById.set(c.id, c);
+    const out = new Map();
+    for (const v of ctx.variables) {
+        if (!isClaimBound(v))
+            continue;
+        const claim = claimById.get(v.claimId);
+        if (claim !== undefined)
+            out.set(v.id, claim);
+    }
+    return out;
+}
+/**
+ * Collect every variable expression in the subtree rooted at `start`,
+ * walking through all descendants. Used by D-3 (collect antecedent
+ * variables) and D-4/D-5 placement scans.
+ */
+function collectVariableExpressionsInSubtree(start, children) {
+    const out = [];
+    const stack = [start];
+    while (stack.length > 0) {
+        const cursor = stack.pop();
+        if (cursor.type === "variable")
+            out.push(cursor);
+        const kids = children.get(cursor.id) ?? [];
+        stack.push(...kids);
+    }
+    return out;
+}
+/**
+ * For a `type='derivation'` premise, find the root expression
+ * (parentId === null) within that premise. Returns undefined if no root
+ * exists or multiple roots exist (other validators flag those).
+ */
+function findPremiseRoot(premiseId, grouped) {
+    const exprs = grouped.get(premiseId) ?? [];
+    const roots = exprs.filter((e) => e.parentId === null);
+    if (roots.length !== 1)
+        return undefined;
+    return roots[0];
+}
+// ---- Validators -------------------------------------------------------
+/**
+ * D-1 — Derivation premise canonical shape. Every `type='derivation'`
+ * premise's tree matches one of two canonical forms:
+ *
+ * - **Naked-Q**: a single `variable` expression at the root, bound to
+ *   `derivedClaimId`.
+ * - **Populated**: root `IMPLIES` with consequent at position 1 (variable
+ *   bound to `derivedClaimId`); antecedent at position 0, after peeling
+ *   formula buffers, is either a single claim-bound variable
+ *   (citation/axiomatic) — see D-2 — or an `OR` whose children (each
+ *   peeled of formulas) are all claim-bound variables of the same
+ *   grounding type. IFF at root fails D-1 (Structurally allowed per
+ *   S-14; D-1 narrows derivation premise root to IMPLIES).
+ *
+ * Wrong-root-operator cases (and/or/not/formula at root) are already
+ * caught by Structural S-14; D-1 silently skips them.
+ */
+export function validateD1(ctx) {
+    const violations = [];
+    const children = buildTChildMap(ctx.expressions);
+    const grouped = groupExpressionsByPremise(ctx.expressions);
+    const varToClaim = buildVarToClaim(ctx);
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        const root = findPremiseRoot(p.id, grouped);
+        if (root === undefined)
+            continue;
+        // Naked-Q: single variable at root bound to derivedClaimId.
+        if (root.type === "variable") {
+            const claim = varToClaim.get(root.variableId);
+            if (claim?.id !== p.derivedClaimId) {
+                violations.push({
+                    tier: "derivable",
+                    code: "D-1",
+                    message: `derivation premise ${p.id} naked-Q root variable is not bound to derivedClaimId ${p.derivedClaimId}`,
+                    argumentId: ctx.argument.id,
+                    premiseId: p.id,
+                    expressionId: root.id,
+                });
+            }
+            continue;
+        }
+        // Populated form requires root='implies'. IFF at root is a D-1
+        // violation. Any other operator type (and/or/not/formula) is
+        // caught by S-14; D-1 skips silently.
+        if (root.type !== "operator")
+            continue;
+        if (root.operator === "iff") {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} has IFF at root; populated form must be IMPLIES`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: root.id,
+            });
+            continue;
+        }
+        if (root.operator !== "implies")
+            continue;
+        // Populated form: check consequent at position 1.
+        const kids = children.get(root.id) ?? [];
+        if (kids.length !== 2) {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} populated form has ${kids.length} root children (expected 2)`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: root.id,
+            });
+            continue;
+        }
+        const consequent = kids[1];
+        if (consequent.type !== "variable") {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} consequent slot must be a variable expression`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: consequent.id,
+            });
+            continue;
+        }
+        const consequentClaim = varToClaim.get(consequent.variableId);
+        if (consequentClaim?.id !== p.derivedClaimId) {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} consequent variable is not bound to derivedClaimId ${p.derivedClaimId}`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: consequent.id,
+            });
+            continue;
+        }
+        // Antecedent at position 0, peeled of formula buffers.
+        const antecedent = peelFormulas(kids[0], children);
+        if (antecedent === undefined) {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} antecedent has malformed formula buffer`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: kids[0].id,
+            });
+            continue;
+        }
+        const valid = antecedentMatchesPopulatedForm(antecedent, children, varToClaim);
+        if (!valid) {
+            violations.push({
+                tier: "derivable",
+                code: "D-1",
+                message: `derivation premise ${p.id} antecedent shape does not match populated form (single claim variable or OR of same-grounding claim variables)`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: antecedent.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * Returns true when `antecedent` is one of:
+ * - A variable expression bound to a citation or axiomatic claim.
+ * - An `or` operator whose children (each peeled of formulas) are all
+ *   variable expressions bound to citation or axiomatic claims of the
+ *   same grounding type.
+ *
+ * D-2 (single-citation form) and D-3 (no mixing) are separate validators
+ * that emit their own codes; this helper only answers the D-1 question.
+ */
+function antecedentMatchesPopulatedForm(antecedent, children, varToClaim) {
+    if (antecedent.type === "variable") {
+        const claim = varToClaim.get(antecedent.variableId);
+        if (claim === undefined)
+            return false;
+        return claim.type === "citation" || claim.type === "axiomatic";
+    }
+    if (antecedent.type !== "operator" || antecedent.operator !== "or") {
+        return false;
+    }
+    const orChildren = children.get(antecedent.id) ?? [];
+    // Multi-citation populated form requires ≥ 2 children. A 1-child OR
+    // is not valid populated form — the single-grounding case is
+    // `IMPLIES(claim-var, Q)` without an OR wrapper (D-2). Without this
+    // ≥-2 floor, `IMPLIES(OR(single-citation), Q)` would pass D-1
+    // silently and only D-2 would fire; consumers gating on a clean D-1
+    // would accept invalid shape.
+    if (orChildren.length < 2)
+        return false;
+    for (const child of orChildren) {
+        const peeled = peelFormulas(child, children);
+        if (peeled === undefined)
+            return false;
+        if (peeled.type !== "variable")
+            return false;
+        const claim = varToClaim.get(peeled.variableId);
+        if (claim === undefined)
+            return false;
+        if (claim.type !== "citation" && claim.type !== "axiomatic") {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * D-2 — Single-citation derivation form. If a derivation premise has a
+ * populated form whose antecedent (peeled of formula buffers) is an `OR`
+ * with exactly one child (also peeled of formulas), that's wrong — the
+ * canonical single-grounding form is `IMPLIES(claim-var, Q)` without the
+ * `OR` wrapper.
+ *
+ * Note: a 1-child `OR` also fails E-1 (variadic ≥ 2) and P-4
+ * (single-child binary). D-2 is the Derivable-tier UI hint specifically
+ * naming the "drop the OR wrapper" remediation.
+ */
+export function validateD2(ctx) {
+    const violations = [];
+    const children = buildTChildMap(ctx.expressions);
+    const grouped = groupExpressionsByPremise(ctx.expressions);
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        const root = findPremiseRoot(p.id, grouped);
+        if (root === undefined)
+            continue;
+        if (root.type !== "operator" || root.operator !== "implies")
+            continue;
+        const kids = children.get(root.id) ?? [];
+        if (kids.length < 1)
+            continue;
+        const antecedent = peelFormulas(kids[0], children);
+        if (antecedent === undefined)
+            continue;
+        if (antecedent.type !== "operator" || antecedent.operator !== "or") {
+            continue;
+        }
+        const orChildren = children.get(antecedent.id) ?? [];
+        if (orChildren.length === 1) {
+            violations.push({
+                tier: "derivable",
+                code: "D-2",
+                message: `derivation premise ${p.id} antecedent is OR with a single child; drop the OR wrapper`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: antecedent.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * D-3 — No mixing axioms and citations in one derivation. For each
+ * derivation premise's populated form, collect all claim-bound variables
+ * in the antecedent subtree. If they bind to claims of more than one
+ * grounding type (citation vs axiomatic), emit D-3.
+ *
+ * Formula nodes are traversed transparently by
+ * `collectVariableExpressionsInSubtree`'s plain DFS descent — no
+ * explicit `peelFormulas` call needed for D-3, since the DFS visits
+ * formula descendants like any other node and the variable collector
+ * picks up the claim-bound variables regardless of nesting depth.
+ */
+export function validateD3(ctx) {
+    const violations = [];
+    const children = buildTChildMap(ctx.expressions);
+    const grouped = groupExpressionsByPremise(ctx.expressions);
+    const varToClaim = buildVarToClaim(ctx);
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        const root = findPremiseRoot(p.id, grouped);
+        if (root === undefined)
+            continue;
+        if (root.type !== "operator" || root.operator !== "implies")
+            continue;
+        const kids = children.get(root.id) ?? [];
+        if (kids.length < 1)
+            continue;
+        const antecedent = kids[0];
+        const varExprs = collectVariableExpressionsInSubtree(antecedent, children);
+        const groundingTypes = new Set();
+        for (const ve of varExprs) {
+            const claim = varToClaim.get(ve.variableId);
+            if (claim === undefined)
+                continue;
+            if (claim.type === "citation" || claim.type === "axiomatic") {
+                groundingTypes.add(claim.type);
+            }
+        }
+        if (groundingTypes.size > 1) {
+            violations.push({
+                tier: "derivable",
+                code: "D-3",
+                message: `derivation premise ${p.id} antecedent mixes axiom and citation grounding`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+                expressionId: antecedent.id,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * Returns true when `expr` is in the antecedent subtree (position-0
+ * descendants of root IMPLIES) of a derivation premise. Used by D-4/D-5
+ * to determine whether a typed-claim variable expression is in a
+ * permissible location.
+ *
+ * Returns false for variables in freeform premises, variables at the
+ * consequent slot of a derivation premise's IMPLIES, and variables at the
+ * naked-Q root of a derivation premise.
+ */
+function isInDerivationAntecedent(expr, premiseType, children, expressionsById, grouped) {
+    if (premiseType !== "derivation")
+        return false;
+    const root = findPremiseRoot(expr.premiseId, grouped);
+    if (root === undefined)
+        return false;
+    // Naked-Q: the root variable is the consequent, not the antecedent.
+    if (root.type === "variable")
+        return false;
+    if (root.type !== "operator" || root.operator !== "implies")
+        return false;
+    const kids = children.get(root.id) ?? [];
+    if (kids.length < 1)
+        return false;
+    const antecedentRoot = kids[0];
+    // Walk up from expr's parent until we either reach the antecedent root
+    // (in scope) or reach the IMPLIES root via the consequent path (out of scope).
+    let cursor = expr.id;
+    while (cursor !== null) {
+        if (cursor === antecedentRoot.id)
+            return true;
+        if (cursor === root.id)
+            return false;
+        const node = expressionsById.get(cursor);
+        if (node === undefined)
+            return false;
+        cursor = node.parentId;
+    }
+    return false;
+}
+/**
+ * Common implementation for D-4 / D-5: variables bound to a particular
+ * claim type appear only in derivation premise antecedents.
+ */
+function validateClaimPlacement(ctx, claimType, code) {
+    const violations = [];
+    const children = buildTChildMap(ctx.expressions);
+    const grouped = groupExpressionsByPremise(ctx.expressions);
+    const varToClaim = buildVarToClaim(ctx);
+    const premiseTypeById = new Map();
+    for (const p of ctx.premises)
+        premiseTypeById.set(p.id, p.type);
+    const expressionsById = new Map();
+    for (const e of ctx.expressions)
+        expressionsById.set(e.id, e);
+    for (const e of ctx.expressions) {
+        if (e.type !== "variable")
+            continue;
+        const claim = varToClaim.get(e.variableId);
+        if (claim?.type !== claimType)
+            continue;
+        const premiseType = premiseTypeById.get(e.premiseId);
+        if (premiseType === undefined)
+            continue;
+        const allowed = isInDerivationAntecedent(e, premiseType, children, expressionsById, grouped);
+        if (!allowed) {
+            violations.push({
+                tier: "derivable",
+                code,
+                message: `${claimType}-bound variable expression ${e.id} appears outside a derivation premise antecedent`,
+                argumentId: ctx.argument.id,
+                premiseId: e.premiseId,
+                expressionId: e.id,
+                claimId: claim.id,
+                variableId: e.variableId,
+            });
+        }
+    }
+    return violations;
+}
+/**
+ * D-4 — Axiomatic claim placement. Variables bound to `type='axiomatic'`
+ * claims appear only in the antecedent of a derivation premise, never in
+ * freeform premises and never in a derivation premise's consequent slot.
+ */
+export function validateD4(ctx) {
+    return validateClaimPlacement(ctx, "axiomatic", "D-4");
+}
+/**
+ * D-5 — Citation claim placement. Mirror of D-4 for citation claims.
+ */
+export function validateD5(ctx) {
+    return validateClaimPlacement(ctx, "citation", "D-5");
+}
+/**
+ * D-6 — Derivation premise role. Every `type='derivation'` premise has
+ * `role='supporting'` — concretely, `roleState.conclusionPremiseId !==
+ * premise.id`.
+ */
+export function validateD6(ctx) {
+    const violations = [];
+    for (const p of ctx.premises) {
+        if (p.type !== "derivation")
+            continue;
+        if (ctx.roleState.conclusionPremiseId === p.id) {
+            violations.push({
+                tier: "derivable",
+                code: "D-6",
+                message: `derivation premise ${p.id} is designated as conclusion; derivation premises must be supporting`,
+                argumentId: ctx.argument.id,
+                premiseId: p.id,
+            });
+        }
+    }
+    return violations;
+}
+// 'D-7' reserved — not used.
+export function validateDerivable(ctx) {
+    return [
+        ...validateD1(ctx),
+        ...validateD2(ctx),
+        ...validateD3(ctx),
+        ...validateD4(ctx),
+        ...validateD5(ctx),
+        ...validateD6(ctx),
+    ];
+}
+//# sourceMappingURL=derivable.js.map

package/dist/lib/grammar/validators/derivable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"derivable.js","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/derivable.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,uEAAuE;AACvE,EAAE;AACF,gEAAgE;AAChE,yEAAyE;AACzE,uDAAuD;AACvD,gEAAgE;AAChE,+DAA+D;AAC/D,2DAA2D;AAI3D,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAA;AAW9D;;;GAGG;AACH,SAAS,cAAc,CACnB,WAAoD;IAEpD,MAAM,GAAG,GAAc,IAAI,GAAG,EAAE,CAAA;IAChC,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI;YAAE,SAAQ;QACjC,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;QACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;IAChD,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,YAAY,CACjB,IAAkC,EAClC,QAAmB;IAEnB,IAAI,MAAM,GAA6C,IAAI,CAAA;IAC3D,OAAO,MAAM,EAAE,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,IAAI,GACN,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACjC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAA;QACvC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACpB,CAAC;IACD,OAAO,MAAM,CAAA;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,yBAAyB,CAC9B,WAAoD;IAEpD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0C,CAAA;IAC7D,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;QACvC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACZ,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;IAC9B,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,GAAsB;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC/C,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM;QAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAClD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAsB,CAAA;IACzC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAC5B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAAE,SAAQ;QAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;QACtC,IAAI,KAAK,KAAK,SAAS;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;IACjD,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,mCAAmC,CACxC,KAAmC,EACnC,QAAmB;IAEnB,MAAM,GAAG,GAA2C,EAAE,CAAA;IACtD,MAAM,KAAK,GAAmC,CAAC,KAAK,CAAC,CAAA;IACrD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;QAC3B,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;YAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAChD,MAAM,IAAI,GACN,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACjC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CACpB,SAAiB,EACjB,OAAoD;IAEpD,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAA;IAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAA;IACtD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IACxC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAA;AACnB,CAAC;AAED,0EAA0E;AAE1E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAEvC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;QAC3C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAQ;QAEhC,4DAA4D;QAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;YAC7C,IAAI,KAAK,EAAE,EAAE,KAAK,CAAC,CAAC,cAAc,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,WAAW;oBACjB,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,yDAAyD,CAAC,CAAC,cAAc,EAAE;oBAC9G,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;oBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;oBACf,YAAY,EAAE,IAAI,CAAC,EAAE;iBACxB,CAAC,CAAA;YACN,CAAC;YACD,SAAQ;QACZ,CAAC;QAED,+DAA+D;QAC/D,6DAA6D;QAC7D,sCAAsC;QACtC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACtC,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,kDAAkD;gBACrF,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,IAAI,CAAC,EAAE;aACxB,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAQ;QAEzC,kDAAkD;QAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACxC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpB,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,uBAAuB,IAAI,CAAC,MAAM,6BAA6B;gBAClG,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,IAAI,CAAC,EAAE;aACxB,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACjC,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,gDAAgD;gBACnF,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,UAAU,CAAC,EAAE;aAC9B,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;QAC7D,IAAI,eAAe,EAAE,EAAE,KAAK,CAAC,CAAC,cAAc,EAAE,CAAC;YAC3C,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,uDAAuD,CAAC,CAAC,cAAc,EAAE;gBAC5G,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,UAAU,CAAC,EAAE;aAC9B,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QAED,uDAAuD;QACvD,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;QAClD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,0CAA0C;gBAC7E,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;aAC3B,CAAC,CAAA;YACF,SAAQ;QACZ,CAAC;QACD,MAAM,KAAK,GAAG,8BAA8B,CACxC,UAAU,EACV,QAAQ,EACR,UAAU,CACb,CAAA;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACT,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,iHAAiH;gBACpJ,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,UAAU,CAAC,EAAE;aAC9B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,8BAA8B,CACnC,UAAwC,EACxC,QAAmB,EACnB,UAAmC;IAEnC,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,CAAA;QACnD,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QACrC,OAAO,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,CAAA;IAClE,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,IAAI,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;QACjE,OAAO,KAAK,CAAA;IAChB,CAAC;IACD,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;IACpD,oEAAoE;IACpE,6DAA6D;IAC7D,oEAAoE;IACpE,8DAA8D;IAC9D,oEAAoE;IACpE,8BAA8B;IAC9B,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IACvC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAC5C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QACtC,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU;YAAE,OAAO,KAAK,CAAA;QAC5C,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;QAC/C,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QACrC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC1D,OAAO,KAAK,CAAA;QAChB,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAA;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAE1D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;QAC3C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAQ;QAChC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAQ;QACrE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACxC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAC7B,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;QAClD,IAAI,UAAU,KAAK,SAAS;YAAE,SAAQ;QACtC,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,IAAI,UAAU,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YACjE,SAAQ;QACZ,CAAC;QACD,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACpD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,4DAA4D;gBAC/F,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,UAAU,CAAC,EAAE;aAC9B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAEvC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAA;QAC3C,IAAI,IAAI,KAAK,SAAS;YAAE,SAAQ;QAChC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAQ;QACrE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QACxC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,SAAQ;QAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,QAAQ,GAAG,mCAAmC,CAChD,UAAU,EACV,QAAQ,CACX,CAAA;QACD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;QACxC,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,CAAA;YAC3C,IAAI,KAAK,KAAK,SAAS;gBAAE,SAAQ;YACjC,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC1D,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;YAClC,CAAC;QACL,CAAC;QACD,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,gDAAgD;gBACnF,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;gBACf,YAAY,EAAE,UAAU,CAAC,EAAE;aAC9B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,wBAAwB,CAC7B,IAAkC,EAClC,WAAsC,EACtC,QAAmB,EACnB,eAA0D,EAC1D,OAAoD;IAEpD,IAAI,WAAW,KAAK,YAAY;QAAE,OAAO,KAAK,CAAA;IAC9C,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IACrD,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IACpC,oEAAoE;IACpE,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;QAAE,OAAO,KAAK,CAAA;IAC1C,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IACzE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;IACxC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,KAAK,CAAA;IACjC,MAAM,cAAc,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IAC9B,uEAAuE;IACvE,+EAA+E;IAC/E,IAAI,MAAM,GAAkB,IAAI,CAAC,EAAE,CAAA;IACnC,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;QACrB,IAAI,MAAM,KAAK,cAAc,CAAC,EAAE;YAAE,OAAO,IAAI,CAAA;QAC7C,IAAI,MAAM,KAAK,IAAI,CAAC,EAAE;YAAE,OAAO,KAAK,CAAA;QACpC,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACxC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QACpC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAA;IAC1B,CAAC;IACD,OAAO,KAAK,CAAA;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAC3B,GAAsB,EACtB,SAAmC,EACnC,IAAmB;IAEnB,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAChD,MAAM,OAAO,GAAG,yBAAyB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IACvC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAqC,CAAA;IACpE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ;QAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;IAC/D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAwC,CAAA;IACvE,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW;QAAE,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;IAE7D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU;YAAE,SAAQ;QACnC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAA;QAC1C,IAAI,KAAK,EAAE,IAAI,KAAK,SAAS;YAAE,SAAQ;QACvC,MAAM,WAAW,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAA;QACpD,IAAI,WAAW,KAAK,SAAS;YAAE,SAAQ;QACvC,MAAM,OAAO,GAAG,wBAAwB,CACpC,CAAC,EACD,WAAW,EACX,QAAQ,EACR,eAAe,EACf,OAAO,CACV,CAAA;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI;gBACJ,OAAO,EAAE,GAAG,SAAS,8BAA8B,CAAC,CAAC,EAAE,kDAAkD;gBACzG,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,YAAY,EAAE,CAAC,CAAC,EAAE;gBAClB,OAAO,EAAE,KAAK,CAAC,EAAE;gBACjB,UAAU,EAAE,CAAC,CAAC,UAAU;aAC3B,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAA;AACrB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,OAAO,sBAAsB,CAAC,GAAG,EAAE,WAAW,EAAE,KAAK,CAAC,CAAA;AAC1D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,OAAO,sBAAsB,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB;IAC7C,MAAM,UAAU,GAAiB,EAAE,CAAA;IACnC,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY;YAAE,SAAQ;QACrC,IAAI,GAAG,CAAC,SAAS,CAAC,mBAAmB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;YAC7C,UAAU,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,sBAAsB,CAAC,CAAC,EAAE,sEAAsE;gBACzG,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;gBAC3B,SAAS,EAAE,CAAC,CAAC,EAAE;aAClB,CAAC,CAAA;QACN,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAA;AACrB,CAAC;AAED,6BAA6B;AAE7B,MAAM,UAAU,iBAAiB,CAC7B,GAAsB;IAEtB,OAAO;QACH,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;QAClB,GAAG,UAAU,CAAC,GAAG,CAAC;KACrB,CAAA;AACL,CAAC"}

package/dist/lib/grammar/validators/evaluable.d.ts

@@ -0,0 +1,48 @@
+import type { TViolation } from "../types.js";
+import type { TValidatorContext } from "./context.js";
+/**
+ * E-1 — Variadic operator arity floor. `and` and `or` each have at least
+ * two children. (Unary `not`/`formula` are constrained Structurally per
+ * S-12/S-13; binary `implies`/`iff` per S-8.)
+ */
+export declare function validateE1(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * E-3 — Variable binding resolves. Every variable's claim or premise
+ * reference points at an existing target. External premise bindings
+ * (`boundArgumentId !== argument.id`) resolve in a different argument
+ * and are out of scope here — those targets aren't in this context.
+ */
+export declare function validateE3(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * E-4 — Axiomatic-binding constraint. Axiomatic-bound variables must not
+ * be assigned in the caller's evaluation input. This is a **runtime
+ * guard** on caller-supplied input, not an AST invariant — the check
+ * runs inside `ArgumentEngine.evaluate` / `.checkValidity` and rejects
+ * pre-flight with the engine-error code `AXIOM_VARIABLE_ASSIGNMENT_FORBIDDEN`.
+ * The AST-level validator cannot detect E-4 from the argument tree alone
+ * and intentionally returns an empty array.
+ */
+export declare function validateE4(_ctx: TValidatorContext): readonly TViolation[];
+/**
+ * E-5 — Derivation premise consequent present. Every `type='derivation'`
+ * premise's expression tree includes a variable bound to its
+ * `derivedClaimId`. Naked-Q satisfies this (the lone variable at the
+ * root *is* the consequent).
+ */
+export declare function validateE5(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * E-6 — Claim-derivation pairing. For every `type='normal'` claim
+ * referenced in the argument, at most one `type='derivation'` premise
+ * exists with `derivedClaimId` matching that claim. Zero is valid (the
+ * post-publish-pruning state); two or more is the violation.
+ */
+export declare function validateE6(ctx: TValidatorContext): readonly TViolation[];
+/**
+ * E-7 — Argument has conclusion premise. An argument that has at least
+ * one premise has exactly one premise designated as the conclusion via
+ * `roleState.conclusionPremiseId`. A brand-new argument with zero
+ * premises is exempt.
+ */
+export declare function validateE7(ctx: TValidatorContext): readonly TViolation[];
+export declare function validateEvaluable(ctx: TValidatorContext): readonly TViolation[];
+//# sourceMappingURL=evaluable.d.ts.map

package/dist/lib/grammar/validators/evaluable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"evaluable.d.ts","sourceRoot":"","sources":["../../../../src/lib/grammar/validators/evaluable.ts"],"names":[],"mappings":"AAWA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAA;AAkBrD;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAmBxE;AAID;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkCxE;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAEzE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CAkCxE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA6BxE;AAED;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,iBAAiB,GAAG,SAAS,UAAU,EAAE,CA0BxE;AAED,wBAAgB,iBAAiB,CAC7B,GAAG,EAAE,iBAAiB,GACvB,SAAS,UAAU,EAAE,CASvB"}