reifydb_rql/expression/

mod.rs

// SPDX-License-Identifier: Apache-2.0
// Copyright (c) 2025 ReifyDB

pub mod fragment;
pub mod join;
pub mod json;
pub mod name;

use crate::{
	ast,
	ast::{
		ast::{Ast, AstInfix, AstLiteral, InfixOperator},
		parse_str,
	},
	bump::{Bump, BumpBox},
	convert_data_type,
};

pub fn parse_expression(rql: &str) -> Result<Vec<Expression>> {
	let bump = Bump::new();
	let statements = parse_str(&bump, rql)?;
	if statements.is_empty() {
		return Ok(vec![]);
	}

	let mut result = Vec::new();
	for statement in statements {
		for ast in statement.nodes {
			result.push(ExpressionCompiler::compile(ast)?);
		}
	}

	Ok(result)
}

use std::{
	fmt,
	fmt::{Display, Formatter},
	str::FromStr,
	sync::Arc,
};

use ast::ast::AstMatchArm;
use reifydb_core::interface::identifier::{ColumnIdentifier, ColumnPrimitive};
use reifydb_type::{
	err,
	error::Diagnostic,
	fragment::Fragment,
	value::{row_number::ROW_NUMBER_COLUMN_NAME, r#type::Type},
};
use serde::{Deserialize, Serialize};

use crate::{Result, ast::ast::AstBlock, diagnostic::AstError};

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct AliasExpression {
	pub alias: IdentExpression,
	pub expression: Box<Expression>,
	pub fragment: Fragment,
}

impl Display for AliasExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		Display::fmt(&self.alias, f)
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub enum Expression {
	AccessSource(AccessPrimitiveExpression),

	Alias(AliasExpression),

	Cast(CastExpression),

	Constant(ConstantExpression),

	Column(ColumnExpression),

	Add(AddExpression),

	Div(DivExpression),

	Call(CallExpression),

	Rem(RemExpression),

	Mul(MulExpression),

	Sub(SubExpression),

	Tuple(TupleExpression),

	List(ListExpression),

	Prefix(PrefixExpression),

	GreaterThan(GreaterThanExpression),

	GreaterThanEqual(GreaterThanEqExpression),

	LessThan(LessThanExpression),

	LessThanEqual(LessThanEqExpression),

	Equal(EqExpression),

	NotEqual(NotEqExpression),

	Between(BetweenExpression),

	And(AndExpression),

	Or(OrExpression),

	Xor(XorExpression),

	In(InExpression),

	Contains(ContainsExpression),

	Type(TypeExpression),

	Parameter(ParameterExpression),
	Variable(VariableExpression),

	If(IfExpression),
	Map(MapExpression),
	Extend(ExtendExpression),
	SumTypeConstructor(SumTypeConstructorExpression),
	IsVariant(IsVariantExpression),
	FieldAccess(FieldAccessExpression),
}

#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct AccessPrimitiveExpression {
	pub column: ColumnIdentifier,
}

impl AccessPrimitiveExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		// For backward compatibility, merge primitive and column fragments
		match &self.column.primitive {
			ColumnPrimitive::Primitive {
				primitive,
				..
			} => Fragment::merge_all([primitive.clone(), self.column.name.clone()]),
			ColumnPrimitive::Alias(alias) => Fragment::merge_all([alias.clone(), self.column.name.clone()]),
		}
	}
}

#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub enum ConstantExpression {
	None {
		fragment: Fragment,
	},
	Bool {
		fragment: Fragment,
	},
	// any number
	Number {
		fragment: Fragment,
	},
	// any textual representation can be String, Text, ...
	Text {
		fragment: Fragment,
	},
	// any temporal representation can be Date, Time, DateTime, ...
	Temporal {
		fragment: Fragment,
	},
}

impl Display for ConstantExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		match self {
			ConstantExpression::None {
				..
			} => write!(f, "none"),
			ConstantExpression::Bool {
				fragment,
			} => write!(f, "{}", fragment.text()),
			ConstantExpression::Number {
				fragment,
			} => write!(f, "{}", fragment.text()),
			ConstantExpression::Text {
				fragment,
			} => write!(f, "\"{}\"", fragment.text()),
			ConstantExpression::Temporal {
				fragment,
			} => write!(f, "{}", fragment.text()),
		}
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct CastExpression {
	pub fragment: Fragment,
	pub expression: Box<Expression>,
	pub to: TypeExpression,
}

impl CastExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.fragment.clone(),
			self.expression.full_fragment_owned(),
			self.to.full_fragment_owned(),
		])
	}

	pub fn lazy_fragment(&self) -> impl Fn() -> Fragment {
		move || self.full_fragment_owned()
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct TypeExpression {
	pub fragment: Fragment,
	pub ty: Type,
}

impl TypeExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		self.fragment.clone()
	}

	pub fn lazy_fragment(&self) -> impl Fn() -> Fragment {
		move || self.full_fragment_owned()
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct AddExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct DivExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct SubExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct RemExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct MulExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct GreaterThanExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl GreaterThanExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct GreaterThanEqExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl GreaterThanEqExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct LessThanExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl LessThanExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct LessThanEqExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl LessThanEqExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct EqExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl EqExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct NotEqExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl NotEqExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct BetweenExpression {
	pub value: Box<Expression>,
	pub lower: Box<Expression>,
	pub upper: Box<Expression>,
	pub fragment: Fragment,
}

impl BetweenExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.value.full_fragment_owned(),
			self.fragment.clone(),
			self.lower.full_fragment_owned(),
			self.upper.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct AndExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl AndExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct OrExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl OrExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct XorExpression {
	pub left: Box<Expression>,
	pub right: Box<Expression>,
	pub fragment: Fragment,
}

impl XorExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.left.full_fragment_owned(),
			self.fragment.clone(),
			self.right.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct InExpression {
	pub value: Box<Expression>,
	pub list: Box<Expression>,
	pub negated: bool,
	pub fragment: Fragment,
}

impl InExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.value.full_fragment_owned(),
			self.fragment.clone(),
			self.list.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ContainsExpression {
	pub value: Box<Expression>,
	pub list: Box<Expression>,
	pub fragment: Fragment,
}

impl ContainsExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([
			self.value.full_fragment_owned(),
			self.fragment.clone(),
			self.list.full_fragment_owned(),
		])
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ColumnExpression(pub ColumnIdentifier);

impl ColumnExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		// Return just the column name for unqualified column references
		self.0.name.clone()
	}

	pub fn column(&self) -> &ColumnIdentifier {
		&self.0
	}
}

impl Display for Expression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		match self {
			Expression::AccessSource(AccessPrimitiveExpression {
				column,
			}) => match &column.primitive {
				ColumnPrimitive::Primitive {
					primitive,
					..
				} => {
					write!(f, "{}.{}", primitive.text(), column.name.text())
				}
				ColumnPrimitive::Alias(alias) => {
					write!(f, "{}.{}", alias.text(), column.name.text())
				}
			},
			Expression::Alias(AliasExpression {
				alias,
				expression,
				..
			}) => {
				write!(f, "{} as {}", expression, alias)
			}
			Expression::Cast(CastExpression {
				expression: expr,
				..
			}) => write!(f, "{}", expr),
			Expression::Constant(fragment) => {
				write!(f, "Constant({})", fragment)
			}
			Expression::Column(ColumnExpression(column)) => {
				write!(f, "{}", column.name.text())
			}
			Expression::Add(AddExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} + {})", left, right)
			}
			Expression::Div(DivExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} / {})", left, right)
			}
			Expression::Call(call) => write!(f, "{}", call),
			Expression::Rem(RemExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} % {})", left, right)
			}
			Expression::Mul(MulExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} * {})", left, right)
			}
			Expression::Sub(SubExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} - {})", left, right)
			}
			Expression::Tuple(tuple) => write!(f, "({})", tuple),
			Expression::List(list) => write!(f, "{}", list),
			Expression::Prefix(prefix) => write!(f, "{}", prefix),
			Expression::GreaterThan(GreaterThanExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} > {})", left, right)
			}
			Expression::GreaterThanEqual(GreaterThanEqExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} >= {})", left, right)
			}
			Expression::LessThan(LessThanExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} < {})", left, right)
			}
			Expression::LessThanEqual(LessThanEqExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} <= {})", left, right)
			}
			Expression::Equal(EqExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} == {})", left, right)
			}
			Expression::NotEqual(NotEqExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} != {})", left, right)
			}
			Expression::Between(BetweenExpression {
				value,
				lower,
				upper,
				..
			}) => {
				write!(f, "({} BETWEEN {} AND {})", value, lower, upper)
			}
			Expression::And(AndExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} and {})", left, right)
			}
			Expression::Or(OrExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} or {})", left, right)
			}
			Expression::Xor(XorExpression {
				left,
				right,
				..
			}) => {
				write!(f, "({} xor {})", left, right)
			}
			Expression::In(InExpression {
				value,
				list,
				negated,
				..
			}) => {
				if *negated {
					write!(f, "({} NOT IN {})", value, list)
				} else {
					write!(f, "({} IN {})", value, list)
				}
			}
			Expression::Contains(ContainsExpression {
				value,
				list,
				..
			}) => {
				write!(f, "({} CONTAINS {})", value, list)
			}
			Expression::Type(TypeExpression {
				fragment,
				..
			}) => write!(f, "{}", fragment.text()),
			Expression::Parameter(param) => match param {
				ParameterExpression::Positional {
					fragment,
					..
				} => write!(f, "{}", fragment.text()),
				ParameterExpression::Named {
					fragment,
				} => write!(f, "{}", fragment.text()),
			},
			Expression::Variable(var) => write!(f, "{}", var.fragment.text()),
			Expression::If(if_expr) => write!(f, "{}", if_expr),
			Expression::Map(map_expr) => write!(
				f,
				"MAP{{ {} }}",
				map_expr.expressions
					.iter()
					.map(|expr| format!("{}", expr))
					.collect::<Vec<_>>()
					.join(", ")
			),
			Expression::Extend(extend_expr) => write!(
				f,
				"EXTEND{{ {} }}",
				extend_expr
					.expressions
					.iter()
					.map(|expr| format!("{}", expr))
					.collect::<Vec<_>>()
					.join(", ")
			),
			Expression::SumTypeConstructor(ctor) => write!(
				f,
				"{}::{}{{ {} }}",
				ctor.sumtype_name.text(),
				ctor.variant_name.text(),
				ctor.columns
					.iter()
					.map(|(name, expr)| format!("{}: {}", name.text(), expr))
					.collect::<Vec<_>>()
					.join(", ")
			),
			Expression::IsVariant(e) => write!(f, "({} IS {})", e.expression, e.variant_name.text()),
			Expression::FieldAccess(field_access) => write!(f, "{}", field_access),
		}
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct CallExpression {
	pub func: IdentExpression,
	pub args: Vec<Expression>,
	pub fragment: Fragment,
}

impl CallExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::Statement {
			column: self.func.0.column(),
			line: self.func.0.line(),
			text: Arc::from(format!(
				"{}({})",
				self.func.0.text(),
				self.args
					.iter()
					.map(|arg| arg.full_fragment_owned().text().to_string())
					.collect::<Vec<_>>()
					.join(",")
			)),
		}
	}
}

impl Display for CallExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		let args = self.args.iter().map(|arg| format!("{}", arg)).collect::<Vec<_>>().join(", ");
		write!(f, "{}({})", self.func, args)
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct IdentExpression(pub Fragment);

#[derive(Debug, Clone, Serialize, Deserialize)]
pub enum ParameterExpression {
	Positional {
		fragment: Fragment,
	},
	Named {
		fragment: Fragment,
	},
}

impl ParameterExpression {
	pub fn position(&self) -> Option<u32> {
		match self {
			ParameterExpression::Positional {
				fragment,
			} => fragment.text()[1..].parse().ok(),
			ParameterExpression::Named {
				..
			} => None,
		}
	}

	pub fn name(&self) -> Option<&str> {
		match self {
			ParameterExpression::Named {
				fragment,
			} => Some(&fragment.text()[1..]),
			ParameterExpression::Positional {
				..
			} => None,
		}
	}
}

#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct VariableExpression {
	pub fragment: Fragment,
}

impl VariableExpression {
	pub fn name(&self) -> &str {
		// Extract variable name from token value (skip the '$')
		let text = self.fragment.text();
		if text.starts_with('$') {
			&text[1..]
		} else {
			text
		}
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct IfExpression {
	pub condition: Box<Expression>,
	pub then_expr: Box<Expression>,
	pub else_ifs: Vec<ElseIfExpression>,
	pub else_expr: Option<Box<Expression>>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ElseIfExpression {
	pub condition: Box<Expression>,
	pub then_expr: Box<Expression>,
	pub fragment: Fragment,
}

impl IfExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		self.fragment.clone()
	}

	pub fn lazy_fragment(&self) -> impl Fn() -> Fragment {
		move || self.full_fragment_owned()
	}
}

impl Display for IfExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		write!(f, "if {} {{ {} }}", self.condition, self.then_expr)?;

		for else_if in &self.else_ifs {
			write!(f, " else if {} {{ {} }}", else_if.condition, else_if.then_expr)?;
		}

		if let Some(else_expr) = &self.else_expr {
			write!(f, " else {{ {} }}", else_expr)?;
		}

		Ok(())
	}
}

impl IdentExpression {
	pub fn name(&self) -> &str {
		self.0.text()
	}
}

impl Display for IdentExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		write!(f, "{}", self.0.text())
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub enum PrefixOperator {
	Minus(Fragment),
	Plus(Fragment),
	Not(Fragment),
}

impl PrefixOperator {
	pub fn full_fragment_owned(&self) -> Fragment {
		match self {
			PrefixOperator::Minus(fragment) => fragment.clone(),
			PrefixOperator::Plus(fragment) => fragment.clone(),
			PrefixOperator::Not(fragment) => fragment.clone(),
		}
	}
}

impl Display for PrefixOperator {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		match self {
			PrefixOperator::Minus(_) => write!(f, "-"),
			PrefixOperator::Plus(_) => write!(f, "+"),
			PrefixOperator::Not(_) => write!(f, "not"),
		}
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct PrefixExpression {
	pub operator: PrefixOperator,
	pub expression: Box<Expression>,
	pub fragment: Fragment,
}

impl PrefixExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([self.operator.full_fragment_owned(), self.expression.full_fragment_owned()])
	}
}

impl Display for PrefixExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		write!(f, "({}{})", self.operator, self.expression)
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct TupleExpression {
	pub expressions: Vec<Expression>,
	pub fragment: Fragment,
}

impl Display for TupleExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		let items = self.expressions.iter().map(|e| format!("{}", e)).collect::<Vec<_>>().join(", ");
		write!(f, "({})", items)
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ListExpression {
	pub expressions: Vec<Expression>,
	pub fragment: Fragment,
}

impl Display for ListExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		let items = self.expressions.iter().map(|e| format!("{}", e)).collect::<Vec<_>>().join(", ");
		write!(f, "[{}]", items)
	}
}

pub struct ExpressionCompiler {}

impl ExpressionCompiler {
	pub fn compile(ast: Ast<'_>) -> Result<Expression> {
		match ast {
			Ast::Literal(literal) => match literal {
				AstLiteral::Boolean(_) => Ok(Expression::Constant(ConstantExpression::Bool {
					fragment: literal.fragment().to_owned(),
				})),
				AstLiteral::Number(_) => Ok(Expression::Constant(ConstantExpression::Number {
					fragment: literal.fragment().to_owned(),
				})),
				AstLiteral::Temporal(_) => Ok(Expression::Constant(ConstantExpression::Temporal {
					fragment: literal.fragment().to_owned(),
				})),
				AstLiteral::Text(_) => Ok(Expression::Constant(ConstantExpression::Text {
					fragment: literal.fragment().to_owned(),
				})),
				AstLiteral::None(_) => Ok(Expression::Constant(ConstantExpression::None {
					fragment: literal.fragment().to_owned(),
				})),
			},
			Ast::Identifier(identifier) => {
				// Create an unqualified column identifier

				let column = ColumnIdentifier {
					primitive: ColumnPrimitive::Primitive {
						namespace: Fragment::Internal {
							text: Arc::from("_context"),
						},
						primitive: Fragment::Internal {
							text: Arc::from("_context"),
						},
					},
					name: identifier.token.fragment.to_owned(),
				};
				Ok(Expression::Column(ColumnExpression(column)))
			}
			Ast::CallFunction(call) => {
				// Build the full function name from namespace + function
				let full_name = if call.function.namespaces.is_empty() {
					call.function.name.text().to_string()
				} else {
					let namespace_path = call
						.function
						.namespaces
						.iter()
						.map(|ns| ns.text())
						.collect::<Vec<_>>()
						.join("::");
					format!("{}::{}", namespace_path, call.function.name.text())
				};

				// Compile arguments
				let mut arg_expressions = Vec::new();
				for arg_ast in call.arguments.nodes {
					let compiled = Self::compile(arg_ast)?;
					let compiled = match &compiled {
						Expression::Column(col_expr) => {
							if let Ok(ty) = Type::from_str(col_expr.0.name.text()) {
								Expression::Type(TypeExpression {
									fragment: col_expr.0.name.clone(),
									ty,
								})
							} else {
								compiled
							}
						}
						_ => compiled,
					};
					arg_expressions.push(compiled);
				}

				Ok(Expression::Call(CallExpression {
					func: IdentExpression(Fragment::testing(&full_name)),
					args: arg_expressions,
					fragment: call.token.fragment.to_owned(),
				}))
			}
			Ast::Infix(ast) => Self::infix(ast),
			Ast::Between(between) => {
				let value = Self::compile(BumpBox::into_inner(between.value))?;
				let lower = Self::compile(BumpBox::into_inner(between.lower))?;
				let upper = Self::compile(BumpBox::into_inner(between.upper))?;

				Ok(Expression::Between(BetweenExpression {
					value: Box::new(value),
					lower: Box::new(lower),
					upper: Box::new(upper),
					fragment: between.token.fragment.to_owned(),
				}))
			}
			Ast::Tuple(tuple) => {
				let mut expressions = Vec::with_capacity(tuple.len());

				for ast in tuple.nodes {
					expressions.push(Self::compile(ast)?);
				}

				Ok(Expression::Tuple(TupleExpression {
					expressions,
					fragment: tuple.token.fragment.to_owned(),
				}))
			}
			Ast::Prefix(prefix) => {
				let (fragment, operator) = match prefix.operator {
					ast::ast::AstPrefixOperator::Plus(token) => (
						token.fragment.to_owned(),
						PrefixOperator::Plus(token.fragment.to_owned()),
					),
					ast::ast::AstPrefixOperator::Negate(token) => (
						token.fragment.to_owned(),
						PrefixOperator::Minus(token.fragment.to_owned()),
					),
					ast::ast::AstPrefixOperator::Not(token) => (
						token.fragment.to_owned(),
						PrefixOperator::Not(token.fragment.to_owned()),
					),
				};

				Ok(Expression::Prefix(PrefixExpression {
					operator,
					expression: Box::new(Self::compile(BumpBox::into_inner(prefix.node))?),
					fragment,
				}))
			}
			Ast::Cast(node) => {
				let mut tuple = node.tuple;
				let node = tuple.nodes.pop().unwrap();
				let bump_fragment = node.as_identifier().token.fragment;
				let ty = convert_data_type(&bump_fragment)?;
				let fragment = bump_fragment.to_owned();

				let expr = tuple.nodes.pop().unwrap();

				Ok(Expression::Cast(CastExpression {
					fragment: tuple.token.fragment.to_owned(),
					expression: Box::new(Self::compile(expr)?),
					to: TypeExpression {
						fragment,
						ty,
					},
				}))
			}
			Ast::Variable(var) => Ok(Expression::Variable(VariableExpression {
				fragment: var.token.fragment.to_owned(),
			})),
			Ast::Rownum(_rownum) => {
				// Compile rownum to a column reference for rownum

				let column = ColumnIdentifier {
					primitive: ColumnPrimitive::Primitive {
						namespace: Fragment::Internal {
							text: Arc::from("_context"),
						},
						primitive: Fragment::Internal {
							text: Arc::from("_context"),
						},
					},
					name: Fragment::Internal {
						text: Arc::from(ROW_NUMBER_COLUMN_NAME),
					},
				};
				Ok(Expression::Column(ColumnExpression(column)))
			}
			Ast::If(if_ast) => {
				// Compile condition
				let condition = Box::new(Self::compile(BumpBox::into_inner(if_ast.condition))?);

				// Compile then expression (take first expression from first statement in block)
				let then_expr = Box::new(Self::compile_block_as_expr(if_ast.then_block)?);

				// Compile else_if chains
				let mut else_ifs = Vec::new();
				for else_if in if_ast.else_ifs {
					let else_if_condition =
						Box::new(Self::compile(BumpBox::into_inner(else_if.condition))?);
					let else_if_then = Box::new(Self::compile_block_as_expr(else_if.then_block)?);
					else_ifs.push(ElseIfExpression {
						condition: else_if_condition,
						then_expr: else_if_then,
						fragment: else_if.token.fragment.to_owned(),
					});
				}

				// Compile optional else expression
				let else_expr = if let Some(else_block) = if_ast.else_block {
					Some(Box::new(Self::compile_block_as_expr(else_block)?))
				} else {
					None
				};

				Ok(Expression::If(IfExpression {
					condition,
					then_expr,
					else_ifs,
					else_expr,
					fragment: if_ast.token.fragment.to_owned(),
				}))
			}
			Ast::Map(map) => {
				// Compile expressions in the map
				let mut expressions = Vec::with_capacity(map.nodes.len());
				for node in map.nodes {
					expressions.push(Self::compile(node)?);
				}

				Ok(Expression::Map(MapExpression {
					expressions,
					fragment: map.token.fragment.to_owned(),
				}))
			}
			Ast::Extend(extend) => {
				// Compile expressions in the extend
				let mut expressions = Vec::with_capacity(extend.nodes.len());
				for node in extend.nodes {
					expressions.push(Self::compile(node)?);
				}

				Ok(Expression::Extend(ExtendExpression {
					expressions,
					fragment: extend.token.fragment.to_owned(),
				}))
			}
			Ast::List(list) => {
				// Compile list expressions (used for IN [...] syntax)
				let mut expressions = Vec::with_capacity(list.nodes.len());
				for ast in list.nodes {
					expressions.push(Self::compile(ast)?);
				}
				Ok(Expression::List(ListExpression {
					expressions,
					fragment: list.token.fragment.to_owned(),
				}))
			}
			Ast::SumTypeConstructor(ctor) => {
				let mut columns = Vec::with_capacity(ctor.columns.keyed_values.len());
				for kv in ctor.columns.keyed_values {
					let name = kv.key.token.fragment.to_owned();
					let expr = Self::compile(BumpBox::into_inner(kv.value))?;
					columns.push((name, expr));
				}
				Ok(Expression::SumTypeConstructor(SumTypeConstructorExpression {
					namespace: ctor.namespace.to_owned(),
					sumtype_name: ctor.sumtype_name.to_owned(),
					variant_name: ctor.variant_name.to_owned(),
					columns,
					fragment: ctor.token.fragment.to_owned(),
				}))
			}
			Ast::IsVariant(is) => {
				let expression = Self::compile(BumpBox::into_inner(is.expression))?;
				Ok(Expression::IsVariant(IsVariantExpression {
					expression: Box::new(expression),
					namespace: is.namespace.map(|n| n.to_owned()),
					sumtype_name: is.sumtype_name.to_owned(),
					variant_name: is.variant_name.to_owned(),
					tag: None,
					fragment: is.token.fragment.to_owned(),
				}))
			}
			Ast::Match(match_ast) => Self::compile_match(match_ast),
			Ast::Identity(ident) => Ok(Expression::Variable(VariableExpression {
				fragment: ident.token.fragment.to_owned(),
			})),
			ast => unimplemented!("{:?}", ast),
		}
	}

	/// Compile an AstBlock as a single expression.
	/// Takes the first expression from the first statement in the block.
	/// Used for IF/ELSE blocks in expression context.
	fn compile_block_as_expr(block: AstBlock<'_>) -> Result<Expression> {
		let fragment = block.token.fragment.to_owned();
		if let Some(first_stmt) = block.statements.into_iter().next() {
			if let Some(first_node) = first_stmt.nodes.into_iter().next() {
				return Self::compile(first_node);
			}
		}
		// Empty block → none
		Ok(Expression::Constant(ConstantExpression::None {
			fragment,
		}))
	}

	/// Compile a MATCH expression by lowering it to an IfExpression.
	fn compile_match(match_ast: ast::ast::AstMatch<'_>) -> Result<Expression> {
		let fragment = match_ast.token.fragment.to_owned();

		// Compile subject expression (if present)
		let subject = match match_ast.subject {
			Some(s) => Some(Self::compile(BumpBox::into_inner(s))?),
			None => None,
		};

		// Extract the subject column name for field rewriting (if subject is a simple column)
		let subject_col_name = subject.as_ref().and_then(|s| match s {
			Expression::Column(ColumnExpression(col)) => Some(col.name.text().to_string()),
			_ => None,
		});

		// Build list of (condition, result) pairs + optional else
		let mut branches: Vec<(Expression, Expression)> = Vec::new();
		let mut else_result: Option<Expression> = None;

		for arm in match_ast.arms {
			match arm {
				AstMatchArm::Else {
					result,
				} => {
					else_result = Some(Self::compile(BumpBox::into_inner(result))?);
				}
				AstMatchArm::Value {
					pattern,
					guard,
					result,
				} => {
					let subject_expr = subject.clone().expect("Value arm requires a MATCH subject");
					let pattern_expr = Self::compile(BumpBox::into_inner(pattern))?;

					// condition = subject == pattern
					let mut condition = Expression::Equal(EqExpression {
						left: Box::new(subject_expr),
						right: Box::new(pattern_expr),
						fragment: fragment.clone(),
					});

					// If guard, condition = condition AND guard
					if let Some(guard) = guard {
						let guard_expr = Self::compile(BumpBox::into_inner(guard))?;
						condition = Expression::And(AndExpression {
							left: Box::new(condition),
							right: Box::new(guard_expr),
							fragment: fragment.clone(),
						});
					}

					let result_expr = Self::compile(BumpBox::into_inner(result))?;
					branches.push((condition, result_expr));
				}
				AstMatchArm::IsVariant {
					namespace,
					sumtype_name,
					variant_name,
					destructure,
					guard,
					result,
				} => {
					let subject_expr = subject.clone().expect("IS arm requires a MATCH subject");

					// Build field bindings for rewriting
					let bindings: Vec<(String, String)> = match (&destructure, &subject_col_name) {
						(Some(destr), Some(col_name)) => {
							let variant_lower = variant_name.text().to_lowercase();
							destr.fields
								.iter()
								.map(|f| {
									let field_name = f.text().to_string();
									let physical = format!(
										"{}_{}_{}",
										col_name,
										variant_lower,
										field_name.to_lowercase()
									);
									(field_name, physical)
								})
								.collect()
						}
						_ => vec![],
					};

					// condition = subject IS [ns.]Type::Variant
					let mut condition = Expression::IsVariant(IsVariantExpression {
						expression: Box::new(subject_expr),
						namespace: namespace.map(|n| n.to_owned()),
						sumtype_name: sumtype_name.to_owned(),
						variant_name: variant_name.to_owned(),
						tag: None,
						fragment: fragment.clone(),
					});

					// If guard, rewrite field refs in guard, then AND
					if let Some(guard) = guard {
						let mut guard_expr = Self::compile(BumpBox::into_inner(guard))?;
						Self::rewrite_field_refs(&mut guard_expr, &bindings);
						condition = Expression::And(AndExpression {
							left: Box::new(condition),
							right: Box::new(guard_expr),
							fragment: fragment.clone(),
						});
					}

					let mut result_expr = Self::compile(BumpBox::into_inner(result))?;
					Self::rewrite_field_refs(&mut result_expr, &bindings);
					branches.push((condition, result_expr));
				}
				AstMatchArm::Variant {
					variant_name,
					destructure,
					guard,
					result,
				} => {
					let subject_expr =
						subject.clone().expect("Variant arm requires a MATCH subject");

					// Build field bindings for rewriting
					let bindings: Vec<(String, String)> = match (&destructure, &subject_col_name) {
						(Some(destr), Some(col_name)) => {
							let variant_lower = variant_name.text().to_lowercase();
							destr.fields
								.iter()
								.map(|f| {
									let field_name = f.text().to_string();
									let physical = format!(
										"{}_{}_{}",
										col_name,
										variant_lower,
										field_name.to_lowercase()
									);
									(field_name, physical)
								})
								.collect()
						}
						_ => vec![],
					};

					// condition = subject IS Variant (placeholder sumtype_name = variant_name)
					let mut condition = Expression::IsVariant(IsVariantExpression {
						expression: Box::new(subject_expr),
						namespace: None,
						sumtype_name: variant_name.to_owned(),
						variant_name: variant_name.to_owned(),
						tag: None,
						fragment: fragment.clone(),
					});

					// If guard, rewrite field refs in guard, then AND
					if let Some(guard) = guard {
						let mut guard_expr = Self::compile(BumpBox::into_inner(guard))?;
						Self::rewrite_field_refs(&mut guard_expr, &bindings);
						condition = Expression::And(AndExpression {
							left: Box::new(condition),
							right: Box::new(guard_expr),
							fragment: fragment.clone(),
						});
					}

					let mut result_expr = Self::compile(BumpBox::into_inner(result))?;
					Self::rewrite_field_refs(&mut result_expr, &bindings);
					branches.push((condition, result_expr));
				}
				AstMatchArm::Condition {
					condition,
					guard,
					result,
				} => {
					let mut cond = Self::compile(BumpBox::into_inner(condition))?;

					if let Some(guard) = guard {
						let guard_expr = Self::compile(BumpBox::into_inner(guard))?;
						cond = Expression::And(AndExpression {
							left: Box::new(cond),
							right: Box::new(guard_expr),
							fragment: fragment.clone(),
						});
					}

					let result_expr = Self::compile(BumpBox::into_inner(result))?;
					branches.push((cond, result_expr));
				}
			}
		}

		// Assemble into IfExpression
		if branches.is_empty() {
			// Degenerate: only ELSE or empty match
			return Ok(else_result.unwrap_or(Expression::Constant(ConstantExpression::None {
				fragment,
			})));
		}

		let (first_cond, first_then) = branches.remove(0);

		let else_ifs: Vec<ElseIfExpression> = branches
			.into_iter()
			.map(|(cond, then_expr)| ElseIfExpression {
				condition: Box::new(cond),
				then_expr: Box::new(then_expr),
				fragment: fragment.clone(),
			})
			.collect();

		Ok(Expression::If(IfExpression {
			condition: Box::new(first_cond),
			then_expr: Box::new(first_then),
			else_ifs,
			else_expr: else_result.map(Box::new),
			fragment,
		}))
	}

	/// Rewrite field references in a compiled expression tree.
	/// Replaces Column expressions whose name matches a bound field name
	/// with the corresponding physical column name.
	pub(crate) fn rewrite_field_refs(expr: &mut Expression, bindings: &[(String, String)]) {
		if bindings.is_empty() {
			return;
		}
		match expr {
			Expression::Column(ColumnExpression(col)) => {
				let name = col.name.text().to_string();
				for (field_name, physical_name) in bindings {
					if name == *field_name {
						col.name = Fragment::internal(physical_name);
						break;
					}
				}
			}
			Expression::Add(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Sub(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Mul(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Div(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Rem(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Equal(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::NotEqual(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::GreaterThan(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::GreaterThanEqual(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::LessThan(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::LessThanEqual(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::And(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Or(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Xor(e) => {
				Self::rewrite_field_refs(&mut e.left, bindings);
				Self::rewrite_field_refs(&mut e.right, bindings);
			}
			Expression::Prefix(e) => {
				Self::rewrite_field_refs(&mut e.expression, bindings);
			}
			Expression::Cast(e) => {
				Self::rewrite_field_refs(&mut e.expression, bindings);
			}
			Expression::Call(e) => {
				for arg in &mut e.args {
					Self::rewrite_field_refs(arg, bindings);
				}
			}
			Expression::If(e) => {
				Self::rewrite_field_refs(&mut e.condition, bindings);
				Self::rewrite_field_refs(&mut e.then_expr, bindings);
				for else_if in &mut e.else_ifs {
					Self::rewrite_field_refs(&mut else_if.condition, bindings);
					Self::rewrite_field_refs(&mut else_if.then_expr, bindings);
				}
				if let Some(else_expr) = &mut e.else_expr {
					Self::rewrite_field_refs(else_expr, bindings);
				}
			}
			Expression::Alias(e) => {
				Self::rewrite_field_refs(&mut e.expression, bindings);
			}
			Expression::Tuple(e) => {
				for expr in &mut e.expressions {
					Self::rewrite_field_refs(expr, bindings);
				}
			}
			Expression::List(e) => {
				for expr in &mut e.expressions {
					Self::rewrite_field_refs(expr, bindings);
				}
			}
			Expression::Between(e) => {
				Self::rewrite_field_refs(&mut e.value, bindings);
				Self::rewrite_field_refs(&mut e.lower, bindings);
				Self::rewrite_field_refs(&mut e.upper, bindings);
			}
			Expression::In(e) => {
				Self::rewrite_field_refs(&mut e.value, bindings);
				Self::rewrite_field_refs(&mut e.list, bindings);
			}
			Expression::Contains(e) => {
				Self::rewrite_field_refs(&mut e.value, bindings);
				Self::rewrite_field_refs(&mut e.list, bindings);
			}
			// Leaf nodes that don't contain column references
			Expression::Constant(_)
			| Expression::AccessSource(_)
			| Expression::Type(_)
			| Expression::Parameter(_)
			| Expression::Variable(_)
			| Expression::Map(_)
			| Expression::Extend(_)
			| Expression::SumTypeConstructor(_)
			| Expression::IsVariant(_)
			| Expression::FieldAccess(_) => {}
		}
	}

	fn infix(ast: AstInfix<'_>) -> Result<Expression> {
		match ast.operator {
			InfixOperator::Add(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;
				Ok(Expression::Add(AddExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Divide(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;
				Ok(Expression::Div(DivExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Subtract(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;
				Ok(Expression::Sub(SubExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Rem(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;
				Ok(Expression::Rem(RemExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Multiply(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;
				Ok(Expression::Mul(MulExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Call(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				let func_name = match left {
					Expression::Column(ColumnExpression(column)) => column.name,
					Expression::Variable(var) => var.fragment,
					_ => panic!("unexpected left-hand side in call expression"),
				};
				let Expression::Tuple(tuple) = right else {
					panic!()
				};

				Ok(Expression::Call(CallExpression {
					func: IdentExpression(func_name),
					args: tuple.expressions,
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::GreaterThan(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::GreaterThan(GreaterThanExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::GreaterThanEqual(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::GreaterThanEqual(GreaterThanEqExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::LessThan(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::LessThan(LessThanExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::LessThanEqual(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::LessThanEqual(LessThanEqExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::Equal(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::Equal(EqExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::NotEqual(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::NotEqual(NotEqExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}
			InfixOperator::As(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let alias_fragment = match BumpBox::into_inner(ast.right) {
					Ast::Identifier(ident) => ident.token.fragment.to_owned(),
					Ast::Literal(AstLiteral::Text(text)) => {
						let raw = text.0.fragment.text();
						let unquoted = raw.trim_matches('"');
						Fragment::internal(unquoted)
					}
					_ => unimplemented!(),
				};

				Ok(Expression::Alias(AliasExpression {
					alias: IdentExpression(alias_fragment),
					expression: Box::new(left),
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::And(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::And(AndExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::Or(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::Or(OrExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::Xor(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::Xor(XorExpression {
					left: Box::new(left),
					right: Box::new(right),
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::In(token) => {
				let value = Self::compile(BumpBox::into_inner(ast.left))?;
				let list = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::In(InExpression {
					value: Box::new(value),
					list: Box::new(list),
					negated: false,
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::NotIn(token) => {
				let value = Self::compile(BumpBox::into_inner(ast.left))?;
				let list = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::In(InExpression {
					value: Box::new(value),
					list: Box::new(list),
					negated: true,
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::Contains(token) => {
				let value = Self::compile(BumpBox::into_inner(ast.left))?;
				let list = Self::compile(BumpBox::into_inner(ast.right))?;

				Ok(Expression::Contains(ContainsExpression {
					value: Box::new(value),
					list: Box::new(list),
					fragment: token.fragment.to_owned(),
				}))
			}

			InfixOperator::Assign(token) => {
				// Assignment operator (=) is not valid in expression context
				// Use == for equality comparison
				return Err(AstError::UnsupportedToken {
					fragment: token.fragment.to_owned(),
				}
				.into());
			}

			InfixOperator::TypeAscription(token) => {
				match BumpBox::into_inner(ast.left) {
					Ast::Identifier(alias) => {
						let right = Self::compile(BumpBox::into_inner(ast.right))?;

						Ok(Expression::Alias(AliasExpression {
							alias: IdentExpression(alias.token.fragment.to_owned()),
							expression: Box::new(right),
							fragment: token.fragment.to_owned(),
						}))
					}
					Ast::Literal(AstLiteral::Text(text)) => {
						// Handle string literals as alias names (common in MAP syntax)
						let right = Self::compile(BumpBox::into_inner(ast.right))?;

						Ok(Expression::Alias(AliasExpression {
							alias: IdentExpression(text.0.fragment.to_owned()),
							expression: Box::new(right),
							fragment: token.fragment.to_owned(),
						}))
					}
					_ => {
						return err!(Diagnostic {
							code: "EXPR_001".to_string(),
							statement: None,
							message: "Invalid alias expression".to_string(),
							column: None,
							fragment: Fragment::None,
							label: Some("Only identifiers and string literals can be used as alias names".to_string()),
							help: Some("Use an identifier or string literal for the alias name".to_string()),
							notes: vec![],
							cause: None,
							operator_chain: None,
						});
					}
				}
			}
			InfixOperator::AccessNamespace(_token) => {
				// Handle namespace access: `ns::func(args)` → CallExpression with namespaced name
				// Extract namespace name from left side (always an identifier)
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let namespace = match &left {
					Expression::Column(ColumnExpression(col)) => col.name.text().to_string(),
					other => unimplemented!("unsupported namespace expression: {other:?}"),
				};

				// The right side may contain keywords (e.g. `undefined`) that should be
				// treated as identifiers in a namespace context. Extract the name from the
				// raw AST token before compiling, so keywords are treated as identifier_or_keyword.
				let right_ast = BumpBox::into_inner(ast.right);
				Self::compile_namespace_right(&namespace, right_ast)
			}

			InfixOperator::AccessTable(token) => {
				let left = Self::compile(BumpBox::into_inner(ast.left))?;
				let right_ast = BumpBox::into_inner(ast.right);
				let field_name = right_ast.token().fragment.to_owned();
				let fragment = token.fragment.to_owned();
				Ok(Expression::FieldAccess(FieldAccessExpression {
					object: Box::new(left),
					field: field_name,
					fragment,
				}))
			}
		}
	}

	/// Compile the right-hand side of a namespace access (`ns::...`).
	///
	/// Keywords like `undefined` or `true` are treated as identifiers in this
	/// context so that `is::none(x)` resolves to a function call rather
	/// than parsing `undefined` as the literal keyword.
	fn compile_namespace_right(namespace: &str, right_ast: Ast<'_>) -> Result<Expression> {
		// Helper: extract a token's text from any AST node that should be treated
		// as an identifier_or_keyword in namespace position.
		fn identifier_or_keyword_name(ast: &Ast<'_>) -> Option<String> {
			Some(ast.token().fragment.text().to_string())
		}

		match right_ast {
			// ns::func(args)  where func is parsed as Infix(left, Call, right)
			Ast::Infix(infix) if matches!(infix.operator, InfixOperator::Call(_)) => {
				let func_name = identifier_or_keyword_name(&infix.left)
					.expect("namespace function name must be extractable");
				let full_name = format!("{}::{}", namespace, func_name);

				let right = Self::compile(BumpBox::into_inner(infix.right))?;
				let Expression::Tuple(tuple) = right else {
					panic!("expected tuple arguments for namespaced call");
				};

				Ok(Expression::Call(CallExpression {
					func: IdentExpression(Fragment::testing(&full_name)),
					args: tuple.expressions,
					fragment: infix.token.fragment.to_owned(),
				}))
			}
			// ns::func(args) where func is parsed as CallFunction
			// (happens when the namespace token is a keyword like `is`,
			// so the parser treats the right side as a standalone call)
			Ast::CallFunction(call) => {
				let func_name = call.function.name.text().to_string();
				let full_name = if call.function.namespaces.is_empty() {
					format!("{}::{}", namespace, func_name)
				} else {
					let sub_ns = call
						.function
						.namespaces
						.iter()
						.map(|ns| ns.text())
						.collect::<Vec<_>>()
						.join("::");
					format!("{}::{}::{}", namespace, sub_ns, func_name)
				};

				let mut arg_expressions = Vec::new();
				for arg_ast in call.arguments.nodes {
					let compiled = Self::compile(arg_ast)?;
					let compiled = match &compiled {
						Expression::Column(col_expr) => {
							if let Ok(ty) = Type::from_str(col_expr.0.name.text()) {
								Expression::Type(TypeExpression {
									fragment: col_expr.0.name.clone(),
									ty,
								})
							} else {
								compiled
							}
						}
						_ => compiled,
					};
					arg_expressions.push(compiled);
				}

				Ok(Expression::Call(CallExpression {
					func: IdentExpression(Fragment::testing(&full_name)),
					args: arg_expressions,
					fragment: call.token.fragment.to_owned(),
				}))
			}
			// ns::name  (bare namespaced reference, no call)
			other => {
				if let Some(name) = identifier_or_keyword_name(&other) {
					let full_name = format!("{}::{}", namespace, name);
					Ok(Expression::Column(ColumnExpression(ColumnIdentifier {
						primitive: ColumnPrimitive::Primitive {
							namespace: Fragment::Internal {
								text: Arc::from("_context"),
							},
							primitive: Fragment::Internal {
								text: Arc::from("_context"),
							},
						},
						name: Fragment::testing(&full_name),
					})))
				} else {
					let compiled = Self::compile(other)?;
					match compiled {
						Expression::Column(ColumnExpression(col)) => {
							let full_name = format!("{}::{}", namespace, col.name.text());
							Ok(Expression::Column(ColumnExpression(ColumnIdentifier {
								primitive: col.primitive,
								name: Fragment::testing(&full_name),
							})))
						}
						other => unimplemented!(
							"unsupported namespace right-hand side: {other:?}"
						),
					}
				}
			}
		}
	}
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct MapExpression {
	pub expressions: Vec<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ExtendExpression {
	pub expressions: Vec<Expression>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct SumTypeConstructorExpression {
	pub namespace: Fragment,
	pub sumtype_name: Fragment,
	pub variant_name: Fragment,
	pub columns: Vec<(Fragment, Expression)>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct IsVariantExpression {
	pub expression: Box<Expression>,
	pub namespace: Option<Fragment>,
	pub sumtype_name: Fragment,
	pub variant_name: Fragment,
	pub tag: Option<u8>,
	pub fragment: Fragment,
}

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct FieldAccessExpression {
	pub object: Box<Expression>,
	pub field: Fragment,
	pub fragment: Fragment,
}

impl FieldAccessExpression {
	pub fn full_fragment_owned(&self) -> Fragment {
		Fragment::merge_all([self.object.full_fragment_owned(), self.fragment.clone(), self.field.clone()])
	}
}

impl Display for FieldAccessExpression {
	fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
		write!(f, "{}.{}", self.object, self.field.text())
	}
}

/// Recursively extract all variable names referenced in an expression tree.
pub fn extract_variable_names(expr: &Expression) -> Vec<String> {
	let mut names = Vec::new();
	collect_variable_names(expr, &mut names);
	names
}

fn collect_variable_names(expr: &Expression, names: &mut Vec<String>) {
	match expr {
		Expression::Variable(v) => {
			let name = v.name().to_string();
			if !names.contains(&name) {
				names.push(name);
			}
		}
		Expression::Add(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Sub(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Mul(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Div(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Rem(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::GreaterThan(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::GreaterThanEqual(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::LessThan(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::LessThanEqual(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Equal(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::NotEqual(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::And(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Or(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Xor(e) => {
			collect_variable_names(&e.left, names);
			collect_variable_names(&e.right, names);
		}
		Expression::Between(e) => {
			collect_variable_names(&e.value, names);
			collect_variable_names(&e.lower, names);
			collect_variable_names(&e.upper, names);
		}
		Expression::In(e) => {
			collect_variable_names(&e.value, names);
			collect_variable_names(&e.list, names);
		}
		Expression::Contains(e) => {
			collect_variable_names(&e.value, names);
			collect_variable_names(&e.list, names);
		}
		Expression::Prefix(e) => collect_variable_names(&e.expression, names),
		Expression::Cast(e) => collect_variable_names(&e.expression, names),
		Expression::Alias(e) => collect_variable_names(&e.expression, names),
		Expression::Call(e) => {
			for arg in &e.args {
				collect_variable_names(arg, names);
			}
		}
		Expression::Tuple(e) => {
			for expr in &e.expressions {
				collect_variable_names(expr, names);
			}
		}
		Expression::List(e) => {
			for expr in &e.expressions {
				collect_variable_names(expr, names);
			}
		}
		Expression::If(e) => {
			collect_variable_names(&e.condition, names);
			collect_variable_names(&e.then_expr, names);
			for else_if in &e.else_ifs {
				collect_variable_names(&else_if.condition, names);
				collect_variable_names(&else_if.then_expr, names);
			}
			if let Some(else_expr) = &e.else_expr {
				collect_variable_names(else_expr, names);
			}
		}
		Expression::Map(e) => {
			for expr in &e.expressions {
				collect_variable_names(expr, names);
			}
		}
		Expression::Extend(e) => {
			for expr in &e.expressions {
				collect_variable_names(expr, names);
			}
		}
		Expression::SumTypeConstructor(e) => {
			for (_, expr) in &e.columns {
				collect_variable_names(expr, names);
			}
		}
		Expression::IsVariant(e) => collect_variable_names(&e.expression, names),
		Expression::FieldAccess(e) => collect_variable_names(&e.object, names),
		// Leaf nodes with no sub-expressions
		Expression::Constant(_)
		| Expression::Column(_)
		| Expression::AccessSource(_)
		| Expression::Parameter(_)
		| Expression::Type(_) => {}
	}
}