-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathDFA.cpp
More file actions
246 lines (190 loc) · 6.32 KB
/
Copy pathDFA.cpp
File metadata and controls
246 lines (190 loc) · 6.32 KB
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
/***************************************************************************
DFA.cpp - Deterministic Finite Automata
-------------------
begin : Sun Jun 2 2002
copyright : (C) 2002 by Manuel Astudillo
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Lesser General Public License as *
* published by the Free Software Foundation; either version 2 of the *
* License, or (at your option) any later version. *
* *
***************************************************************************/
#include "DFA.h"
DFA::DFA (const DFAStateTable *stateTable, const SymbolTable *symbolTable,
const CharacterSetTable *characterSetTable, integer startState, bool caseSensitive) {
this->startState = startState;
this->stateTable = stateTable;
this->symbolTable = symbolTable;
this->characterSetTable = characterSetTable;
this->caseSensitive = caseSensitive;
errorTab = NULL;
}
DFA::~DFA () {
for (integer j = 0; j < tokens.size(); j++) {
delete tokens[j];
}
delete errorTab;
}
bool DFA::scan (char *text) {
wchar_t *wtext = new wchar_t [strlen(text)+1];
mbstowcs (wtext, text, strlen(text)+1);
bool res = scan (wtext);
delete [] wtext;
return res;
}
bool DFA::scan (wchar_t *text) {
bool commentBlock = false;
bool commentLine = false;
integer currentLine = 1, currentCol = 1, tokenBeginCol = 1;
Token *t = NULL;
wstring tmpImage;
wstring tokenSymbol, tokenImage;
wchar_t currentChar;
integer currentState = startState;
int i=0;//, imgIndex = 0; //Unused variable
integer j;
// Free the memory for every token that might be stored in this vector
for (j = 0; j < tokens.size(); j++) {
delete tokens[j];
}
tokens.clear();
delete errorTab;
errorTab = new ErrorTable();
bool run = true;
while (run) {
if (text[i] == 0) {
// Check if Comment Block not ended
if (commentBlock) {
// Set error and return
errorTab->addError (ERROR_SCAN, END_COMMENT_NOT_FOUND,
NULL, currentLine, tokenBeginCol);
currentState = startState;
tmpImage = L"";
return false;
} else {
run = false;
}
}
if (text[i] == L'\n') {
currentLine++;
currentCol = 1;
if (commentLine) {
commentLine = false;
if (text[i] == 0) {
break;
}
}
}
if (!caseSensitive) {
currentChar = (wchar_t) towlower (text[i]);
} else {
currentChar = (wchar_t) text[i];
}
if (!commentLine) {
tmpImage.append (1,text[i]);
// Check which is the next state
integer e;
bool changedState = false;
for (e = 0; e < stateTable->states[currentState].edges.size(); e++) {
integer index = stateTable->states[currentState].
edges[e].characterSetIndex;
// Check if the current character matchs one of the edge string
wstring edgeString = characterSetTable->characters[index];
integer s = 0;
while (edgeString[s] != 0) {
if (currentChar == edgeString[s]) {
currentState = stateTable->states[currentState].edges[e].targetIndex;
changedState = true;
break;
}
s++;
}
if (changedState) break;
}
if (!changedState) {
// Check if it is an Accept state
if (stateTable->states[currentState].accept) {
i--;
currentCol--;
// If the current character was a \n we have to decrement the line
// counter
if (text[i+1] == L'\n') {
currentLine--;
}
// Check for type of symbol
integer index2 = stateTable->states[currentState].acceptIndex;
switch (symbolTable->symbols[index2].kind) {
// Non terminal symbol
case 0:
// Cannot be
break;
// Terminal symbol
case 1 :
if (!commentBlock) {
// tmpImage[imgIndex-1] = 0;
tokenSymbol = symbolTable->symbols[index2].name;
tokenImage = tmpImage.substr (0, tmpImage.length()-1);
t = new Token();
t->symbol = tokenSymbol;
t->image = tokenImage;
t->symbolIndex = index2;
t->kind = TERMINAL;
t->line = currentLine;
t->col = tokenBeginCol;
tokens.push_back(t);
}
tokenBeginCol = currentCol;
break;
case WHITESPACE:
// Just dont do anything or generate error for token not accepted
tokenBeginCol = currentCol;
break;
case END_SYMBOL:
wprintf (L"EOF SYMBOL");
break;
case START_COMMENT:
commentBlock = true;
break;
case END_COMMENT:
commentBlock = false;
break;
case LINE_COMMENT:
commentLine = true;
break;
}
currentState = startState;
tmpImage = L"";
} else {
if (!commentBlock) {
// Set error and return
errorTab->addError (ERROR_SCAN, UNKNOWN_TOKEN, NULL, currentLine, tokenBeginCol);
currentState = startState;
tmpImage = L"";
return false;
}
tokenBeginCol = currentCol;
}
}
}
i++;
currentCol++;
}
// Generate EOF token
t = new Token ();
t->line = currentLine;
t->col = currentCol;
t->symbol = L"EOF";
t->image = L"EOF";
tokens.push_back(t);
return true;
}
vector <Token*> &DFA::getTokens () {
// preliminar stuff here
return tokens;
}
ErrorTable *DFA::getErrors () {
return errorTab;
}