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
|
local chupacabra = {}
-- Parse a string into a list of tokens
function chupacabra.tokenize(s)
local tokens = {}
local array = nil
for token in s:gmatch("%S+") do
if array then
array = array .. " " .. token
if token:find("]$") then
table.insert(tokens, array)
array = nil
end
elseif token:find("^%[") then
array = token
else
table.insert(tokens, token)
end
end
return tokens
end
function chupacabra.evaluate(tokens, context)
local stack = {}
for _, token in ipairs(tokens) do
if tonumber(token) then
table.insert(stack, tonumber(token))
elseif token:match("^%b[]$") then
local array = {}
for number in token:sub(2, -2):gmatch("%S+") do
table.insert(array, tonumber(number))
end
table.insert(stack, array)
elseif token == ".." then
local array = {}
for i = 1, #stack do
table.insert(array, stack[i])
end
table.insert(stack, array)
elseif token == "@.." then
local result = {}
for i = 1, #stack do
local value = stack[i]
if type(value) == "table" then
for j = 1, #value do
table.insert(result, value[j])
end
else
table.insert(result, value)
end
end
table.insert(stack, result)
elseif token == "." then
table.remove(stack)
elseif token == ":" then
table.insert(stack, stack[#stack])
elseif token == "?" then
local a = table.remove(stack)
local b = table.remove(stack)
table.insert(stack, a)
table.insert(stack, b)
elseif token == "=" then
local b = table.remove(stack)
local a = table.remove(stack)
table.insert(stack, a == b)
elseif token == "@=" then
-- checks if the values of 2 equally lenghted arrays are equal, and returns a bit mask of the differences
local b = table.remove(stack)
local a = table.remove(stack)
if #a ~= #b then
error("Arrays must have equal length")
end
local result = {}
for i = 1, #a do
table.insert(result, a[i] == b[i])
end
table.insert(stack, result)
elseif token == "@" then
local index = table.remove(stack)
local array = table.remove(stack)
table.insert(stack, array[index])
elseif token == "+" then
local b = table.remove(stack)
local a = table.remove(stack)
table.insert(stack, a + b)
elseif token == "-" then
local b = table.remove(stack)
local a = table.remove(stack)
table.insert(stack, a - b)
elseif token == "*" then
local b = table.remove(stack)
local a = table.remove(stack)
table.insert(stack, a * b)
elseif token == "/" then
local b = table.remove(stack)
local a = table.remove(stack)
table.insert(stack, a / b)
elseif token == "@+" then
local a = table.remove(stack)
local b = table.remove(stack)
if type(a) == "table" and type(b) == "table" then
if #a ~= #b then
error("Arrays must have equal length")
end
local result = {}
for i = 1, #a do
table.insert(result, a[i] + b[i])
end
table.insert(stack, result)
elseif type(a) == "table" and type(b) == "number" then
local result = {}
for i = 1, #a do
table.insert(result, a[i] + b)
end
table.insert(stack, result)
elseif type(a) == "number" and type(b) == "table" then
local result = {}
for i = 1, #b do
table.insert(result, a + b[i])
end
table.insert(stack, result)
else
error("Invalid operands for addition")
end
elseif token == "@*" then
local a = table.remove(stack)
local b = table.remove(stack)
if type(a) == "table" and type(b) == "table" then
if #a ~= #b then
error("Arrays must have equal length")
end
local result = {}
for i = 1, #a do
table.insert(result, a[i] * b[i])
end
table.insert(stack, result)
elseif type(a) == "table" and type(b) == "number" then
local result = {}
for i = 1, #a do
table.insert(result, a[i] * b)
end
table.insert(stack, result)
elseif type(a) == "number" and type(b) == "table" then
local result = {}
for i = 1, #b do
table.insert(result, a * b[i])
end
table.insert(stack, result)
else
error("Invalid operands for multiplication")
end
elseif token == "@-" then
local a = table.remove(stack)
local b = table.remove(stack)
if type(a) == "table" and type(b) == "table" then
if #a ~= #b then
error("Arrays must have equal length")
end
local result = {}
for i = 1, #a do
table.insert(result, a[i] - b[i])
end
table.insert(stack, result)
elseif type(a) == "table" and type(b) == "number" then
local result = {}
for i = 1, #a do
table.insert(result, a[i] - b)
end
table.insert(stack, result)
elseif type(a) == "number" and type(b) == "table" then
local result = {}
for i = 1, #b do
table.insert(result, a - b[i])
end
table.insert(stack, result)
else
error("Invalid operands for subtraction")
end
elseif token == "@/" then
local a = table.remove(stack)
local b = table.remove(stack)
if type(a) == "table" and type(b) == "table" then
if #a ~= #b then
error("Arrays must have equal length")
end
local result = {}
for i = 1, #a do
table.insert(result, a[i] / b[i])
end
table.insert(stack, result)
elseif type(a) == "table" and type(b) == "number" then
local result = {}
for i = 1, #a do
table.insert(result, a[i] / b)
end
table.insert(stack, result)
elseif type(a) == "number" and type(b) == "table" then
local result = {}
for i = 1, #b do
table.insert(result, a / b[i])
end
table.insert(stack, result)
else
error("Invalid operands for division")
end
end
end
return table.remove(stack)
end
function chupacabra.run(str, context)
local tokens = chupacabra.tokenize(str)
return chupacabra.evaluate(tokens, context)
end
return chupacabra
|