WIP: simplify recursive planning limit checks.

Instead of planning recursively up to the limit, the behavior now is to check if the AST is small enough to fit in the limit and either fail or swap back to the stack machine implementation

This simplifies the planner logic step and avoids some unpredictable behavior around wrapping recursive sub-programs in stack machine steps.

PiperOrigin-RevId: 878154486

Author: jnthntatum

eval/compiler/BUILD

@@ -33,6 +33,7 @@ cc_library(
         "//base:data",
         "//common:expr",
         "//common:native_type",
+        "//common:navigable_ast",
         "//common:value",
         "//eval/eval:direct_expression_step",
         "//eval/eval:evaluator_core",