Repository navigation
Expand file tree
/
Copy pathparser.go
More file actions
689 lines (644 loc) · 22.6 KB
/
Copy pathparser.go
File metadata and controls
689 lines (644 loc) · 22.6 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
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
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
// Package parser provides T-SQL parsing functionality.
package parser
import (
"context"
"fmt"
"io"
"reflect"
"strings"
"github.com/sqlc-dev/teesql/ast"
)
// Parse parses T-SQL from the given reader and returns an AST Script.
func Parse(ctx context.Context, r io.Reader) (*ast.Script, error) {
data, err := io.ReadAll(r)
if err != nil {
return nil, fmt.Errorf("reading input: %w", err)
}
// For now, return an empty script for empty input
if len(data) == 0 {
script := &ast.Script{}
script.SetSpan(0, 0, 1, 1)
return script, nil
}
p := newParser(string(data))
return p.parseScript()
}
// Parser holds the parsing state.
type Parser struct {
lexer *Lexer
curTok Token
peekTok Token
srcMap *sourceMap
// prevEndByte is the byte offset one past the end of the last consumed
// token; node spans extend from their first token to this point.
prevEndByte int
// endBeforeSemiByte is the value prevEndByte had just before the most
// recently consumed semicolon token. It lets callers trim a trailing
// semicolon out of a sub-statement's span (e.g. the SELECT body of
// CREATE VIEW, whose semicolon belongs to the outer statement only).
endBeforeSemiByte int
// lastSemiEndByte is the byte offset one past the most recently
// consumed semicolon token, used to verify that a span actually ends
// with that semicolon before trimming it.
lastSemiEndByte int
// parenQueryDepth tracks nesting inside parenthesized queries (derived
// tables); ScriptDom records FOR XML clauses there without the FOR XML
// keywords.
parenQueryDepth int
}
func newParser(input string) *Parser {
p := &Parser{lexer: NewLexer(input)}
// The lexer may have transformed the input (BOM stripping, UTF-16
// decoding), so build the source map from its view of the input.
p.srcMap = newSourceMap(p.lexer.input)
// Read two tokens to initialize curTok and peekTok
p.nextToken()
p.nextToken()
return p
}
func (p *Parser) nextToken() {
if p.curTok.Type == TokenSemicolon {
p.endBeforeSemiByte = p.prevEndByte
p.lastSemiEndByte = p.curTok.Pos + len(p.curTok.Literal)
}
if p.curTok.Type != TokenEOF {
if end := p.curTok.Pos + len(p.curTok.Literal); end > p.prevEndByte {
p.prevEndByte = end
}
}
p.curTok = p.peekTok
p.peekTok = p.lexer.NextToken()
}
// spannable is satisfied by every AST node via the embedded ast.Fragment.
type spannable interface {
SetSpan(startOffset, fragmentLength, startLine, startColumn int)
Frag() *ast.Fragment
}
// spanned records the source span of n as running from the given start token
// to the end of the last consumed token, then returns n unchanged. It is a
// no-op for nil nodes, non-node values, and nodes for which no tokens have
// been consumed. When both an inner and an outer parse function wrap the
// same node, the outer call wins: it sees at least as wide an extent.
func spanned[T any](p *Parser, n T, start Token) T {
s, ok := any(n).(spannable)
if !ok {
return n
}
if v := reflect.ValueOf(any(n)); v.Kind() == reflect.Pointer && v.IsNil() {
return n
}
if s.Frag().Pinned() {
return n
}
if p.prevEndByte <= start.Pos {
return n
}
su, sl, sc := p.srcMap.at(start.Pos)
eu, _, _ := p.srcMap.at(p.prevEndByte)
s.SetSpan(su, eu-su, sl, sc)
return n
}
// spanFrom is the statement-form of spanned for use inside parse functions.
func (p *Parser) spanFrom(start Token, n spannable) {
if p.prevEndByte <= start.Pos {
return
}
su, sl, sc := p.srcMap.at(start.Pos)
eu, _, _ := p.srcMap.at(p.prevEndByte)
n.SetSpan(su, eu-su, sl, sc)
}
// spanStatementList sets a StatementList's span to cover its statements
// (first statement start through last statement end), matching ScriptDom.
func spanStatementList(sl *ast.StatementList) {
if sl == nil || len(sl.Statements) == 0 {
return
}
f, ok1 := any(sl.Statements[0]).(spannable)
l, ok2 := any(sl.Statements[len(sl.Statements)-1]).(spannable)
if !ok1 || !ok2 || !f.Frag().HasSpan() || !l.Frag().HasSpan() {
return
}
ff, lf := f.Frag(), l.Frag()
sl.SetSpan(ff.StartOffset, lf.EndOffset()-ff.StartOffset, ff.StartLine, ff.StartColumn)
}
// spanMaxLit builds a MaxLiteral carrying the span of the current token.
func (p *Parser) spanMaxLit() *ast.MaxLiteral {
m := &ast.MaxLiteral{LiteralType: "Max", Value: p.curTok.Literal}
p.tokSpan(m, p.curTok)
return m
}
// spanFromChild spans n from the start of an already-spanned child node
// through the end of the last consumed token (for wrapper nodes whose
// trailing keywords are consumed after the child was parsed).
func (p *Parser) spanFromChild(n spannable, child any) {
c, ok := child.(spannable)
if !ok || c == nil {
return
}
if v := reflect.ValueOf(child); v.Kind() == reflect.Pointer && v.IsNil() {
return
}
cf := c.Frag()
if !cf.HasSpan() {
return
}
n.SetSpan(cf.StartOffset, cf.FragmentLength, cf.StartLine, cf.StartColumn)
eu, _, _ := p.srcMap.at(p.prevEndByte)
if eu > cf.EndOffset() {
n.Frag().FragmentLength = eu - cf.StartOffset
}
}
// tokSpan stamps a node with the span of a single token (used for leaf
// nodes such as identifiers built directly from the current token).
func (p *Parser) tokSpan(n spannable, tok Token) {
if len(tok.Literal) == 0 {
return
}
su, sl, sc := p.srcMap.at(tok.Pos)
eu, _, _ := p.srcMap.at(tok.Pos + len(tok.Literal))
n.SetSpan(su, eu-su, sl, sc)
}
// unspan clears any recorded span on a node. ScriptDom leaves certain
// synthesized nodes (normalized keywords stored as identifiers, defaulted
// options) without position information; unspan reproduces that.
func unspan[T any](n T) T {
if s, ok := any(n).(spannable); ok {
if v := reflect.ValueOf(any(n)); v.Kind() != reflect.Pointer || !v.IsNil() {
*s.Frag() = ast.Fragment{}
}
}
return n
}
// spanIdent builds an Identifier carrying the span of the current token.
// It must be called while p.curTok is still the identifier's token.
func (p *Parser) spanIdent(value, quoteType string) *ast.Identifier {
id := &ast.Identifier{Value: value, QuoteType: quoteType}
p.tokSpan(id, p.curTok)
return id
}
// spanVarRef builds a VariableReference carrying the span of the current
// token. It must be called while p.curTok is still the variable's token.
func (p *Parser) spanVarRef(name string) *ast.VariableReference {
v := &ast.VariableReference{Name: name}
p.tokSpan(v, p.curTok)
return v
}
// varRefFromToken builds a VariableReference from a previously captured token.
func (p *Parser) varRefFromToken(tok Token) *ast.VariableReference {
v := &ast.VariableReference{Name: tok.Literal}
p.tokSpan(v, tok)
return v
}
// spanTokens stamps a node with the span running from the start of one
// token to the end of another (inclusive).
func (p *Parser) spanTokens(n spannable, start, end Token) {
su, sl, sc := p.srcMap.at(start.Pos)
eu, _, _ := p.srcMap.at(end.Pos + len(end.Literal))
n.SetSpan(su, eu-su, sl, sc)
}
// optHint builds a plain OptimizerHint spanning a single token. ScriptDom
// positions keyword-only optimizer hints on their first token (e.g.
// CHECKCONSTRAINTS PLAN spans just CHECKCONSTRAINTS).
func (p *Parser) optHint(kind string, tok Token) *ast.OptimizerHint {
h := &ast.OptimizerHint{HintKind: kind}
p.tokSpan(h, tok)
return h
}
// spanChildToToken spans n from an already-spanned child's start through the
// end of the given token.
func (p *Parser) spanChildToToken(n spannable, child spannable, end Token) {
cf := child.Frag()
if !cf.HasSpan() {
return
}
eu, _, _ := p.srcMap.at(end.Pos + len(end.Literal))
n.SetSpan(cf.StartOffset, eu-cf.StartOffset, cf.StartLine, cf.StartColumn)
}
// intLitFromToken builds an IntegerLiteral carrying the span of the given token.
func (p *Parser) intLitFromToken(tok Token) *ast.IntegerLiteral {
l := &ast.IntegerLiteral{LiteralType: "Integer", Value: tok.Literal}
p.tokSpan(l, tok)
return l
}
// strLit builds a StringLiteral (with an already-stripped value) carrying the
// span of the current token. It must be called while p.curTok is still the
// string's token.
func (p *Parser) strLit(value string, isNational bool) *ast.StringLiteral {
l := &ast.StringLiteral{
LiteralType: "String",
Value: value,
IsNational: isNational,
IsLargeObject: false,
}
p.tokSpan(l, p.curTok)
return l
}
// respanStart widens an already-spanned node so its span begins at the given
// earlier token, keeping the current end.
func (p *Parser) respanStart(n spannable, start Token) {
f := n.Frag()
if !f.HasSpan() || f.Pinned() {
return
}
su, sl, sc := p.srcMap.at(start.Pos)
if su < f.StartOffset {
f.FragmentLength += f.StartOffset - su
f.StartOffset = su
f.StartLine = sl
f.StartColumn = sc
}
}
// respanEnd widens an already-spanned node so its span runs through the end
// of the last consumed token.
func (p *Parser) respanEnd(n spannable) {
f := n.Frag()
if !f.HasSpan() {
return
}
eu, _, _ := p.srcMap.at(p.prevEndByte)
if eu > f.EndOffset() {
f.FragmentLength = eu - f.StartOffset
}
}
// identFromToken builds an Identifier from the given token's literal with
// the token's source span, without consuming it.
func (p *Parser) identFromToken(tok Token) *ast.Identifier {
literal := tok.Literal
quoteType := "NotQuoted"
if len(literal) >= 2 && literal[0] == '[' && literal[len(literal)-1] == ']' {
quoteType = "SquareBracket"
literal = strings.ReplaceAll(literal[1:len(literal)-1], "]]", "]")
} else if len(literal) >= 2 && literal[0] == '"' && literal[len(literal)-1] == '"' {
quoteType = "DoubleQuote"
literal = strings.ReplaceAll(literal[1:len(literal)-1], "\"\"", "\"")
}
id := &ast.Identifier{Value: literal, QuoteType: quoteType}
p.tokSpan(id, tok)
return id
}
// trimTrailingSemicolon shrinks n's span so it no longer covers the most
// recently consumed semicolon (used where ScriptDom attributes the semicolon
// to an enclosing statement rather than the nested one).
func (p *Parser) trimTrailingSemicolon(n spannable) {
f := n.Frag()
if !f.HasSpan() {
return
}
semiEnd, _, _ := p.srcMap.at(p.lastSemiEndByte)
if f.EndOffset() != semiEnd {
return
}
eu, _, _ := p.srcMap.at(p.endBeforeSemiByte)
if eu > f.StartOffset && eu < f.EndOffset() {
f.FragmentLength = eu - f.StartOffset
}
}
// shrinkParenSelect adjusts the span of a parenthesized SELECT used as an
// inline function return body: ScriptDom spans the SelectStatement over the
// content between the parentheses, while the enclosing return type keeps the
// parenthesized extent.
func (p *Parser) shrinkParenSelect(sel *ast.SelectStatement, lparenTok Token) {
isWS := func(b byte) bool { return b == ' ' || b == '\t' || b == '\r' || b == '\n' }
input := p.lexer.input
b := lparenTok.Pos + 1
for b < len(input) && isWS(input[b]) {
b++
}
e := p.prevEndByte
for e > b && isWS(input[e-1]) {
e--
}
if e > b && input[e-1] == ';' {
e--
for e > b && isWS(input[e-1]) {
e--
}
}
if e > b && input[e-1] == ')' {
e--
for e > b && isWS(input[e-1]) {
e--
}
}
if e <= b {
return
}
su, sl, sc := p.srcMap.at(b)
eu, _, _ := p.srcMap.at(e)
sel.SetSpan(su, eu-su, sl, sc)
sel.Pin()
}
func (p *Parser) parseScript() (*ast.Script, error) {
script := &ast.Script{}
// Parse all batches (separated by GO)
for p.curTok.Type != TokenEOF {
batch, err := p.parseBatch()
if err != nil {
return nil, err
}
if batch != nil && len(batch.Statements) > 0 {
script.Batches = append(script.Batches, batch)
}
}
// The script fragment always covers the entire input, including any
// leading or trailing trivia (matching ScriptDom).
script.SetSpan(0, p.srcMap.u16Len(), 1, 1)
return script, nil
}
func (p *Parser) parseBatch() (*ast.Batch, error) {
batch := &ast.Batch{}
for p.curTok.Type != TokenEOF {
// Stop at GO statements (batch separators)
if p.curTok.Type == TokenIdent && strings.ToUpper(p.curTok.Literal) == "GO" {
p.nextToken()
break
}
stmt, err := p.parseStatement()
if err != nil {
return nil, err
}
if stmt != nil {
batch.Statements = append(batch.Statements, stmt)
}
}
// A batch spans from the first token of its first statement to the end
// of its last statement; the GO separator belongs to no batch.
if len(batch.Statements) > 0 {
first, okF := any(batch.Statements[0]).(spannable)
last, okL := any(batch.Statements[len(batch.Statements)-1]).(spannable)
if okF && okL && first.Frag().HasSpan() && last.Frag().HasSpan() {
ff, lf := first.Frag(), last.Frag()
batch.SetSpan(ff.StartOffset, lf.EndOffset()-ff.StartOffset, ff.StartLine, ff.StartColumn)
}
}
return batch, nil
}
func (p *Parser) parseStatement() (ast.Statement, error) {
astStart := p.curTok
stmt, err := p.parseStatementInner()
if err != nil || stmt == nil {
return stmt, err
}
// ScriptDom includes a statement's terminating semicolon in its span.
// Most parse functions consume it themselves; consume it here for the
// ones that do not, so every statement span covers its terminator.
// Repeated semicolons (;;) also belong to the statement.
for p.curTok.Type == TokenSemicolon {
p.nextToken()
}
return spanned(p, stmt, astStart), nil
}
func (p *Parser) parseStatementInner() (ast.Statement, error) {
astStart := p.curTok
switch p.curTok.Type {
case TokenWith:
spanV348, spanErr348 := p.parseWithStatement()
return spanned(p, spanV348, astStart), spanErr348
case TokenSelect, TokenLParen:
spanV349, spanErr349 := p.parseSelectStatement()
return spanned(p, spanV349, astStart), spanErr349
case TokenInsert:
spanV350, spanErr350 := p.parseInsertStatement()
return spanned(p, spanV350, astStart), spanErr350
case TokenUpdate:
spanV351, spanErr351 := p.parseUpdateOrUpdateStatisticsStatement()
return spanned(p, spanV351, astStart), spanErr351
case TokenDelete:
spanV352, spanErr352 := p.parseDeleteStatement()
return spanned(p, spanV352, astStart), spanErr352
case TokenDeclare:
spanV353, spanErr353 := p.parseDeclareVariableStatement()
return spanned(p, spanV353, astStart), spanErr353
case TokenSet:
spanV354, spanErr354 := p.parseSetVariableStatement()
return spanned(p, spanV354, astStart), spanErr354
case TokenIf:
spanV355, spanErr355 := p.parseIfStatement()
return spanned(p, spanV355, astStart), spanErr355
case TokenWhile:
spanV356, spanErr356 := p.parseWhileStatement()
return spanned(p, spanV356, astStart), spanErr356
case TokenBegin:
spanV357, spanErr357 := p.parseBeginStatement()
return spanned(p, spanV357, astStart), spanErr357
case TokenCreate:
spanV358, spanErr358 := p.parseCreateStatement()
return spanned(p, spanV358, astStart), spanErr358
case TokenExec, TokenExecute:
spanV359, spanErr359 := p.parseExecuteStatement()
return spanned(p, spanV359, astStart), spanErr359
case TokenPrint:
spanV360, spanErr360 := p.parsePrintStatement()
return spanned(p, spanV360, astStart), spanErr360
case TokenThrow:
spanV361, spanErr361 := p.parseThrowStatement()
return spanned(p, spanV361, astStart), spanErr361
case TokenAlter:
spanV362, spanErr362 := p.parseAlterStatement()
return spanned(p, spanV362, astStart), spanErr362
case TokenRevert:
spanV363, spanErr363 := p.parseRevertStatement()
return spanned(p, spanV363, astStart), spanErr363
case TokenDrop:
spanV364, spanErr364 := p.parseDropStatement()
return spanned(p, spanV364, astStart), spanErr364
case TokenReturn:
spanV365, spanErr365 := p.parseReturnStatement()
return spanned(p, spanV365, astStart), spanErr365
case TokenBreak:
spanV366, spanErr366 := p.parseBreakStatement()
return spanned(p, spanV366, astStart), spanErr366
case TokenContinue:
spanV367, spanErr367 := p.parseContinueStatement()
return spanned(p, spanV367, astStart), spanErr367
case TokenGrant:
return p.parseGrantStatement()
case TokenRevoke:
return p.parseRevokeStatement()
case TokenDeny:
return p.parseDenyStatement()
case TokenCommit:
spanV368, spanErr368 := p.parseCommitTransactionStatement()
return spanned(p, spanV368, astStart), spanErr368
case TokenRollback:
spanV369, spanErr369 := p.parseRollbackTransactionStatement()
return spanned(p, spanV369, astStart), spanErr369
case TokenSave:
spanV370, spanErr370 := p.parseSaveTransactionStatement()
return spanned(p, spanV370, astStart), spanErr370
case TokenWaitfor:
spanV371, spanErr371 := p.parseWaitForStatement()
return spanned(p, spanV371, astStart), spanErr371
case TokenGoto:
spanV372, spanErr372 := p.parseGotoStatement()
return spanned(p, spanV372, astStart), spanErr372
case TokenMove:
spanV373, spanErr373 := p.parseMoveConversationStatement()
return spanned(p, spanV373, astStart), spanErr373
case TokenGet:
spanV374, spanErr374 := p.parseGetConversationGroupStatement()
return spanned(p, spanV374, astStart), spanErr374
case TokenTruncate:
spanV375, spanErr375 := p.parseTruncateTableStatement()
return spanned(p, spanV375, astStart), spanErr375
case TokenUse:
spanV376, spanErr376 := p.parseUseStatement()
return spanned(p, spanV376, astStart), spanErr376
case TokenKill:
spanV377, spanErr377 := p.parseKillStatement()
return spanned(p, spanV377, astStart), spanErr377
case TokenCheckpoint:
spanV378, spanErr378 := p.parseCheckpointStatement()
return spanned(p, spanV378, astStart), spanErr378
case TokenReconfigure:
spanV379, spanErr379 := p.parseReconfigureStatement()
return spanned(p, spanV379, astStart), spanErr379
case TokenShutdown:
spanV380, spanErr380 := p.parseShutdownStatement()
return spanned(p, spanV380, astStart), spanErr380
case TokenSetuser:
spanV381, spanErr381 := p.parseSetUserStatement()
return spanned(p, spanV381, astStart), spanErr381
case TokenLineno:
spanV382, spanErr382 := p.parseLineNoStatement()
return spanned(p, spanV382, astStart), spanErr382
case TokenRaiserror:
spanV383, spanErr383 := p.parseRaiseErrorStatement()
return spanned(p, spanV383, astStart), spanErr383
case TokenReadtext:
spanV384, spanErr384 := p.parseReadTextStatement()
return spanned(p, spanV384, astStart), spanErr384
case TokenWritetext:
spanV385, spanErr385 := p.parseWriteTextStatement()
return spanned(p, spanV385, astStart), spanErr385
case TokenUpdatetext:
spanV386, spanErr386 := p.parseUpdateTextStatement()
return spanned(p, spanV386, astStart), spanErr386
case TokenSend:
spanV387, spanErr387 := p.parseSendStatement()
return spanned(p, spanV387, astStart), spanErr387
case TokenReceive:
spanV388, spanErr388 := p.parseReceiveStatement()
return spanned(p, spanV388, astStart), spanErr388
case TokenRestore:
return p.parseRestoreStatement()
case TokenBackup:
spanV389, spanErr389 := p.parseBackupStatement()
return spanned(p, spanV389, astStart), spanErr389
case TokenClose:
spanV390, spanErr390 := p.parseCloseStatement()
return spanned(p, spanV390, astStart), spanErr390
case TokenEnd:
// Check for END CONVERSATION
if p.peekTok.Type == TokenConversation {
spanV391, spanErr391 := p.parseEndConversationStatement()
return spanned(p, spanV391, astStart), spanErr391
}
return nil, fmt.Errorf("unexpected token: END")
case TokenOpen:
spanV392, spanErr392 := p.parseOpenStatement()
return spanned(p, spanV392, astStart), spanErr392
case TokenDbcc:
spanV393, spanErr393 := p.parseDbccStatement()
return spanned(p, spanV393, astStart), spanErr393
case TokenAdd:
spanV394, spanErr394 := p.parseAddStatement()
return spanned(p, spanV394, astStart), spanErr394
case TokenSemicolon:
p.nextToken()
return nil, nil
case TokenIdent:
// Check for BULK INSERT
if strings.ToUpper(p.curTok.Literal) == "BULK" {
p.nextToken() // consume BULK
spanV395, spanErr395 := p.parseBulkInsertStatement()
return spanned(p, spanV395, astStart), spanErr395
}
// Check for RENAME (Azure SQL DW/Synapse)
if strings.ToUpper(p.curTok.Literal) == "RENAME" {
spanV396, spanErr396 := p.parseRenameStatement()
return spanned(p, spanV396, astStart), spanErr396
}
// Check for FETCH cursor
if strings.ToUpper(p.curTok.Literal) == "FETCH" {
spanV397, spanErr397 := p.parseFetchCursorStatement()
return spanned(p, spanV397, astStart), spanErr397
}
// Check for DEALLOCATE cursor
if strings.ToUpper(p.curTok.Literal) == "DEALLOCATE" {
spanV398, spanErr398 := p.parseDeallocateCursorStatement()
return spanned(p, spanV398, astStart), spanErr398
}
// Check for ENABLE TRIGGER
if strings.ToUpper(p.curTok.Literal) == "ENABLE" {
spanV399, spanErr399 := p.parseEnableDisableTriggerStatement("Enable")
return spanned(p, spanV399, astStart), spanErr399
}
// Check for DISABLE TRIGGER
if strings.ToUpper(p.curTok.Literal) == "DISABLE" {
spanV400, spanErr400 := p.parseEnableDisableTriggerStatement("Disable")
return spanned(p, spanV400, astStart), spanErr400
}
// Check for MERGE statement
if strings.ToUpper(p.curTok.Literal) == "MERGE" {
return p.parseMergeStatement()
}
// Check for COPY INTO statement
if strings.ToUpper(p.curTok.Literal) == "COPY" {
spanV401, spanErr401 := p.parseCopyStatement()
return spanned(p, spanV401, astStart), spanErr401
}
// Check for label (identifier followed by colon)
spanV402, spanErr402 := p.parseLabelOrError()
return spanned(p, spanV402, astStart), spanErr402
default:
return nil, fmt.Errorf("unexpected token: %s", p.curTok.Literal)
}
}
// spanDeviceInfo spans a backup/restore device on its name expression when it
// carries one (matching ScriptDom), falling back to the full clause.
func (p *Parser) spanDeviceInfo(d *ast.DeviceInfo, start Token) {
var child any
if d.PhysicalDevice != nil {
child = d.PhysicalDevice
} else if d.LogicalDevice != nil {
if d.LogicalDevice.Identifier != nil {
child = d.LogicalDevice.Identifier
} else if d.LogicalDevice.ValueExpression != nil {
child = d.LogicalDevice.ValueExpression
}
}
if c, ok := child.(spannable); ok {
if f := c.Frag(); f.HasSpan() {
d.SetSpan(f.StartOffset, f.FragmentLength, f.StartLine, f.StartColumn)
return
}
}
p.spanFrom(start, d)
}
// pinBinaryFromPinnedChild records a boolean binary expression's span when
// its first operand carries a pinned (quirk-narrowed) span: the parent then
// starts at that operand's start rather than its own first token, and is
// itself pinned so enclosing calls keep the narrowed start.
func (p *Parser) pinBinaryFromPinnedChild(b *ast.BooleanBinaryExpression) {
fs, fok := any(b.FirstExpression).(spannable)
ss, sok := any(b.SecondExpression).(spannable)
firstPinned := fok && fs.Frag().Pinned() && fs.Frag().HasSpan()
secondPinned := sok && ss.Frag().Pinned() && ss.Frag().HasSpan()
if !firstPinned && !secondPinned {
return
}
if !fok || !fs.Frag().HasSpan() {
return
}
p.spanFromChild(b, b.FirstExpression)
// A pinned second operand also bounds the end of the binary span
// (e.g. a SHORTEST_PATH predicate whose trailing parentheses are
// excluded from its fragment).
if secondPinned {
if end := ss.Frag().EndOffset(); end < b.Frag().EndOffset() && end > b.Frag().StartOffset {
b.Frag().FragmentLength = end - b.Frag().StartOffset
}
}
b.Frag().Pin()
}