/
RegExLexer.cs
326 lines (295 loc) · 14.3 KB
/
RegExLexer.cs
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
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
using System.Collections.Generic;
using System.IO;
using System.Linq;
namespace Piglet.Lexer.Construction
{
internal class RegExLexer
{
private readonly TextReader input;
private State state;
private enum State
{
Normal,
NormalEscaped,
BeginCharacterClass,
InsideCharacterClass,
RangeEnd,
NumberedRepetition
}
private class CharacterClassState
{
public CharacterClassState()
{
ClassChars = new List<char>();
}
public IList<char> ClassChars { get; private set; }
public bool Negated { get; set; }
}
private class NumberedRepetitionState
{
public NumberedRepetitionState()
{
MinRepetitions = -1;
MaxRepetitions = -1;
Chars = new List<char>();
}
public int MaxRepetitions { get; set; }
public int MinRepetitions { get; set; }
public List<char> Chars { get; private set; }
public int CurrentPart { get; set; }
}
public RegExLexer(TextReader input)
{
this.input = input;
state = State.Normal;
}
public RegExToken NextToken()
{
// These keeps track of classes
var classState = new CharacterClassState();
var numberedRepetitionState = new NumberedRepetitionState();
state = State.Normal;
while (input.Peek() != -1)
{
var c = (char)input.Read();
switch (state)
{
case State.Normal:
switch (c)
{
case '\\':
state = State.NormalEscaped;
break;
case '[':
state = State.BeginCharacterClass;
break;
case '{':
state = State.NumberedRepetition;
// numberedRepetitionState = new NumberedRepetitionState();
break;
case '(': return new RegExToken { Type = RegExToken.TokenType.OperatorOpenParanthesis };
case ')': return new RegExToken { Type = RegExToken.TokenType.OperatorCloseParanthesis };
case '|': return new RegExToken { Type = RegExToken.TokenType.OperatorOr };
case '+': return new RegExToken { Type = RegExToken.TokenType.OperatorPlus };
case '*': return new RegExToken { Type = RegExToken.TokenType.OperatorMul };
case '?': return new RegExToken { Type = RegExToken.TokenType.OperatorQuestion };
case '.': return new RegExToken { Type = RegExToken.TokenType.Accept, Characters = AllCharactersExceptNull };
default: return new RegExToken { Type = RegExToken.TokenType.Accept, Characters = new[] {c}};
}
break;
case State.NormalEscaped:
switch (c)
{
// Shorthand for [0-9]
case 'd':
return new RegExToken {Type = RegExToken.TokenType.Accept, Characters = CharRange('0', '9')};
// Shorthand for [^0-9]
case 'D':
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = AllCharactersExceptNull.Except(CharRange('0', '9'))
};
case 's':
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = AllWhitespaceCharacters
};
case 'S':
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = AllCharactersExceptNull.Except(AllWhitespaceCharacters)
};
case 'w':
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = CharRange('0', '9').Union(CharRange('a', 'z')).Union(CharRange('A', 'Z'))
};
case 'W':
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = AllCharactersExceptNull.Except(
CharRange('0', '9').Union(CharRange('a', 'z')).Union(CharRange('A', 'Z')))
};
case 'n':
return new RegExToken { Type = RegExToken.TokenType.Accept, Characters = new[] { '\n' } };
case 'r':
return new RegExToken { Type = RegExToken.TokenType.Accept, Characters = new[] { '\r' } };
case '.':
case '*':
case '|':
case '[':
case ']':
case '+':
case '(':
case ')':
case '\\':
case '{':
case '}':
case ' ':
return new RegExToken { Type = RegExToken.TokenType.Accept, Characters = new[] { c } };
default:
throw new LexerConstructionException(string.Format("Unknown escaped character '{0}'", c));
}
case State.BeginCharacterClass:
switch (c)
{
case '^':
if (classState.Negated)
{
// If the classstate is ALREADY negated
// Readd the ^ to the expression
classState.ClassChars.Add('^');
state = State.InsideCharacterClass;
}
classState.Negated = true;
break;
case '[':
case ']':
case '-':
// This does not break the character class TODO: I THINK!!!
classState.ClassChars.Add(c);
break;
default:
classState.ClassChars.Add(c);
state = State.InsideCharacterClass;
break;
}
break;
case State.InsideCharacterClass:
switch (c)
{
case '-':
state = State.RangeEnd;
break;
case '[':
throw new LexerConstructionException("Opening new character class inside an already open one");
case ']':
// Ending class
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = classState.Negated
? AllCharactersExceptNull.Except(classState.ClassChars)
: classState.ClassChars.Distinct()
};
default:
classState.ClassChars.Add(c);
break;
}
break;
case State.RangeEnd:
switch (c)
{
case ']':
// We found the - at the position BEFORE the end of the class
// which means we should handle it as a litteral and end the class
return new RegExToken
{
Type = RegExToken.TokenType.Accept,
Characters = classState.Negated
? AllCharactersExceptNull.Except(classState.ClassChars)
: classState.ClassChars.Distinct()
};
default:
char lastClassChar = classState.ClassChars.Last();
char from = lastClassChar < c ? lastClassChar : c;
char to = lastClassChar < c ? c : lastClassChar;
for (; from <= to; ++from)
{
classState.ClassChars.Add(from);
}
state = State.InsideCharacterClass;
break;
}
break;
case State.NumberedRepetition:
switch (c)
{
case '0': // Is it really OK to start with a 0. It is now.
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
numberedRepetitionState.Chars.Add(c);
break;
case '}':
case ':':
// Parse whatever is in Chars
int reps;
if (!int.TryParse(new string(numberedRepetitionState.Chars.ToArray()), out reps))
{
throw new LexerConstructionException("Numbered repetition operator contains operand that is not a number");
}
numberedRepetitionState.Chars.Clear();
// Set the right value
if (numberedRepetitionState.CurrentPart == 0)
{
numberedRepetitionState.MinRepetitions = reps;
}
else
{
numberedRepetitionState.MaxRepetitions = reps;
}
if (c == ':')
{
++numberedRepetitionState.CurrentPart;
if (numberedRepetitionState.CurrentPart > 1)
throw new LexerConstructionException("More than one : in numbered repetition.");
}
else
{
return new RegExToken
{
Type = RegExToken.TokenType.NumberedRepeat,
MinRepetitions = numberedRepetitionState.MinRepetitions,
MaxRepetitions = numberedRepetitionState.MaxRepetitions
};
}
break;
default:
throw new LexerConstructionException(
string.Format("Illegal character {0} in numbered repetition", c));
}
break;
}
}
// We get here if we try to lex when the expression has ended.
return null;
}
private static IEnumerable<char> CharRange(char start, char end)
{
for (var c = start; c <= end; ++c)
{
yield return c;
}
}
protected static IEnumerable<char> AllCharactersExceptNull
{
get
{
for (var c = (char)1; c < 256; ++c)
yield return c;
}
}
protected static IEnumerable<char> AllWhitespaceCharacters
{
get
{
yield return ' ';
yield return '\t';
yield return '\n';
yield return '\r';
}
}
}
}