refactor(compiler): simplify isSlotAlignedSpine

Drop the two `info != nil` guards: the function reads info only after
confirming expr is an *ast.InfixExpression, and the solver caches every infix
node — it even reads a child's ExprInfo with no nil guard when caching the
parent (solver.go:1822), so a missing entry would already have panicked there.
info is never nil at these accesses.

Drop the `IsComparison() || IsLogicalOr() -> false` branch. It was a defensive
boundary to stop the recursion from descending into a comparison/|| node's
operands, but a value-position comparison/|| always carries a cond mode
(CondScalar/CondArray/CondOr), so the HasAnyComparison/HasFallbackOr true-check
above it fires first for every expression the solver produces — the branch
never decided an outcome. Easy to restore if cond-mode assignment ever changes.

No behavior change.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>

Author: thiremani

compiler/cond.go

@@ -1214,15 +1214,12 @@ func (c *Compiler) isSlotAlignedSpine(expr ast.Expression) bool {
 		return false
 	}
 	info := c.ExprCache[key(c.FuncNameMangled, expr)]
-	if info != nil && len(c.pendingLoopRanges(info.Ranges)) > 0 {
+	if len(c.pendingLoopRanges(info.Ranges)) > 0 {
 		return false
 	}
-	if info != nil && (info.HasAnyComparison() || info.HasFallbackOr()) {
+	if info.HasAnyComparison() || info.HasFallbackOr() {
 		return true
 	}
-	if infix.Token.IsComparison() || infix.IsLogicalOr() {
-		return false
-	}
 	return c.isSlotAlignedSpine(infix.Left) || c.isSlotAlignedSpine(infix.Right)
 }