forked from sol-prog/schm
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProcedures.cpp
107 lines (91 loc) · 3.22 KB
/
Procedures.cpp
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
//Basic procedures:
//Each procedure receives as input a vector of strings and returns a string
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <cstdlib>
using namespace std;
#include "Procedures.h"
//Print one or more variables; e.g. (print aa), (print aa bb cc)
string print(vector<string>&vv) {
for (int i = 0; i < vv.size(); i++) {
cout << vv[i] << " ";
}
cout << endl;
return ("");
}
//Add one or more variables; e.g. (+ aa), (+ aa bb cc)
string add(vector<string>&vv) {
if (vv.size() == 0)return "Wrong number of arguments for procedure +";
stringstream ss;
double sum = strtod(vv[0].c_str(), NULL);
for (size_t i = 1; i < vv.size(); i++)sum += strtod(vv[i].c_str(), NULL);
ss << sum;
return ss.str();
}
//Diff, e.g.: (- aa bb)
string diff(vector<string>&vv) {
if (vv.size() == 0)return "Wrong number of arguments for procedure -";
stringstream ss;
double sum = strtod(vv[0].c_str(), NULL);
for (size_t i = 1; i < vv.size(); i++)sum -= strtod(vv[i].c_str(), NULL);
ss << sum;
return ss.str();
}
//Division, e.g. (/ aa bb cc ...)
string divv(vector<string>&vv) {
if (vv.size() == 0)return "Wrong number of arguments for procedure /";
stringstream ss;
double sum = strtod(vv[0].c_str(), NULL);
for (size_t i = 1; i < vv.size(); i++)sum /= strtod(vv[i].c_str(), NULL);
ss << sum;
return ss.str();
}
//Product, e.g. (* aa bb cc ...)
string prod(vector<string>&vv) {
if (vv.size() == 0)return "Wrong number of arguments for procedure *";
stringstream ss;
double sum = strtod(vv[0].c_str(), NULL);
for (size_t i = 1; i < vv.size(); i++)sum *= strtod(vv[i].c_str(), NULL);
ss << sum;
return ss.str();
}
//Quit the interpreter, e.q. (quit) or (exit)
string scheme_quit(vector<string>&vv) {
exit(1);
return "ok";
}
//Logical operators: <, <=, >, >=, =, !=
string less_than(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++) {
if (!(strtod(vv[i].c_str(), NULL) < strtod(vv[i + 1].c_str(), NULL))) return "#f";
}
return "#t";
}
string less_or_equal(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++)if (!(strtod(vv[i].c_str(), NULL) <= strtod(vv[i + 1].c_str(), NULL))) return "#f";
return "#t";
}
string great_than(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++)if (!(strtod(vv[i].c_str(), NULL) > strtod(vv[i + 1].c_str(), NULL))) return "#f";
return "#t";
}
string great_or_equal(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++)if (!(strtod(vv[i].c_str(), NULL) >= strtod(vv[i + 1].c_str(), NULL))) return "#f";
return "#t";
}
string equall(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++)if (!(strtod(vv[i].c_str(), NULL) == strtod(vv[i + 1].c_str(), NULL))) return "#f";
return "#t";
}
string not_equal(vector<string>&vv) {
if (vv.size() == 1)return "#t";
for (size_t i = 0; i < vv.size() - 1; i++)if (!(strtod(vv[i].c_str(), NULL) != strtod(vv[i + 1].c_str(), NULL))) return "#f";
return "#t";
}