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
|
// file : build/lexer.cxx -*- C++ -*-
// copyright : Copyright (c) 2014-2015 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#include <build/lexer>
using namespace std;
namespace build
{
token lexer::
next ()
{
skip_spaces ();
xchar c (get ());
uint64_t ln (c.line ()), cn (c.column ());
if (is_eos (c))
return token (token_type::eos, ln, cn);
switch (c)
{
// NOTE: remember to update name() if adding new punctuations.
//
case '\n':
{
return token (token_type::newline, ln, cn);
}
case ':':
{
return token (token_type::colon, ln, cn);
}
case '{':
{
return token (token_type::lcbrace, ln, cn);
}
case '}':
{
return token (token_type::rcbrace, ln, cn);
}
}
// Otherwise it is a name.
//
return name (c);
}
lexer::xchar lexer::
escape ()
{
xchar c (get ());
if (!is_eos (c))
return c;
fail (c) << "unterminated escape sequence";
}
void lexer::
skip_spaces ()
{
xchar c (peek ());
bool start (c.column () == 1);
for (; !is_eos (c); c = peek ())
{
switch (c)
{
case ' ':
case '\t':
break;
case '\n':
{
// Skip empty lines.
//
if (start)
break;
return;
}
case '#':
{
get ();
// Read until newline or eos.
//
for (c = peek (); !is_eos (c) && c != '\n'; c = peek ())
get ();
continue;
}
case '\\':
{
get ();
if (peek () == '\n')
break;
unget (c);
// Fall through.
}
default:
return; // Not a space.
}
get ();
}
}
token lexer::
name (xchar c)
{
uint64_t ln (c.line ()), cn (c.column ());
string lexeme;
lexeme += (c != '\\' ? c : escape ());
for (c = peek (); !is_eos (c); c = peek ())
{
switch (c)
{
case ' ':
case '\t':
case '\n':
case ':':
case '{':
case '}':
case '#':
{
break;
}
case '\\':
{
get ();
lexeme += escape ();
continue;
}
default:
{
get ();
lexeme += c;
continue;
}
}
break;
}
return token (lexeme, ln, cn);
}
lexer::xchar lexer::
peek ()
{
if (unget_)
return buf_;
else
{
if (eos_)
return xchar (xchar::traits_type::eof (), l_, c_);
else
{
xchar::int_type v (is_.peek ());
if (v == xchar::traits_type::eof ())
eos_ = true;
return xchar (v, l_, c_);
}
}
}
lexer::xchar lexer::
get ()
{
if (unget_)
{
unget_ = false;
return buf_;
}
else
{
// When is_.get () returns eof, the failbit is also set (stupid,
// isn't?) which may trigger an exception. To work around this
// we will call peek() first and only call get() if it is not
// eof. But we can only call peek() on eof once; any subsequent
// calls will spoil the failbit (even more stupid).
//
xchar c (peek ());
if (!is_eos (c))
{
is_.get ();
if (c == '\n')
{
l_++;
c_ = 1;
}
else
c_++;
}
return c;
}
}
void lexer::
unget (const xchar& c)
{
// Because iostream::unget cannot work once eos is reached,
// we have to provide our own implementation.
//
buf_ = c;
unget_ = true;
}
location_prologue lexer::fail_mark_base::
operator() (const xchar& c) const
{
return build::fail_mark_base<failed>::operator() (
location (name_.c_str (), c.line (), c.column ()));
}
}
|
