cel_parser/

lib.rs

//! A recursive descent parser for CEL (Common Expression Language) expressions.
//!
//! This crate provides a parser that can parse CEL expressions into executable segments.
//! The parser follows the CEL grammar specification and provides detailed error reporting
//! with source location information.
//!
//! # Canonical typed execution
//!
//! Arrays, tuples, unit, registered leaves, and `Fn` signatures compose
//! recursively without registering each aggregate shape. [`ResolvedType`] and
//! [`Ty`] retain complete shapes; shared physical carrier IDs are not identities.
//! Preparation validates concrete witnesses before the body executes:
//!
//! ```
//! use cel_parser::{CELParser, OpLookup};
//! use cel_runtime::{ArrayOf, Cons, IntoCStackList, IntoRustTuple, Leaf, Nil};
//! type Pair = Cons<Leaf<i32>, Cons<Leaf<bool>, Nil>>;
//! let body = CELParser::new(OpLookup::new()).parse_str("[(7, true)]").unwrap();
//! let mut prepared = body.prepare::<Nil, ArrayOf<Pair>>().unwrap();
//! let pairs = prepared.call(&().into_c_stack_list()).unwrap().into_vec();
//! assert_eq!(pairs.into_iter().next().unwrap().into_rust_tuple(), (7, true));
//! ```
//!
//! Repeated prepared calls do not repeat recursive type checks. Arbitrary
//! erased host imports remain checked external boundaries. Cloning borrowed
//! argument reads, comparing values, and formatting values require their own
//! capabilities; merely moving a value into a container does not. Source
//! `Fn((A,), R)` names one parameter and `Fn((), R)` names none. The typed
//! Rust carrier is [`cel_runtime::Callable`], witnessed by [`cel_runtime::FnOf`].
//! `cel-rs-macros` validates source; no native macro backend is implemented.
//!
//! # Error Handling
//!
//! Parse errors are returned as [`ParseError`], which carries a `proc_macro2::Span` for precise diagnostics.
//! Convert to [`CELError`] (via `From`) when the error must be stored or sent across thread boundaries.
//! All errors result from malformed input (syntax errors, type mismatches, undefined identifiers).
//!
//! # Grammar
//!
//! For a prose reference manual with the same grammar, see the standalone
//! [CEL book](../cel-book/index.html) and its
//! [reference chapter](../cel-book/reference.html).
//!
//! ```text
//! expression = range_expression.
//! range_expression = or_expression [ ".." [ or_expression ] | "..=" or_expression ]
//!                   | ".." [ or_expression ]
//!                   | "..=" or_expression.
//! or_expression = and_expression { "||" and_expression }.
//! and_expression = comparison_expression { "&&" comparison_expression }.
//! comparison_expression = bitwise_or_expression
//!     [ ("==" | "!=" | "<" | ">" | "<=" | ">=") bitwise_or_expression ].
//! bitwise_or_expression = bitwise_xor_expression { "|" bitwise_xor_expression }.
//! bitwise_xor_expression = bitwise_and_expression { "^" bitwise_and_expression }.
//! bitwise_and_expression = bitwise_shift_expression { "&" bitwise_shift_expression }.
//! bitwise_shift_expression = additive_expression { ("<<" | ">>") additive_expression }.
//! additive_expression = multiplicative_expression { ("+" | "-") multiplicative_expression }.
//! multiplicative_expression = cast_expression { ("*" | "/" | "%") cast_expression }.
//! cast_expression = unary_expression { "as" identifier }.
//! unary_expression = (("-" | "!") unary_expression) | postfix_expression.
//! postfix_expression = primary_expression { "(" [ parameter_list ] ")" | "." (unsuffixed_integer | identifier [ "(" [ parameter_list ] ")" ]) }.
//! primary_expression = literal | identifier [ record_fields ] | tuple_or_group | array_expression
//!                    | if_expression | closure_expression.
//! record_fields = "{" [ identifier ":" expression { "," identifier ":" expression } [ "," ] ] "}".
//! tuple_or_group = "(" [ expression ["," [ expression { "," expression } ]] ] ")".
//! array_expression = "[" [ expression { "," expression } ] "]" [ ":" type_expression ].
//! if_expression = "if" expression "{" expression "}" [ "else" ( "{" expression "}" | if_expression ) ].
//! closure_expression = ("||" | "|" [ closure_param { "," closure_param } ] "|") expression.
//! closure_param = identifier ":" type_expression.
//! parameter_list = expression { "," expression }.
//!
//! type_expression = identifier [ "(" [ type_expression { "," type_expression } ] ")" ]
//!                  | "[" type_expression "]"
//!                  | "(" [ type_expression ["," [ type_expression { "," type_expression } ]] ] ")".
//!
//! literal_pattern = ["-"] literal.
//! ```
//!
//! Registered records use a constructor namespace independent of value bindings and evaluate
//! fields once in written order. All schema fields are required exactly once with exact types.
//! An `if` condition (or an embedded host header) reserves its body brace: write
//! `if (Point { x: 0.0 }).x == 0.0 { 1 } else { 2 }` to explicitly allow a record there.
//! Delimited argument lists, arrays, field values, and branch bodies parse ordinarily.
//!
//! `literal_pattern` is a separate entry point, not reachable from `expression` — it exists for
//! grammars that embed CEL literals in pattern position (e.g. adam-lang's `conditional_branch`)
//! and need Rust's own `LiteralPattern` rule: a bare literal, or one directly negated by a
//! leading `-` (no `!`, no chained `--`, no arbitrary unary/postfix operand) — see
//! <https://doc.rust-lang.org/reference/patterns.html#literal-patterns>.
//!
//! `type_expression` is the single, reusable recursive type grammar shared by array type
//! ascriptions (`[1, 2]: [i32]`), closure parameters (`|x: RangeInclusive(f64)| ...`), and
//! adam-lang cell/source/out type annotations (`cell x: (i32, f64);`). A bare identifier
//! resolves through the configured [`TypeResolver`] (array/closure contexts) or a host
//! `TypeRegistry` (adam-lang cell contexts); `Name(args)` names a parameterized/generic type
//! (e.g. `RangeInclusive(f64)`, the type produced by CEL's own `..=` range operator) resolved
//! against the same [`TypeResolver`]; `[T]` composes nested array types (`[i32]`, `[[i32]]`);
//! and parenthesized tuple syntax names a (possibly nested) tuple type. Every context that
//! accepts `type_expression` documents its own narrower support boundary where one exists.
//! CEL types recursively compose registered cloneable leaves, tuples, arrays, and callables:
//! arrays can contain tuples or callables, and tuples and callable signatures can contain
//! further compound types. `Fn((A, B), R)` names a callable with two parameters and result
//! `R`; use `Fn((A,), R)` for one parameter and `Fn((), R)` for none.
//! Adam-lang shares this recursive resolution for persistent cells, including registered
//! generic leaves. Adam requires cloning and value equality before storing a cell:
//! callable values remain valid CEL values, but a callable without equality cannot become
//! an Adam cell. Compound host access uses explicit canonical representation witnesses;
//! registered primitive and foreign leaf cells retain their concrete Rust access APIs.
//!
//! # Examples
//!
//! ```rust
//! use cel_parser::{CELParser, OpLookup};
//!
//! let mut segment = CELParser::new(OpLookup::new()).parse_str("10u32 + 20u32 * 5u32").unwrap();
//! let result = segment.call0::<u32>();
//! assert!(result.is_ok());
//! assert_eq!(result.unwrap(), 110); // 10 + 20 * 5 = 10 + 100
//! ```
//!
//! ## Basic Usage
//!
//! ```rust
//! use cel_parser::CELParser;
//! use cel_parser::OpLookup;
//! use proc_macro2::TokenStream;
//! use std::str::FromStr;
//!
//! let input = TokenStream::from_str("10").unwrap();
//! let mut parser = CELParser::new(OpLookup::new());
//! let result = parser.parse_tokens(input.into_iter());
//! assert!(result.is_ok());
//! ```
//!
//! ## Receiver Operations
//!
//! `receiver.name` and `receiver.name()` both invoke a unary named operation directly.
//! `receiver.name(arg1, arg2)` passes the receiver first, then the explicit arguments;
//! execution evaluates each operand once in source order. Value bindings named `name` do
//! not hide dot operations. Grouping changes call behavior: `(receiver.name)()` calls the
//! operation's result through the ordinary callable lookup instead.
//!
//! Host libraries supply these operations through [`OpLookup`]; the parser imposes no
//! domain-specific receiver types. AST parsing preserves the spelling and the member's name
//! span without resolving the operation:
//!
//! ```rust
//! use cel_parser::{AstContext, Expr, OpLookup, Parser, format_expr};
//! let source = "a.center().x";
//! let expr = Parser::<AstContext>::new(OpLookup::new()).parse_str_ast(source).unwrap();
//! assert!(matches!(&expr, Expr::Member { args: None, .. }));
//! assert_eq!(format_expr(&expr, source, 0), source);
//! ```
//!
//! ## Metadata-aware static checking
//!
//! [`ty::check_expr_with_type_resolver`] takes the host's [`OpLookup`] as its fourth argument.
//! It checks record fields against schemas and receiver operations against signatures without
//! invoking emitters. Known custom leaves retain [`Ty::Registered`] descriptors; unrelated
//! known types never unify. Unknown constructors are diagnostic, while genuinely unresolved
//! values and custom calls without metadata remain best-effort. Every child is still checked,
//! and constructor/field/member labels never enter the value resolver. No integer-to-float
//! coercion occurs. [`ty::check_expr`] remains the primitive convenience entry with an empty lookup.
//!
//! ```rust
//! use cel_parser::{AstContext, OpLookup, OperationSignature, Parser, ResolvedLeafType, Ty};
//! use cel_runtime::ValueType;
//!
//! let scalar = ResolvedLeafType::new("f64", ValueType::leaf::<f64>());
//! let mut lookup = OpLookup::new();
//! lookup.register_operation(OperationSignature {
//!     name: "twice",
//!     operands: vec![scalar.clone().into()],
//!     result: scalar.into(),
//!     emit: Box::new(|s, _| s.op1(|value: f64| value * 2.0)),
//! }).unwrap();
//! let expr = Parser::<AstContext>::new(OpLookup::new())
//!     .parse_str_ast("3.0.twice() + true").unwrap();
//! let (_, diagnostics) = cel_parser::ty::check_expr_with_type_resolver(
//!     &expr, &|_| Ty::Any, cel_parser::builtin_type_resolver().as_ref(), &lookup,
//! );
//! assert_eq!(diagnostics.len(), 1);
//! ```
//!
//! ## Array Literals
//!
//! A `[...]` literal constructs one canonical [`cel_runtime::Array`] owning every element.
//! Checked host calls return [`cel_runtime::OwnedValue`]; prepared calls use exact
//! recursive witnesses directly.
//! Unannotated non-empty arrays keep their existing inference, while postfix annotations let
//! callers state complete recursive array, tuple, callable, and custom-leaf shapes
//! explicitly. Elements must share one complete recursive runtime type — a heterogeneous literal
//! such as `[1i32, 2.0f64]`, an unannotated empty literal `[]`, or a trailing comma is a parse
//! error — and the evaluated array converts to the corresponding `Vec<T>` without moving or
//! reallocating its elements:
//!
//! ```rust
//! use cel_parser::{CELParser, OpLookup};
//!
//!
//! let mut segment = CELParser::new(OpLookup::new())
//!     .parse_str("[0, 1, 2]: [i32]")
//!     .unwrap();
//! let array = segment.call0::<cel_runtime::OwnedValue>().unwrap().try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>().unwrap();
//! assert_eq!(array.into_vec(), vec![0, 1, 2]);
//!
//! let mut segment = CELParser::new(OpLookup::new()).parse_str("[]: [i32]").unwrap();
//! let array = segment.call0::<cel_runtime::OwnedValue>().unwrap().try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>().unwrap();
//! assert!(array.into_vec().is_empty());
//! ```
//!
//! Tuple arrays and callable arrays use canonical witnesses rather than external erased wrappers.
//! Singleton tuple types retain their trailing comma. `Fn((A, B), R)` has two parameters,
//! `Fn((A,), R)` has one, and `Fn((), R)` has none:
//!
//! ```
//! use cel_parser::{CELParser, OpLookup};
//! use cel_runtime::{ArrayOf, Cons, FnOf, IntoCStackList, Leaf, Nil};
//! type F = FnOf<Cons<Leaf<i32>, Nil>, ArrayOf<Leaf<i32>>>;
//! let body = CELParser::new(OpLookup::new())
//!     .parse_str("[]: [Fn((i32,), [i32])]").unwrap();
//! let values = body.prepare::<Nil, ArrayOf<F>>().unwrap()
//!     .call(&().into_c_stack_list()).unwrap();
//! assert!(values.is_empty());
//! ```
//!
//! Hosts may also resolve custom registry-backed leaf names by constructing the parser with
//! [`CELParser::with_type_resolver`]:
//!
//! ```rust
//! use cel_parser::{CELParser, OpLookup, ResolvedLeafType};
//! use cel_runtime::ValueType;
//!
//! #[derive(Clone)]
//! struct Custom;
//!
//! let resolver = [(
//!     "Custom",
//!     ResolvedLeafType::new("Custom", ValueType::leaf::<Custom>()),
//! )];
//! let mut segment = CELParser::with_type_resolver(OpLookup::new(), resolver)
//!     .parse_str("[]: [Custom]")
//!     .unwrap();
//! let array = segment.call0::<cel_runtime::OwnedValue>().unwrap().try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<Custom>>>().unwrap();
//! assert!(array.into_vec().is_empty());
//! ```
//!
//! Nested literals accept recursive array annotations; each inner value uses the
//! same canonical array ABI with a complete element witness:
//!
//! ```rust
//! use cel_parser::{CELParser, OpLookup};
//!
//!
//! let mut segment = CELParser::new(OpLookup::new())
//!     .parse_str("[[0], [1]]: [[i32]]")
//!     .unwrap();
//! let array = segment.call0::<cel_runtime::OwnedValue>().unwrap().try_into_typed::<cel_runtime::ArrayOf<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>>().unwrap();
//! let rows = array.into_vec();
//! assert_eq!(rows.len(), 2);
//! assert_eq!(rows[0].as_slice(), &[0]);
//! ```
//!
//! Exact annotation failures stay precise:
//!
//! ```rust
//! use cel_parser::{CELParser, OpLookup};
//!
//! let err = match CELParser::new(OpLookup::new()).parse_str("[0, 1]: [f64]") {
//!     Ok(_) => panic!("the annotation should reject i32 elements"),
//!     Err(err) => err,
//! };
//! assert_eq!(
//!     err.message(),
//!     "array element 0 has type i32, expected f64"
//! );
//!
//! let err = match CELParser::new(OpLookup::new()).parse_str("[0]: [Nope]") {
//!     Ok(_) => panic!("the unknown leaf name should be rejected"),
//!     Err(err) => err,
//! };
//! assert_eq!(err.message(), "unknown type `Nope`");
//! ```
//!
//! ### Known limitations
//!
//! - An unannotated empty literal (`[]`) is a parse error: with no element there is nothing to
//!   infer the array's element type from (<https://github.com/stlab/cel-rs/issues/212>).
//! - A type-mismatch diagnostic from the compiling path ([`CELParser`], which type-checks
//!   elements against their compiled runtime types) spans the whole `[...]` literal and names the
//!   offending element only in its message text (`array element 1 has type ...`). The static
//!   [`ty::check_expr`] checker, which runs over an [`AstContext`] tree instead, already reports
//!   the offending element's own span (<https://github.com/stlab/cel-rs/issues/215>).
//!
//! ## Error Formatting
//!
//! ```rust
//! use annotate_snippets::Renderer;
//! use cel_parser::CELParser;
//! use cel_parser::OpLookup;
//! use proc_macro2::TokenStream;
//! use std::str::FromStr;
//!
//! let line = line!() + 1;
//! let source = r#"
//!   10 20
//! "#; // Invalid: missing operator
//! let input = TokenStream::from_str(source).unwrap();
//! let mut parser = CELParser::new(OpLookup::new());
//!
//! if let Err(e) = parser.parse_tokens(input.into_iter()) {
//!     // Format error starting at line 1
//!     println!("{}", e.format_rustc_style(source, file!(), line, &Renderer::plain()));
//! }
//! ```

pub mod ast;
mod error;
mod fmt;
pub mod lex_lexer;
pub mod op_table;
pub mod registered_ops;
pub use registered_ops::{
    OperationEmitter, OperationSignature, RecordEmitter, RecordField, RecordSchema,
};
pub mod parser_context;
pub mod trivia;
pub mod ty;
pub mod type_expr;

pub use ast::{AstContext, ClosureParam, Expr, ExprSpan, Literal, LogicalOp, RecordInit};
pub use error::{
    CELError, FormatRustcStyle, ParseError, SourceSpan, SpanContext, SpanLabel, format_multi_span,
};
pub use fmt::{
    format_expr, format_expr_header, format_expr_header_with_layout, format_expr_restricted,
    format_expr_with_layout,
};
pub use op_table::{OpLookup, OperandTypes, builtin_operand_types};
pub use parser_context::{DynSegmentContext, ParserContext};
pub use proc_macro2::LineColumn;
pub use trivia::Comment;
pub use ty::Ty;
pub use type_expr::{
    ResolvedArrayType, ResolvedLeafType, ResolvedType, TypeExpr, TypeResolver,
    builtin_type_resolver, resolve_builtin_named_type,
};

use lex_lexer::{LexLexer, Literal as CelLiteral, Token, TokenStreamIter};

use cel_runtime::DynSegment;
use proc_macro2::{Delimiter, Span, TokenStream};
#[cfg(test)]
use std::any::TypeId;
use std::collections::HashMap;
use std::iter::Peekable;
use std::str::FromStr;

/// Parser result type.
pub type Result<T> = std::result::Result<T, ParseError>;

/// Pushes a literal value from `token` onto `output`.
///
/// # Errors
///
/// Returns `Err` if the literal type is unsupported or if a suffixed numeric
/// literal cannot be parsed.
fn push_literal_token<C: ParserContext>(output: &mut C, lit: CelLiteral) -> Result<()> {
    match lit {
        CelLiteral::Int(integer) => {
            let span = integer.span();
            match integer.suffix() {
                "" | "i32" => output.push_literal(
                    integer.base10_parse::<i32>().map_err(|e| {
                        ParseError::new(
                            format!("invalid i32 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "u8" => output.push_literal(
                    integer.base10_parse::<u8>().map_err(|e| {
                        ParseError::new(
                            format!("invalid u8 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "u16" => output.push_literal(
                    integer.base10_parse::<u16>().map_err(|e| {
                        ParseError::new(
                            format!("invalid u16 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "u32" => output.push_literal(
                    integer.base10_parse::<u32>().map_err(|e| {
                        ParseError::new(
                            format!("invalid u32 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "u64" => output.push_literal(
                    integer.base10_parse::<u64>().map_err(|e| {
                        ParseError::new(
                            format!("invalid u64 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "u128" => output.push_literal(
                    integer.base10_parse::<u128>().map_err(|e| {
                        ParseError::new(
                            format!("invalid u128 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "usize" => output.push_literal(
                    integer.base10_parse::<usize>().map_err(|e| {
                        ParseError::new(
                            format!("invalid usize literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "i8" => output.push_literal(
                    integer.base10_parse::<i8>().map_err(|e| {
                        ParseError::new(
                            format!("invalid i8 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "i16" => output.push_literal(
                    integer.base10_parse::<i16>().map_err(|e| {
                        ParseError::new(
                            format!("invalid i16 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "i64" => output.push_literal(
                    integer.base10_parse::<i64>().map_err(|e| {
                        ParseError::new(
                            format!("invalid i64 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "i128" => output.push_literal(
                    integer.base10_parse::<i128>().map_err(|e| {
                        ParseError::new(
                            format!("invalid i128 literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                "isize" => output.push_literal(
                    integer.base10_parse::<isize>().map_err(|e| {
                        ParseError::new(
                            format!("invalid isize literal `{integer}`: {e}"),
                            integer.span(),
                        )
                    })?,
                    span,
                ),
                suffix => {
                    return Err(ParseError::new(
                        format!("invalid integer literal suffix: `{suffix}`"),
                        integer.span(),
                    ));
                }
            };
        }
        CelLiteral::Float(float) => {
            let span = float.span();
            match float.suffix() {
                "" | "f64" => output.push_literal(
                    float.base10_parse::<f64>().map_err(|e| {
                        ParseError::new(format!("invalid f64 literal `{float}`: {e}"), float.span())
                    })?,
                    span,
                ),
                "f32" => output.push_literal(
                    float.base10_parse::<f32>().map_err(|e| {
                        ParseError::new(format!("invalid f32 literal `{float}`: {e}"), float.span())
                    })?,
                    span,
                ),
                suffix => {
                    return Err(ParseError::new(
                        format!("invalid float literal suffix: `{suffix}`"),
                        float.span(),
                    ));
                }
            };
        }
        CelLiteral::Str(string) => {
            let span = string.span();
            output.push_literal(string.value(), span);
        }
        CelLiteral::Bool(lit_bool) => {
            let span = lit_bool.span();
            output.push_literal(lit_bool.value, span);
        }
        CelLiteral::Char(ch) => {
            let span = ch.span();
            output.push_literal(ch.value(), span);
        }
        CelLiteral::Byte(byte) => {
            let span = byte.span();
            output.push_literal(byte.value(), span);
        }
        CelLiteral::ByteStr(byte_str) => {
            let span = byte_str.span();
            output.push_literal(byte_str.value(), span);
        }
        CelLiteral::CStr(c_str) => {
            let span = c_str.span();
            output.push_literal(c_str.value(), span);
        }
        other => {
            return Err(ParseError::new(
                format!("unsupported literal: {other:?}"),
                other.span(),
            ));
        }
    }
    Ok(())
}

/// Validates that `lit` is a literal `cel_parser` can represent as a value: a recognized numeric
/// suffix, and (for a suffixed or unsuffixed integer/float) a value in range for its width.
/// Reuses the same literal-compiling checks the grammar itself applies to a literal token,
/// against a throwaway context, for a caller (e.g. adam-lang's CST parser, which records a
/// literal token without compiling it into a value) that needs to reject the same literals the
/// runtime parser would, without needing a [`ParserContext`] of its own to push into.
///
/// # Errors
///
/// Returns `Err` for an unrecognized numeric suffix, or a numeric value out of range for its
/// width.
pub fn validate_literal(lit: &CelLiteral) -> Result<()> {
    push_literal_token(&mut DynSegmentContext::new_context(), lit.clone())
}

/// Resolves a closure annotation through the configured registry without erasing its shape.
///
/// # Errors
/// Returns annotation resolution errors or unrepresentable layout errors.
/// - Complexity: O(number of type nodes).
fn closure_param_type_from_type_expr(
    type_expr: &TypeExpr,
    resolver: &dyn TypeResolver,
) -> Result<cel_runtime::ValueType> {
    type_expr
        .resolve(resolver)?
        .into_value_type()
        .map_err(|error| {
            let span = type_expr.span();
            ParseError::new_range(error.to_string(), span.start, span.end)
        })
}

/// A recursive descent parser for expressions, generic over the [`ParserContext`] it emits
/// into.
///
/// [`CELParser`] is a type alias for `Parser<DynSegmentContext>` and remains the concrete type
/// most callers use; it behaves identically to how `CELParser` always has, before this type
/// became generic.
///
/// # Examples
///
/// ## Basic Usage
///
/// ```rust
/// use cel_parser::OpLookup;
/// use cel_parser::CELParser;
/// use proc_macro2::TokenStream;
/// use std::str::FromStr;
///
/// let input = TokenStream::from_str("10").unwrap();
/// let mut parser = CELParser::new(OpLookup::new());
/// let result = parser.parse_tokens(input.into_iter());
/// assert!(result.is_ok());
/// ```
///
/// ## Error Formatting
///
/// ```rust
/// use annotate_snippets::Renderer;
/// use cel_parser::OpLookup;
/// use cel_parser::CELParser;
/// use proc_macro2::TokenStream;
/// use std::str::FromStr;
///
/// let line = line!() + 1;
/// let source = r#"
///   10 + 20 30
/// "#; // Invalid: missing operator
/// let input = TokenStream::from_str(source).unwrap();
/// let mut parser = CELParser::new(OpLookup::new());
///
/// if let Err(e) = parser.parse_tokens(input.into_iter()) {
///     // Format error starting at line 1
///     println!("{}", e.format_rustc_style(source, file!(), line, &Renderer::plain()));
/// }
/// ```
pub struct Parser<C: ParserContext> {
    tokens: Option<Peekable<LexLexer>>,
    context: C,
    op_lookup: OpLookup,
    type_resolver: Box<dyn TypeResolver>,
    last_span: Span,
    /// Net count of `Delimiter::Brace`/`Delimiter::Bracket`/`Delimiter::Parenthesis` tokens
    /// consumed since the last [`set_tokens`](Self::set_tokens)/
    /// [`set_lex_tokens`](Self::set_lex_tokens) call that remain unmatched: incremented for an
    /// `OpenDelim`, decremented for a `CloseDelim`. See
    /// [`unbalanced_delimiter_count`](Self::unbalanced_delimiter_count).
    unbalanced_delimiters: i32,
    restriction: ExpressionRestriction,
}

/// Selects whether a header reserves an identifier's following brace for its body.
///
/// Explicit delimiters establish ordinary expression boundaries; unary, binary, and closure
/// expressions inherit the surrounding restriction.
///
/// # Examples
/// ```
/// use cel_parser::{CELParser, ExpressionRestriction, OpLookup};
/// let mut parser = CELParser::new(OpLookup::new());
/// parser.set_tokens("true {}".parse::<proc_macro2::TokenStream>().unwrap().into_iter());
/// parser.parse_expression_restricted(ExpressionRestriction::NoStructLiteral).unwrap();
/// ```
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
pub enum ExpressionRestriction {
    /// Allows ordinary record literals.
    None,
    /// Leaves an unparenthesized identifier's following brace to the enclosing grammar.
    NoStructLiteral,
}

/// A recursive descent parser that executes directly into a [`DynSegment`].
///
/// This is the parser every existing caller uses; behavior is unchanged from before [`Parser`]
/// became generic over [`ParserContext`].
pub type CELParser = Parser<DynSegmentContext>;

impl<C: ParserContext> Parser<C> {
    /// Creates a new CEL parser with the given operation lookup.
    ///
    /// No tokens are set at construction; use [`set_tokens`](Self::set_tokens),
    /// [`parse_tokens_ctx`](Self::parse_tokens_ctx), or [`parse_str_ctx`](Self::parse_str_ctx)
    /// to parse.
    ///
    /// # Arguments
    ///
    /// * `op_lookup` - Operation lookup for resolving operators and identifiers
    pub fn new(op_lookup: OpLookup) -> Self {
        Self::with_boxed_type_resolver(op_lookup, type_expr::builtin_type_resolver())
    }

    /// Creates a new CEL parser with the given operation lookup and leaf type resolver.
    ///
    /// Existing callers that need only the built-in CEL scalar types should continue to use
    /// [`new`](Self::new); this constructor is for hosts that want additional named CEL types
    /// without coupling `cel-parser` to their own registry implementation.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use cel_parser::{CELParser, OpLookup, ResolvedLeafType};
    /// use cel_runtime::ValueType;
    ///
    /// #[derive(Clone)]
    /// struct Celsius(i32);
    ///
    /// let resolver = [(
    ///     "Celsius",
    ///     ResolvedLeafType::new("Celsius", ValueType::leaf::<Celsius>()),
    /// )];
    /// let mut segment = CELParser::with_type_resolver(OpLookup::new(), resolver)
    ///     .parse_str("[]: [Celsius]")
    ///     .unwrap();
    /// let array = segment.call0::<cel_runtime::OwnedValue>().unwrap().try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<Celsius>>>().unwrap();
    /// assert!(array.into_vec().is_empty());
    /// ```
    pub fn with_type_resolver<R>(op_lookup: OpLookup, type_resolver: R) -> Self
    where
        R: TypeResolver + 'static,
    {
        Self::with_boxed_type_resolver(op_lookup, Box::new(type_resolver))
    }

    /// Creates a parser that uniquely owns its compile-time type resolver.
    fn with_boxed_type_resolver(op_lookup: OpLookup, type_resolver: Box<dyn TypeResolver>) -> Self {
        Parser {
            tokens: None,
            context: C::new_context(),
            op_lookup,
            type_resolver,
            last_span: Span::call_site(),
            unbalanced_delimiters: 0,
            restriction: ExpressionRestriction::None,
        }
    }

    /// Replaces this parser's named-type resolver.
    ///
    /// Every subsequent parse resolves annotation type names through `type_resolver` instead of
    /// the one this parser was built with.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use cel_parser::{CELParser, OpLookup, ResolvedLeafType};
    /// use cel_runtime::ValueType;
    ///
    /// #[derive(Clone)]
    /// struct Celsius(i32);
    ///
    /// let mut parser = CELParser::new(OpLookup::new());
    /// assert!(parser.parse_str("[]: [Celsius]").is_err());
    ///
    /// parser.set_type_resolver([(
    ///     "Celsius",
    ///     ResolvedLeafType::new("Celsius", ValueType::leaf::<Celsius>()),
    /// )]);
    /// assert!(parser.parse_str("[]: [Celsius]").is_ok());
    /// ```
    pub fn set_type_resolver<R>(&mut self, type_resolver: R)
    where
        R: TypeResolver + 'static,
    {
        self.type_resolver = Box::new(type_resolver);
    }

    /// Resolves `expr` through this parser's configured leaf type resolver.
    ///
    /// # Errors
    ///
    /// Returns `Err` if some named leaf in `expr` is not recognized.
    pub fn resolve_type_expr(&self, expr: &TypeExpr) -> Result<ResolvedType> {
        expr.resolve(self.type_resolver.as_ref())
    }

    /// Sets the token stream for parsing, resetting internal state.
    ///
    /// Call before [`is_expression`](Self::is_expression) or use
    /// [`parse_tokens_ctx`](Self::parse_tokens_ctx) which sets tokens and parses in one step.
    pub fn set_tokens(&mut self, tokens: TokenStreamIter) {
        self.tokens = Some(LexLexer::new(tokens).peekable());
        self.context = C::new_context();
        self.last_span = Span::call_site();
        self.unbalanced_delimiters = 0;
    }

    /// Sets the token stream from an existing [`LexLexer`] iterator for inline expression parsing.
    ///
    /// Resets the context. Use together with [`parse_expression_ctx`](Self::parse_expression_ctx)
    /// and [`take_lex_tokens`](Self::take_lex_tokens) to share a token stream between adam-lang and
    /// [`CELParser`].
    pub fn set_lex_tokens(&mut self, tokens: std::iter::Peekable<lex_lexer::LexLexer>) {
        self.tokens = Some(tokens);
        self.context = C::new_context();
        self.last_span = Span::call_site();
        self.unbalanced_delimiters = 0;
    }

    /// Returns the net number of opening delimiters this parser has consumed since the last
    /// [`set_tokens`](Self::set_tokens)/[`set_lex_tokens`](Self::set_lex_tokens) call, that
    /// remain unmatched by a corresponding closing delimiter.
    ///
    /// Always `0` after a successful top-level parse: every delimiter this grammar opens (an
    /// `if`-expression's branch braces, a tuple/group literal's or call's parens), it also
    /// closes. Positive after a parse that returned `Err` from partway through a production that
    /// had already consumed one or more opening delimiters before failing — e.g. an
    /// `if`-expression whose then-branch fails to parse consumes the branch's opening `{` before
    /// erroring out, never reaching the matching `}`.
    ///
    /// An embedding caller that shares its own token stream with this parser (via
    /// [`set_lex_tokens`](Self::set_lex_tokens)/[`take_lex_tokens`](Self::take_lex_tokens)), and
    /// tracks its own nesting depth over that same stream, cannot otherwise tell a delimiter this
    /// parser left dangling apart from one still genuinely open in the caller's own grammar,
    /// since both use the same `Delimiter` kinds. Reading this count immediately after reclaiming
    /// the stream — regardless of whether the parse succeeded or failed — and folding it into the
    /// caller's own depth counter keeps that counter consistent with the physical nesting left
    /// behind in the stream.
    pub fn unbalanced_delimiter_count(&self) -> i32 {
        self.unbalanced_delimiters
    }

    /// Parses one `expression` from the current token stream and returns the built context.
    ///
    /// Unlike [`parse_str_ctx`](Self::parse_str_ctx), this method does not require
    /// end-of-stream, allowing adam-lang to parse an expression embedded within a larger token
    /// stream.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid `expression`.
    ///
    /// - Complexity: O(n) in the number of tokens in the expression.
    pub fn parse_expression_ctx(&mut self) -> Result<C> {
        self.parse_expression_ctx_restricted(ExpressionRestriction::None)
    }

    /// Parses one expression under `restriction`, restoring the previous mode on every result.
    ///
    /// Does not require end-of-stream, so the enclosing grammar retains its body brace.
    ///
    /// - Complexity: O(n) in the expression's token count.
    ///
    /// # Errors
    /// Returns an error for a malformed expression or a context's semantic rejection.
    ///
    /// # Examples
    /// See [`ExpressionRestriction`].
    pub fn parse_expression_ctx_restricted(
        &mut self,
        restriction: ExpressionRestriction,
    ) -> Result<C> {
        if !self.with_restriction(restriction, |p| p.is_expression())? {
            return Err(self.error_at("expression expected"));
        }
        Ok(std::mem::replace(&mut self.context, C::new_context()))
    }

    /// Runs a grammar production in a temporary mode, restoring it on success and error.
    ///
    /// - Complexity: the invoked production's complexity.
    fn with_restriction<T>(
        &mut self,
        restriction: ExpressionRestriction,
        parse: impl FnOnce(&mut Self) -> Result<T>,
    ) -> Result<T> {
        let previous = std::mem::replace(&mut self.restriction, restriction);
        let result = parse(self);
        self.restriction = previous;
        result
    }

    /// `ordinary_expression = expression.` Explicit delimiters lift header restrictions.
    ///
    /// # Errors
    /// Returns the nested expression's syntax or context error.
    /// - Complexity: O(n) in the expression's token count.
    fn is_ordinary_expression(&mut self) -> Result<bool> {
        self.with_restriction(ExpressionRestriction::None, |p| p.is_expression())
    }

    /// Parses one `literal_pattern` from the current token stream and returns the built context.
    ///
    /// Like [`parse_expression_ctx`](Self::parse_expression_ctx), this does not require
    /// end-of-stream, letting a caller (e.g. adam-lang's `conditional_branch`) parse just the
    /// pattern before continuing with its own grammar.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid `literal_pattern`.
    pub fn parse_literal_pattern_ctx(&mut self) -> Result<C> {
        if !self.is_literal_pattern()? {
            return Err(self.error_at("literal pattern expected"));
        }
        Ok(std::mem::replace(&mut self.context, C::new_context()))
    }

    /// Compiles a fully independent nested context — used for a closure literal's body — by
    /// swapping `self.context` out for a fresh one, running `f` against it, then swapping the
    /// original context back in and returning the finished nested one.
    ///
    /// Unlike [`parse_expression_ctx`](Self::parse_expression_ctx), this does not reset
    /// `self.tokens`/`self.op_lookup`/`self.last_span` — it's for compiling a sub-expression in the
    /// middle of an already-in-progress outer parse, not starting a fresh top-level parse.
    ///
    /// # Errors
    ///
    /// Returns `Err` if `f` does, or if `f` returns `Ok(false)` (no expression found) — in both
    /// cases the outer context is still restored before returning.
    ///
    /// - Complexity: whatever `f`'s own parse cost is.
    pub(crate) fn parse_nested_context<F>(&mut self, f: F) -> Result<C>
    where
        F: FnOnce(&mut Self) -> Result<bool>,
    {
        let outer = std::mem::replace(&mut self.context, C::new_context());
        let outcome = f(self);
        let nested = std::mem::replace(&mut self.context, outer);
        match outcome {
            Ok(true) => Ok(nested),
            Ok(false) => Err(self.error_at("expected expression")),
            Err(e) => Err(e),
        }
    }

    /// Returns the remaining token stream after expression parsing.
    ///
    /// Call after [`parse_expression_ctx`](Self::parse_expression_ctx) to recover the
    /// shared [`LexLexer`] for continued adam-lang parsing.
    pub fn take_lex_tokens(&mut self) -> Option<std::iter::Peekable<lex_lexer::LexLexer>> {
        self.tokens.take()
    }

    /// Parses a token stream into a context value.
    ///
    /// Sets the token source, runs the expression grammar, and returns the context on success.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid CEL expression.
    pub fn parse_tokens_ctx(&mut self, tokens: TokenStreamIter) -> Result<C> {
        self.set_tokens(tokens);
        if !self.is_expression()? {
            return Err(self.error_at("expression expected"));
        }
        if self.peek_token().is_some() {
            return Err(self.error_at("unexpected token"));
        }
        Ok(std::mem::replace(&mut self.context, C::new_context()))
    }

    /// Parses a string into a context value.
    ///
    /// Tokenizes the string then parses; equivalent to
    /// `parse_tokens_ctx(TokenStream::from_str(s)?.into_iter())`.
    ///
    /// # Errors
    ///
    /// Returns an error on lex failure or if the input does not contain a valid CEL expression.
    pub fn parse_str_ctx(&mut self, s: &str) -> Result<C> {
        let input = TokenStream::from_str(s).map_err(|e| ParseError::from_lex_error(s, e))?;
        self.parse_tokens_ctx(input.into_iter())
    }

    /// Parses one complete `type_expr` from the current token stream.
    ///
    /// Unlike [`parse_type_expr_str`](Self::parse_type_expr_str), this method does not require
    /// ownership of the whole source string; it consumes only as many tokens as the type
    /// expression itself needs from the current stream.
    ///
    /// # Errors
    ///
    /// Returns an error if the current token stream does not begin with a valid type expression.
    pub fn parse_type_expr(&mut self) -> Result<TypeExpr> {
        self.parse_type_expression()
    }

    /// Parses one complete `type_expr` from `tokens`.
    ///
    /// # Errors
    ///
    /// Returns an error if `tokens` does not contain a valid complete type expression.
    pub fn parse_type_expr_tokens(&mut self, tokens: TokenStreamIter) -> Result<TypeExpr> {
        self.set_tokens(tokens);
        let expr = self.parse_type_expr()?;
        if self.peek_token().is_some() {
            return Err(self.error_at("unexpected token"));
        }
        Ok(expr)
    }

    /// Parses one complete `type_expr` from `s`.
    ///
    /// # Errors
    ///
    /// Returns an error on lex failure or if `s` does not contain a valid complete type
    /// expression.
    pub fn parse_type_expr_str(&mut self, s: &str) -> Result<TypeExpr> {
        let input = TokenStream::from_str(s).map_err(|e| ParseError::from_lex_error(s, e))?;
        self.parse_type_expr_tokens(input.into_iter())
    }

    /// Returns a mutable reference to the operation lookup.
    ///
    /// This allows customization of the operations available during parsing,
    /// such as adding new scopes for custom operations or identifiers.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use cel_parser::op_table::OpLookup;
    /// use cel_parser::CELParser;
    /// use cel_runtime::DynSegment;
    /// use proc_macro2::TokenStream;
    /// use std::any::TypeId;
    /// use std::str::FromStr;
    ///
    /// let input = TokenStream::from_str("10 + 20").unwrap();
    /// let mut lookup = OpLookup::new();
    /// lookup.push_scope(|name, segment, num_operands, _span| {
    ///     let matches = {
    ///         let top = segment.peek_stack_infos(num_operands);
    ///         name == "+" && top.len() == 2 && top[0].value_type.type_id() == TypeId::of::<i32>()
    ///     };
    ///     if matches {
    ///         segment.op2(|a: i32, b: i32| a + b + 1)?; // Custom addition
    ///         Ok(true)
    ///     } else {
    ///         Ok(false)
    ///     }
    /// });
    /// let mut parser = CELParser::new(lookup);
    /// parser.set_tokens(input.into_iter());
    /// ```
    pub fn op_lookup_mut(&mut self) -> &mut OpLookup {
        &mut self.op_lookup
    }

    /// Advances past the current token, recording its span in `last_span`.
    ///
    /// - Postcondition: [`unbalanced_delimiter_count`](Self::unbalanced_delimiter_count) is
    ///   incremented if the consumed token is an `OpenDelim`, decremented if it is a
    ///   `CloseDelim` (of `Delimiter::Brace`, `Delimiter::Bracket`, or `Delimiter::Parenthesis`;
    ///   `Delimiter::None` never appears in a token stream this parser is given, since it only
    ///   ever arises from `proc_macro2`'s macro-hygiene groups, not from parsing source text).
    ///
    /// # Panics
    ///
    /// Panics if no token stream has been set or if there is no current token.
    fn advance(&mut self) {
        use lex_lexer::HasSpan;
        let token = self
            .tokens
            .as_mut()
            .expect("tokens set")
            .next()
            .expect("token required to advance");
        match &token {
            Token::OpenDelim {
                delimiter: Delimiter::Brace | Delimiter::Bracket | Delimiter::Parenthesis,
                ..
            } => self.unbalanced_delimiters += 1,
            Token::CloseDelim {
                delimiter: Delimiter::Brace | Delimiter::Bracket | Delimiter::Parenthesis,
                ..
            } => self.unbalanced_delimiters -= 1,
            _ => {}
        }
        self.last_span = token.span();
    }

    /// Returns the span of the next token without consuming it, or `None` if exhausted.
    fn peek_span(&mut self) -> Option<Span> {
        self.peek_token().map(|token| {
            use lex_lexer::HasSpan;
            token.span()
        })
    }

    /// Peeks at the current token without consuming it.
    ///
    /// Returns `None` if there are no more tokens.
    fn peek_token(&mut self) -> Option<&Token> {
        self.tokens.as_mut().expect("tokens set").peek()
    }

    /// Builds a [`ParseError`] at the current token's span (or call_site if no token).
    fn error_at(&mut self, message: &str) -> ParseError {
        let span = match self.peek_token() {
            Some(token) => {
                use lex_lexer::HasSpan;
                token.span()
            }
            None => Span::call_site(),
        };
        ParseError::new(message, span)
    }

    /// Consumes and returns `true` if the next token is punctuation matching `target`.
    fn is_punctuation(&mut self, target: &str) -> bool {
        match self.peek_token() {
            Some(Token::Punct { op, .. }) if op == target => {
                self.advance();
                true
            }
            _ => false,
        }
    }

    /// Consumes and returns `true` if the next token is an identifier matching `keyword`.
    fn is_keyword(&mut self, keyword: &str) -> bool {
        match self.peek_token() {
            Some(Token::Identifier(ident)) if ident == keyword => {
                self.advance();
                true
            }
            _ => false,
        }
    }

    /// Consumes and returns the next token's text if it is an identifier.
    ///
    /// # Errors
    ///
    /// Returns an error with `message` if the next token is not an identifier.
    fn expect_identifier(&mut self, message: &str) -> Result<String> {
        match self.peek_token() {
            Some(Token::Identifier(ident)) => {
                let name = ident.to_string();
                self.advance();
                Ok(name)
            }
            _ => Err(self.error_at(message)),
        }
    }

    /// Consumes and returns `true` if the next token is an opening parenthesis `(`.
    fn is_open_paren(&mut self) -> bool {
        if matches!(
            self.peek_token(),
            Some(Token::OpenDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            })
        ) {
            self.advance();
            true
        } else {
            false
        }
    }

    /// Consumes and returns `true` if the next token is a closing parenthesis `)`.
    fn is_close_paren(&mut self) -> bool {
        if matches!(
            self.peek_token(),
            Some(Token::CloseDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            })
        ) {
            self.advance();
            true
        } else {
            false
        }
    }

    /// Consumes and returns `true` if the next token is a closing bracket `]`.
    fn is_close_bracket(&mut self) -> bool {
        if matches!(
            self.peek_token(),
            Some(Token::CloseDelim {
                delimiter: Delimiter::Bracket,
                ..
            })
        ) {
            self.advance();
            true
        } else {
            false
        }
    }

    /// `expression = range_expression.`
    pub fn is_expression(&mut self) -> Result<bool> {
        self.is_range_expression()
    }

    /// `or_expression = and_expression { "||" and_expression }.`
    ///
    /// # Errors
    ///
    /// Returns an error if the RHS is missing after `||`, if the RHS does not
    /// produce a `bool`, or if any sub-expression returns an error.
    fn is_or_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_and_expression()? {
            while self.is_punctuation("||") {
                let mut rhs_fragment = self.context.new_fragment();
                std::mem::swap(&mut self.context, &mut rhs_fragment);
                if !self.is_and_expression()? {
                    return Err(self.error_at("expected and_expression"));
                }
                std::mem::swap(&mut self.context, &mut rhs_fragment);
                self.context.apply_logical(
                    "||",
                    rhs_fragment,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `and_expression = comparison_expression { "&&" comparison_expression }.`
    ///
    /// # Errors
    ///
    /// Returns an error if the RHS is missing after `&&`, if the RHS does not
    /// produce a `bool`, or if any sub-expression returns an error.
    fn is_and_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_comparison_expression()? {
            while self.is_punctuation("&&") {
                let mut rhs_fragment = self.context.new_fragment();
                std::mem::swap(&mut self.context, &mut rhs_fragment);
                if !self.is_comparison_expression()? {
                    return Err(self.error_at("expected comparison_expression"));
                }
                std::mem::swap(&mut self.context, &mut rhs_fragment);
                self.context.apply_logical(
                    "&&",
                    rhs_fragment,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `comparison_expression = bitwise_or_expression
    ///     [ ("==" | "!=" | "<" | ">" | "<=" | ">=") bitwise_or_expression ].`
    fn is_comparison_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_bitwise_or_expression()? {
            // Longer operators first: must check "==" before "=", "<=" before "<", etc.
            let op_name = if self.is_punctuation("==") {
                Some("==")
            } else if self.is_punctuation("!=") {
                Some("!=")
            } else if self.is_punctuation("<=") {
                Some("<=")
            } else if self.is_punctuation(">=") {
                Some(">=")
            } else if self.is_punctuation("<") {
                Some("<")
            } else if self.is_punctuation(">") {
                Some(">")
            } else {
                None
            };

            if let Some(op_name) = op_name {
                if !self.is_bitwise_or_expression()? {
                    return Err(self.error_at("expected bitwise_or_expression"));
                }
                self.context.apply_op(
                    &self.op_lookup,
                    op_name,
                    2,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `range_expression = or_expression [ ".." [ or_expression ] | "..=" or_expression ]
    ///                   | ".." [ or_expression ]
    ///                   | "..=" or_expression.`
    ///
    /// Left-factored so every alternative is chosen by one concrete leading token rather
    /// than by first deciding whether an optional `or_expression` is present: the three
    /// alternatives start with `or_expression`'s own FIRST set, the literal `".."`, or the
    /// literal `"..="` respectively — pairwise disjoint (`..`/`..=` can never be the first
    /// token of an `or_expression`), so picking among them needs exactly one token, and none
    /// of them opens with a bracketed, possibly-empty non-terminal.
    ///
    /// `..`'s right operand is optional wherever it appears (covering, across the three
    /// alternatives, `Range`/`RangeFrom`/`RangeTo`/`RangeFull`); `..=`'s right operand is
    /// never optional (covering `RangeInclusive`/`RangeToInclusive`) — there is no
    /// inclusive-from-only range in Rust, and no such form is registered in the op-table for
    /// it to dispatch to, so a bare `..=`, or a left operand followed by `..=` and nothing
    /// after, is a parse error, not a valid empty match.
    ///
    /// Operands are `or_expression` — matching Rust's own precedence, where `..`/`..=` bind
    /// *looser* than `||` (and everything below it: `&&`, comparisons, bitwise ops,
    /// arithmetic). So `1 + 2..3 * 4` still groups as `(1 + 2)..(3 * 4)` (arithmetic is well
    /// inside `or_expression`'s own chain), and `a == b..c == d` groups the *whole*
    /// comparisons as the two endpoints: `(a == b)..(c == d)`, not `a == (b..c) == d`.
    fn is_range_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();

        if self.is_punctuation("..=") {
            if !self.is_or_expression()? {
                return Err(self.error_at("expected or_expression"));
            }
            self.context.apply_op(
                &self.op_lookup,
                "range_to_inclusive",
                1,
                start_span.expect("production has token at start"),
                self.last_span,
            )?;
            return Ok(true);
        }

        if self.is_punctuation("..") {
            if self.is_or_expression()? {
                self.context.apply_op(
                    &self.op_lookup,
                    "range_to",
                    1,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            } else {
                self.context.apply_op(
                    &self.op_lookup,
                    "range_full",
                    0,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            return Ok(true);
        }

        if self.is_or_expression()? {
            if self.is_punctuation("..=") {
                if !self.is_or_expression()? {
                    return Err(self.error_at("expected or_expression"));
                }
                self.context.apply_op(
                    &self.op_lookup,
                    "range_inclusive",
                    2,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            } else if self.is_punctuation("..") {
                if self.is_or_expression()? {
                    self.context.apply_op(
                        &self.op_lookup,
                        "range",
                        2,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                } else {
                    self.context.apply_op(
                        &self.op_lookup,
                        "range_from",
                        1,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                }
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `bitwise_or_expression = bitwise_xor_expression { "|" bitwise_xor_expression }.`
    fn is_bitwise_or_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_bitwise_xor_expression()? {
            while self.is_punctuation("|") {
                if !self.is_bitwise_xor_expression()? {
                    return Err(self.error_at("expected bitwise_xor_expression"));
                }
                self.context.apply_op(
                    &self.op_lookup,
                    "|",
                    2,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `bitwise_xor_expression = bitwise_and_expression { "^" bitwise_and_expression }.`
    fn is_bitwise_xor_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_bitwise_and_expression()? {
            while self.is_punctuation("^") {
                if !self.is_bitwise_and_expression()? {
                    return Err(self.error_at("expected bitwise_and_expression"));
                }
                self.context.apply_op(
                    &self.op_lookup,
                    "^",
                    2,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `bitwise_and_expression = bitwise_shift_expression { "&" bitwise_shift_expression }.`
    fn is_bitwise_and_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_bitwise_shift_expression()? {
            while self.is_punctuation("&") {
                if !self.is_bitwise_shift_expression()? {
                    return Err(self.error_at("expected bitwise_shift_expression"));
                }
                self.context.apply_op(
                    &self.op_lookup,
                    "&",
                    2,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `bitwise_shift_expression = additive_expression { ("<<" | ">>") additive_expression }.`
    fn is_bitwise_shift_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_additive_expression()? {
            loop {
                let op_name = if self.is_punctuation("<<") {
                    Some("<<")
                } else if self.is_punctuation(">>") {
                    Some(">>")
                } else {
                    None
                };

                if let Some(op_name) = op_name {
                    if !self.is_additive_expression()? {
                        return Err(self.error_at("expected additive_expression"));
                    }
                    self.context.apply_op(
                        &self.op_lookup,
                        op_name,
                        2,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                } else {
                    break;
                }
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `additive_expression = multiplicative_expression { ("+" | "-") multiplicative_expression }.`
    fn is_additive_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_multiplicative_expression()? {
            loop {
                let op_name = if self.is_punctuation("+") {
                    Some("+")
                } else if self.is_punctuation("-") {
                    Some("-")
                } else {
                    None
                };

                if let Some(op_name) = op_name {
                    if !self.is_multiplicative_expression()? {
                        return Err(self.error_at("expected multiplicative_expression"));
                    }
                    self.context.apply_op(
                        &self.op_lookup,
                        op_name,
                        2,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                } else {
                    break;
                }
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `multiplicative_expression = cast_expression { ("*" | "/" | "%") cast_expression }.`
    fn is_multiplicative_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_cast_expression()? {
            loop {
                let op_name = if self.is_punctuation("*") {
                    Some("*")
                } else if self.is_punctuation("/") {
                    Some("/")
                } else if self.is_punctuation("%") {
                    Some("%")
                } else {
                    None
                };

                if let Some(op_name) = op_name {
                    if !self.is_cast_expression()? {
                        return Err(self.error_at("expected cast_expression"));
                    }
                    self.context.apply_op(
                        &self.op_lookup,
                        op_name,
                        2,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                } else {
                    break;
                }
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `cast_expression = unary_expression { "as" identifier }.`
    ///
    /// Binds tighter than `* / %` but looser than unary prefix and postfix, matching Rust: `-x as
    /// f64` is `(-x) as f64`, and `x as i32 as f64` applies left-to-right (`(x as i32) as f64`).
    ///
    /// # Errors
    ///
    /// Returns an error if `"as"` isn't followed by an identifier, or if any sub-expression
    /// returns an error.
    fn is_cast_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if self.is_unary_expression()? {
            while self.is_keyword("as") {
                let type_name = match self.peek_token() {
                    Some(Token::Identifier(ident)) => ident.to_string(),
                    _ => return Err(self.error_at("expected type name after `as`")),
                };
                self.advance();
                self.context.apply_cast(
                    &self.op_lookup,
                    &type_name,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            }
            Ok(true)
        } else {
            Ok(false)
        }
    }

    /// `unary_expression = (("-" | "!") unary_expression) | primary_expression.`
    fn is_unary_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        let op_name = if self.is_punctuation("-") {
            Some("-")
        } else if self.is_punctuation("!") {
            Some("!")
        } else {
            None
        };

        if let Some(op_name) = op_name {
            if !self.is_unary_expression()? {
                return Err(self.error_at("expected unary_expression"));
            }
            self.context.apply_op(
                &self.op_lookup,
                op_name,
                1,
                start_span.expect("production has token at start"),
                self.last_span,
            )?;
            Ok(true)
        } else {
            self.is_postfix_expression()
        }
    }

    /// `literal_pattern = ["-"] literal.`
    ///
    /// A deliberately narrower relative of [`is_unary_expression`](Self::is_unary_expression):
    /// Rust's own pattern grammar allows a leading unary `-` only directly on a literal (no
    /// `!`, no chained `--`, and the operand must be a bare literal token, not an arbitrary
    /// `postfix_expression`).
    ///
    /// # Errors
    ///
    /// Returns an error if a leading `-` is not followed by a literal, or if the literal or its
    /// negation fails (e.g. an out-of-range suffixed integer, or negating an unsigned literal).
    fn is_literal_pattern(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        let negated = self.is_punctuation("-");
        match self.peek_token() {
            Some(Token::Literal(lit)) => {
                let lit_clone = lit.clone();
                self.advance();
                push_literal_token(&mut self.context, lit_clone)?;
                if negated {
                    self.context.apply_op(
                        &self.op_lookup,
                        "-",
                        1,
                        start_span.expect("production has token at start"),
                        self.last_span,
                    )?;
                }
                Ok(true)
            }
            _ if negated => Err(self.error_at("expected literal after `-`")),
            _ => Ok(false),
        }
    }

    /// `postfix_expression = primary_expression { "(" [ parameter_list ] ")" | "." (unsuffixed_integer | identifier [ "(" [ parameter_list ] ")" ]) }.`
    ///
    /// The repetition allows chained indices (`t.0.1`): each `"." unsuffixed_integer`
    /// is applied in turn to whatever value the previous step left on top of the
    /// stack. Source text like `.0.1` tokenizes as a single `.` followed by one
    /// float literal `0.1` (Rust's own lexer maximally munches the digits after
    /// the second `.`), so that case is detected and split back into its two
    /// integer indices — see the `Token::Literal(CelLiteral::Float(..))` arm below.
    /// Named members consume their optional argument list as one operation, not a call
    /// of a previously evaluated scalar result.
    fn is_postfix_expression(&mut self) -> Result<bool> {
        let start_span = self.peek_span();
        if !self.is_primary_expression()? {
            return Ok(false);
        }
        loop {
            if let Some(arg_count) = self.postfix_arguments()? {
                // Stack order is [callee, arg1, arg2, ...]; lookup peeks top (arg_count + 1) entries.
                self.context.apply_op(
                    &self.op_lookup,
                    "()",
                    arg_count + 1,
                    start_span.expect("production has token at start"),
                    self.last_span,
                )?;
            } else if self.is_punctuation(".") {
                match self.peek_token() {
                    Some(Token::Identifier(_)) => {
                        let name_start = self.peek_span().expect("member has a name token");
                        let name = self.expect_identifier("expected member name")?;
                        let name_span = ExprSpan {
                            start: name_start,
                            end: name_start,
                        };
                        let explicit_args = self.postfix_arguments()?;
                        self.context.apply_member(
                            &self.op_lookup,
                            &name,
                            name_span,
                            explicit_args,
                            start_span.expect("production has token at start"),
                            self.last_span,
                        )?;
                    }
                    Some(Token::Literal(CelLiteral::Int(integer))) => {
                        let integer = integer.clone();
                        if !integer.suffix().is_empty() {
                            return Err(self.error_at("tuple index must be an unsuffixed integer"));
                        }
                        self.advance();
                        let index = integer.base10_parse::<usize>().map_err(|e| {
                            self.error_at(&format!("invalid tuple index `{integer}`: {e}"))
                        })?;
                        self.apply_tuple_index(
                            index,
                            start_span.expect("production has token at start"),
                        )?;
                    }
                    Some(Token::Literal(CelLiteral::Float(float))) => {
                        let float = float.clone();
                        if !float.suffix().is_empty() {
                            return Err(self.error_at("tuple index must be an unsuffixed integer"));
                        }
                        // base10_digits() returns the decimal digits with underscores
                        // stripped and the suffix removed, e.g. "0.1" or "10.25" for
                        // ordinary decimal floats — splitting on '.' recovers the two
                        // chained integer indices. Scientific-notation floats (e.g.
                        // `1e2`) normalize to digits with no '.' at all; reject those
                        // as a parse error (checked before advancing, so the error
                        // span still points at the float token) rather than assuming
                        // a '.' is always present.
                        let digits = float.base10_digits();
                        let Some((first, second)) = digits.split_once('.') else {
                            return Err(self.error_at(
                                "tuple index chain must use decimal notation (e.g. `.0.1`)",
                            ));
                        };
                        self.advance();
                        let first_index = first.parse::<usize>().map_err(|e| {
                            self.error_at(&format!("invalid tuple index `{first}`: {e}"))
                        })?;
                        let second_index = second.parse::<usize>().map_err(|e| {
                            self.error_at(&format!("invalid tuple index `{second}`: {e}"))
                        })?;
                        let idx_start = start_span.expect("production has token at start");
                        self.apply_tuple_index(first_index, idx_start)?;
                        self.apply_tuple_index(second_index, idx_start)?;
                    }
                    _ => return Err(self.error_at("expected integer or member name after '.'")),
                }
            } else {
                break;
            }
        }
        Ok(true)
    }

    /// `postfix_arguments = [ "(" [ parameter_list ] ")" ].`
    ///
    /// Returns `None` without consuming input when no argument list follows.
    ///
    /// # Errors
    /// Returns an error for malformed arguments or a missing closing parenthesis.
    ///
    /// - Complexity: O(n) in the parsed argument expressions.
    fn postfix_arguments(&mut self) -> Result<Option<usize>> {
        if !self.is_open_paren() {
            return Ok(None);
        }
        if self.is_close_paren() {
            return Ok(Some(0));
        }
        let count = self.parameter_list()?;
        if !self.is_close_paren() {
            return Err(self.error_at("expected closing parenthesis"));
        }
        Ok(Some(count))
    }

    /// Applies a single `.N` tuple-index operation to the value currently on
    /// top of the stack, replacing it with element `index`. `start` is the span
    /// of the base expression the index chain is rooted at.
    ///
    /// # Errors
    /// Returns an error if the top of stack isn't a tuple, or if `index` is
    /// out of range for its arity.
    fn apply_tuple_index(&mut self, index: usize, start: Span) -> Result<()> {
        let arity = self
            .context
            .peek_tuple_arity()
            .ok_or_else(|| self.error_at("'.N' requires a tuple"))?;
        if index >= arity {
            return Err(self.error_at(&format!(
                "tuple index `{index}` out of range for tuple of arity {arity}"
            )));
        }
        self.context.tuple_index(index, start, self.last_span)?;
        Ok(())
    }

    /// `parameter_list = expression { "," expression }.`
    ///
    /// Always parses at least one `expression` — callers that need to allow zero
    /// arguments (`postfix_expression`'s `"(" [ parameter_list ] ")"`) check for that
    /// possibility themselves before calling, rather than `parameter_list` swallowing it.
    ///
    /// Returns the argument count.
    ///
    /// # Errors
    /// Returns an error if the first token can't start an `expression`, or if a comma
    /// isn't followed by one.
    fn parameter_list(&mut self) -> Result<usize> {
        if !self.is_ordinary_expression()? {
            return Err(self.error_at("expected expression"));
        }
        let mut count = 1;
        while self.is_punctuation(",") {
            if !self.is_ordinary_expression()? {
                return Err(self.error_at("expected expression after comma"));
            }
            count += 1;
        }
        Ok(count)
    }

    /// `primary_expression = literal | identifier [ record_fields ] | tuple_or_group | array_expression |
    /// if_expression | closure_expression.`
    ///
    /// Dispatches to [`is_if_expression`](Self::is_if_expression) when the `if` keyword is seen,
    /// to [`is_tuple_or_group`](Self::is_tuple_or_group) when `(` is seen, to
    /// [`is_array_expression`](Self::is_array_expression) when `[` is seen, and to
    /// [`is_closure_expression`](Self::is_closure_expression) when `|` or `||` is seen.
    ///
    /// A zero-parameter closure's opening and closing pipes (`||`) have nothing between them to
    /// keep them apart, so the lexer combines them into one two-character token exactly like it
    /// does for `&&`/`<=`/etc. elsewhere in this grammar — checked first, before the
    /// one-character `|` case, so `is_punctuation("|")` doesn't (and can't) partially match it.
    ///
    /// # Errors
    ///
    /// Returns an error if:
    /// - A literal value cannot be parsed (e.g., integer out of range).
    /// - An identifier is not found in the op lookup table.
    /// - A tuple-or-group expression fails to parse.
    /// - An array literal fails to parse or is rejected by the context it emits into.
    /// - An `if` expression fails to parse.
    /// - A closure expression fails to parse.
    fn is_primary_expression(&mut self) -> Result<bool> {
        if self.is_punctuation("||") {
            return self.is_closure_expression(true);
        }
        if self.is_punctuation("|") {
            return self.is_closure_expression(false);
        }
        match self.peek_token() {
            Some(Token::Literal(lit)) => {
                let lit_clone = lit.clone();
                self.advance();
                push_literal_token(&mut self.context, lit_clone)?;
                Ok(true)
            }
            Some(Token::Identifier(ident)) => {
                let ident_name = ident.to_string();
                let ident_span = ident.span();
                self.advance();

                if ident_name == "if" {
                    return self.is_if_expression(ident_span);
                }

                if self.restriction == ExpressionRestriction::None
                    && matches!(
                        self.peek_token(),
                        Some(Token::OpenDelim {
                            delimiter: Delimiter::Brace,
                            ..
                        })
                    )
                {
                    return self.is_record_fields(&ident_name, ident_span);
                }

                self.context
                    .apply_op(&self.op_lookup, &ident_name, 0, ident_span, ident_span)?;

                Ok(true)
            }
            Some(Token::OpenDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            }) => self.is_tuple_or_group(),
            Some(Token::OpenDelim {
                delimiter: Delimiter::Bracket,
                ..
            }) => self.is_array_expression(),
            _ => Ok(false),
        }
    }

    /// `record_fields = "{" [ identifier ":" expression { "," identifier ":" expression } [ "," ] ] "}".`
    ///
    /// - Precondition: the constructor identifier is consumed and the next token is `{`.
    /// - Postcondition: fields are emitted once in source order before the constructor.
    /// - Complexity: O(n + f² + f * d + r) for n tokens, f fields, descriptor depth d and r schemas.
    ///
    /// # Errors
    /// Returns malformed field syntax errors or the context's record validation error.
    fn is_record_fields(&mut self, name: &str, name_token: Span) -> Result<bool> {
        self.advance();
        let ambient_start = self.context.current_stack_offset();
        let mut fields = Vec::new();
        loop {
            if matches!(
                self.peek_token(),
                Some(Token::CloseDelim {
                    delimiter: Delimiter::Brace,
                    ..
                })
            ) {
                self.advance();
                break;
            }
            let Some(Token::Identifier(field)) = self.peek_token() else {
                return Err(self.error_at("expected record field name"));
            };
            let field_name = field.to_string();
            let field_span = field.span();
            self.advance();
            if !self.is_punctuation(":") {
                return Err(self.error_at("expected `:` after record field name"));
            }
            if !self.is_ordinary_expression()? {
                return Err(self.error_at("expected record field expression"));
            }
            fields.push((
                field_name,
                ExprSpan {
                    start: field_span,
                    end: field_span,
                },
            ));
            if matches!(
                self.peek_token(),
                Some(Token::CloseDelim {
                    delimiter: Delimiter::Brace,
                    ..
                })
            ) {
                self.advance();
                break;
            }
            if !self.is_punctuation(",") {
                return Err(self.error_at("expected `,` or `}` after record field"));
            }
        }
        self.context.make_record(
            &self.op_lookup,
            name,
            ExprSpan {
                start: name_token,
                end: name_token,
            },
            fields,
            ambient_start,
            name_token,
            self.last_span,
        )?;
        Ok(true)
    }

    /// `tuple_or_group = "(" [ expression ["," [ expression { "," expression } ]] ] ")".`
    ///
    /// `()` parses as unit, `(expr)` as grouping, `(expr,)` as a 1-tuple, and
    /// `(expr, expr, ...)` as an n-tuple.
    ///
    /// - Precondition: The next token is `Token::OpenDelim` with `Delimiter::Parenthesis`.
    ///
    /// # Errors
    ///
    /// Returns an error if the parenthesized expression or tuple literal is malformed, has a
    /// missing or misplaced comma, or is missing its closing `)`.
    fn is_tuple_or_group(&mut self) -> Result<bool> {
        let open_span = self
            .peek_span()
            .expect("tuple_or_group requires an opening '(' token");
        self.advance();
        // Unit expression: ()
        if matches!(
            self.peek_token(),
            Some(Token::CloseDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            })
        ) {
            self.advance();
            self.context.make_tuple(
                0,
                self.context.current_stack_offset(),
                open_span,
                self.last_span,
            )?;
            return Ok(true);
        }
        let ambient_start = self.context.current_stack_offset();
        if !self.is_ordinary_expression()? {
            return Err(self.error_at("expected expression"));
        }
        if matches!(
            self.peek_token(),
            Some(Token::CloseDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            })
        ) {
            // Grouping: exactly one expression, no comma.
            self.advance();
            return Ok(true);
        }
        if !self.is_punctuation(",") {
            return Err(self.error_at("expected ',' or closing parenthesis"));
        }
        let mut count = 1;
        if matches!(
            self.peek_token(),
            Some(Token::CloseDelim {
                delimiter: Delimiter::Parenthesis,
                ..
            })
        ) {
            // Single element + trailing comma: 1-tuple.
            self.advance();
            self.context
                .make_tuple(count, ambient_start, open_span, self.last_span)?;
            return Ok(true);
        }
        loop {
            if !self.is_ordinary_expression()? {
                return Err(self.error_at("expected expression after ','"));
            }
            count += 1;
            if matches!(
                self.peek_token(),
                Some(Token::CloseDelim {
                    delimiter: Delimiter::Parenthesis,
                    ..
                })
            ) {
                self.advance();
                break;
            }
            if !self.is_punctuation(",") {
                return Err(self.error_at("expected ',' or closing parenthesis"));
            }
        }
        self.context
            .make_tuple(count, ambient_start, open_span, self.last_span)?;
        Ok(true)
    }

    /// `array_expression = "[" [ expression { "," expression } ] "]" [ ":" type_expr ] .`
    ///
    /// Every comma requires another element, so the production stays Wirth-style LL(1) — each
    /// decision is made by inspecting exactly the current token — and a trailing comma
    /// (`[0i32,]`) is a parse error, unlike the 1-tuple form `(0i32,)` where the comma is what
    /// distinguishes a tuple from a grouping.
    ///
    /// - Precondition: The next token is `Token::OpenDelim` with `Delimiter::Bracket`.
    ///
    /// # Errors
    ///
    /// Returns an error if the literal is empty and unannotated (`[]` has no inferable element
    /// type; see <https://github.com/stlab/cel-rs/issues/212>), if an element expression is
    /// missing or malformed, if a comma or the closing `]` is missing, if the type annotation is
    /// malformed or names a non-array type, or if the context this emits into rejects the
    /// collected elements (e.g. heterogeneous element types).
    ///
    /// - Postcondition: Returns `Ok(true)` on success; `Ok(false)` is never returned.
    fn is_array_expression(&mut self) -> Result<bool> {
        let open_span = self
            .peek_span()
            .expect("array_expression requires an opening '[' token");
        self.advance();
        let ambient_start = self.context.current_stack_offset();
        let mut count = 0usize;
        if !self.is_close_bracket() {
            if !self.is_ordinary_expression()? {
                return Err(self.error_at("expected expression"));
            }
            count = 1;
            loop {
                if self.is_close_bracket() {
                    break;
                }
                if !self.is_punctuation(",") {
                    return Err(self.error_at("expected ',' or closing ']'"));
                }
                // A comma always requires another element: `]` here (a trailing comma) can't
                // start an `expression`, so this is where `[0i32,]` is rejected.
                if !self.is_ordinary_expression()? {
                    return Err(self.error_at("expected expression after ','"));
                }
                count += 1;
            }
        }

        let mut type_annotation = None;
        let mut annotation_span = None;
        if self.is_punctuation(":") {
            let colon_span = self.last_span;
            let annotation = self.parse_type_expression()?;
            let annotation_end = annotation.span().end;
            annotation_span = Some(ExprSpan {
                start: colon_span,
                end: annotation_end,
            });
            type_annotation = Some(annotation);
        }

        if count == 0 && type_annotation.is_none() {
            return Err(ParseError::new_range(
                "an empty array literal has no inferable element type; \
                 see https://github.com/stlab/cel-rs/issues/212"
                    .to_string(),
                open_span,
                self.last_span,
            ));
        }

        let type_resolver = self.type_resolver.as_ref();
        let mut resolve_array_type = |type_expr: &TypeExpr| {
            let resolved = type_expr.resolve(type_resolver)?;
            ResolvedArrayType::from_resolved_type(resolved, type_expr.span())
        };
        self.context.make_annotated_array(
            count,
            ambient_start,
            parser_context::AnnotatedArray::new(
                &mut resolve_array_type,
                type_annotation,
                annotation_span,
            ),
            open_span,
            self.last_span,
        )?;
        Ok(true)
    }

    /// `type_expression = identifier [ "(" [ type_expression { "," type_expression } ] ")" ]
    ///                  | "[" type_expression "]"
    ///                  | "(" [ type_expression ["," [ type_expression { "," type_expression } ]] ] ")" .`
    ///
    /// `()` is the empty tuple type (0 elements); `(T)` is grouping (same as bare `T`); `(T,)`
    /// is a 1-element tuple; `(T, U, ...)` is n-element, no trailing comma. `[T]` names an
    /// array type whose elements have type `T`. `Name(A, B)` applies zero or more type
    /// arguments to a named (generic) type.
    ///
    /// # Errors
    ///
    /// Returns an error if a named leaf is missing, if an array, tuple, or type-argument list is
    /// malformed, or if a closing `]`/`)` is missing.
    pub fn parse_type_expression(&mut self) -> Result<TypeExpr> {
        if let Some(Token::Identifier(_)) = self.peek_token() {
            let name = self.expect_identifier("expected a type name")?;
            let name_span = self.last_span;
            let mut args = Vec::new();
            let mut end_span = name_span;
            if self.is_open_paren() {
                if !self.is_close_paren() {
                    args.push(self.parse_type_expression()?);
                    while self.is_punctuation(",") {
                        args.push(self.parse_type_expression()?);
                    }
                    if !self.is_close_paren() {
                        return Err(
                            self.error_at("expected ',' or closing ')' in type argument list")
                        );
                    }
                }
                end_span = self.last_span;
            }
            return Ok(TypeExpr::Named {
                name,
                args,
                span: ExprSpan {
                    start: name_span,
                    end: end_span,
                },
            });
        }

        if matches!(
            self.peek_token(),
            Some(Token::OpenDelim {
                delimiter: Delimiter::Bracket,
                ..
            })
        ) {
            let open_span = self
                .peek_span()
                .expect("array type expression requires an opening '[' token");
            self.advance();
            if self.is_close_bracket() {
                return Err(ParseError::new_range(
                    "expected a type expression after '['".to_string(),
                    open_span,
                    self.last_span,
                ));
            }
            let element = self.parse_type_expression()?;
            if !self.is_close_bracket() {
                return Err(self.error_at("expected closing ']' after array type expression"));
            }
            return Ok(TypeExpr::Array {
                element: Box::new(element),
                span: ExprSpan {
                    start: open_span,
                    end: self.last_span,
                },
            });
        }

        if !self.is_open_paren() {
            return Err(self.error_at("expected a type name, '[' or '('"));
        }
        let open_span = self.last_span;
        if self.is_close_paren() {
            return Ok(TypeExpr::Tuple {
                elements: Vec::new(),
                span: ExprSpan {
                    start: open_span,
                    end: self.last_span,
                },
            });
        }

        let first = self.parse_type_expression()?;
        if self.is_close_paren() {
            let span = ExprSpan {
                start: open_span,
                end: self.last_span,
            };
            return Ok(match first {
                TypeExpr::Named { name, args, .. } => TypeExpr::Named { name, args, span },
                TypeExpr::Array { element, .. } => TypeExpr::Array { element, span },
                TypeExpr::Tuple { elements, .. } => TypeExpr::Tuple { elements, span },
            });
        }
        if !self.is_punctuation(",") {
            return Err(self.error_at("expected ',' or closing ')'"));
        }
        if self.is_close_paren() {
            return Ok(TypeExpr::Tuple {
                elements: vec![first],
                span: ExprSpan {
                    start: open_span,
                    end: self.last_span,
                },
            });
        }
        let mut elements = vec![first];
        loop {
            elements.push(self.parse_type_expression()?);
            if self.is_close_paren() {
                break;
            }
            if !self.is_punctuation(",") {
                return Err(self.error_at("expected ',' or closing ')'"));
            }
        }
        Ok(TypeExpr::Tuple {
            elements,
            span: ExprSpan {
                start: open_span,
                end: self.last_span,
            },
        })
    }

    /// `closure_expression = ("||" | "|" [ closure_param { "," closure_param } ] "|") expression .`
    /// `closure_param = identifier ":" type_expression .`
    ///
    /// Compiles the body as a fully independent nested context (via
    /// [`parse_nested_context`](Self::parse_nested_context)) whose only visible names are its
    /// own declared parameters plus whatever library/built-in functions are always reachable —
    /// [`OpLookup::isolate_scopes`] hides every other transient scope (including one an enclosing
    /// caller, e.g. adam-lang, pushed around this whole parse) for the duration of the body
    /// parse, so a closure never resolves a free variable from its lexical surroundings.
    ///
    /// Runtime contexts resolve each annotation through the configured [`TypeResolver`] into
    /// its exact [`cel_runtime::ValueType`]. Syntax-only contexts retain the unresolved,
    /// span-carrying [`TypeExpr`] without consulting runtime tables. Both use the same
    /// [`parse_type_expression`](Self::parse_type_expression) production.
    ///
    /// - Precondition: the opening `|` (`params_already_closed == false`) or the combined `||`
    ///   token naming an empty parameter list (`params_already_closed == true`) has already been
    ///   consumed by [`is_primary_expression`](Self::is_primary_expression); `self.last_span` is
    ///   its span.
    ///
    /// # Errors
    ///
    /// Returns an error if a parameter name, its `:`, its type, or the closing `|` is malformed
    /// or missing; if a runtime parameter names an unrecognized type or unsupported array
    /// element shape; if a used parameter lacks clone support; if the body is missing or malformed;
    /// or if this `ParserContext` implementation's `push_closure` rejects the closure (e.g.
    /// `DynSegmentContext` when the body doesn't produce exactly one value).
    ///
    /// - Postcondition: Returns `Ok(true)` on success; `Ok(false)` is never returned.
    fn is_closure_expression(&mut self, params_already_closed: bool) -> Result<bool> {
        let start_span = self.last_span;
        let mut params: Vec<(String, Span, Option<cel_runtime::ValueType>, TypeExpr)> = Vec::new();
        if !params_already_closed {
            loop {
                let name = self.expect_identifier("expected closure parameter name")?;
                let name_span = self.last_span;
                if !self.is_punctuation(":") {
                    return Err(self.error_at("expected ':' after closure parameter name"));
                }
                let ty_ast = self.parse_type_expression()?;
                let ty = if C::resolves_closure_types() {
                    Some(closure_param_type_from_type_expr(
                        &ty_ast,
                        self.type_resolver.as_ref(),
                    )?)
                } else {
                    None
                };
                params.push((name, name_span, ty, ty_ast));
                if self.is_punctuation(",") {
                    continue;
                }
                break;
            }
            if !self.is_punctuation("|") {
                return Err(self.error_at("expected ',' or closing '|'"));
            }
        }

        let param_types = params
            .iter()
            .filter_map(|(_, _, ty, _)| ty.clone())
            .collect();
        let ast_params: Vec<ClosureParam> = params
            .iter()
            .map(|(name, name_span, _, ty_ast)| ClosureParam {
                name: name.clone(),
                name_span: ExprSpan {
                    start: *name_span,
                    end: *name_span,
                },
                type_expr: ty_ast.clone(),
            })
            .collect();
        let isolated = self.op_lookup.isolate_scopes();
        let param_table: HashMap<String, (usize, Option<cel_runtime::ValueType>)> = params
            .into_iter()
            .enumerate()
            .map(|(idx, (name, _, ty, _))| (name, (idx, ty)))
            .collect();
        self.op_lookup
            .push_scope(move |name, segment, arity, _span| {
                if arity != 0 {
                    return Ok(false);
                }
                let Some((idx, ty)) = param_table.get(name) else {
                    return Ok(false);
                };
                if let Some(ty) = ty {
                    ty.push_argument(segment, *idx)?;
                }
                Ok(true)
            });

        let body_result = self.parse_nested_context(|p| p.is_expression());
        self.op_lookup.pop_scope();
        self.op_lookup.restore_scopes(isolated);
        let body = body_result?;

        self.context
            .push_closure(param_types, ast_params, body, start_span)?;
        Ok(true)
    }

    /// `if_expression = "if" expression "{" expression "}" [ "else" ( "{" expression "}" | if_expression ) ].`
    ///
    /// - Precondition: The `if` keyword has already been consumed by the caller; `if_span` is
    ///   its span.
    ///
    /// # Errors
    ///
    /// Returns an error if the condition is missing, if a `{` or `}` delimiter is missing,
    /// if the then-branch or else-branch expression is missing, or if the then and else
    /// branch types do not match (as detected by `join2`).
    ///
    /// - Postcondition: Returns `Ok(true)` on success; `Ok(false)` is never returned.
    fn is_if_expression(&mut self, if_span: Span) -> Result<bool> {
        if !self.with_restriction(ExpressionRestriction::NoStructLiteral, |p| {
            p.is_expression()
        })? {
            return Err(self.error_at("expected condition after `if`"));
        }
        match self.peek_token() {
            Some(Token::OpenDelim {
                delimiter: Delimiter::Brace,
                ..
            }) => {
                self.advance();
            }
            _ => return Err(self.error_at("expected `{` after if condition")),
        }
        let mut then_fragment = self.context.new_fragment();
        std::mem::swap(&mut self.context, &mut then_fragment);
        if !self.is_ordinary_expression()? {
            return Err(self.error_at("expected expression in then-branch"));
        }
        std::mem::swap(&mut self.context, &mut then_fragment);
        match self.peek_token() {
            Some(Token::CloseDelim {
                delimiter: Delimiter::Brace,
                ..
            }) => {
                self.advance();
            }
            _ => return Err(self.error_at("expected `}` after then-branch")),
        }
        let else_fragment = if self.is_keyword("else") {
            if self.is_keyword("if") {
                // else if: recursively parse another if_expression
                let elif_span = self.last_span;
                let mut fragment = self.context.new_fragment();
                std::mem::swap(&mut self.context, &mut fragment);
                self.is_if_expression(elif_span)?;
                std::mem::swap(&mut self.context, &mut fragment);
                Some(fragment)
            } else {
                // else { expr }
                match self.peek_token() {
                    Some(Token::OpenDelim {
                        delimiter: Delimiter::Brace,
                        ..
                    }) => {
                        self.advance();
                    }
                    _ => return Err(self.error_at("expected `{` or `if` after `else`")),
                }
                let mut fragment = self.context.new_fragment();
                std::mem::swap(&mut self.context, &mut fragment);
                if !self.is_ordinary_expression()? {
                    return Err(self.error_at("expected expression in else-branch"));
                }
                std::mem::swap(&mut self.context, &mut fragment);
                match self.peek_token() {
                    Some(Token::CloseDelim {
                        delimiter: Delimiter::Brace,
                        ..
                    }) => {
                        self.advance();
                    }
                    _ => return Err(self.error_at("expected `}` after else-branch")),
                }
                Some(fragment)
            }
        } else {
            // No `else`/`else if` in the source — each ParserContext::join2 impl decides what
            // this means (DynSegmentContext synthesizes an implicit `()` fragment;
            // AstContext records `None` directly on Expr::If).
            None
        };
        self.context
            .join2(then_fragment, else_fragment, if_span, self.last_span)
            .map_err(|e| ParseError::new_range(e.to_string(), if_span, self.last_span))?;
        Ok(true)
    }
}

impl Parser<DynSegmentContext> {
    /// Parses one `expression` from the current token stream and returns the segment.
    ///
    /// Unlike [`parse_str`](Self::parse_str), this method does not require end-of-stream,
    /// allowing adam-lang to parse an expression embedded within a larger token stream.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid `expression`.
    ///
    /// - Complexity: O(n) in the number of tokens in the expression.
    pub fn parse_expression(&mut self) -> Result<DynSegment> {
        self.parse_expression_ctx()
            .map(DynSegmentContext::into_inner)
    }

    /// Parses one embedded expression with a header brace restriction.
    ///
    /// - Complexity: O(n) in the expression's token count.
    ///
    /// # Errors
    /// Returns syntax, type, or operation-resolution errors.
    ///
    /// # Examples
    /// See [`ExpressionRestriction`].
    pub fn parse_expression_restricted(
        &mut self,
        restriction: ExpressionRestriction,
    ) -> Result<DynSegment> {
        self.parse_expression_ctx_restricted(restriction)
            .map(DynSegmentContext::into_inner)
    }

    /// Parses one `literal_pattern` from the current token stream and returns the segment.
    ///
    /// Unlike [`parse_str`](Self::parse_str), this method does not require end-of-stream.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid `literal_pattern`.
    pub fn parse_literal_pattern(&mut self) -> Result<DynSegment> {
        self.parse_literal_pattern_ctx()
            .map(DynSegmentContext::into_inner)
    }

    /// Parses a token stream into a [`DynSegment`].
    ///
    /// Sets the token source, runs the expression grammar, and returns the segment on success.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid CEL expression.
    ///
    /// - Complexity: O(n) in the number of tokens.
    pub fn parse_tokens(&mut self, tokens: TokenStreamIter) -> Result<DynSegment> {
        self.parse_tokens_ctx(tokens)
            .map(DynSegmentContext::into_inner)
    }

    /// Parses a string into a [`DynSegment`].
    ///
    /// Tokenizes the string then parses; equivalent to
    /// `parse_tokens(TokenStream::from_str(s)?.into_iter())`.
    ///
    /// # Errors
    ///
    /// Returns an error on lex failure or if the input does not contain a valid CEL expression.
    ///
    /// - Complexity: O(n) in the length of `s`.
    pub fn parse_str(&mut self, s: &str) -> Result<DynSegment> {
        self.parse_str_ctx(s).map(DynSegmentContext::into_inner)
    }
}

impl Parser<AstContext> {
    /// Parses one `expression` from the current token stream and returns the built [`Expr`].
    ///
    /// Unlike [`parse_str_ast`](Self::parse_str_ast), this method does not require
    /// end-of-stream, allowing adam-lang to parse an expression embedded within a larger token
    /// stream.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid `expression`.
    ///
    /// - Complexity: O(n) in the number of tokens in the expression.
    pub fn parse_expression_ast(&mut self) -> Result<Expr> {
        self.parse_expression_ctx().map(AstContext::into_expr)
    }

    /// Parses a token stream into an [`Expr`] tree.
    ///
    /// Sets the token source, runs the expression grammar, and returns the tree on success.
    ///
    /// # Errors
    ///
    /// Returns an error if the input does not contain a valid CEL expression.
    ///
    /// - Complexity: O(n) in the number of tokens.
    pub fn parse_tokens_ast(&mut self, tokens: TokenStreamIter) -> Result<Expr> {
        self.parse_tokens_ctx(tokens).map(AstContext::into_expr)
    }

    /// Parses a string into an [`Expr`] tree.
    ///
    /// Tokenizes the string then parses; equivalent to
    /// `parse_tokens_ast(TokenStream::from_str(s)?.into_iter())`.
    ///
    /// # Errors
    ///
    /// Returns an error on lex failure or if the input does not contain a valid CEL expression.
    ///
    /// - Complexity: O(n) in the length of `s`.
    ///
    /// # Examples
    ///
    /// ```rust
    /// use cel_parser::{AstContext, Expr, OpLookup, Parser};
    ///
    /// let mut parser = Parser::<AstContext>::new(OpLookup::new());
    /// let expr = parser.parse_str_ast("1 + 2").unwrap();
    /// assert!(matches!(expr, Expr::Op { .. }));
    /// ```
    pub fn parse_str_ast(&mut self, s: &str) -> Result<Expr> {
        self.parse_str_ctx(s).map(AstContext::into_expr)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use annotate_snippets::Renderer;

    #[test]
    fn simple_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10");
        assert!(result.is_ok());
        assert_eq!(result.unwrap().call0::<i32>().unwrap(), 10);
    }

    #[test]
    fn parse_nested_context_compiles_an_independent_segment_without_disturbing_the_outer_one()
    -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_tokens(quote::quote! { 1 + 2 }.into_iter());
        // Start the outer expression: push a literal directly onto the (not-yet-swapped) context.
        parser
            .context
            .push_literal(100i32, proc_macro2::Span::call_site());

        let nested = parser
            .parse_nested_context(|p| p.is_or_expression())
            .map_err(|e| anyhow::anyhow!("{}", e))?;

        // The outer context still only has the one literal pushed before the nested parse.
        assert_eq!(parser.context.into_inner().call0::<i32>()?, 100);
        // The nested context has its own, independently-evaluated result.
        assert_eq!(nested.into_inner().call0::<i32>()?, 3);
        Ok(())
    }

    #[test]
    fn unbalanced_delimiter_count_is_zero_before_any_parse() {
        let parser = CELParser::new(OpLookup::new());
        assert_eq!(parser.unbalanced_delimiter_count(), 0);
    }

    #[test]
    fn unbalanced_delimiter_count_is_zero_after_a_successful_parse() {
        let mut parser = CELParser::new(OpLookup::new());
        parser.parse_str("(1 + 2)").unwrap();
        assert_eq!(parser.unbalanced_delimiter_count(), 0);
    }

    #[test]
    fn unbalanced_delimiter_count_reports_a_brace_left_dangling_by_a_failed_if_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("if true { }") {
            Err(e) => e,
            Ok(_) => panic!("an empty then-branch must fail to parse"),
        };
        assert!(err.message().contains("then-branch"));
        assert_eq!(parser.unbalanced_delimiter_count(), 1);
    }

    #[test]
    fn unbalanced_delimiter_count_reports_a_paren_left_dangling_by_a_failed_tuple_literal() {
        let mut parser = CELParser::new(OpLookup::new());
        if parser.parse_str("(+)").is_ok() {
            panic!("`+` alone cannot start an expression");
        }
        assert_eq!(parser.unbalanced_delimiter_count(), 1);
    }

    #[test]
    fn unbalanced_delimiter_count_resets_when_a_new_parse_begins() {
        let mut parser = CELParser::new(OpLookup::new());
        if parser.parse_str("(+)").is_ok() {
            panic!("`+` alone cannot start an expression");
        }
        assert_eq!(parser.unbalanced_delimiter_count(), 1);
        parser.parse_str("1 + 2").unwrap();
        assert_eq!(parser.unbalanced_delimiter_count(), 0);
    }

    #[test]
    fn integer_literal_i32_suffix() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10i32");
        assert!(result.is_ok());
        assert_eq!(result.unwrap().call0::<i32>().unwrap(), 10);
    }

    #[test]
    fn invalid_integer_suffix() {
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("10xyz") {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for invalid integer suffix"),
        };
        assert!(err.message().contains("invalid integer literal suffix"));
        assert!(err.message().contains("xyz"));
    }

    #[test]
    fn validate_literal_accepts_a_well_formed_integer() {
        let lit: lex_lexer::Literal = syn::parse_str("5i32").unwrap();
        assert!(validate_literal(&lit).is_ok());
    }

    #[test]
    fn validate_literal_accepts_a_well_formed_float() {
        let lit: lex_lexer::Literal = syn::parse_str("1.5f64").unwrap();
        assert!(validate_literal(&lit).is_ok());
    }

    #[test]
    fn validate_literal_rejects_an_unrecognized_integer_suffix() {
        let lit: lex_lexer::Literal = syn::parse_str("10xyz").unwrap();
        let err = validate_literal(&lit).expect_err("unrecognized suffix must be rejected");
        assert!(err.message().contains("invalid integer literal suffix"));
    }

    #[test]
    fn validate_literal_rejects_an_out_of_range_integer() {
        let lit: lex_lexer::Literal = syn::parse_str("999i8").unwrap();
        let err = validate_literal(&lit).expect_err("out-of-range literal must be rejected");
        assert!(err.message().contains("invalid i8 literal"));
    }

    #[test]
    fn float_literal() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("42.14");
        assert!(result.is_ok());
        let value = result.unwrap().call0::<f64>().unwrap();
        assert!((value - 42.14).abs() < 1e-10);
    }

    #[test]
    fn float_literal_f64_suffix() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("42.14f64");
        assert!(result.is_ok());
        let value = result.unwrap().call0::<f64>().unwrap();
        assert!((value - 42.14).abs() < 1e-10);
    }

    #[test]
    fn float_literal_f32_suffix() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("42.14f32");
        assert!(result.is_ok());
        let value = result.unwrap().call0::<f32>().unwrap();
        assert!((value - 42.14f32).abs() < 1e-6);
    }

    #[test]
    fn invalid_float_suffix() {
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("3.14xyz") {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for invalid float suffix"),
        };
        assert!(err.message().contains("invalid float literal suffix"));
        assert!(err.message().contains("xyz"));
    }

    #[test]
    fn boolean_literal() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("true");
        assert!(result.is_ok());
        assert!(result.unwrap().call0::<bool>().unwrap());
    }

    #[test]
    fn string_literal() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(r#""hello""#);
        assert!(result.is_ok());
        assert_eq!(result.unwrap().call0::<String>().unwrap(), "hello");
    }

    #[test]
    fn string_concatenation() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(r#""a" + "b""#);
        assert!(result.is_ok());
        assert_eq!(result.unwrap().call0::<String>().unwrap(), "ab");
    }

    #[test]
    fn incomplete_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10 + 25 25");
        let err = match result {
            Ok(_) => panic!("expected parse error"),
            Err(e) => e,
        };
        assert_eq!(err.message(), "unexpected token");
    }

    #[test]
    fn arithmetic_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10 + 20 * 30");
        assert!(result.is_ok());
    }

    #[test]
    fn parenthesized_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(10 + 20) * 30");
        assert!(result.is_ok());
    }

    #[test]
    fn unit_still_parses_as_unit() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("()").unwrap();
        seg.call0::<()>().unwrap();
    }

    #[test]
    fn single_paren_expression_is_grouping_not_tuple() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(1i32 + 2i32)").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 3);
    }

    #[test]
    fn one_tuple_requires_trailing_comma() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(1i32,)").unwrap();
        assert_eq!(seg.peek_tuple_arity(), Some(1));
        seg.tuple_index(0).unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 1);
    }

    #[test]
    fn two_element_tuple_no_trailing_comma() {
        let mut parser = CELParser::new(OpLookup::new());
        let seg: DynSegment = parser.parse_str(r#"("Hello", 42i32)"#).unwrap();
        assert_eq!(seg.peek_tuple_arity(), Some(2));
    }

    #[test]
    fn trailing_comma_rejected_for_arity_two() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32, 2i32,)");
        assert!(result.is_err(), "trailing comma is only valid for 1-tuples");
    }

    #[test]
    fn missing_comma_between_elements_is_an_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32 2i32)");
        assert!(result.is_err());
    }

    #[test]
    fn index_first_element_of_tuple() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(10i32, 20i32).0").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 10);
    }

    #[test]
    fn tuple_element_can_be_arithmetic_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(1i32 + 2i32, 3i32).0").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 3);
    }

    #[test]
    fn tuple_second_element_can_be_arithmetic_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(1i32 + 2i32, 3i32).1").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 3);
    }

    #[test]
    fn tuple_ambient_start_correct_after_sibling_expression() {
        // Regression test: a fully-evaluated sibling subexpression earlier in
        // the same additive chain must not shift where the following tuple
        // literal thinks its elements land on the real stack.
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("(1i32 + 2i32) + 3i32 + (4i32, 5i32).0")
            .unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 10);
    }

    #[test]
    fn tuple_index_inside_if_then_branch() {
        // Regression test: `join2` pops the condition bool before running
        // the chosen fragment, so a tuple literal inside that fragment must
        // compute its layout as if that pop already happened.
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("if true { (10i32, 20i32).1 } else { 0i32 }")
            .unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 20);
    }

    #[test]
    fn tuple_index_inside_if_else_branch() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("if false { 0i32 } else { (10i32, 20i32).1 }")
            .unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 20);
    }

    #[test]
    fn tuple_index_inside_and_rhs() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("(1i32, 2i32).1 == 2i32 && (10i32, 20i32).1 == 20i32")
            .unwrap();
        assert!(seg.call0::<bool>().unwrap());
    }

    #[test]
    fn tuple_index_inside_or_rhs() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("(1i32, 2i32).1 == 99i32 || (10i32, 20i32).1 == 20i32")
            .unwrap();
        assert!(seg.call0::<bool>().unwrap());
    }

    #[test]
    fn tuple_containing_indexed_nested_tuple_result() {
        // Regression test: extracting an element from a misaligned nested
        // tuple must not leave the tuple's own leading padding as dead space
        // on the stack — otherwise a later tuple literal built from this
        // result computes its element offsets against the wrong ambient
        // start and reads garbage. (7, not 1: the dead gap's own marker
        // byte is hardcoded to value 1, so a value of 1 here would pass
        // even when reading the wrong offset.)
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(0u8, (7u8, 2u64).0).1").unwrap();
        assert_eq!(seg.call0::<u8>().unwrap(), 7);
    }

    #[test]
    fn index_second_element_of_tuple() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(10i32, 20i32).1").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 20);
    }

    #[test]
    fn indexing_combined_with_addition() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("5i32 + (0i32, 1i32).1").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 6);
    }

    #[test]
    fn indexing_combined_with_addition_on_the_right() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(0i32, 1i32).1 + 5i32").unwrap();
        assert_eq!(seg.call0::<i32>().unwrap(), 6);
    }

    #[test]
    fn out_of_range_index_is_a_parse_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32, 2i32).5");
        assert!(result.is_err());
    }

    #[test]
    fn indexing_a_non_tuple_is_a_parse_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1i32.0");
        assert!(result.is_err());
    }

    #[test]
    fn suffixed_index_is_a_parse_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32, 2i32).0i32");
        assert!(result.is_err());
    }

    #[test]
    fn chained_tuple_index_into_nested_tuple() {
        // `.1` selects the inner tuple `(10i32, 20i32)`, then `.0` selects its
        // first element. Source text `.1.0` tokenizes as a single float
        // literal `1.0`, which must be split back into the chained indices
        // `1` then `0` — using a shape/value where applying the indices to
        // the wrong operand or in the wrong order gives a different (wrong)
        // answer than 10 (e.g. swapping order would try `.0` on an i32 and
        // fail to parse; picking element 0 first would return "a" or 10
        // depending on order, not confusably 10 either way, so pick values
        // that make a mix-up obvious).
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str(r#"("a", (10i32, 20i32)).1.0"#)
            .expect("chained .1.0 index should parse");
        assert_eq!(seg.call0::<i32>().unwrap(), 10);
    }

    #[test]
    fn chained_tuple_index_suffixed_second_part_is_a_parse_error() {
        // The suffix lands on the whole `0.1i32` float token; the existing
        // unsuffixed-integer rule must still reject it.
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32, 2i32).0.1i32");
        assert!(result.is_err());
    }

    #[test]
    fn chained_tuple_index_scientific_notation_is_a_parse_error_not_a_panic() {
        // `1e2` normalizes to digits with no '.' at all (scientific notation),
        // unlike ordinary decimal floats like `0.1` — must be a graceful parse
        // error, not a panic on the assumption that '.' is always present.
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("(1i32, 2i32).1e2");
        assert!(result.is_err());
    }

    #[test]
    fn complex_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10 + 20 * (30 - 5) / 2");
        assert!(result.is_ok());
    }

    #[test]
    fn logical_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("true && false || true");
        assert!(result.is_ok());
    }

    #[test]
    fn comparison_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("10 == 20 && 30 > 40");
        assert!(result.is_ok());
    }

    #[test]
    fn bitwise_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1 | 2 & 3 ^ 4");
        assert!(result.is_ok());
    }

    #[test]
    fn shift_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("8u32 << 2u32 + 16u32 >> 1u32");
        assert!(result.is_ok());
    }

    #[test]
    fn unary_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("-10 + -20");
        assert!(result.is_ok());
    }

    #[test]
    fn double_negation() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("!!true");
        assert!(
            result.is_ok(),
            "Failed to parse !!true: {}",
            result.err().unwrap()
        );
        assert!(result.unwrap().call0::<bool>().unwrap());
    }

    #[test]
    fn double_minus() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("--5");
        assert!(
            result.is_ok(),
            "Failed to parse --5: {}",
            result.err().unwrap()
        );
        assert_eq!(result.unwrap().call0::<i32>().unwrap(), 5);
    }

    #[test]
    fn chained_unary_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("!!false || !!true");
        if let Err(ref e) = result {
            eprintln!("Error: {:?}", e);
            eprintln!("Error message: {}", e.message());
        }
        assert!(result.is_ok(), "Failed to parse: {}", result.err().unwrap());
        assert!(result.unwrap().call0::<bool>().unwrap());
    }

    #[test]
    fn cast_expression_parses_and_executes() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1024i32 as f64");
        assert_eq!(result.unwrap().call0::<f64>().unwrap(), 1024.0);
    }

    #[test]
    fn cast_expression_chains_left_to_right() {
        // `x as i32 as f64` must apply left-to-right: `(x as i32) as f64`, not
        // `x as (i32 as f64)` (which isn't even expressible - a cast target is a bare
        // identifier, not another cast expression).
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1.5f64 as i32 as f64");
        assert_eq!(result.unwrap().call0::<f64>().unwrap(), 1.0);
    }

    #[test]
    fn cast_binds_tighter_than_unary_negation() {
        // `-x as u32` must parse as `(-x) as u32` (matching Rust): the negative operand hits the
        // checked int->int cast's own out-of-range check at execution, not a "no operation `-`
        // for `u32`" error at parse time, which is what parsing it as `-(x as u32)` would
        // produce instead - `u32` has no registered unary negation, matching Rust (u32 doesn't
        // implement `Neg`).
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("-1i32 as u32").expect(
            "parses: unary negation is registered for i32, and i32 -> u32 is a valid cast pair",
        );
        let err = seg.call0::<u32>().unwrap_err();
        // The cast's own error is wrapped in a `SpanContext` (see `span_err`), which becomes the
        // outermost context and so is what plain `Display`/`to_string()` shows - the underlying
        // "does not fit" message is further down the `anyhow` chain, hence `{:#}`.
        let full = format!("{err:#}");
        assert!(
            full.contains("does not fit"),
            "expected an out-of-range cast error, got: {full}"
        );
    }

    #[test]
    fn cast_binds_tighter_than_multiplicative_operators() {
        // `*` requires homogeneous operand types, so if `as` binds tighter than `*` (matching
        // Rust), this parses as `2i32 * (3i32 as f64)` - an `i32 * f64` mismatch, which this
        // grammar's eager, statically-typed segment construction rejects immediately at parse
        // time (operator/operand-type matching isn't deferred to execution, unlike a cast's own
        // value-range check). If `as` bound looser instead, this would parse as
        // `(2i32 * 3i32) as f64` and succeed.
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("2i32 * 3i32 as f64");
        assert!(result.is_err(), "expected a type-mismatch parse error");
    }

    #[test]
    fn cast_binds_tighter_than_additive_operators() {
        // Same reasoning as the multiplicative case: `1i32 + 2i32 as f64` must parse as
        // `1i32 + (2i32 as f64)` (an `i32 + f64` mismatch, a parse-time error), not
        // `(1i32 + 2i32) as f64` (which would succeed).
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1i32 + 2i32 as f64");
        assert!(result.is_err(), "expected a type-mismatch parse error");
    }

    #[test]
    fn invalid_expression() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("+");
        assert!(result.is_err());
    }

    #[test]
    fn error_formatting() {
        let source = "10 + 20 30";
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(source);

        assert!(result.is_err());

        let err = match &result {
            Ok(_) => panic!("expected parse error"),
            Err(e) => e,
        };
        assert_eq!(err.message(), "unexpected token");

        let formatted = err.format_rustc_style(source, "test.cel", 1u32, &Renderer::plain());
        assert!(formatted.contains("error: unexpected token"));
        assert!(formatted.contains("test.cel:1:"));
        assert!(formatted.contains("1 | 10 + 20 30"));
        assert!(formatted.contains("^"));
    }

    #[test]
    fn error_formatting_with_line_offset() {
        let source = "10 + 20 30";
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(source);

        assert!(result.is_err());

        let err = match &result {
            Ok(_) => panic!("expected parse error"),
            Err(e) => e,
        };
        let formatted = err.format_rustc_style(source, "large_file.rs", 42u32, &Renderer::plain());
        assert!(formatted.contains("error: unexpected token"));
        assert!(formatted.contains("large_file.rs:42:"));
        assert!(formatted.contains("42 | 10 + 20 30"));
        assert!(formatted.contains("^"));
    }

    #[test]
    fn print_error_formatting() {
        let line = line!() + 1;
        let source = r#"

         10 + 20  30 // Unexpected token

     "#;

        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(source);

        assert!(result.is_err(), "Expected parsing to fail");

        let err = match &result {
            Ok(_) => panic!("expected parse error"),
            Err(e) => e,
        };
        eprintln!(
            "DEBUG: span.start.line = {}, span.start.column = {}",
            err.span().start().line,
            err.span().start().column
        );

        let formatted_error = err.format_rustc_style(source, file!(), line, &Renderer::plain());
        println!("{}", formatted_error);

        let formatted = formatted_error;

        let expected_line = line + 2;

        assert!(
            formatted.contains("error: unexpected token"),
            "Should contain error message, got: {}",
            formatted
        );
        assert!(
            formatted.contains(&format!("{}:", expected_line)),
            "Should show error on line {}, got: {}",
            expected_line,
            formatted
        );
        assert!(
            formatted.contains("30"),
            "Should show the source line with '30', got: {}",
            formatted
        );
        assert!(
            formatted.contains("^"),
            "Should have carets pointing to error, got: {}",
            formatted
        );
    }

    #[test]
    fn test_addition_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("10 + 20")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, 30);
        Ok(())
    }

    #[test]
    fn test_multiplication_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("3 * 7")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, 21);
        Ok(())
    }

    #[test]
    fn test_complex_arithmetic_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("10 + 20 * 3")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, 70);
        Ok(())
    }

    #[test]
    fn test_parenthesized_arithmetic_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("(10 + 20) * 3")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, 90);
        Ok(())
    }

    #[test]
    fn test_comparison_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("10 < 20")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<bool>()?;
        assert!(result);
        Ok(())
    }

    #[test]
    fn test_logical_and_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("true && false")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<bool>()?;
        assert!(!result);
        Ok(())
    }

    #[test]
    fn test_unary_negation_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("-42")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, -42);
        Ok(())
    }

    #[test]
    fn test_logical_not_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("!true")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<bool>()?;
        assert!(!result);
        Ok(())
    }

    #[test]
    fn test_u32_addition_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("10u32 + 20u32")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<u32>()?;
        assert_eq!(result, 30);
        Ok(())
    }

    #[test]
    fn test_identifier_with_scope() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(|name, segment, num_operands, _span| {
            if num_operands == 0 {
                match name {
                    "x" => {
                        segment.op0(|| 10i32);
                        Ok(true)
                    }
                    "y" => {
                        segment.op0(|| 20i32);
                        Ok(true)
                    }
                    _ => Ok(false),
                }
            } else {
                Ok(false)
            }
        });
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("x + y")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<i32>()?;
        assert_eq!(result, 30);
        Ok(())
    }

    #[test]
    fn test_undefined_identifier_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("undefined_var + 10");

        assert!(result.is_err());
        if let Err(e) = result {
            let error_msg = format!("{:?}", e);
            assert!(
                error_msg.contains("undefined identifier: `undefined_var`"),
                "Error message should contain 'undefined identifier: `undefined_var`', got: {}",
                error_msg
            );
        }
    }

    #[test]
    fn test_identifier_scope_error_propagated() {
        let mut lookup = OpLookup::new();
        lookup.push_scope(|name, _segment, num_operands, _span| {
            if name == "bad_id" && num_operands == 0 {
                return Err(anyhow::anyhow!("custom identifier rejected"));
            }
            Ok(false)
        });
        let mut parser = CELParser::new(lookup);
        let err = match parser.parse_str("bad_id + 1") {
            Err(e) => e,
            Ok(_) => panic!("scope Err should propagate, not become Undefined identifier"),
        };
        assert!(
            err.message().contains("custom identifier rejected"),
            "expected scope error message, got: {}",
            err.message()
        );
        assert!(
            !err.message().contains("undefined identifier:"),
            "scope Err must not be rewritten as undefined identifier"
        );
    }

    #[test]
    fn test_undefined_identifier_error_formatting() {
        let input = "undefined_var + 10";
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str(input);

        assert!(result.is_err());
        if let Err(e) = result {
            let formatted_error = e.format_rustc_style(input, "test.cel", 1, &Renderer::plain());
            assert!(formatted_error.contains("undefined identifier"));
            assert!(formatted_error.contains("undefined_var"));
            assert!(formatted_error.contains("test.cel"));
        }
    }

    #[test]
    fn test_float_arithmetic_execution() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("3.5 * 2.0")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result = segment.call0::<f64>()?;
        assert_eq!(result, 7.0);
        Ok(())
    }

    #[test]
    fn call_empty_arg_list() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 1) => {
                    segment.op1(|_callee: i32| 99i32)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("f()")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<i32>()?, 99);
        Ok(())
    }

    #[test]
    fn call_single_arg() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 2) => {
                    segment.op2(|_callee: i32, arg: i32| arg)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("f(42)")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<i32>()?, 42);
        Ok(())
    }

    #[test]
    fn call_multiple_args() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 3) => {
                    segment.op3(|_callee: i32, arg1: i32, arg2: i32| arg1 + arg2)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("f(10, 32)")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<i32>()?, 42);
        Ok(())
    }

    #[test]
    fn call_missing_closing_paren() {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let err = match parser.parse_str("f(42 43)") {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for missing closing parenthesis"),
        };
        assert_eq!(err.message(), "expected closing parenthesis");
    }

    #[test]
    fn call_trailing_comma() {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let err = match parser.parse_str("f(42,)") {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for trailing comma"),
        };
        assert_eq!(err.message(), "expected expression after comma");
    }

    #[test]
    fn call_undefined_call_op() {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let err = match parser.parse_str("f()") {
            Err(e) => e,
            Ok(_) => panic!("expected error when () operator is not registered"),
        };
        assert!(
            err.message().starts_with("no operation"),
            "error should report no operation found, got: {}",
            err.message()
        );
    }

    #[test]
    fn call_leading_comma_reports_expected_expression_at_the_comma() {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let err = match parser.parse_str("f(,5)") {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for leading comma"),
        };
        assert_eq!(err.message(), "expected expression");
    }

    #[test]
    fn call_chained() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 1) => {
                    segment.op1(|_callee: i32| 7i32)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("f()()")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<i32>()?, 7);
        Ok(())
    }

    #[test]
    fn op_type_mismatch_error_spans_full_expression() {
        let source = r#""Hello" + 32.0"#;
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str(source) {
            Err(e) => e,
            Ok(_) => panic!("expected parse error for type mismatch"),
        };
        assert!(
            err.message().starts_with("no operation"),
            "expected 'no operation' prefix, got: {}",
            err.message()
        );
        let end_span = err.end_span().expect("op-lookup errors carry an end span");
        assert!(
            end_span.end().column >= 14,
            "end span should reach the end of 32.0 (expected end.column >= 14, got {})",
            end_span.end().column
        );
    }

    #[test]
    fn and_short_circuits_on_false() {
        // Without short-circuit the RHS executes and division-by-zero errors.
        // With short-circuit the RHS fragment is skipped, returning false directly.
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("false && (1i32 / 0i32 == 0i32)")
            .expect("should parse");
        assert!(!segment.call0::<bool>().unwrap());
    }

    #[test]
    fn and_evaluates_rhs_when_lhs_true() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser.parse_str("true && false").expect("should parse");
        assert!(!segment.call0::<bool>().unwrap());
    }

    #[test]
    fn and_chained_short_circuits() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("false && false && false")
            .expect("should parse");
        assert!(!segment.call0::<bool>().unwrap());
    }

    #[test]
    fn and_lhs_type_error() {
        // LHS is i32, not bool — join2 must reject it at parse time.
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("1i32 && true") {
            Err(e) => e,
            Ok(_) => panic!("lhs i32 should fail for &&"),
        };
        assert!(err.end_span().is_some());
    }

    #[test]
    fn or_lhs_type_error() {
        // LHS is i32, not bool — join2 must reject it at parse time.
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("1i32 || true") {
            Err(e) => e,
            Ok(_) => panic!("lhs i32 should fail for ||"),
        };
        assert!(err.end_span().is_some());
    }

    #[test]
    fn or_short_circuits_on_true() {
        // Without short-circuit the RHS executes and division-by-zero errors.
        // With short-circuit the RHS fragment is skipped, returning true directly.
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("true || (1i32 / 0i32 == 0i32)")
            .expect("should parse");
        assert!(segment.call0::<bool>().unwrap());
    }

    #[test]
    fn or_evaluates_rhs_when_lhs_false() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser.parse_str("false || true").expect("should parse");
        assert!(segment.call0::<bool>().unwrap());
    }

    #[test]
    fn or_chained() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("true || false || false")
            .expect("should parse");
        assert!(segment.call0::<bool>().unwrap());
    }

    #[test]
    fn if_true_branch_selected() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if true { 1i32 } else { 2i32 }")
            .expect("should parse");
        assert_eq!(segment.call0::<i32>().unwrap(), 1);
    }

    #[test]
    fn if_false_branch_selected() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if false { 1i32 } else { 2i32 }")
            .expect("should parse");
        assert_eq!(segment.call0::<i32>().unwrap(), 2);
    }

    #[test]
    fn if_else_if_first_branch() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if true { 1i32 } else if false { 2i32 } else { 3i32 }")
            .expect("should parse");
        assert_eq!(segment.call0::<i32>().unwrap(), 1);
    }

    #[test]
    fn if_else_if_middle_branch() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if false { 1i32 } else if true { 2i32 } else { 3i32 }")
            .expect("should parse");
        assert_eq!(segment.call0::<i32>().unwrap(), 2);
    }

    #[test]
    fn if_else_if_last_branch() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if false { 1i32 } else if false { 2i32 } else { 3i32 }")
            .expect("should parse");
        assert_eq!(segment.call0::<i32>().unwrap(), 3);
    }

    #[test]
    fn if_omitted_else_unit_branch() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser.parse_str("if true { () }").expect("should parse");
        segment.call0::<()>().expect("should execute");
    }

    #[test]
    fn if_omitted_else_rejects_non_unit_then() {
        // then-branch returns i32, implicit else returns () — types must match.
        let mut parser = CELParser::new(OpLookup::new());
        assert!(parser.parse_str("if false { 1i32 }").is_err());
    }

    #[test]
    fn if_branch_type_mismatch_is_error() {
        let mut parser = CELParser::new(OpLookup::new());
        assert!(parser.parse_str("if true { 1i32 } else { true }").is_err());
    }

    #[test]
    fn if_branch_tuple_arity_mismatch_is_error() {
        // Regression test: a flat erased tuple identity
        // marker type, so a naive type_id comparison would accept branches
        // with genuinely different tuple shapes — join2 must compare shapes,
        // not just the marker type, and reject this.
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("if false { (1i32, 2i32) } else { (3i64, 4i64, 5i64) }.0");
        assert!(
            result.is_err(),
            "branches with different tuple shapes must not be accepted"
        );
    }

    #[test]
    fn if_branch_tuple_element_type_mismatch_is_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("if false { (1i32, 2i32) } else { (3i64, 4i64) }.0");
        assert!(
            result.is_err(),
            "branches with the same arity but different element types must not be accepted"
        );
    }

    #[test]
    fn if_missing_open_brace_is_error() {
        let mut parser = CELParser::new(OpLookup::new());
        assert!(parser.parse_str("if true 1i32 } else { 2i32 }").is_err());
    }

    #[test]
    fn if_missing_else_after_brace_is_fine() {
        // Omitting else is allowed; result type must be ().
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser.parse_str("if false { () }").expect("should parse");
        segment.call0::<()>().expect("should execute");
    }

    #[test]
    fn if_trailing_else_is_error() {
        // `else` with no body is a parse error.
        let mut parser = CELParser::new(OpLookup::new());
        assert!(parser.parse_str("if true { () } else").is_err());
    }

    #[test]
    fn parse_expression_stops_before_comma() -> anyhow::Result<()> {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "10i32 + 20i32, 5i32".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let mut seg = parser
            .parse_expression()
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let result: i32 = seg.call0()?;
        assert_eq!(result, 30);
        let remaining: Vec<_> = parser.take_lex_tokens().expect("tokens present").collect();
        // The comma and "5i32" should remain unconsumed.
        assert_eq!(
            remaining.len(),
            2,
            "expected 2 remaining tokens (comma and 5i32)"
        );
        Ok(())
    }

    #[test]
    fn parse_expression_on_empty_input_returns_error() {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let result = parser.parse_expression();
        assert!(result.is_err(), "expected Err for empty input");
    }

    #[test]
    fn parse_literal_pattern_accepts_a_bare_literal() -> anyhow::Result<()> {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "5i32".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let mut seg = parser
            .parse_literal_pattern()
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(seg.call0::<i32>()?, 5);
        Ok(())
    }

    #[test]
    fn parse_literal_pattern_accepts_a_negated_integer_literal() -> anyhow::Result<()> {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "-5i32".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let mut seg = parser
            .parse_literal_pattern()
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(seg.call0::<i32>()?, -5);
        Ok(())
    }

    #[test]
    fn parse_literal_pattern_accepts_a_negated_float_literal() -> anyhow::Result<()> {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "-1.5f64".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let mut seg = parser
            .parse_literal_pattern()
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(seg.call0::<f64>()?, -1.5);
        Ok(())
    }

    #[test]
    fn parse_literal_pattern_stops_before_a_trailing_operator() -> anyhow::Result<()> {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "1i32 + 2i32".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        let mut seg = parser
            .parse_literal_pattern()
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(seg.call0::<i32>()?, 1);
        let remaining: Vec<_> = parser.take_lex_tokens().expect("tokens present").collect();
        assert_eq!(
            remaining.len(),
            2,
            "expected 2 remaining tokens (+ and 2i32)"
        );
        Ok(())
    }

    #[test]
    fn parse_literal_pattern_rejects_a_dash_not_followed_by_a_literal() {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "-mode".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        assert!(parser.parse_literal_pattern().is_err());
    }

    #[test]
    fn parse_literal_pattern_rejects_negating_an_unsigned_literal() {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "-1u32".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        assert!(parser.parse_literal_pattern().is_err());
    }

    #[test]
    fn parse_literal_pattern_rejects_a_bare_identifier() {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "mode".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        assert!(parser.parse_literal_pattern().is_err());
    }

    #[test]
    fn parse_literal_pattern_rejects_a_tuple() {
        use lex_lexer::LexLexer;
        let stream: proc_macro2::TokenStream = "(1i32, 2i32)".parse().unwrap();
        let mut parser = CELParser::new(OpLookup::new());
        parser.set_lex_tokens(LexLexer::new(stream.into_iter()).peekable());
        assert!(parser.parse_literal_pattern().is_err());
    }

    #[test]
    fn closure_literal_with_one_param_compiles_and_calls() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|x: i32| x + 1")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        let x = 5i32;
        assert_eq!(closure.call::<i32>(&[&x])?, 6);
        Ok(())
    }

    #[test]
    fn closure_literal_with_zero_params_compiles_and_calls() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|| 42")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        assert_eq!(closure.call::<i32>(&[])?, 42);
        Ok(())
    }

    #[test]
    fn closure_literal_with_two_params_compiles_and_calls_in_order() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|a: i32, b: i32| a - b")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        let (a, b) = (10i32, 3i32);
        assert_eq!(closure.call::<i32>(&[&a, &b])?, 7);
        Ok(())
    }

    #[test]
    fn closure_literal_with_tuple_typed_param_compiles_and_calls() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|r: (i32, i32)| r.0 + r.1")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;

        // Borrow a canonical whole-value owner at the checked closure boundary.
        let mut pair = DynSegment::new::<()>();
        let ambient_start = pair.current_stack_offset();
        pair.just(10i32);
        pair.annotate_top(crate::op_table::builtin_value_type(TypeId::of::<i32>()).unwrap())?;
        pair.just(20i32);
        pair.annotate_top(crate::op_table::builtin_value_type(TypeId::of::<i32>()).unwrap())?;
        pair.make_tuple(2, ambient_start)?;
        let pair = pair.call_dyn_value(&[])?;

        assert_eq!(closure.call::<i32>(&[&pair])?, 30);
        Ok(())
    }

    #[test]
    fn closure_param_accepts_a_builtin_generic_type() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|r: RangeInclusive(f64)| r")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        let range = 1.0f64..=2.0f64;
        assert_eq!(
            closure.call::<std::ops::RangeInclusive<f64>>(&[&range])?,
            1.0..=2.0
        );
        Ok(())
    }

    #[test]
    fn closure_param_accepts_an_array_type() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser.parse_str("(|xs: [i32]| xs)([1, 2])").unwrap();
        let array = segment
            .call0::<cel_runtime::OwnedValue>()
            .unwrap()
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()
            .unwrap();
        assert_eq!(array.as_slice(), &[1, 2]);
    }

    #[test]
    fn closure_body_referencing_an_undeclared_name_is_a_parse_error() {
        let mut parser = CELParser::new(OpLookup::new());
        let err = parser.parse_str("|x: i32| x + y");
        assert!(err.is_err());
    }

    #[test]
    fn nested_closure_referencing_only_its_own_param_compiles_and_calls() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        // The outer closure's own parameter `x` must NOT be visible inside the inner closure
        // body — a bare nested closure literal parses fine directly as the outer body's
        // `expression`, with no extra block grouping needed (this grammar has no bare
        // block-expression production, only `if`'s own braces, so `{ ... }` grouping isn't an
        // option here anyway).
        let mut segment = parser
            .parse_str("|x: i32| |y: i32| y + 1")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let outer: cel_runtime::DynClosure = segment.call0()?;
        let x = 0i32;
        let inner: cel_runtime::DynClosure = outer.call(&[&x])?;
        let y = 41i32;
        assert_eq!(inner.call::<i32>(&[&y])?, 42);
        Ok(())
    }

    #[test]
    fn closure_body_cannot_see_an_enclosing_scopes_names() {
        // A scope pushed before parsing (standing in for e.g. adam-lang's own cell-name scope)
        // must not leak into a closure body's name resolution.
        let mut lookup = OpLookup::new();
        lookup.push_scope(|name, segment, arity, _span| {
            if name == "outer_only" && arity == 0 {
                segment.just(1i32);
                Ok(true)
            } else {
                Ok(false)
            }
        });
        let mut parser = CELParser::new(lookup);
        let err = parser.parse_str("|x: i32| x + outer_only");
        assert!(err.is_err());
    }

    #[test]
    fn ast_context_parses_a_one_param_closure() {
        let mut parser = Parser::<AstContext>::new(OpLookup::new());
        let expr = parser.parse_str_ast("|x: i32| x").unwrap();
        let Expr::Closure { params, body, .. } = expr else {
            panic!("expected Closure");
        };
        assert_eq!(params.len(), 1);
        assert_eq!(params[0].name, "x");
        assert!(matches!(
            &params[0].type_expr,
            TypeExpr::Named { name, args, .. } if name == "i32" && args.is_empty()
        ));
        assert!(matches!(*body, Expr::Ident { ref name, .. } if name == "x"));
    }

    #[test]
    fn ast_context_parses_a_zero_param_closure() {
        let mut parser = Parser::<AstContext>::new(OpLookup::new());
        let expr = parser.parse_str_ast("|| 1i32").unwrap();
        let Expr::Closure { params, .. } = expr else {
            panic!("expected Closure");
        };
        assert!(params.is_empty());
    }

    #[test]
    fn ast_context_parses_a_tuple_typed_closure_param() {
        let mut parser = Parser::<AstContext>::new(OpLookup::new());
        let expr = parser.parse_str_ast("|x: (i32, f64)| x.0").unwrap();
        let Expr::Closure { params, .. } = expr else {
            panic!("expected Closure");
        };
        match &params[0].type_expr {
            TypeExpr::Tuple { elements, .. } => assert_eq!(elements.len(), 2),
            other => panic!("expected Tuple, got {other:?}"),
        }
    }

    #[test]
    fn range_expression_constructs_a_range() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("1i32..5i32").unwrap();
        assert_eq!(seg.call0::<std::ops::Range<i32>>().unwrap(), 1i32..5i32);
    }

    #[test]
    fn range_inclusive_expression_constructs_a_range_inclusive() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("1i32..=5i32").unwrap();
        assert_eq!(
            seg.call0::<std::ops::RangeInclusive<i32>>().unwrap(),
            1i32..=5i32
        );
    }

    #[test]
    fn range_from_expression_constructs_a_range_from() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("3i32..").unwrap();
        assert_eq!(seg.call0::<std::ops::RangeFrom<i32>>().unwrap(), 3i32..);
    }

    #[test]
    fn range_to_expression_constructs_a_range_to() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("..7i32").unwrap();
        assert_eq!(seg.call0::<std::ops::RangeTo<i32>>().unwrap(), ..7i32);
    }

    #[test]
    fn range_to_inclusive_expression_constructs_a_range_to_inclusive() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("..=7i32").unwrap();
        assert_eq!(
            seg.call0::<std::ops::RangeToInclusive<i32>>().unwrap(),
            ..=7i32
        );
    }

    #[test]
    fn range_full_expression_constructs_a_range_full() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("..").unwrap();
        seg.call0::<std::ops::RangeFull>().unwrap();
    }

    #[test]
    fn range_endpoints_are_full_or_expressions() {
        // `1 + 2..3 * 4` must group as `(1 + 2)..(3 * 4)`, matching Rust's own precedence
        // (range binds looser than every arithmetic/bitwise operator).
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("1i32 + 2i32..3i32 * 4i32").unwrap();
        assert_eq!(seg.call0::<std::ops::Range<i32>>().unwrap(), 3i32..12i32);
    }

    #[test]
    fn chained_ranges_are_a_parse_error() {
        // Ranges don't chain, matching Rust (`1..2..3` is also a compile error there). No
        // special "non-chainable" check is needed in `is_range_expression` itself: after
        // parsing `1..2`, the leftover `..3` fails `parse_tokens_ctx`'s end-of-stream check
        // the same way `"10 + 25 25"` already does (see `incomplete_expression`).
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("1i32..2i32..3i32");
        assert!(result.is_err(), "expected a parse error, got Ok");
    }

    #[test]
    fn range_to_inclusive_without_a_right_operand_is_a_parse_error() {
        // `..=` always requires a right endpoint — there is no inclusive-from-only range.
        let mut parser = CELParser::new(OpLookup::new());
        let result = parser.parse_str("..=");
        assert!(result.is_err(), "expected a parse error, got Ok");
    }

    #[test]
    fn range_endpoint_absorbs_a_trailing_comparison_confirming_or_expression_operands() {
        // Confirms range operands are `or_expression`, not `bitwise_or_expression`: in
        // `1i32..5i32 == true`, `5i32 == true` must group together as the range's right
        // endpoint's own `or_expression` and fail *there* (`i32` vs `bool`) — proving the
        // endpoint absorbed the whole comparison, rather than `..` grabbing only `5i32` and
        // `==` applying afterward to an already-built `Range`.
        let mut parser = CELParser::new(OpLookup::new());
        let err = match parser.parse_str("1i32..5i32 == true") {
            Err(e) => e,
            Ok(_) => panic!("expected a parse error"),
        };
        let message = err.message();
        assert!(
            message.starts_with("no operation `==`"),
            "expected a 'no operation `==`' error, got: {message}"
        );
        assert!(
            !message.contains("Range"),
            "expected the error to be about `i32`/`bool` (the inner endpoint's own comparison), \
             not `Range<i32>` (which would mean `..` grabbed only `5i32` and `==` applied afterward \
             to an already-built range) — got: {message}"
        );
    }

    #[test]
    fn parameter_list_accepts_a_range_expression() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 2) => {
                    segment.op2(|_callee: i32, arg: std::ops::Range<i32>| arg)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("f(1i32..5i32)")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<std::ops::Range<i32>>()?, 1i32..5i32);
        Ok(())
    }

    #[test]
    fn tuple_or_group_accepts_a_range_expression() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser.parse_str("(1i32..5i32)").unwrap();
        assert_eq!(seg.call0::<std::ops::Range<i32>>().unwrap(), 1i32..5i32);
        Ok(())
    }

    #[test]
    fn if_expression_branches_accept_range_expressions() {
        let mut parser = CELParser::new(OpLookup::new());
        let mut seg = parser
            .parse_str("if true { 1i32..5i32 } else { 2i32..6i32 }")
            .unwrap();
        assert_eq!(seg.call0::<std::ops::Range<i32>>().unwrap(), 1i32..5i32);
    }

    #[test]
    fn closure_body_accepts_a_range_expression() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|| 1i32..5i32")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        assert_eq!(closure.call::<std::ops::Range<i32>>(&[])?, 1i32..5i32);
        Ok(())
    }

    /// Returns the [`ParseError`] the runtime-executing parser must produce for `source`.
    fn array_parse_error(source: &str) -> ParseError {
        let mut parser = CELParser::new(OpLookup::new());
        match parser.parse_str(source) {
            Err(e) => e,
            Ok(_) => panic!("expected a parse error for `{source}`"),
        }
    }

    #[test]
    fn array_literal_evaluates_to_its_elements_in_source_order() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[0i32, 1i32, 2i32]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![0, 1, 2]);
        Ok(())
    }

    #[test]
    fn typed_array_annotation_preserves_unsuffixed_non_empty_inference() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[0, 1]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![0, 1]);
        Ok(())
    }

    #[test]
    fn typed_array_annotation_evaluates_to_the_declared_scalar_type() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[0, 1]: [i32]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![0, 1]);
        Ok(())
    }

    #[test]
    fn typed_array_annotation_evaluates_to_the_declared_f64_type() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[1.0, 42.5]: [f64]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<f64>>>()?;
        assert_eq!(array.into_vec(), vec![1.0, 42.5]);
        Ok(())
    }

    #[test]
    fn typed_array_annotation_constructs_a_typed_empty_array() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[]: [i32]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert!(array.into_vec().is_empty());
        Ok(())
    }

    #[test]
    fn typed_array_annotation_constructs_a_nested_typed_empty_array() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[]: [[i32]]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>>(
            )?;
        assert!(array.into_vec().is_empty());
        Ok(())
    }

    #[test]
    fn single_element_array_literal_needs_no_trailing_comma() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[7i32]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![7]);
        Ok(())
    }

    #[test]
    fn array_elements_can_be_arbitrary_expressions() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[1i32 + 2i32, if true { 4i32 } else { 5i32 }]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![3, 4]);
        Ok(())
    }

    #[test]
    fn empty_array_literal_is_rejected_with_a_dedicated_diagnostic() {
        let err = array_parse_error("[]");
        assert!(
            err.message().contains("empty array"),
            "got: {}",
            err.message()
        );
        assert!(
            err.message().contains("issues/212"),
            "the diagnostic must reference the contextual-typing issue, got: {}",
            err.message()
        );
    }

    #[test]
    fn array_literal_rejects_a_trailing_comma() {
        let err = array_parse_error("[0i32,]");
        assert!(
            err.message().contains("expected expression after ','"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn array_literal_requires_a_comma_between_elements() {
        let err = array_parse_error("[0i32 1i32]");
        assert!(
            err.message().contains("expected ',' or closing ']'"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn array_literal_rejects_a_mismatched_element_naming_its_index() {
        let err = array_parse_error("[0i32, 1.0f64]");
        assert!(
            err.message().contains("array element 1"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn array_literal_accepts_a_tuple_element() {
        use cel_runtime::{ArrayOf, Cons, Leaf, Nil};
        let body = CELParser::new(OpLookup::new())
            .parse_str("[(0i32, 1i32)]")
            .unwrap();
        assert!(
            body.prepare::<Nil, ArrayOf<Cons<Leaf<i32>, Cons<Leaf<i32>, Nil>>>>()
                .is_ok()
        );
    }

    #[test]
    fn nested_array_literal_evaluates_to_an_array_of_arrays() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("[[0i32], [1i32]]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>>(
            )?;
        let inner = array.into_vec();
        assert_eq!(inner.len(), 2);
        let mut values = Vec::new();
        for element in inner {
            values.extend(element.into_vec());
        }
        assert_eq!(values, vec![0, 1]);
        Ok(())
    }

    #[test]
    fn nested_array_literal_rejects_a_recursive_element_mismatch() {
        let err = array_parse_error("[[0i32], [1.0f64]]");
        assert!(
            err.message().contains("array element 1"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn nested_array_literal_rejects_a_depth_mismatch() {
        let err = array_parse_error("[[0i32], [[1i32]]]");
        assert!(
            err.message().contains("array element 1"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn typed_array_annotation_rejects_an_exact_element_type_mismatch() {
        let err = array_parse_error("[0, 1]: [f64]");
        assert!(
            err.message().contains("expected f64"),
            "got: {}",
            err.message()
        );
        assert!(err.message().contains("type i32"), "got: {}", err.message());
    }

    #[test]
    fn typed_array_annotation_rejects_a_recursive_element_type_mismatch() {
        // The annotation's mismatch is one level below the outer array: the values are nested
        // `i32` arrays, the annotation names nested `f64` arrays.
        let err = array_parse_error("[[0, 1]]: [[f64]]");
        assert!(
            err.message().contains("expected [f64]"),
            "got: {}",
            err.message()
        );
        assert!(
            err.message().contains("type [i32]"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn typed_array_annotation_mismatch_names_the_registered_type_not_its_rust_path() {
        let resolver = [(
            "Celsius",
            ResolvedLeafType::new("Celsius", cel_runtime::ValueType::leaf::<Celsius>()),
        )];
        let mut parser = CELParser::with_type_resolver(OpLookup::new(), resolver);
        let err = match parser.parse_str("[0]: [Celsius]") {
            Err(e) => e,
            Ok(_) => panic!("expected `[0]: [Celsius]` to reject its `i32` element"),
        };
        assert!(
            err.message().contains("expected Celsius"),
            "the registered annotation name must survive into the diagnostic, got: {}",
            err.message()
        );
        assert!(
            !err.message().contains("::"),
            "no Rust type path may leak into the diagnostic, got: {}",
            err.message()
        );
    }

    /// The runtime rejects a nested literal whose own annotation names a different custom element
    /// type — the mismatch `ty::check_expr` must also report statically.
    #[test]
    fn typed_array_annotation_rejects_a_nested_custom_element_type_mismatch() {
        #[derive(Clone)]
        struct CustomB;

        let resolver = [
            (
                "Celsius",
                ResolvedLeafType::new("Celsius", cel_runtime::ValueType::leaf::<Celsius>()),
            ),
            (
                "CustomB",
                ResolvedLeafType::new("CustomB", cel_runtime::ValueType::leaf::<CustomB>()),
            ),
        ];
        let mut parser = CELParser::with_type_resolver(OpLookup::new(), resolver);
        let err = match parser.parse_str("[[]: [Celsius]]: [[CustomB]]") {
            Err(e) => e,
            Ok(_) => panic!("expected the inner annotation to conflict with the outer one"),
        };
        assert!(
            err.message().contains("expected [CustomB]"),
            "got: {}",
            err.message()
        );
        assert!(
            err.message().contains("[Celsius]"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn typed_array_annotation_rejects_an_unknown_type_name() {
        let err = array_parse_error("[0]: [Nope]");
        assert!(
            err.message().contains("unknown type `Nope`"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn typed_array_annotation_requires_a_complete_array_type() {
        let err = array_parse_error("[0]: i32");
        assert!(
            err.message()
                .contains("array annotations must name a complete array type"),
            "got: {}",
            err.message()
        );
    }

    #[test]
    fn typed_array_annotation_accepts_tuple_array_elements() {
        use cel_runtime::{ArrayOf, Cons, Leaf, Nil};
        let body = CELParser::new(OpLookup::new())
            .parse_str("[]: [(i32, f64)]")
            .unwrap();
        assert!(
            body.prepare::<Nil, ArrayOf<Cons<Leaf<i32>, Cons<Leaf<f64>, Nil>>>>()
                .is_ok()
        );
    }

    #[test]
    fn array_literal_is_accepted_as_a_call_argument() -> anyhow::Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            |name, segment, num_operands, _span| match (name, num_operands) {
                ("len", 0) => {
                    segment.op0(|| 0i32);
                    Ok(true)
                }
                ("()", 2) => {
                    segment.op2_repr::<cel_runtime::Leaf<i32>, cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>, cel_runtime::Leaf<i32>, _>(
                        |_callee, arg| arg.len() as i32)?;
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        let mut parser = CELParser::new(lookup);
        let mut segment = parser
            .parse_str("len([1i32, 2i32, 3i32])")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        assert_eq!(segment.call0::<i32>()?, 3);
        Ok(())
    }

    #[test]
    fn array_literal_is_accepted_as_a_tuple_element() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("([1i32, 2i32], 3i32).0")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![1, 2]);
        Ok(())
    }

    #[test]
    fn array_literal_is_accepted_inside_an_if_branch() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("if true { [1i32, 2i32] } else { [3i32, 4i32] }")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![1, 2]);
        Ok(())
    }

    #[test]
    fn array_literal_is_accepted_as_a_closure_body() -> anyhow::Result<()> {
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("|x: i32| [x, x]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let closure: cel_runtime::DynClosure = segment.call0()?;
        let x = 5i32;
        let array = closure
            .call::<cel_runtime::OwnedValue>(&[&x])?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![5, 5]);
        Ok(())
    }

    #[test]
    fn array_ambient_start_is_correct_after_a_sibling_expression() -> anyhow::Result<()> {
        // Regression guard mirroring `tuple_ambient_start_correct_after_sibling_expression`: the
        // array literal is deliberately *not* the first sub-expression, and its sibling has a
        // different alignment than its element type. The `u8` sum is pushed first (offset 0,
        // align 1), so the `i32` elements start at a nonzero offset that is only correct if the
        // ambient start is both threaded through from the sibling and padded up to `i32`'s
        // alignment.
        let mut parser = CELParser::new(OpLookup::new());
        let mut segment = parser
            .parse_str("(1u8 + 2u8, [3i32, 4i32]).1")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<i32>>>()?;
        assert_eq!(array.into_vec(), vec![3, 4]);
        Ok(())
    }

    /// A custom element type implementing no trait beyond `'static` — not `Copy`, `Clone`,
    /// `Debug`, or `PartialEq` — so an array of it exercises the minimum element bound.
    struct Celsius(i32);

    /// A second custom element type, distinct from [`Celsius`], so one call in an otherwise
    /// homogeneous literal can return a different type.
    struct Fahrenheit(i32);

    /// The unapplied nullary function `f`.
    struct FName;

    /// The unapplied nullary function `g`.
    struct GName;

    /// The unapplied nullary function `h`.
    struct HName;

    /// Returns an [`OpLookup`] resolving the nullary calls `f()`, `g()`, and `h()`, where `f`
    /// and `g` return [`Celsius`] values and `h` returns a [`Celsius`] when `homogeneous` and a
    /// [`Fahrenheit`] otherwise.
    fn temperature_lookup(homogeneous: bool) -> OpLookup {
        let mut lookup = OpLookup::new();
        lookup.push_scope(
            move |name, segment, num_operands, _span| match (name, num_operands) {
                ("f", 0) => {
                    segment.op0(|| FName);
                    Ok(true)
                }
                ("g", 0) => {
                    segment.op0(|| GName);
                    Ok(true)
                }
                ("h", 0) => {
                    segment.op0(|| HName);
                    Ok(true)
                }
                ("()", 1) => {
                    let Some(callee) = segment
                        .peek_stack_infos(1)
                        .first()
                        .map(|i| i.value_type.type_id())
                    else {
                        return Ok(false);
                    };
                    if callee == TypeId::of::<FName>() {
                        segment.op1(|_: FName| Celsius(0))?;
                    } else if callee == TypeId::of::<GName>() {
                        segment.op1(|_: GName| Celsius(1))?;
                    } else if callee == TypeId::of::<HName>() {
                        if homogeneous {
                            segment.op1(|_: HName| Celsius(2))?;
                        } else {
                            segment.op1(|_: HName| Fahrenheit(2))?;
                        }
                    } else {
                        return Ok(false);
                    }
                    Ok(true)
                }
                _ => Ok(false),
            },
        );
        lookup
    }

    #[test]
    fn array_literal_of_calls_returning_a_custom_type_converts_to_its_vector() -> anyhow::Result<()>
    {
        let mut parser = CELParser::new(temperature_lookup(true));
        let mut segment = parser
            .parse_str("[f(), g(), h()]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<Celsius>>>()?;
        let degrees: Vec<i32> = array.into_vec().into_iter().map(|c| c.0).collect();
        assert_eq!(degrees, vec![0, 1, 2]);
        Ok(())
    }

    #[test]
    fn array_literal_of_one_custom_typed_call_evaluates_to_that_type() -> anyhow::Result<()> {
        // The same registration the mismatch test below uses: `h` alone is a perfectly good
        // array element, so that test's failure is about element homogeneity, not about `h`.
        let mut parser = CELParser::new(temperature_lookup(false));
        let mut segment = parser
            .parse_str("[h()]")
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment
            .call0::<cel_runtime::OwnedValue>()?
            .try_into_typed::<cel_runtime::ArrayOf<cel_runtime::Leaf<Fahrenheit>>>()?;
        let degrees: Vec<i32> = array.into_vec().into_iter().map(|f| f.0).collect();
        assert_eq!(degrees, vec![2]);
        Ok(())
    }

    #[test]
    fn array_literal_of_calls_rejects_a_mismatched_return_type_before_execution() {
        // `parse_str` compiles the literal, so a mismatch is reported here — the segment is
        // never built and therefore never executed.
        let mut parser = CELParser::new(temperature_lookup(false));
        let err = match parser.parse_str("[f(), g(), h()]") {
            Err(e) => e,
            Ok(_) => panic!("expected `[f(), g(), h()]` with a mismatched `h` to fail"),
        };
        let message = err.message();
        assert!(message.contains("array element 2"), "got: {message}");
        assert!(message.contains("Fahrenheit"), "got: {message}");
        assert!(message.contains("Celsius"), "got: {message}");
    }

    #[test]
    fn static_check_and_execution_agree_on_a_nested_custom_typed_array() -> anyhow::Result<()> {
        const SOURCE: &str = "[[f(), g()], [h()]]";

        // The static checker sees only the AST, where `Celsius` — a host-registered type with no
        // `Ty` variant — infers as `Ty::Any`, so the literal infers as an array of arrays of it:
        // an under-approximation of the runtime type, reported without diagnostics.
        let mut ast_parser = Parser::<AstContext>::new(OpLookup::new());
        let expr = ast_parser
            .parse_str_ast(SOURCE)
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let (ty, diagnostics) = ty::check_expr(&expr, &|_name| Ty::Any);
        let messages: Vec<String> = diagnostics
            .iter()
            .map(|d| d.message().to_string())
            .collect();
        assert!(messages.is_empty(), "unexpected diagnostics: {messages:?}");
        assert_eq!(ty, Ty::Array(Box::new(Ty::Array(Box::new(Ty::Any)))));

        // The same source, compiled and executed, produces the value the checker accepted.
        let mut parser = CELParser::new(temperature_lookup(true));
        let mut segment = parser
            .parse_str(SOURCE)
            .map_err(|e| anyhow::anyhow!("{}", e))?;
        let array = segment.call0::<cel_runtime::OwnedValue>()?.try_into_typed::<cel_runtime::ArrayOf<cel_runtime::ArrayOf<cel_runtime::Leaf<Celsius>>>>()?;
        let mut rows: Vec<Vec<i32>> = Vec::new();
        for row in array.into_vec() {
            rows.push(row.into_vec().into_iter().map(|c| c.0).collect());
        }
        assert_eq!(rows, vec![vec![0, 1], vec![2]]);
        Ok(())
    }
}

#[cfg(test)]
mod playground {
    use super::*;
    use annotate_snippets::Renderer;

    #[test]
    fn custom_scope_identifier() -> Result<()> {
        let mut lookup = OpLookup::new();
        lookup.push_scope(|name, segment, _num_operands, _span| {
            if name == "constant" {
                segment.just(42i64);
                return Ok(true);
            }
            Ok(false)
        });
        let mut parser = CELParser::new(lookup);
        let line = line!() + 1;
        let source = r#"
            (("hello" + " world") == constant) && (15i64 < constant)
        "#;
        match parser.parse_str(source) {
            Ok(mut seg) => println!("{:?}", seg.call0::<bool>()),
            Err(e) => println!(
                "{}",
                e.format_rustc_style(source, file!(), line, &Renderer::styled())
            ),
        }
        Ok(())
    }
    #[test]
    fn literal_types() {
        use CELParser;
        use op_table::OpLookup;
        let source = r#"
            b'a'
        "#;
        println!(
            "{:?}",
            CELParser::new(OpLookup::new())
                .parse_str(source)
                .unwrap()
                .call0::<u8>()
        )
    }

    #[test]
    fn expression_macro_error3() {
        use CELParser;
        use op_table::OpLookup;

        let line = line!() + 1;
        let source = r#"
            "Hello" + "World" + 32.0
        "#;
        match CELParser::new(OpLookup::new()).parse_str(source) {
            Ok(_) => panic!("expected parse error"),
            Err(e) => println!(
                "{}",
                e.format_rustc_style(source, file!(), line, &Renderer::styled())
            ),
        }
    }

    #[test]
    fn arithmetic_overflow_error() {
        use error::FormatRustcStyle;

        let line = line!() + 1;
        let source = r#"
           1 + 1 +
                2147483646 + 1
        "#;
        let mut seg = CELParser::new(OpLookup::new())
            .parse_str(source)
            .expect("parses successfully");
        match seg.call0::<i32>() {
            Ok(v) => panic!("expected overflow, got {v}"),
            Err(e) => println!(
                "{}",
                e.format_rustc_style(source, file!(), line, &Renderer::styled())
            ),
        }
    }
}