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
|
#ifndef __LUASL_TREE_H__
#define __LUASL_TREE_H__
//#define LUASL_DEBUG
#include <stddef.h> // So we can have NULL defined.
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include "assert.h"
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stdlib.h>
#include <stdio.h>
#include <limits.h> // For PATH_MAX.
#include "LuaSL_lemon_yaccer.h"
#define YYERRCODE 256
#define YYDEBUG 1
// http://w-hat.com/stackdepth is a useful discussion about some aspects of the LL parser.
typedef struct _allowedTypes allowedTypes;
typedef struct _LSL_Token LSL_Token;
typedef struct _LSL_Leaf LSL_Leaf;
typedef struct _LSL_Parenthesis LSL_Parenthesis;
typedef struct _LSL_Identifier LSL_Identifier;
typedef struct _LSL_Statement LSL_Statement;
typedef struct _LSL_Block LSL_Block;
typedef struct _LSL_Function LSL_Function;
typedef struct _LSL_State LSL_State;
typedef struct _LSL_Script LSL_Script;
extern LSL_Token **tokens;
extern int lowestToken;
typedef int LSL_Type;
typedef enum
{
OM_LSL,
OM_LUA
} outputMode;
typedef void (*outputToken) (FILE *file, outputMode mode, LSL_Leaf *content);
typedef LSL_Leaf * (*evaluateToken) (LSL_Leaf *content, LSL_Leaf *left, LSL_Leaf *right);
//#ifndef FALSE
//typedef enum
//{
// FALSE = 0,
// TRUE = 1
//} boolean;
//#endif
typedef enum
{
LSL_NONE = 0,
LSL_LEFT2RIGHT = 1,
LSL_RIGHT2LEFT = 2,
LSL_INNER2OUTER = 4,
LSL_UNARY = 8,
LSL_ASSIGNMENT = 16,
LSL_CREATION = 32,
LSL_NOIGNORE = 64
} LSL_Flags;
typedef enum
{
OT_nothing,
OT_bool,
OT_integer,
OT_float,
OT_key,
OT_list,
OT_rotation,
OT_string,
OT_vector,
OT_other,
OT_boolBool,
OT_intInt,
OT_intFloat,
OT_floatInt,
OT_floatFloat,
OT_keyString,
OT_stringKey,
OT_stringString,
OT_listList,
OT_listInt,
OT_listFloat,
OT_intList,
OT_floatList,
OT_listOther,
OT_vectorVector,
OT_vectorFloat,
OT_vectorRotation,
OT_rotationRotation,
OT_otherOther,
OT_invalid
} opType;
typedef enum
{
ST_NONE = 0,
ST_ASSIGNMENT = 1, // -= *= /=
ST_BIT_NOT = 2, // ~
ST_BOOL_NOT = 4, // !
ST_BITWISE = 8, // & | ^ << >>
ST_BOOLEAN = 16, // && !!
ST_COMPARISON = 32, // < > <= >=
ST_CONCATENATION = 64, // = +=
ST_EQUALITY = 128, // == !=
ST_ADD = 512, // +
ST_SUBTRACT = 1024, // -
ST_NEGATE = 2048, // -
ST_MULTIPLY = 4096, // * /
ST_MODULO = 8192 // % %=
} opSubType;
struct _allowedTypes
{
opType result;
const char *name;
int subTypes;
};
struct _LSL_Token
{
LSL_Type type;
opSubType subType;
const char *token;
LSL_Flags flags;
outputToken output;
evaluateToken evaluate;
};
struct _LSL_Leaf
{
LSL_Leaf *left;
LSL_Leaf *right;
LSL_Token *token;
Eina_Strbuf *ignorableText;
int line, column, len;
opType basicType;
union
{
float floatValue;
float vectorValue[3];
float rotationValue[4];
int integerValue;
LSL_Leaf *listValue;
const char *stringValue;
opType operationValue;
LSL_Parenthesis *parenthesis;
LSL_Identifier *identifierValue;
LSL_Statement *statementValue;
LSL_Block *blockValue;
LSL_Function *functionValue;
LSL_State *stateValue;
LSL_Script *scriptValue;
} value;
};
struct _LSL_Parenthesis
{
LSL_Leaf *left;
LSL_Leaf *contents;
LSL_Leaf *right;
LSL_Type type;
};
struct _LSL_Identifier // For variables and function parameters.
{
const char *name;
LSL_Leaf value;
};
struct _LSL_Statement
{
LSL_Leaf *expressions; // For things like a for statement, might hold three expressions.
LSL_Type type; // Expression type.
};
struct _LSL_Block
{
LSL_Block *outerBlock;
// Eina_Hash *statements; // Probably should be some sort of eina list.
Eina_Hash *variables; // Those variables in this scope.
LSL_Function *function; // A pointer to the function if this block is a function.
};
struct _LSL_Function
{
const char *name;
LSL_Leaf *type;
LSL_Leaf *params; // Probably should be some sort of eina list.
Eina_Hash *variables; // And this actually duplicates params.
LSL_Leaf *block;
};
struct _LSL_State
{
const char *name;
LSL_Leaf *block;
Eina_Hash *handlers;
};
struct _LSL_Script
{
const char *name;
Eina_Hash *functions;
Eina_Hash *states;
Eina_Hash *variables;
};
/* Tracking variables.
There are global variables, block local variables, and function parameters.
For outputting Lua, which is the ultimate goal -
track order, name, and type.
For looking them up during the compile -
quick access from name.
For validating them during compile -
track type.
For outputting LSL to double check -
track order, name, type, and white space.
For executing directly from the AST -
track order, name, type, and value.
In this case, order is only important for functions.
We can assume that names are stringshared. This means we only have to
compare pointers. It also means the same name stored at diffferent
scopes, must be stored in separate structures, coz the pointers are the
same.
Order is taken care of by the AST anyway, but for somethings we want to
condense the AST down to something more efficient.
On the other hand, no need to micro optimise it just yet, we should be
able to try out other data structures at a later date, then benchmark
them with typical scripts.
Right now I see nothing wrong with the current use of hash for script
and block variables. The same for script states and functions, as wall
as state functions. Though in the near future, they will have similar
problems to functcions I think - the need to track order and white
space.
Function params though have gotten unwieldy. Each param ends up with
AST nodes for itself, it's type, it's own paramlist node, and the comma.
The paramlist nodes are the excessive bits, the rest are needed to track
the white space.
*/
/* General design.
NOTE We should be able to remove the white space tracking at compile
time, as it's only a debugging aid. Will be a performance and memory
gain for productidon use. Tracking values on the other hand will still
be useful for constants.
The compile process starts with turning tokens into AST nodes connected
in a tree. During that process the parser wants to condense nodes down
to more efficient data structures. This is a good idea, as we will
spend a fair amount of time looking up names, no matter which part of
the process is important at the time.
Once the parser has condensed things down, it only deals with the
condensed nodes. So we can get rid of some of the AST parts at this
time, so long as we keep the relevant information. This is what the
other data structures above are for.
*/
// Define the type for flex and lemon.
#define YYSTYPE LSL_Leaf
typedef struct
{
gameGlobals *game;
void *scanner; // This should be of type yyscan_t, which is typedef to void * anyway, but that does not get defined until LuaSL_lexer.h, which depends on this struct being defined first.
int argc;
char **argv;
char fileName[PATH_MAX];
FILE *file;
LSL_Leaf *ast;
LSL_Script script;
Eina_Strbuf *ignorableText;
LSL_Leaf *lval;
int column, line;
LSL_Block *currentBlock;
} LuaSL_compiler;
#ifndef excludeLexer
#include "LuaSL_lexer.h"
#endif
void burnLeaf(void *data);
LSL_Leaf *addFunction(LuaSL_compiler *compiler, LSL_Leaf *type, LSL_Leaf *identifier, LSL_Leaf *open, LSL_Leaf *params, LSL_Leaf *close);
LSL_Leaf *addFunctionBody(LuaSL_compiler *compiler, LSL_Leaf *function, LSL_Leaf *block);
LSL_Leaf *addOperation(LuaSL_compiler *compiler, LSL_Leaf *left, LSL_Leaf *lval, LSL_Leaf *right);
LSL_Leaf *addParameter(LuaSL_compiler *compiler, LSL_Leaf *type, LSL_Leaf *newParam);
LSL_Leaf *addParenthesis(LSL_Leaf *lval, LSL_Leaf *expr, LSL_Type type, LSL_Leaf *rval);
LSL_Leaf *addState(LuaSL_compiler *compiler, LSL_Leaf *identifier, LSL_Leaf *block);
LSL_Leaf *addStatement(LSL_Leaf *lval, LSL_Type type, LSL_Leaf *expr);
LSL_Leaf *addTypecast(LSL_Leaf *lval, LSL_Leaf *type, LSL_Leaf *rval, LSL_Leaf *expr);
LSL_Leaf *addVariable(LuaSL_compiler *compiler, LSL_Leaf *type, LSL_Leaf *identifier, LSL_Leaf *assignment, LSL_Leaf *expr);
void beginBlock(LuaSL_compiler *compiler, LSL_Leaf *block);
LSL_Leaf *checkVariable(LuaSL_compiler *compiler, LSL_Leaf *identifier);
LSL_Leaf *collectParameters(LuaSL_compiler *compiler, LSL_Leaf *list, LSL_Leaf *comma, LSL_Leaf *newParam);
void endBlock(LuaSL_compiler *compiler, LSL_Leaf *block);
void *ParseAlloc(void *(*mallocProc)(size_t));
void ParseTrace(FILE *TraceFILE, char *zTracePrompt);
void Parse(void *yyp, int yymajor, LSL_Leaf *yyminor, LuaSL_compiler *compiler);
void ParseFree(void *p, void (*freeProc)(void*));
#endif // __LUASL_LSL_TREE_H__
|