use std::rc::Rc; use parsing::{AST, Expression, Declaration}; use builtin::{BinOp, PrefixOp}; #[derive(Debug)] pub struct ReducedAST(pub Vec); #[derive(Debug)] pub enum Stmt { Binding { name: Rc, expr: Expr, }, Expr(Expr), } #[derive(Debug)] pub enum Expr { Lit(Lit), Func(Func), Call { f: Func, args: Vec, }, } #[derive(Debug)] pub enum Lit { Nat(u64), Int(i64), Float(f64), Bool(bool), StringLit(Rc), } #[derive(Debug)] pub enum Func { BuiltIn(Rc), UserDefined { params: Vec>, body: Vec, } } impl AST { pub fn reduce(&self) -> Result { use parsing::Statement::*; let mut output = vec![]; for statement in self.0.iter() { match statement { &ExpressionStatement(ref expr) => output.push(Stmt::Expr(expr.reduce()?)), &Declaration(ref decl) => output.push(decl.reduce()?), } } Ok(ReducedAST(output)) } } impl Expression { fn reduce(&self) -> Result { use parsing::ExpressionType::*; let ref input = self.0; let output_expr = match input { &IntLiteral(ref n) => Expr::Lit(Lit::Nat(*n)), //TODO I should rename IntLiteral if I want the Nat/Int distinction, which I do &FloatLiteral(ref f) => Expr::Lit(Lit::Float(*f)), &StringLiteral(ref s) => Expr::Lit(Lit::StringLit(s.clone())), &BoolLiteral(ref b) => Expr::Lit(Lit::Bool(*b)), &BinExp(ref binop, ref lhs, ref rhs) => binop.reduce(lhs, rhs)?, &PrefixExp(ref op, ref arg) => op.reduce(arg)?, e => return Err(format!("{:?} not implemented in reduction", e)) }; Ok(output_expr) } } impl Declaration { fn reduce(&self) -> Result { Ok(Stmt::Expr(Expr::Lit(Lit::Int(0)))) } } impl BinOp { fn reduce(&self, lhs: &Box, rhs: &Box) -> Result { let f = Func::BuiltIn(self.sigil().clone()); Ok(Expr::Call { f, args: vec![lhs.reduce()?, rhs.reduce()?]}) } } impl PrefixOp { fn reduce(&self, arg: &Box) -> Result { Err(format!("NOTDONE")) } }