-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmocha.h
362 lines (320 loc) · 7.27 KB
/
mocha.h
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
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
#ifndef MOCHA_H
#define MOCHA_H
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <fstream>
#include <cstdlib>
#include <map>
struct filevector
{
unsigned int line;
unsigned int offset;
/*
The number of spaces before this vector
*/
unsigned int numspaces;
};
struct token {
std::string name;
std::string value;
std::vector<token*> tokens;
int precedence;
filevector vector;
void print(std::string pre = "");
std::string spacing(int i);
void debug(int spcing = 0);
token();
~token();
};
// char
// uchar
// short
// ushort
// int
// uint
// long
// ulong
// float
// double
// pointer
#define PUSH_CHAR 0
#define PUSH_UCHR 1
#define PUSH_SHRT 2
#define PUSH_USHT 3
#define PUSH_INTR 4
#define PUSH_UINT 5
#define PUSH_LONG 6
#define PUSH_ULNG 7
#define PUSH_UPTR 8
#define PUSH_UOBJ 9
#define POP 10
#define PRT 11
#define ADD 12
#define MUL 13
#define SUB 14
#define DIV 15
#define MOD 16
#define MRK 17
#define GTO 18
#define IF 19
#define ELSEIF 20
#define ELSE 21
#define WHILE 22
#define CAST_CHAR 23
#define CAST_UCHR 24
#define CAST_SHRT 25
#define CAST_USHT 26
#define CAST_INTR 27
#define CAST_UINT 28
#define CAST_LONG 29
#define CAST_ULNG 30
#define CAST_UPTR 31
#define CAST_UOBJ 32
#define LOAD_CHAR 33
#define LOAD_UCHR 34
#define LOAD_SHRT 35
#define LOAD_USHT 36
#define LOAD_INTR 37
#define LOAD_UINT 38
#define LOAD_LONG 39
#define LOAD_ULNG 40
#define LOAD_UPTR 41
#define LOAD_UOBJ 42
#define MOD_CHAR 43
#define MOD_UCHR 44
#define MOD_SHRT 45
#define MOD_USHT 46
#define MOD_INTR 47
#define MOD_UINT 48
#define MOD_LONG 49
#define MOD_ULNG 50
#define MOD_UPTR 51
#define MOD_UOBJ 52
//#define CLASS 256
//#define FUNCTION 258
//#define CHAR 257
//#define CHARU 257
//#define INT 257
//#define INT 257
//#define INT 257
//#define INT 257
//#define INT 257
//#define INT 257
//namespace MochaRuntimeEnvironment
//{
// template<typename T> struct Buffer
// {
// T* mBuffer;
// unsigned long index;
// unsigned long size;
//
// void allocate(unsigned long size)
// {
// mBuffer = malloc(sizeof(T) * size);
// index = 0;
// this->size = size;
// }
//
// void reset()
// {
// index = 0;
// }
//
// unsigned long remaining()
// {
// return size - index;
// }
//
// void push(T t)
// {
// mBuffer[index++] = t;
// }
//
// T get()
// {
// return mBuffer[index++];
// }
// };
//
// struct Stack
// {
// enum { CHAR, UCHAR, SHORT, USHORT, INT, UINT, LONG, ULONG, OBJECT, POINTER, SMARTPOINTER };
// std::vector<unsigned char> main;
// std::vector<unsigned int> indx;
// std::vector<unsigned char> typs;
// unsigned int index;
//
// void push_char(char c)
// {
// main.push_back(c);
// indx.push_back(1);
// typs.push_back(CHAR);
// index++;
// }
//
// void push_uchar(unsigned char c)
// {
// main.push_back(c);
// indx.push_back(1);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push_short(short c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// indx.push_back(2);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push_ushort(unsigned short c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// indx.push_back(2);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push_int(int c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// main.push_back((&c)[2]);
// main.push_back((&c)[3]);
// indx.push_back(4);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push_uint(unsigned int c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// main.push_back((&c)[2]);
// main.push_back((&c)[3]);
// indx.push_back(4);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push(long c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// main.push_back((&c)[2]);
// main.push_back((&c)[3]);
// main.push_back((&c)[4]);
// main.push_back((&c)[5]);
// main.push_back((&c)[6]);
// main.push_back((&c)[7]);
// indx.push_back(8);
// typs.push_back(UCHAR);
// index++;
// }
//
// void push(unsigned long c)
// {
// main.push_back((&c)[0]);
// main.push_back((&c)[1]);
// main.push_back((&c)[2]);
// main.push_back((&c)[3]);
// main.push_back((&c)[4]);
// main.push_back((&c)[5]);
// main.push_back((&c)[6]);
// main.push_back((&c)[7]);
// indx.push_back(8);
// typs.push_back(UCHAR);
// index++;
// }
// };
//
// struct alu
// {
// void add_d(Stack& stack)
// {
// }
// };
//
// void addition(Stack& stack)
// {
// }
//
// void multiply(Stack& stack)
// {
// }
//
// void run(Buffer<unsigned short> buffer)
// {
// Stack stack;
//
// while (buffer.remaining() > 0)
// {
// unsigned short bytecode_i = buffer.get();
//
// switch (bytecode_i)
// {
// case ADD: addition(stack);
// case SUB: addition(stack);
// case DIV: addition(stack);
// case MUL: multiply(stack);
// case MOD: addition(stack);
//
// default:
// break;
// }
// }
// }
//}
#define token_stack std::vector<token*>
#define remaining_ (tokens.size() - vector_index)
#define previewP (vector_index > 0 ? vector_index - 1 : 0)
#define previewN (vector_index < (tokens.size() - 1) ? vector_index + 1 : tokens.size() - 1)
#define Token(x) token* x = new token()
class Parser
{
public:
bool parseBody(token_stack*tns, token_stack*tokenout, int&vector_index, std::map<unsigned int, token_stack*>& referenceMap);
bool parseAssertion(token_stack*tns, token_stack*tokenout, int&vector_index);
//bool parseParenthesis(token_stack*tns, token_stack*tokenout, int&vector_index);
//bool parseBraces(token_stack*tns, token_stack*tokenout, int&vector_index);
//bool parseClass(token_stack*tns, token_stack*tokenout, int&vector_index);
//bool parseMathOperator(token_stack*tns, token_stack*tokenout, int&vector_index);
//bool parseBoolOperator(token_stack*tns, token_stack*tokenout, int&vector_index);
bool parse(token_stack* tokns, token_stack* tokenout, int& vector_index);
token_stack parse(token_stack& tokens);
};
#undef token_stack
class MochaLexer
{
public:
#define checkIndex(x, y) ((x >= y) ? 0 : x ++)
#define checkIndex1(x, y) ((x >= y) ? 0 : x)
#define checkIndex0(x) ((x <= 0) ? 0 : x - 1)
std::map<std::string, std::string> specials;
std::vector<std::string> keywords;
std::map<std::string, std::string> types;
std::map<std::string, int> precedence;
bool hasNext(const std::string string, int index);
char getNext(const std::string string, int index);
bool isSpecial(const std::string str, std::vector<token*>& tokens, const int line, const int offset, const int spaces);
bool isKeyword(const std::string str, std::vector<token*>& tokens);
std::string typeof(std::string& str);
std::string chartypeof(std::string& c);
int getprecedence(std::string& c);
void loop(std::vector<token*>& tokens, std::string& program, std::string& builder, int& i, int& offset, int& spaces, int& line, bool& countspaces, bool& isIdentifier);
std::vector<token*> lex(std::string program, std::map<std::string, std::string> lexmap);
void compile(std::string program);
std::string loadText(std::string location);
std::string loadSpecials(std::string location);
std::string loadKeywords(std::string location);
std::string loadPrecedence(std::string location);
std::string loadncheck(std::string& s, std::ifstream& f);
};
#endif !MOCHA_H