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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
|
#[macro_use]
extern crate pest_derive;
#[macro_use]
extern crate pest;
mod parser {
#[derive(Parser)]
#[grammar = "grammar.pest"]
pub struct Parser;
}
mod ast {
use super::parser::Rule;
use std::rc::Rc;
pub fn from_parse_tree(parse_tree: &mut pest::iterators::Pairs<Rule>) -> Program {
let root = parse_tree.next().unwrap();
match root.as_rule() {
Rule::program => {
let statements_with_eoi: Vec<pest::iterators::Pair<Rule>> =
root.into_inner().collect();
let statements_split = statements_with_eoi.split_last().unwrap();
let statements = statements_split.1.to_vec();
statements
.iter()
.map(|s| Statement::from_pair(s.clone()))
.collect()
}
_ => panic!("[ast] first Pair is not a program"),
}
}
pub type Program = Vec<Statement>;
#[derive(Debug)]
pub enum Statement {
Definition {
symbol: Symbol,
expression: Rc<Expression>,
},
Expression(Rc<Expression>),
}
impl Statement {
fn from_pair(pair: pest::iterators::Pair<Rule>) -> Statement {
let def_or_expr = pair.into_inner().next().unwrap();
fn definition_from_pair(pair: pest::iterators::Pair<Rule>) -> Statement {
let mut inner = pair.into_inner();
let symbol = inner.next().unwrap().as_span().as_str();
let expression = inner.next().unwrap();
let expression_inners: Vec<ExpressionInner> = expression
.into_inner()
.map(ExpressionInner::from_pair)
.collect();
Statement::Definition {
symbol: String::from(symbol),
expression: expression_vec_to_tuple(&expression_inners),
}
}
match def_or_expr.as_rule() {
Rule::definition => definition_from_pair(def_or_expr),
Rule::expression => {
let expression_inners: Vec<ExpressionInner> = def_or_expr
.into_inner()
.map(ExpressionInner::from_pair)
.collect();
Statement::Expression(expression_vec_to_tuple(&expression_inners))
}
rule => panic!("[ast] can't make a statement from {:#?}", rule),
}
}
}
#[derive(Debug, Clone)]
pub enum ExpressionInner {
Symbol(Symbol),
IntegerLiteral(IntegerLiteral),
StringLiteral(StringLiteral),
Expression(Rc<Expression>),
}
impl ExpressionInner {
fn from_pair(pair: pest::iterators::Pair<Rule>) -> ExpressionInner {
// println!("ExpressionInner::from_pair pair: {:#?}", pair);
match pair.as_rule() {
Rule::symbol => ExpressionInner::Symbol(string_from_pair(pair)),
Rule::integer_literal => ExpressionInner::IntegerLiteral(integer_from_pair(pair)),
Rule::string_literal => {
let s_with_quotes = string_from_pair(pair);
let mut chars = s_with_quotes.chars();
chars.next();
chars.next_back();
let s = chars.as_str();
ExpressionInner::StringLiteral(String::from(s))
}
Rule::expression => {
let expression_inners: Vec<ExpressionInner> =
pair.into_inner().map(ExpressionInner::from_pair).collect();
ExpressionInner::Expression(expression_vec_to_tuple(&expression_inners))
}
rule => panic!("[ast] can't make an expression element from {:#?}", rule),
}
}
}
#[derive(Debug)]
pub enum Expression {
Unary(ExpressionInner),
Binary(ExpressionInner, ExpressionInner),
}
fn expression_vec_to_tuple(v: &Vec<ExpressionInner>) -> Rc<Expression> {
match v.len() {
1 => Rc::new(Expression::Unary(v[0].clone())),
2 => Rc::new(Expression::Binary(v[0].clone(), v[1].clone())),
_ => todo!("[ast] expr tree generation"),
}
}
pub type IntegerLiteral = i64;
fn integer_from_pair(pair: pest::iterators::Pair<Rule>) -> i64 {
let s = pair.as_span().as_str();
s.parse().unwrap()
}
pub type StringLiteral = String;
fn string_from_pair(pair: pest::iterators::Pair<Rule>) -> String {
String::from(pair.as_span().as_str())
}
pub type Symbol = String;
}
mod runtime {
use super::ast;
use std::collections::HashMap;
use std::rc::Rc;
use std::sync::atomic::{AtomicUsize, Ordering};
#[derive(Debug, Clone)]
pub enum Value {
Integer(i64),
String(String),
Var(usize),
Function(usize, Rc<Value>),
}
static VAR_ID_INC: AtomicUsize = AtomicUsize::new(0);
fn try_evaluate_builtin(symbol: &ast::Symbol) -> Option<Value> {
match symbol.as_str() {
"int.zero" => Some(Value::Integer(0)),
"id" => {
let v = VAR_ID_INC.load(Ordering::Relaxed);
VAR_ID_INC.store(v + 1, Ordering::Relaxed);
Some(Value::Function(v, Rc::new(Value::Var(v))))
}
_ => None,
}
}
fn try_apply_function(func_rc: Rc<Value>, arg: Rc<Value>, bound_v: Option<usize>) -> Rc<Value> {
let func = &*func_rc;
match func {
Value::Function(func_v, body_rc) => {
let v1 = bound_v.unwrap_or(*func_v);
let body = &**body_rc;
match body {
Value::Var(v2) => {
if v1 == *v2 {
arg
} else {
(*body_rc).clone()
}
}
Value::Function(_, _) => try_apply_function((*body_rc).clone(), arg, Some(v1)),
_ => (*body_rc).clone(),
}
}
_ => func_rc,
}
}
fn evaluate_expr(
symbol_table: &HashMap<String, Rc<Value>>,
expression: &ast::Expression,
) -> Rc<Value> {
match expression {
ast::Expression::Unary(inner) => match inner {
ast::ExpressionInner::IntegerLiteral(value) => Rc::new(Value::Integer(*value)),
ast::ExpressionInner::StringLiteral(value) => Rc::new(Value::String(value.clone())),
ast::ExpressionInner::Symbol(value) => {
let builtin_value = try_evaluate_builtin(value);
if builtin_value.is_some() {
return Rc::new(builtin_value.unwrap());
}
let table_lookup_value = symbol_table.get(value);
if table_lookup_value.is_some() {
let lookup_rc = table_lookup_value.unwrap();
return lookup_rc.clone();
}
panic!("[runtime] symbol not defined: {:#?}", value);
}
ast::ExpressionInner::Expression(value_rc) => {
let sub_expr = &**value_rc;
evaluate_expr(symbol_table, sub_expr)
}
},
ast::Expression::Binary(inner1, inner2) => match inner1 {
ast::ExpressionInner::Expression(value_rc) => {
let sub_expr = &**value_rc;
evaluate_expr(symbol_table, sub_expr)
}
ast::ExpressionInner::Symbol(value) => {
let mut lhs_value_rc: Rc<Value>;
if let Some(builtin) = try_evaluate_builtin(value) {
lhs_value_rc = Rc::new(builtin);
} else if let Some(lookup) = symbol_table.get(value) {
lhs_value_rc = *lookup;
} else {
panic!("[runtime] symbol not defined: {:#?}", value);
}
let evaled_arg = evaluate_expr_inner(inner2);
try_apply_function(lhs_value_rc, evaled_arg, None)
}
other => unreachable!(
"[runtime] this should not be on the left side of a binary expression: {:#?}",
other
),
},
}
// println!("[runtime] evaluating expression");
// let head = &expression[0];
// let tail = &expression[1..];
// let arity = tail.len();
// match head {
// ast::ExpressionInner::IntegerLiteral(value) => match arity {
// 0 => Rc::new(Value::Integer(*value)),
// _ => panic!("[runtime] cannot apply integer: {}", value),
// },
// ast::ExpressionInner::StringLiteral(value) => match arity {
// 0 => Rc::new(Value::String(value.clone())),
// _ => panic!("[runtime] cannot apply string: {}", value),
// },
// ast::ExpressionInner::Symbol(value) => match arity {
// 0 => {
// let builtin_value = try_evaluate_builtin(value);
// if builtin_value.is_some() {
// return Rc::new(builtin_value.unwrap());
// }
// let table_lookup_value = symbol_table.get(value);
// if table_lookup_value.is_some() {
// let lookup_rc = table_lookup_value.unwrap();
// return lookup_rc.clone();
// }
// Rc::new(Value::String(String::from("dummy value")))
// }
// 1 => {
// // let arg = &tail[0];
// // let applied = try_apply_function(value, arg, None);
// panic!("should apply function here!")
// }
// _ => unreachable!(
// "[runtime] expression arity >= 2! there must be an error in AST generation"
// ),
// },
// ast::ExpressionInner::Expression(expression) => evaluate_expr(symbol_table, expression),
// }
}
pub fn evaluate(program: &ast::Program) {
let mut symbol_table: HashMap<String, Rc<Value>> = HashMap::new();
for statement in program {
match statement {
ast::Statement::Definition { symbol, expression } => {
println!("[runtime] defining symbol: {:#?}", symbol);
let value = evaluate_expr(&symbol_table, expression);
symbol_table.insert(symbol.clone(), value);
}
ast::Statement::Expression(expression) => {
println!("[runtime] evaluating free-standing expression");
let value = evaluate_expr(&symbol_table, expression);
println!("Result: {:#?}", value);
}
}
}
println!(
"[runtime] evaluation done, symbol_table state dump: {:#?}",
symbol_table
);
}
}
fn main() {
use ast::Program;
use pest::Parser;
use std::env;
use std::fs;
let script_path = env::args().nth(1).expect("no script file specified");
let unparsed_file = fs::read_to_string(script_path).expect("cannot read file");
let parse_tree_result = parser::Parser::parse(parser::Rule::program, &unparsed_file);
if parse_tree_result.is_err() {
println!("{}", parse_tree_result.unwrap_err());
return;
}
let mut parse_tree = parse_tree_result.unwrap();
println!("parse tree = {:#?}", parse_tree);
let syntax_tree: Program = ast::from_parse_tree(&mut parse_tree);
println!("syntax tree = {:#?}", syntax_tree);
runtime::evaluate(&syntax_tree);
}
|