forked from codeon/cmlex
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lexer.sml
251 lines (212 loc) · 6.74 KB
/
lexer.sml
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
structure Lexer
:> LEXER
where type token = Token.token
=
struct
open Token
structure Table =
HashTable (structure Key = StringHashable)
val keywords : token option Table.table = Table.table 60
(* Illegal identifiers (most are SML reserved words). *)
val () =
List.app
(fn str => Table.insert keywords str NONE)
[
"abstype",
"andalso",
"as",
"case",
"datatype",
"do",
"else",
"end",
"exception",
"fn",
"fun",
"functor",
"handle",
"if",
"in",
"infix",
"infixr",
"include",
"let",
"local",
"nonfix",
"of",
"op",
"open",
"orelse",
"raise",
"sharing",
"sig",
"signature",
"struct",
"structure",
"then",
"type",
"val",
"where",
"while",
"withtype",
"before",
"div",
"mod",
"o",
"true",
"false",
"nil",
"ref",
"int",
"list",
"ord",
"symbol",
"self",
"info"
]
(* Reserved words in cmlex. *)
val () =
List.app
(fn (str, token) => Table.insert keywords str (SOME token))
[
("alphabet", ALPHABET),
("and", AND),
("any", ANY),
("empty", EMPT),
("eos", EOS),
("epsilon", EPSILON),
("function", FUNCTION),
("name", NAME),
("or", OR),
("range", RANGE),
("regexp", REGEXP),
("seq", SEQ),
("set", SET)
]
open Stream
type pos = int
type t = int -> (token * pos) front
type u = int -> char stream * int
type self = { lexmain : char stream -> int -> (token * pos) front,
skipcomment : char stream -> int -> char stream * int }
type info = { match : char list,
len : int,
start : char stream,
follow : char stream,
self : self }
exception Error
fun action f ({ match, len, follow, self, ... }:info) pos =
Cons (f (match, len, pos), lazy (fn () => #lexmain self follow (pos+len)))
fun simple token ({ len, follow, self, ... }:info) pos =
Cons ((token, pos), lazy (fn () => #lexmain self follow (pos+len)))
structure Arg =
struct
type symbol = char
val ord = Char.ord
type t = t
type u = u
type self = self
type info = info
fun eof _ _ = Nil
val ident =
action
(fn (chars, _, pos) =>
let
val str = implode chars
in
(case Table.find keywords str of
NONE =>
(IDENT str, pos)
| SOME NONE =>
(
print "Illegal identifier at ";
print (Int.toString pos);
print ".\n";
raise Error
)
| SOME (SOME token) =>
(token, pos))
end)
val number =
action
(fn (chars, _, pos) =>
((case Int.fromString (implode chars) of
SOME n =>
(NUMBER n, pos)
| NONE =>
raise (Fail "invariant"))
handle Overflow =>
(
print "Illegal constant at ";
print (Int.toString pos);
print ".\n";
raise Error
)))
fun skip ({ len, follow, self, ... }:info) pos = #lexmain self follow (pos+len)
val char =
action
(fn (chars, _, pos) =>
(* By construction, chars should be '<ch> . *)
(case chars of
[_, ch] =>
(NUMBER (Char.ord ch), pos)
| _ =>
raise (Fail "invariant")))
fun lcomment ({ len, follow, self, ...}:info) pos =
let
val (follow', pos') = #skipcomment self follow (pos+len)
in
#lexmain self follow' pos'
end
val string =
action
(fn (chars, len, pos) =>
(* By construction, chars should begin and end with ". *)
(STRING (List.map ord (List.take (List.tl chars, len-2))), pos))
fun error _ pos =
(
print "Lexical error at ";
print (Int.toString pos);
print ".\n";
raise Error
)
val ampersand = simple AND
val arrow = simple ARROW
val bar = simple OR
val colon = simple COLON
val dot = error
val equal = simple EQUAL
val lparen = simple LPAREN
val minus = simple MINUS
val plus = simple PLUS
val question = simple QUESTION
val rparen = simple RPAREN
val slash = simple RANGE
val star = simple STAR
val tilde = simple TILDE
val geq = simple GEQ
val starstar = simple REPEAT
fun comment_open ({ len, follow, self, ... }:info) pos =
let
val (follow', pos') = #skipcomment self follow (pos+len)
in
#skipcomment self follow' pos'
end
fun comment_close ({ len, follow, ...}:info) pos =
(follow, pos+len)
fun comment_skip ({ len, follow, self, ... }:info) pos =
#skipcomment self follow (pos+len)
fun comment_error _ pos =
(
print "Unclosed comment at ";
print (Int.toString pos);
print ".\n";
raise Error
)
end
structure LexMain =
LexMainFun
(structure Streamable = StreamStreamable
structure Arg = Arg)
fun lex s = lazy (fn () => LexMain.lexmain s 0)
end