use std::fmt; use std::boxed::Box; use std::rc::Rc; use std::cell::RefCell; use std::convert::From; use crate::eval::{FormT,Cont,Cursor,PrimCombI}; #[derive(Debug, Eq, PartialEq)] pub enum Form { Nil, Int(i32), Bool(bool), Symbol(String), Cell(RefCell>), Pair(Rc
,Rc), PrimComb { eval_limit: i32, ins: PrimCombI }, DeriComb { se: Rc, de: Option, params: String, body: Rc }, ContComb(Cont), } // todo, strings not symbols? impl From for Form { fn from(item: String) -> Self { Form::Symbol(item) } } impl From<&str> for Form { fn from(item: &str) -> Self { Form::Symbol(item.to_owned()) } } impl From for Form { fn from(item: i32) -> Self { Form::Int(item) } } impl From for Form { fn from(item: bool) -> Self { Form::Bool(item) } } impl, B: Into> From<(A, B)> for Form { fn from(item: (A, B)) -> Self { Form::Pair(Rc::new(item.0.into()), Rc::new(item.1.into())) } } impl fmt::Display for Form { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { match self { Form::Nil => write!(f, "nil"), Form::Int(i) => write!(f, "{i}"), Form::Bool(b) => write!(f, "{b}"), Form::Symbol(s) => write!(f, "{s}"), Form::Cell(c) => write!(f, "@{}", c.borrow()), Form::Pair(car, cdr) => { write!(f, "({}", car)?; let mut traverse: Rc = Rc::clone(cdr); loop { match &*traverse { Form::Pair(ref carp, ref cdrp) => { write!(f, " {}", carp)?; traverse = Rc::clone(cdrp); }, Form::Nil => { write!(f, ")")?; return Ok(()); }, x => { write!(f, ". {x})")?; return Ok(()); }, } } }, Form::PrimComb { eval_limit, ins } => write!(f, "<{eval_limit}> - {ins:?}"), Form::DeriComb { se: _, de, params, body } => { write!(f, "<{} {} {}>", de.as_ref().unwrap_or(&"".to_string()), params, body) }, Form::ContComb(_) => write!(f, ""), } } } impl Form { fn truthy(&self) -> bool { match self { Form::Bool(b) => *b, Form::Nil => false, _ => true, } } fn int(&self) -> Option { match self { Form::Int(i) => Some(*i), _ => None, } } pub fn append(&self, x: Rc) -> Option> { match self { Form::Pair(car, cdr) => cdr.append(x).map(|x| Rc::new(Form::Pair(Rc::clone(car), x))), Form::Nil => Some(Rc::new(Form::Pair(x, Rc::new(Form::Nil)))), _ => None, } } } impl FormT for Form { fn sym(&self) -> Option<&str> { match self { Form::Symbol(s) => Some(s), _ => None, } } fn pair(&self) -> Option<(Rc,Rc)> { match self { Form::Pair(car, cdr) => Some((Rc::clone(car),Rc::clone(cdr))), _ => None, } } fn car(&self) -> Option> { match self { Form::Pair(car, _cdr) => Some(Rc::clone(car)), _ => None, } } fn cdr(&self) -> Option> { match self { Form::Pair(_car, cdr) => Some(Rc::clone(cdr)), _ => None, } } fn is_nil(&self) -> bool { match self { Form::Nil => true, _ => false, } } fn call(&self, p: Rc, e: Rc, nc: Box>, metac: Cont) -> Cursor { match self { Form::PrimComb{eval_limit, ins} => { Cursor { f: Rc::new(Form::Nil), c: Cont::PramEval { eval_limit: *eval_limit, to_eval: p, collected: None, e, ins: *ins, nc: nc }, metac } } Form::DeriComb {se, de, params, body} => { let mut new_e = Rc::clone(se); if let Some(de) = de { new_e = assoc(&de, Rc::clone(&e), new_e); } new_e = assoc(¶ms, p, new_e); Cursor { f: Rc::clone(body), c: Cont::Eval { e: new_e, nc: nc }, metac } } Form::ContComb(c) => { Cursor { f: p.car().unwrap(), c: Cont::Eval { e, nc: Box::new(c.clone()) }, metac: Cont::CatchRet { nc: nc, restore_meta: Box::new(metac) } } } _ => { panic!("Tried to call not a Prim/DeriComb/ContComb {:?}, nc was {:?}", self, nc); } } } fn impl_prim(ins: PrimCombI, e: Rc, ps: Vec>, c: Cont, metac: Cont) -> Cursor { match ins { PrimCombI::Eval => Cursor { f: Rc::clone(&ps[0]), c: Cont::Eval { e: Rc::clone(&ps[1]), nc: Box::new(c) }, metac }, PrimCombI::Vau => { let de = ps[0].sym().map(|s| s.to_owned()); let params = ps[1].sym().unwrap().to_owned(); let body = Rc::clone(&ps[2]); Cursor { f: Rc::new(Form::DeriComb { se: e, de, params, body }), c, metac } }, PrimCombI::If => if ps[0].truthy() { Cursor { f: Rc::clone(&ps[1]), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } } else { Cursor { f: Rc::clone(&ps[2]), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } }, PrimCombI::Reset => Cursor { f: Rc::clone(&ps[0]), c: Cont::Eval { e: e, nc: Box::new(Cont::MetaRet) }, metac: Cont::CatchRet { nc: Box::new(c), restore_meta: Box::new(metac) } }, PrimCombI::Shift => Cursor { f: Rc::clone(&ps[0]), c: Cont::Call { p: Rc::new(Form::Pair(Rc::new(Form::ContComb(c)), Rc::new(Form::Nil))), e: e, nc: Box::new(Cont::MetaRet) }, // I think this is unnecessary and can just be "metac }," // because reset puts this metac in metac: Cont::CatchRet { nc: Box::new(metac.clone()), restore_meta: Box::new(metac) } }, PrimCombI::Assert => { let thing = Rc::clone(&ps[0]); if !thing.truthy() { println!("Assert failed: {:?}", thing); } assert!(thing.truthy()); Cursor { f: Rc::clone(&ps[1]), c: Cont::Eval { e: e, nc: Box::new(c) }, metac } }, PrimCombI::Cell => Cursor { f: Rc::new(Form::Cell(RefCell::new(Rc::clone(&ps[0])))), c, metac }, PrimCombI::Set => match &*ps[0] { Form::Cell(cell) => Cursor { f: cell.replace(Rc::clone(&ps[1])), c, metac }, _ => panic!("set on not cell"), }, PrimCombI::Get => match &*ps[0] { Form::Cell(cell) => Cursor { f: Rc::clone(&cell.borrow()), c, metac }, _ => panic!("get on not cell"), }, PrimCombI::Cons => Cursor { f: Rc::new(Form::Pair(Rc::clone(&ps[0]), Rc::clone(&ps[1]))), c, metac }, PrimCombI::Car => Cursor { f: ps[0].car().unwrap(), c, metac }, PrimCombI::Cdr => Cursor { f: ps[0].cdr().unwrap(), c, metac }, PrimCombI::Quote => Cursor { f: Rc::clone(&ps[0]), c, metac }, PrimCombI::Eq => Cursor { f: Rc::new(Form::Bool(ps[0] == ps[1])), c, metac }, PrimCombI::Lt => Cursor { f: Rc::new(Form::Bool(ps[0].int().unwrap() < ps[1].int().unwrap())), c, metac }, PrimCombI::LEq => Cursor { f: Rc::new(Form::Bool(ps[0].int().unwrap() <= ps[1].int().unwrap())), c, metac }, PrimCombI::Gt => Cursor { f: Rc::new(Form::Bool(ps[0].int().unwrap() > ps[1].int().unwrap())), c, metac }, PrimCombI::GEq => Cursor { f: Rc::new(Form::Bool(ps[0].int().unwrap() >= ps[1].int().unwrap())), c, metac }, PrimCombI::Plus => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() + ps[1].int().unwrap())), c, metac }, PrimCombI::Minus => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() - ps[1].int().unwrap())), c, metac }, PrimCombI::Mult => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() * ps[1].int().unwrap())), c, metac }, PrimCombI::Div => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() / ps[1].int().unwrap())), c, metac }, PrimCombI::Mod => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() % ps[1].int().unwrap())), c, metac }, PrimCombI::And => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() & ps[1].int().unwrap())), c, metac }, PrimCombI::Or => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() | ps[1].int().unwrap())), c, metac }, PrimCombI::Xor => Cursor { f: Rc::new(Form::Int(ps[0].int().unwrap() ^ ps[1].int().unwrap())), c, metac }, PrimCombI::CombP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::PrimComb { .. } => true, Form::DeriComb { .. } => true, _ => false, })), c, metac }, PrimCombI::CellP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::Cell(_c) => true, _ => false, })), c, metac }, PrimCombI::PairP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::Pair(_a,_b) => true, _ => false, })), c, metac }, PrimCombI::SymbolP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::Symbol(_) => true, _ => false, })), c, metac }, PrimCombI::IntP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::Int(_) => true, _ => false, })), c, metac }, PrimCombI::BoolP => Cursor { f: Rc::new(Form::Bool(match &*ps[0] { Form::Bool(_) => true, _ => false, })), c, metac }, PrimCombI::NilP => Cursor { f: Rc::new(Form::Bool(ps[0].is_nil())), c, metac }, } } } fn assoc(k: &str, v: Rc, l: Rc) -> Rc { Rc::new(Form::Pair( Rc::new(Form::Pair( Rc::new(Form::Symbol(k.to_owned())), v)), l)) } pub fn assoc_vec(kvs: Vec<(&str, Rc)>) -> Rc { let mut to_ret = Rc::new(Form::Nil); for (k, v) in kvs { to_ret = assoc(k, v, to_ret); } to_ret } // Have eval?/maybe Cont?/maybe Cursor? parameterized on value type? // Parameterized on prim implementation? // Should opt impl use same prim implementation but trace values through accessors/constructors? // with some special handling of If/Vau/etc? pub fn root_env() -> Rc { assoc_vec(vec![ ("eval", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Eval })), ("vau", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Vau })), ("if", Rc::new(Form::PrimComb { eval_limit: 1, ins: PrimCombI::If })), ("reset", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Reset })), ("shift", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Shift })), ("cell", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cell })), ("set", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Set })), ("get", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Get })), ("cons", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cons })), ("car", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Car })), ("cdr", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Cdr })), ("quote", Rc::new(Form::PrimComb { eval_limit: 0, ins: PrimCombI::Quote })), ("assert", Rc::new(Form::PrimComb { eval_limit: 1, ins: PrimCombI::Assert })), ("=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Eq })), ("<", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Lt })), ("<=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::LEq })), (">", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Gt })), (">=", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::GEq })), ("+", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Plus })), ("-", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Minus })), ("*", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Mult })), ("/", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Div })), ("%", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Mod })), ("&", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::And })), ("|", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Or })), ("^", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::Xor })), ("comb?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::CombP })), ("cell?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::CellP })), ("pair?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::PairP })), ("symbol?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::SymbolP })), ("int?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::IntP })), ("bool?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::BoolP })), ("nil?", Rc::new(Form::PrimComb { eval_limit: -1, ins: PrimCombI::NilP })), ("true", Rc::new(Form::Bool(true))), ("false", Rc::new(Form::Bool(false))), ("nil", Rc::new(Form::Nil)), ]) }