-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlexer.cpp
More file actions
215 lines (191 loc) · 5.14 KB
/
lexer.cpp
File metadata and controls
215 lines (191 loc) · 5.14 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
#include <iostream>
#include <string>
#include <fstream>
#include <iomanip>
using namespace std;
// function prototype
std::pair<int, string> lexer(FILE* infile);
template <class T>
void printToken(int token, T lexeme, ofstream &outfile);
std::pair<int, string> idFSM(char c, FILE* infile);
std::pair<int, string> intFSM(char c, FILE* infile);
const char separators[] = {'(', ')', ';'};
const char op[] = {'=', '>', '<', '+', '-', '*'};
const std::string keyword[] = {"if", "endif", "else", "put", "get", "while", "true", "false", "boolean", "integer", "begin", "end"};
// lexer reads the next lexeme from infile and return the token with lexeme
std::pair<int, string> lexer(FILE* infile){
string s = "";
char c = ' ';
if (infile==NULL){
cout << "Error opening input.txt";
exit(1);
}
else {
c = getc(infile);
//Compares with the separators
if (c=='%'){
c = getc(infile);
if (c == '%'){
return std::pair<int, string>(3, "%%");
}
else {
ungetc(c, infile);
return std::pair<int, string>(6, "%");
}
}
for (auto it: separators){
if (c == it){
s.push_back(c);
return std::pair<int, string>(3, s);
}
}
//delete comments
if (c=='/'){
c = getc(infile);
if (c == '*')
{
loopagain:
do {
c = getc(infile);
} while(c!='*');
c = getc(infile);
if (c == '/'){
c = getc(infile);
goto endComment;
}
else
goto loopagain;
}
else if (c == '='){
return std::pair<int, string>(4, "/=");
}
else {
ungetc(c,infile);
return std::pair<int, string>(4, "/");
}
}
endComment:
//Compares with operators
if (c=='='){
c = getc(infile);
if (c == '='){
return std::pair<int, string>(4, "==");
}
else {
ungetc(c, infile);
return std::pair<int, string>(4, "=");
}
}
for (auto it: op){
if (c == it){
s.push_back(c);
return std::pair<int, string>(4, s);
}
}
//intFSM
if(isdigit(c)){
std::pair<int, string> result = intFSM(c, infile);
return result;
}
//idFSM
if(isalpha(c)){
std:pair<int, string> result = idFSM(c, infile);
for (auto it: keyword){
if (it == result.second){
return std::pair<int, string>(5, result.second);
}
}
return result;
}
s.push_back(c);
if (c < 33){
return std::pair<int, string>(0, to_string(char(c)));
}
return std::pair<int, string>(6, s);
}
return std::pair<int, string>(0,"");
}
template <class T>
void printToken(int token, T lexeme, ofstream& outfile){
switch (token){
case 0:
break;
case 1:
outfile << "identifier\t\t\t\t\t" << lexeme << std::endl;
break;
case 2:
outfile << "integer\t\t\t\t\t\t" << lexeme << std::endl;
break;
case 3:
outfile << "separator\t\t\t\t\t" << lexeme << std::endl;
break;
case 4:
outfile << "operator\t\t\t\t\t" << lexeme << std::endl;
break;
case 5:
outfile << "keyword\t\t\t\t\t\t" << lexeme << std::endl;
break;
case 6:
outfile << "unknown\t\t\t\t\t\t" << lexeme << std::endl;
break;
default:
outfile << "Error" << lexeme << std::endl;
}
}
std::pair<int, string> idFSM(char c, FILE* infile){
string s;
s.push_back(c);
c=getc(infile);
while(isalpha(c)||isdigit(c)){
s.push_back(c);
c=getc(infile);
}
ungetc(c, infile);
int table[5][2] = {{1, 4}, {2, 3}, {2, 3}, {3, 3}, {4, 4}};
{
int state = 0;
for(char& c : s) {
if(isalpha(c))
{
state = table[state][0];
}
else if(isdigit(c))
{
state = table[state][1];
}
else
return std::pair<int, string>(6,s);
}
if(state == 1 || state == 2 || state == 3)
{
return std::pair<int, string>(1,s);
}
else
return std::pair<int, string>(6,s);
}
}
std::pair<int, string> intFSM(char c, FILE* infile){
string s;
s.push_back(c);
c=getc(infile);
while(isdigit(c)){
s.push_back(c);
c=getc(infile);
}
ungetc(c, infile);
int table[2][1] = {{1},{1}};
int state = 0;
for(char& c : s) {
if(isdigit(c))
{
state = table[state][0];
}
else
return std::pair<int, string>(6,s);
}
if(state == 1)
{
return std::pair<int, string>(2,s);
}
return std::pair<int, string>(6,s);
}