-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlexer.in.go
384 lines (359 loc) · 8.56 KB
/
lexer.in.go
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
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
// Copyright 2011 Google Inc. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//go:build neverbuild
// +build neverbuild
package nin
import (
"errors"
"fmt"
"strings"
)
type Token int32
const (
ERROR Token = iota
BUILD
COLON
DEFAULT
EQUALS
IDENT
INCLUDE
INDENT
NEWLINE
PIPE
PIPE2
PIPEAT
POOL
RULE
SUBNINJA
TEOF
)
// String() returns a human-readable form of a token, used in error messages.
func (t Token) String() string {
switch t {
case ERROR:
return "lexing error"
case BUILD:
return "'build'"
case COLON:
return "':'"
case DEFAULT:
return "'default'"
case EQUALS:
return "'='"
case IDENT:
return "identifier"
case INCLUDE:
return "'include'"
case INDENT:
return "indent"
case NEWLINE:
return "newline"
case PIPE2:
return "'||'"
case PIPE:
return "'|'"
case PIPEAT:
return "'|@'"
case POOL:
return "'pool'"
case RULE:
return "'rule'"
case SUBNINJA:
return "'subninja'"
case TEOF:
return "eof"
}
return "" // not reached
}
// errorHint returns a human-readable token hint, used in error messages.
func (t Token) errorHint() string {
if t == COLON {
return " ($ also escapes ':')"
}
return ""
}
// lexerOffset permits quickly toggling between int64 and int32 to measure
// performance impact.
type lexerOffset = int
// lexerState is the offset of processing a token.
//
// It is meant to be saved when an error message may be printed after the
// parsing continued.
type lexerState struct {
// In the original C++ code, these two are char pointers and are used to do
// pointer arithmetics. Go doesn't allow pointer arithmetics so they are
// indexes. ofs starts at 0. lastToken is initially -1 to mark that it is
// not yet set.
ofs lexerOffset
lastToken lexerOffset
}
// error constructs an error message with context.
func (l *lexerState) error(message, filename string, input []byte) error {
// Compute line/column.
line := lexerOffset(1)
lineStart := lexerOffset(0)
for p := lexerOffset(0); p < l.lastToken; p++ {
if input[p] == '\n' {
line++
lineStart = p + 1
}
}
col := lexerOffset(0)
if l.lastToken != -1 {
col = l.lastToken - lineStart
}
// Add some context to the message.
c := ""
const truncateColumn = 72
if col > 0 && col < truncateColumn {
truncated := true
length := lexerOffset(0)
for ; length < truncateColumn; length++ {
if input[lineStart+length] == 0 || input[lineStart+length] == '\n' {
truncated = false
break
}
}
c = unsafeString(input[lineStart : lineStart+length])
if truncated {
c += "..."
}
c += "\n"
c += strings.Repeat(" ", int(col))
c += "^ near here"
}
// TODO(maruel): There's a problem where the error is wrapped, thus the alignment doesn't work.
return fmt.Errorf("%s:%d: %s\n%s", filename, line, message, c)
}
type lexer struct {
// Immutable.
filename string
input []byte
// Mutable.
lexerState
}
// Error constructs an error message with context.
func (l *lexer) Error(message string) error {
return l.lexerState.error(message, l.filename, l.input)
}
// Start parsing some input.
func (l *lexer) Start(filename string, input []byte) error {
l.filename = filename
if input[len(input)-1] != 0 {
panic("Requires hack with a trailing 0 byte")
}
if len(input) > 0x7fffffff {
return errors.New("input larger than 2gb is not supported")
}
l.input = input
l.ofs = 0
l.lastToken = -1
return nil
}
// If the last token read was an ERROR token, provide more info
// or the empty string.
func (l *lexer) DescribeLastError() string {
if l.lastToken != -1 {
switch l.input[l.lastToken] {
case '\t':
return "tabs are not allowed, use spaces"
}
}
return "lexing error"
}
// Rewind to the last read Token.
func (l *lexer) UnreadToken() {
l.ofs = l.lastToken
}
func (l *lexer) ReadToken() Token {
p := l.ofs
q := lexerOffset(0)
start := lexerOffset(0)
var token Token
for {
start = p
/*!re2c
re2c:define:YYCTYPE = "byte";
re2c:define:YYCURSOR = "l.input[p]";
re2c:define:YYSKIP = "p++";
re2c:define:YYMARKER = q;
re2c:yyfill:enable = 0;
re2c:flags:nested-ifs = 0;
re2c:define:YYPEEK = "l.input[p]";
re2c:define:YYBACKUP = "q = p";
re2c:define:YYRESTORE = "p = q";
nul = "\000";
simpleVarname = [a-zA-Z0-9_-]+;
varname = [a-zA-Z0-9_.-]+;
[ ]*"#"[^\000\n]*"\n" { continue; }
[ ]*"\r\n" { token = NEWLINE; break; }
[ ]*"\n" { token = NEWLINE; break; }
[ ]+ { token = INDENT; break; }
"build" { token = BUILD; break; }
"pool" { token = POOL; break; }
"rule" { token = RULE; break; }
"default" { token = DEFAULT; break; }
"=" { token = EQUALS; break; }
":" { token = COLON; break; }
"|@" { token = PIPEAT; break; }
"||" { token = PIPE2; break; }
"|" { token = PIPE; break; }
"include" { token = INCLUDE; break; }
"subninja" { token = SUBNINJA; break; }
varname { token = IDENT; break; }
nul { token = TEOF; break; }
[^] { token = ERROR; break; }
*/
}
l.lastToken = start
l.ofs = p
if token != NEWLINE && token != TEOF {
l.eatWhitespace()
}
return token
}
// If the next token is \a token, read it and return true.
func (l *lexer) PeekToken(token Token) bool {
t := l.ReadToken()
if t == token {
return true
}
l.UnreadToken()
return false
}
// Skip past whitespace (called after each read token/ident/etc.).
func (l *lexer) eatWhitespace() {
p := l.ofs
q := lexerOffset(0)
for {
l.ofs = p
/*!re2c
[ ]+ { continue; }
"$\r\n" { continue; }
"$\n" { continue; }
nul { break; }
[^] { break; }
*/
}
}
// Read a simple identifier (a rule or variable name).
// Returns false if a name can't be read.
func (l *lexer) readIdent() string {
out := ""
p := l.ofs
start := lexerOffset(0)
for {
start = p
/*!re2c
varname {
out = unsafeString(l.input[start:p])
break
}
[^] {
l.lastToken = start
return ""
}
*/
}
l.lastToken = start
l.ofs = p
l.eatWhitespace()
return out
}
// readEvalString reads a $-escaped string.
//
// If path is true, read a path (complete with $escapes).
//
// If path is false, read the value side of a var = value line (complete with
// $escapes).
//
// Returned path may be empty if a delimiter (space, newline) is hit.
func (l *lexer) readEvalString(path bool) (EvalString, error) {
eval := EvalString{}
p := l.ofs
q := lexerOffset(0)
start := lexerOffset(0)
for {
start = p
/*!re2c
[^$ :\r\n|\000]+ {
eval.Parsed = append(eval.Parsed, EvalStringToken{unsafeString(l.input[start: p]), false})
continue
}
"\r\n" {
if path {
p = start
}
break
}
[ :|\n] {
if path {
p = start
break
} else {
if l.input[start] == '\n' {
break
}
eval.Parsed = append(eval.Parsed, EvalStringToken{unsafeString(l.input[start:start+1]), false})
continue
}
}
"$$" {
eval.Parsed = append(eval.Parsed, EvalStringToken{"$", false})
continue
}
"$ " {
eval.Parsed = append(eval.Parsed, EvalStringToken{" ", false})
continue
}
"$\r\n"[ ]* {
continue
}
"$\n"[ ]* {
continue
}
"${"varname"}" {
eval.Parsed = append(eval.Parsed, EvalStringToken{unsafeString(l.input[start + 2: p - 1]), true})
continue
}
"$"simpleVarname {
eval.Parsed = append(eval.Parsed, EvalStringToken{unsafeString(l.input[start + 1: p]), true})
continue
}
"$:" {
eval.Parsed = append(eval.Parsed, EvalStringToken{":", false})
continue
}
"$". {
l.lastToken = start
return eval, l.Error("bad $-escape (literal $ must be written as $$)")
}
nul {
l.lastToken = start
return eval, l.Error("unexpected EOF")
}
[^] {
l.lastToken = start
return eval, l.Error(l.DescribeLastError())
}
*/
}
l.lastToken = start
l.ofs = p
if path {
l.eatWhitespace()
}
// Non-path strings end in newlines, so there's no whitespace to eat.
return eval, nil
}