1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
pub mod step;
pub mod util;
pub mod subst;
pub mod display;
/// A leaf node for S-Expressions.
///
/// May represent built-in operators,
/// variables, functions (to be added) or values.
#[derive(Debug)]
#[derive(PartialEq)]
#[derive(Clone)]
pub enum SLeaf {
Add,
Sub,
Mul,
Div,
Eq,
Neq,
Gt,
Lt,
Ge,
Le,
And,
Or,
Not,
Xor,
Quote,
Vector,
Int(i32),
True,
False,
Var(String),
Nil,
}
/// An S-Expression; the defining structure of the language.
///
/// This structure is not intended to correspond with
/// IETF-standardized s-expressions; they are only inspiration.
#[derive(Debug)]
#[derive(PartialEq)]
#[derive(Clone)]
pub enum SExp {
SCons(Box<SExp>, Box<SExp>),
Atom(SLeaf),
}
use SExp::*;
use SLeaf::*;
impl SExp {
pub fn is_value(&self) -> bool {
match self {
SCons(a, b) =>
(**a == Atom(Quote) || **a == Atom(Vector))
&& b.consists_of_values(),
Atom(Var(_)) => false,
Atom(_) => true,
}
}
pub fn consists_of_values(&self) -> bool {
self.is_value() || match self {
SCons(a, b) if (*a).is_value() => b.consists_of_values(),
_ => false
}
}
}
|
