-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathparse.rs
More file actions
858 lines (785 loc) · 32.4 KB
/
parse.rs
File metadata and controls
858 lines (785 loc) · 32.4 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
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
use proc_macro2::{Delimiter, Ident, Literal, Span, TokenStream, TokenTree};
use quote::quote;
use std::iter::Peekable;
type Tokens = Peekable<proc_macro2::token_stream::IntoIter>;
type Result<T> = std::result::Result<T, syn::Error>;
// ---------------------------------------------------------------------------
// Query parsing
// ---------------------------------------------------------------------------
/// Top-level entry: parse a single query node from the full input.
pub fn parse_query_top(input: TokenStream) -> Result<TokenStream> {
let mut tokens = input.into_iter().peekable();
let result = parse_query_node(&mut tokens)?;
if let Some(tok) = tokens.next() {
return Err(syn::Error::new_spanned(tok, "unexpected token after query"));
}
Ok(result)
}
/// Parse a single query node (possibly with a trailing `@capture`).
fn parse_query_node(tokens: &mut Tokens) -> Result<TokenStream> {
let base = parse_query_atom(tokens)?;
// Check for trailing @capture
if peek_is_at(tokens) {
tokens.next(); // consume @
let capture_name = expect_ident(tokens, "expected capture name after @")?;
let name_str = capture_name.to_string();
Ok(quote! {
yeast::query::QueryNode::Capture {
capture: #name_str,
node: Box::new(#base),
}
})
} else {
Ok(base)
}
}
/// Parse a query atom: a parenthesized node, a bare `_` (any node), or a
/// bare string literal (unnamed token).
/// Does not handle `@capture` — that's handled by the caller as a postfix.
fn parse_query_atom(tokens: &mut Tokens) -> Result<TokenStream> {
match tokens.peek() {
None => Err(syn::Error::new(
Span::call_site(),
"unexpected end of query",
)),
Some(TokenTree::Group(g)) if g.delimiter() == Delimiter::Parenthesis => {
let group = expect_group(tokens, Delimiter::Parenthesis)?;
let mut inner = group.stream().into_iter().peekable();
let result = parse_query_node_inner(&mut inner)?;
if let Some(tok) = inner.next() {
return Err(syn::Error::new_spanned(
tok,
"unexpected token in query node",
));
}
Ok(result)
}
Some(TokenTree::Ident(id)) if *id == "_" => {
tokens.next();
Ok(quote! { yeast::query::QueryNode::Any { match_unnamed: true } })
}
Some(TokenTree::Literal(_)) => {
let lit = expect_literal(tokens)?;
Ok(quote! { yeast::query::QueryNode::UnnamedNode { kind: #lit } })
}
Some(tok) => Err(syn::Error::new_spanned(
tok.clone(),
"expected `(`, `_`, or string literal in query",
)),
}
}
/// Parse the inside of a parenthesized query node: `kind fields...` or `_` or `"lit"`.
fn parse_query_node_inner(tokens: &mut Tokens) -> Result<TokenStream> {
match tokens.peek() {
None => Err(syn::Error::new(
Span::call_site(),
"empty parenthesized group in query",
)),
Some(TokenTree::Ident(id)) if *id == "_" => {
tokens.next();
Ok(quote! { yeast::query::QueryNode::Any { match_unnamed: false } })
}
Some(TokenTree::Literal(_)) => {
let lit = expect_literal(tokens)?;
Ok(quote! { yeast::query::QueryNode::UnnamedNode { kind: #lit } })
}
Some(TokenTree::Ident(_)) => {
let kind = expect_ident(tokens, "expected node kind")?;
let kind_str = kind.to_string();
let fields = parse_query_fields(tokens)?;
Ok(quote! {
yeast::query::QueryNode::Node {
kind: #kind_str,
children: vec![#(#fields),*],
}
})
}
Some(tok) => Err(syn::Error::new_spanned(
tok.clone(),
"expected node kind, `_`, or string literal",
)),
}
}
/// Parse zero or more field specifications and bare patterns.
/// Named fields: `name: pattern`. Bare patterns (no field name) become
/// implicit `child` field entries. Named fields and bare patterns may
/// appear in any order; bare patterns are accumulated and emitted as a
/// single `("child", ...)` entry.
fn parse_query_fields(tokens: &mut Tokens) -> Result<Vec<TokenStream>> {
let mut fields = Vec::new();
let mut bare_children: Vec<TokenStream> = Vec::new();
while tokens.peek().is_some() {
if peek_is_field(tokens) {
let field_name = expect_ident(tokens, "expected field name")?;
let field_str = field_name.to_string();
expect_punct(tokens, ':', "expected `:` after field name")?;
let child = parse_query_node(tokens)?;
fields.push(quote! {
(#field_str, vec![yeast::query::QueryListElem::SingleNode(#child)])
});
} else {
// Bare patterns — accumulate into the implicit `child` field.
// We don't break here, so we can interleave with named fields.
let elems = parse_query_list(tokens)?;
if elems.is_empty() {
// Nothing more we can parse at this level.
break;
}
bare_children.extend(elems);
}
}
if !bare_children.is_empty() {
fields.push(quote! {
("child", vec![#(#bare_children),*])
});
}
Ok(fields)
}
/// Parse a list of query elements (bare children).
/// Each element is a node pattern, possibly followed by `*`, `+`, `?`.
fn parse_query_list(tokens: &mut Tokens) -> Result<Vec<TokenStream>> {
let mut elems = Vec::new();
while tokens.peek().is_some() {
// Check for parenthesized group
if peek_is_group(tokens, Delimiter::Parenthesis) {
let group = expect_group(tokens, Delimiter::Parenthesis)?;
let mut inner = group.stream().into_iter().peekable();
// Check for repetition after the group
if peek_is_repetition(tokens) {
let rep = expect_repetition(tokens)?;
// Determine if the group is a single node pattern or a list
// of patterns. If it starts with an identifier (node kind) or
// `_`, treat it as a single repeated node. Otherwise, parse
// as a repeated list of sub-patterns.
let is_single_node = matches!(inner.peek(), Some(TokenTree::Ident(_)));
if is_single_node {
let node = parse_query_node_inner(&mut inner)?;
let elem = quote! {
yeast::query::QueryListElem::Repeated {
children: vec![yeast::query::QueryListElem::SingleNode(#node)],
rep: #rep,
}
};
let elem = maybe_wrap_list_capture(tokens, elem)?;
elems.push(elem);
} else {
let sub_elems = parse_query_list(&mut inner)?;
let elem = quote! {
yeast::query::QueryListElem::Repeated {
children: vec![#(#sub_elems),*],
rep: #rep,
}
};
let elem = maybe_wrap_list_capture(tokens, elem)?;
elems.push(elem);
}
} else {
// Single parenthesized node, possibly followed by @capture
let node = parse_query_node_inner(&mut inner)?;
let node = maybe_wrap_capture(tokens, node)?;
elems.push(quote! {
yeast::query::QueryListElem::SingleNode(#node)
});
}
continue;
}
// Check for string literal (unnamed node), optionally followed by @capture
if peek_is_literal(tokens) {
let lit = expect_literal(tokens)?;
let node = quote! { yeast::query::QueryNode::UnnamedNode { kind: #lit } };
let node = maybe_wrap_capture(tokens, node)?;
let elem = maybe_wrap_repetition(
tokens,
quote! {
yeast::query::QueryListElem::SingleNode(#node)
},
)?;
elems.push(elem);
continue;
}
// Check for bare `_` (any node, named or unnamed), possibly followed by @capture.
// Distinct from `(_)` which only matches named nodes — this matches
// tree-sitter query semantics.
if peek_is_underscore(tokens) {
tokens.next();
let node = quote! { yeast::query::QueryNode::Any { match_unnamed: true } };
let node = maybe_wrap_capture(tokens, node)?;
let elem = maybe_wrap_repetition(
tokens,
quote! {
yeast::query::QueryListElem::SingleNode(#node)
},
)?;
elems.push(elem);
continue;
}
break;
}
Ok(elems)
}
// ---------------------------------------------------------------------------
// tree! / trees! parsing — direct code generation against BuildCtx
// ---------------------------------------------------------------------------
const IMPLICIT_CTX: &str = "__yeast_ctx";
/// Determine the context identifier: either explicit `ctx,` or the implicit
/// `__yeast_ctx` from an enclosing `rule!`.
fn parse_ctx_or_implicit(tokens: &mut Tokens) -> Ident {
// Check if first token is an ident followed by a comma
let mut lookahead = tokens.clone();
let is_explicit = matches!(lookahead.next(), Some(TokenTree::Ident(_)))
&& matches!(lookahead.next(), Some(TokenTree::Punct(p)) if p.as_char() == ',');
if is_explicit {
let ctx = expect_ident(tokens, "").unwrap();
let _ = tokens.next(); // consume comma
ctx
} else {
Ident::new(IMPLICIT_CTX, Span::call_site())
}
}
/// Parse `tree!(ctx, (template))` or `tree!((template))` — returns single `Id`.
pub fn parse_tree_top(input: TokenStream) -> Result<TokenStream> {
let mut tokens = input.into_iter().peekable();
let ctx = parse_ctx_or_implicit(&mut tokens);
let first = parse_direct_node(&mut tokens, &ctx)?;
if let Some(tok) = tokens.next() {
return Err(syn::Error::new_spanned(
tok,
"unexpected tokens after tree! template; use trees! for multiple nodes",
));
}
Ok(quote! { { #first } })
}
/// Parse `trees!(ctx, ...)` or `trees!(...)` — returns `Vec<Id>`.
pub fn parse_trees_top(input: TokenStream) -> Result<TokenStream> {
let mut tokens = input.into_iter().peekable();
let ctx = parse_ctx_or_implicit(&mut tokens);
let items = parse_direct_list(&mut tokens, &ctx)?;
if let Some(tok) = tokens.next() {
return Err(syn::Error::new_spanned(
tok,
"unexpected token after trees! template",
));
}
Ok(quote! {
{
let mut __nodes: Vec<usize> = Vec::new();
#(#items)*
__nodes
}
})
}
/// Parse a single node template and generate code that returns an `Id`.
/// Handles: `(kind fields... children...)` and `{expr}`.
fn parse_direct_node(tokens: &mut Tokens, ctx: &Ident) -> Result<TokenStream> {
match tokens.peek() {
Some(TokenTree::Group(g)) if g.delimiter() == Delimiter::Brace => {
let group = expect_group(tokens, Delimiter::Brace)?;
let expr = group.stream();
Ok(quote! { #expr })
}
Some(TokenTree::Group(g)) if g.delimiter() == Delimiter::Parenthesis => {
let group = expect_group(tokens, Delimiter::Parenthesis)?;
let mut inner = group.stream().into_iter().peekable();
parse_direct_node_inner(&mut inner, ctx)
}
Some(tok) => Err(syn::Error::new_spanned(
tok.clone(),
"expected `(` or `{` in tree template",
)),
None => Err(syn::Error::new(
Span::call_site(),
"unexpected end of tree template",
)),
}
}
/// Parse the inside of a parenthesized node: `kind fields... children...`
/// or `kind "literal"` or `kind $fresh`.
fn parse_direct_node_inner(tokens: &mut Tokens, ctx: &Ident) -> Result<TokenStream> {
let kind = expect_ident(tokens, "expected node kind")?;
let kind_str = kind.to_string();
// Check for (kind "literal")
if peek_is_literal(tokens) {
let lit = expect_literal(tokens)?;
return Ok(quote! { #ctx.literal(#kind_str, #lit) });
}
// Check for (kind #{expr}) — computed literal, expr converted via .to_string()
if peek_is_hash(tokens) {
tokens.next(); // consume #
let group = expect_group(tokens, Delimiter::Brace)?;
let expr = group.stream();
return Ok(quote! { #ctx.literal(#kind_str, &(#expr).to_string()) });
}
// Check for (kind $fresh)
if peek_is_dollar(tokens) {
tokens.next();
let name = expect_ident(tokens, "expected fresh variable name after $")?;
let name_str = name.to_string();
return Ok(quote! { #ctx.fresh(#kind_str, #name_str) });
}
// Parse named fields
let mut stmts = Vec::new();
let mut field_args = Vec::new();
let mut field_counter = 0usize;
// Named fields — compute each value into a temp, then reference it
while peek_is_field(tokens) {
let field_name = expect_ident(tokens, "expected field name")?;
let field_str = field_name.to_string();
expect_punct(tokens, ':', "expected `:` after field name")?;
let temp = Ident::new(
&format!("__field_{field_str}_{field_counter}"),
Span::call_site(),
);
field_counter += 1;
// Check for field: {..expr} — splice a Vec<Id> into the field
if peek_is_group(tokens, Delimiter::Brace) {
let group_clone = tokens.clone().next().unwrap();
if let TokenTree::Group(g) = &group_clone {
let mut inner_check = g.stream().into_iter();
let is_splice = matches!(inner_check.next(), Some(TokenTree::Punct(p)) if p.as_char() == '.')
&& matches!(inner_check.next(), Some(TokenTree::Punct(p)) if p.as_char() == '.');
if is_splice {
let group = expect_group(tokens, Delimiter::Brace)?;
let mut inner = group.stream().into_iter().peekable();
inner.next(); // consume first .
inner.next(); // consume second .
let expr: proc_macro2::TokenStream = inner.collect();
stmts.push(quote! { let #temp: Vec<usize> = #expr; });
field_args.push(quote! { (#field_str, #temp) });
continue;
}
}
}
let value = parse_direct_node(tokens, ctx)?;
stmts.push(quote! { let #temp = #value; });
field_args.push(quote! { (#field_str, vec![#temp]) });
}
// After all named fields, no other tokens are allowed.
// Output templates require all children to be in named fields.
if let Some(tok) = tokens.peek() {
return Err(syn::Error::new_spanned(
tok.clone(),
"expected named field (`name:`) or end of node template; \
output templates do not support unnamed children",
));
}
Ok(quote! {
{
#(#stmts)*
#ctx.node(#kind_str, vec![#(#field_args),*])
}
})
}
/// Parse the top-level list of a `trees!` template.
/// Each item is a node template or `{expr}` splice.
fn parse_direct_list(tokens: &mut Tokens, ctx: &Ident) -> Result<Vec<TokenStream>> {
let mut items = Vec::new();
while tokens.peek().is_some() {
if peek_is_group(tokens, Delimiter::Parenthesis) {
let group = expect_group(tokens, Delimiter::Parenthesis)?;
let mut inner = group.stream().into_iter().peekable();
// Regular node
let node = parse_direct_node_inner(&mut inner, ctx)?;
items.push(quote! { __nodes.push(#node); });
continue;
}
// {expr} or {..expr} — single node or splice
if peek_is_group(tokens, Delimiter::Brace) {
let group = expect_group(tokens, Delimiter::Brace)?;
let mut inner = group.stream().into_iter().peekable();
if peek_is_dotdot(&inner) {
inner.next(); // consume first .
inner.next(); // consume second .
let expr: TokenStream = inner.collect();
items.push(quote! { __nodes.extend(#expr); });
} else {
let expr = group.stream();
items.push(quote! { __nodes.push(#expr); });
}
continue;
}
break;
}
Ok(items)
}
// ---------------------------------------------------------------------------
// rule! parsing
// ---------------------------------------------------------------------------
/// A captured variable from a query pattern.
struct CaptureInfo {
name: String,
multiplicity: CaptureMultiplicity,
}
#[derive(Clone, Copy, PartialEq)]
enum CaptureMultiplicity {
/// Exactly one match (bare pattern or after no quantifier)
Single,
/// Zero or one match (after `?`)
Optional,
/// Zero or more matches (after `*` or `+`, or inside a repeated group)
Repeated,
}
/// Walk a token stream and extract all `@name` captures, noting whether
/// they appear after `*` or `+` (repeated) or not.
fn extract_captures(stream: &TokenStream) -> Vec<CaptureInfo> {
let mut captures = Vec::new();
extract_captures_inner(
&mut stream.clone().into_iter().peekable(),
&mut captures,
CaptureMultiplicity::Single,
);
captures
}
fn extract_captures_inner(
tokens: &mut Tokens,
captures: &mut Vec<CaptureInfo>,
parent_mult: CaptureMultiplicity,
) {
let mut last_mult = CaptureMultiplicity::Single;
while let Some(tok) = tokens.next() {
match tok {
TokenTree::Group(g) => {
let mut inner = g.stream().into_iter().peekable();
let group_mult = match tokens.peek() {
Some(TokenTree::Punct(p)) if p.as_char() == '*' || p.as_char() == '+' => {
CaptureMultiplicity::Repeated
}
Some(TokenTree::Punct(p)) if p.as_char() == '?' => {
CaptureMultiplicity::Optional
}
_ => CaptureMultiplicity::Single,
};
last_mult = group_mult;
let child_mult = if parent_mult == CaptureMultiplicity::Repeated
|| group_mult == CaptureMultiplicity::Repeated
{
CaptureMultiplicity::Repeated
} else if parent_mult == CaptureMultiplicity::Optional
|| group_mult == CaptureMultiplicity::Optional
{
CaptureMultiplicity::Optional
} else {
CaptureMultiplicity::Single
};
extract_captures_inner(&mut inner, captures, child_mult);
}
TokenTree::Punct(p) if p.as_char() == '@' => {
if let Some(TokenTree::Ident(name)) = tokens.next() {
let mult = if parent_mult == CaptureMultiplicity::Repeated
|| last_mult == CaptureMultiplicity::Repeated
{
CaptureMultiplicity::Repeated
} else if parent_mult == CaptureMultiplicity::Optional
|| last_mult == CaptureMultiplicity::Optional
{
CaptureMultiplicity::Optional
} else {
CaptureMultiplicity::Single
};
captures.push(CaptureInfo {
name: name.to_string(),
multiplicity: mult,
});
}
last_mult = CaptureMultiplicity::Single;
}
TokenTree::Punct(p) if matches!(p.as_char(), '*' | '+' | '?') => {
// Keep last_mult — the @capture follows
}
_ => {
last_mult = CaptureMultiplicity::Single;
}
}
}
}
/// Parse `rule!( query => transform )`.
pub fn parse_rule_top(input: TokenStream) -> Result<TokenStream> {
let mut tokens = input.into_iter().peekable();
// Collect query tokens up to `=>`
let mut query_tokens = Vec::new();
loop {
match tokens.peek() {
None => return Err(syn::Error::new(Span::call_site(), "expected `=>` in rule!")),
Some(TokenTree::Punct(p)) if p.as_char() == '=' => {
let eq = tokens.next().unwrap();
match tokens.peek() {
Some(TokenTree::Punct(p)) if p.as_char() == '>' => {
tokens.next(); // consume >
break;
}
_ => {
query_tokens.push(eq);
continue;
}
}
}
_ => {
query_tokens.push(tokens.next().unwrap());
}
}
}
let query_stream: TokenStream = query_tokens.into_iter().collect();
// Extract captures from query
let captures = extract_captures(&query_stream);
// Parse query
let query_code = parse_query_top(query_stream.clone())?;
// Generate capture bindings
let ctx_ident = Ident::new(IMPLICIT_CTX, Span::call_site());
let bindings: Vec<TokenStream> = captures
.iter()
.map(|cap| {
let name = Ident::new(&cap.name, Span::call_site());
let name_str = &cap.name;
match cap.multiplicity {
CaptureMultiplicity::Repeated => {
quote! { let #name: Vec<usize> = __captures.get_all(#name_str); }
}
CaptureMultiplicity::Optional => {
quote! { let #name: Option<usize> = __captures.get_opt(#name_str); }
}
CaptureMultiplicity::Single => {
quote! { let #name: usize = __captures.get_var(#name_str).unwrap(); }
}
}
})
.collect();
// Parse transform: either shorthand `=> kind_name` or full `=> (template ...)`
let transform_body = if peek_is_field(&mut tokens) && {
// Shorthand form: bare identifier = output node kind.
// Auto-generate template from captures.
let mut lookahead = tokens.clone();
lookahead.next(); // skip ident
lookahead.peek().is_none() // nothing after = shorthand
} {
let output_kind = expect_ident(&mut tokens, "expected output node kind")?;
let output_kind_str = output_kind.to_string();
// Generate field assignments from captures
let field_stmts: Vec<TokenStream> = captures
.iter()
.map(|cap| {
let name = Ident::new(&cap.name, Span::call_site());
let name_str = &cap.name;
match cap.multiplicity {
CaptureMultiplicity::Repeated => quote! {
let __field_id = #ctx_ident.ast.field_id_for_name(#name_str)
.unwrap_or_else(|| panic!("field '{}' not found", #name_str));
__fields.insert(__field_id, #name);
},
CaptureMultiplicity::Optional => quote! {
let __field_id = #ctx_ident.ast.field_id_for_name(#name_str)
.unwrap_or_else(|| panic!("field '{}' not found", #name_str));
if let Some(__id) = #name {
__fields.entry(__field_id).or_insert_with(Vec::new).push(__id);
}
},
CaptureMultiplicity::Single => quote! {
let __field_id = #ctx_ident.ast.field_id_for_name(#name_str)
.unwrap_or_else(|| panic!("field '{}' not found", #name_str));
__fields.entry(__field_id).or_insert_with(Vec::new).push(#name);
},
}
})
.collect();
quote! {
let __kind = #ctx_ident.ast.id_for_node_kind(#output_kind_str)
.unwrap_or_else(|| panic!("node kind '{}' not found", #output_kind_str));
let mut __fields = std::collections::BTreeMap::new();
#(#field_stmts)*
let __id = #ctx_ident.ast.create_node_with_range(
__kind,
yeast::NodeContent::DynamicString(String::new()),
__fields,
true,
__source_range,
);
vec![__id]
}
} else {
// Full template form
let transform_items = parse_direct_list(&mut tokens, &ctx_ident)?;
if let Some(tok) = tokens.next() {
return Err(syn::Error::new_spanned(
tok,
"unexpected token after rule! transform",
));
}
quote! {
let mut __nodes: Vec<usize> = Vec::new();
#(#transform_items)*
__nodes
}
};
Ok(quote! {
{
let __query = #query_code;
yeast::Rule::new(__query, Box::new(|__ast: &mut yeast::Ast, __captures: yeast::captures::Captures, __fresh: &yeast::tree_builder::FreshScope, __source_range: Option<tree_sitter::Range>| {
#(#bindings)*
let mut #ctx_ident = yeast::build::BuildCtx::with_source_range(__ast, &__captures, __fresh, __source_range);
#transform_body
}))
}
})
}
// ---------------------------------------------------------------------------
// Token utilities
// ---------------------------------------------------------------------------
fn peek_is_at(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Punct(p)) if p.as_char() == '@')
}
fn peek_is_literal(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Literal(_)))
}
fn peek_is_dollar(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Punct(p)) if p.as_char() == '$')
}
fn peek_is_hash(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Punct(p)) if p.as_char() == '#')
}
/// Check for `..` (two consecutive dot punctuation tokens).
fn peek_is_dotdot(tokens: &Tokens) -> bool {
let mut lookahead = tokens.clone();
matches!(lookahead.next(), Some(TokenTree::Punct(p)) if p.as_char() == '.')
&& matches!(lookahead.next(), Some(TokenTree::Punct(p)) if p.as_char() == '.')
}
fn peek_is_underscore(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Ident(id)) if *id == "_")
}
/// Check if the next tokens form a field specification (ident followed by `:` or `*:`).
/// A bare identifier (other than `_`) at this position is always a field name, since
/// bare child patterns must start with `(`, `@`, `"literal"`, or `_`.
fn peek_is_field(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Ident(id)) if *id != "_")
}
fn peek_is_group(tokens: &mut Tokens, delim: Delimiter) -> bool {
matches!(tokens.peek(), Some(TokenTree::Group(g)) if g.delimiter() == delim)
}
fn peek_is_repetition(tokens: &mut Tokens) -> bool {
matches!(tokens.peek(), Some(TokenTree::Punct(p)) if matches!(p.as_char(), '*' | '+' | '?'))
}
fn expect_ident(tokens: &mut Tokens, msg: &str) -> Result<Ident> {
match tokens.next() {
Some(TokenTree::Ident(id)) => Ok(id),
Some(tok) => Err(syn::Error::new_spanned(tok, msg)),
None => Err(syn::Error::new(Span::call_site(), msg)),
}
}
fn expect_literal(tokens: &mut Tokens) -> Result<Literal> {
match tokens.next() {
Some(TokenTree::Literal(lit)) => Ok(lit),
Some(tok) => Err(syn::Error::new_spanned(tok, "expected string literal")),
None => Err(syn::Error::new(
Span::call_site(),
"expected string literal",
)),
}
}
fn expect_punct(tokens: &mut Tokens, ch: char, msg: &str) -> Result<()> {
match tokens.next() {
Some(TokenTree::Punct(p)) if p.as_char() == ch => Ok(()),
Some(tok) => Err(syn::Error::new_spanned(tok, msg)),
None => Err(syn::Error::new(Span::call_site(), msg)),
}
}
fn expect_group(tokens: &mut Tokens, delim: Delimiter) -> Result<proc_macro2::Group> {
match tokens.next() {
Some(TokenTree::Group(g)) if g.delimiter() == delim => Ok(g),
Some(tok) => Err(syn::Error::new_spanned(
tok,
format!("expected {delim:?} group"),
)),
None => Err(syn::Error::new(
Span::call_site(),
format!("expected {delim:?} group"),
)),
}
}
fn expect_repetition(tokens: &mut Tokens) -> Result<TokenStream> {
match tokens.next() {
Some(TokenTree::Punct(p)) => match p.as_char() {
'*' => Ok(quote! { yeast::query::Rep::ZeroOrMore }),
'+' => Ok(quote! { yeast::query::Rep::OneOrMore }),
'?' => Ok(quote! { yeast::query::Rep::ZeroOrOne }),
_ => Err(syn::Error::new(p.span(), "expected `*`, `+`, or `?`")),
},
Some(tok) => Err(syn::Error::new_spanned(
tok,
"expected repetition quantifier",
)),
None => Err(syn::Error::new(
Span::call_site(),
"expected repetition quantifier",
)),
}
}
fn maybe_wrap_capture(tokens: &mut Tokens, base: TokenStream) -> Result<TokenStream> {
if peek_is_at(tokens) {
tokens.next(); // consume @
let name = expect_ident(tokens, "expected capture name after @")?;
let name_str = name.to_string();
Ok(quote! {
yeast::query::QueryNode::Capture {
capture: #name_str,
node: Box::new(#base),
}
})
} else {
Ok(base)
}
}
fn maybe_wrap_repetition(tokens: &mut Tokens, single: TokenStream) -> Result<TokenStream> {
if peek_is_repetition(tokens) {
let rep = expect_repetition(tokens)?;
Ok(quote! {
yeast::query::QueryListElem::Repeated {
children: vec![#single],
rep: #rep,
}
})
} else {
Ok(single)
}
}
/// If `@name` follows a Repeated list element, wrap each child SingleNode
/// inside the repetition with a Capture. This matches tree-sitter semantics
/// where `(_)* @name` captures each matched node.
fn maybe_wrap_list_capture(tokens: &mut Tokens, elem: TokenStream) -> Result<TokenStream> {
if peek_is_at(tokens) {
tokens.next();
let name = expect_ident(tokens, "expected capture name after @")?;
let name_str = name.to_string();
// Re-parse the element isn't practical, so we generate a wrapper
// that creates a new Repeated with each child wrapped in a capture.
// The simplest approach: generate code that the runtime can interpret.
// Actually, the capture annotation on repeated elements is best handled
// by re-generating the Repeated with captures injected.
// For now, assume the common case: the repetition contains a single
// SingleNode child, and we wrap that node in a capture.
Ok(quote! {
{
let __rep = #elem;
match __rep {
yeast::query::QueryListElem::Repeated { children, rep } => {
yeast::query::QueryListElem::Repeated {
children: children.into_iter().map(|child| {
match child {
yeast::query::QueryListElem::SingleNode(node) => {
yeast::query::QueryListElem::SingleNode(
yeast::query::QueryNode::Capture {
capture: #name_str,
node: Box::new(node),
}
)
}
other => other,
}
}).collect(),
rep,
}
}
other => other,
}
}
})
} else {
Ok(elem)
}
}