-
Notifications
You must be signed in to change notification settings - Fork 0
/
line.c
226 lines (214 loc) · 5.96 KB
/
line.c
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
#include "line.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "stdcall.h"
#include "parse.h"
#include "parsetree.h"
#include "varlist.h"
line * newLine(char *addline){
char buffer[200];
char *pos= addline;
char *target = buffer;
line *newline = (line *) my_malloc(sizeof(line));
if (!isdigit(*pos)){
//printf("Invalid line - must start with line number: %s", addline);
return NULL;
}
while (isdigit(*pos)){
*(target++)= *(pos++);
}
*target = '\0';
//sscanf(buffer,"%d", &(newline->lineno));
newline->lineno = read_int(buffer);
pos++;
strcpy(newline->instruction, pos);
newline->next = NULL;
newline->prev = NULL;
return newline;
}
line * insertLine(line *list, line *toinsert){
line *position = list;
if (!list)
return toinsert;
/*equal to head of list*/
if (toinsert->lineno == list->lineno){
toinsert->next = list->next;
my_free(list);
return toinsert;
}
/*less than head of list, make new head*/
if (toinsert->lineno < list->lineno){
list->prev = toinsert;
toinsert->next = list;
return toinsert;
}
while (position->next){
/*equal to position but not at head of list, replace*/
if (position->lineno == toinsert->lineno){
position->prev->next = toinsert;
toinsert->next = position->next;
my_free(position);
return list;
}
/*insert sorted*/
if (position->lineno > toinsert->lineno){
toinsert->prev = position->prev;
toinsert->next = position;
position->prev->next = toinsert;
position->prev = toinsert;
return list;
}
position = position->next;
}
/*replace end of list*/
if (position->lineno == toinsert->lineno){
position->prev->next = toinsert;
toinsert->next = position->next;
my_free(position);
return list;
}
/*append to end of list*/
if (position->lineno > toinsert->lineno){
toinsert->prev = position->prev;
toinsert->next = position;
position->prev->next = toinsert;
position->prev = toinsert;
return list;
}
position->next = toinsert;
toinsert->prev = position;
return list;
}
void printList(line *head)
{
while (head){
//printf("%d %s\n", head->lineno, head->instruction);
head = head->next;
}
return;
}
line *executeLine(line *toexec, var *varlist){
char tmpbuffer[100];
char *despaced = NULL;
evaltree *root = NULL;
char * startpos = NULL;
int counter = 0;
root = genNewNode();
if (!toexec){
return NULL;
}
despaced = deSpace(toexec->instruction);
startpos = toexec->instruction;
if (strncmp(toexec->instruction, "SET", 3)==0){
startpos = readVarName(startpos+4, tmpbuffer);
//skip equals when parsing
startpos++;
//tmpbuffer[strlen(tmpbuffer)-1]= '\0';
buildTree(startpos, root, 0);
calcTree(root, varlist);
setVar(varlist, tmpbuffer, root->result);
}
if (strncmp(toexec->instruction, "PRINT", 5)==0){
startpos+=6;
buildTree(startpos, root, 0);
calcTree(root, varlist);
if (root->result.type == integer){
inttoa(root->result.value.i, tmpbuffer);
printf("%s\n", tmpbuffer);
printf("%d\n", root->result.value.i);
}
if (root->result.type == str)
printf("%s\n", root->result.value.s);
}
if (strncmp(toexec->instruction, "GOTO", 5)==0){
startpos+=5;
buildTree(startpos, root, 0);
calcTree(root, varlist);
if (root->result.value.i == toexec->lineno){
//printf ("Pointless infinite loop at line %d\n", toexec->lineno);
return NULL;
}
if (root->result.value.i < toexec->lineno){
while (toexec->prev){
toexec = toexec->prev;
if (toexec->lineno == root->result.value.i)
return toexec;
}
return NULL;
}
if (root->result.value.i > toexec->lineno){
while (toexec->next){
toexec = toexec->next;
if (toexec->lineno == root->result.value.i)
return toexec;
}
return NULL;
}
return NULL;
}
if (strncmp(toexec->instruction, "IF", 2)==0){
startpos+=3;
buildTree(startpos, root, 0);
calcTree(root, varlist);
if (root->result.value.i != 0){
return toexec->next;
}
while(toexec->next){
toexec=toexec->next;
//keep track of nested if then else
if (strncmp(toexec->instruction, "IF",2)==0)
counter++;
if ((strncmp(toexec->instruction, "ELSE", 4)==0)&&counter==0)
return toexec->next;
if (strncmp(toexec->instruction, "END IF", 6)==0)
counter--;
}
return NULL;
}
if (strncmp(toexec->instruction, "ELSE", 4)==0){
while (toexec->next){
toexec=toexec->next;
if (strncmp(toexec->instruction, "IF",2)==0)
counter++;
if ((strncmp(toexec->instruction,"END IF", 6)==0)&&counter==0)
return toexec->next;
if (strncmp(toexec->instruction, "END IF", 6)==0)
counter--;
}
return NULL;
}
if (strncmp(toexec->instruction, "WHILE", 5)==0){
// printf("In While at line %d", toexec->lineno);
startpos+=6;
buildTree(startpos, root,0);
calcTree(root,varlist);
if (root->result.value.i !=0)
return toexec->next;
while(toexec->next){
toexec = toexec->next;
if (strncmp(toexec->instruction, "WHILE", 5)==0)
counter++;
if (strncmp(toexec->instruction, "WEND", 4)==0&&counter==0)
return toexec->next;
if (strncmp(toexec->instruction, "WEND", 4)==0)
counter--;
}
return NULL;
}
if (strncmp(toexec->instruction, "WEND", 4)==0){
while (toexec->prev){
toexec=toexec->prev;
if (strncmp(toexec->instruction, "WEND", 4)==0)
counter++;
if (strncmp(toexec->instruction, "WHILE", 5)==0&&counter==0)
return toexec;
if (strncmp(toexec->instruction, "WHILE", 5)==0)
counter--;
}
return NULL;
}
my_free(despaced);
freeTree(root);
return toexec->next;
}