Repository navigation
Expand file tree
/
Copy pathLexer.java
More file actions
executable file
·209 lines (171 loc) · 5.77 KB
/
Copy pathLexer.java
File metadata and controls
executable file
·209 lines (171 loc) · 5.77 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
import java.io.*;
public class Lexer {
private boolean isEof = false;
private char ch = ' ';
private BufferedReader input;
private String line = "";
private int lineno = 0;
private int col = 1;
private final String letters = "abcdefghijklmnopqrstuvwxyz"
+ "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
private final String digits = "0123456789";
private final char eolnCh = '\n';
private final char eofCh = '\004';
public Lexer(String fileName) { // source filename
try {
input = new BufferedReader(new FileReader(fileName));
}
catch (FileNotFoundException e) {
System.out.println("File not found: " + fileName);
System.exit(1);
}
}
private char nextChar() { // Return next char
if (ch == eofCh)
error("Attempt to read past end of file");
col++;
if (col >= line.length()) {
try {
line = input.readLine();
} catch (IOException e) {
System.err.println(e);
System.exit(1);
} // try
if (line == null) // at end of file
line = "" + eofCh;
else {
// System.out.println(lineno + ":\t" + line);
lineno++;
line += eolnCh;
} // if line
col = 0;
} // if col
return line.charAt(col);
}
public Token next() { // Return next token
do {
if (isLetter(ch)) { // ident or keyword
String spelling = concat(letters + digits);
return Token.keyword(spelling);
} else if (isDigit(ch)) { // int or float literal
String number = concat(digits);
if (ch != '.') // int Literal
return Token.mkIntLiteral(number);
number += concat(digits);
return Token.mkFloatLiteral(number);
} else switch (ch) {
case ' ':
case '\t':
case '\r':
case eolnCh:
ch = nextChar();
break;
case '/': // divide or comment
ch = nextChar();
if (ch != '/') return Token.divideTok;
// comment
do {
ch = nextChar();
} while (ch != eolnCh);
ch = nextChar();
break;
case '\'': // char literal
char ch1 = nextChar();
nextChar(); // get '
ch = nextChar();
return Token.mkCharLiteral("" + ch1);
case eofCh:
return Token.eofTok;
case '+':
ch = nextChar();
return Token.plusTok;
// - * ( ) { } ; , student exercise
case '-':
ch = nextChar();
return Token.minusTok;
case '*':
ch = nextChar();
return Token.multiplyTok;
case '(':
ch = nextChar();
return Token.leftParenTok;
case ')':
ch = nextChar();
return Token.rightParenTok;
case '{':
ch = nextChar();
return Token.leftBraceTok;
case '}':
ch = nextChar();
return Token.rightBraceTok;
case ';':
ch = nextChar();
return Token.semicolonTok;
case ',':
ch = nextChar();
return Token.commaTok;
case '&':
check('&');
return Token.andTok;
case '|':
check('|');
return Token.orTok;
case '=':
return chkOpt('=', Token.assignTok,
Token.eqeqTok);
// < > ! student exercise
case '<':
return chkOpt('=', Token.ltTok, Token.lteqTok);
case '>':
return chkOpt('=', Token.gtTok, Token.gteqTok);
case '!':
return chkOpt('=', Token.notTok, Token.noteqTok);
default:
error("Illegal character " + ch);
} // switch
} while (true);
} // next
private boolean isLetter(char c) {
return (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z');
}
// student exercise
private boolean isDigit(char c) {
return (c >= '0' && c <= '9');
}
private void check(char c) {
ch = nextChar();
if (ch != c)
error("Illegal character, expecting " + c);
ch = nextChar();
}
// student exercise
private Token chkOpt(char c, Token one, Token two) {
ch = nextChar();
Token tok;
if (ch != c) tok = one;
else tok = two;
ch = nextChar();
return tok;
}
private String concat(String set) {
String r = "";
do {
r += ch;
ch = nextChar();
} while (set.indexOf(ch) >= 0);
return r;
}
public void error(String msg) {
System.err.print(line);
System.err.println("Error: column " + col + " " + msg);
System.exit(1);
}
static public void main(String[] argv) {
Lexer lexer = new Lexer(argv[0]);
Token tok = lexer.next();
while (tok != Token.eofTok) {
System.out.println(tok.toString());
tok = lexer.next();
}
} // main
}