air-parser 0.4.0

Parser for the AirScript language
Documentation
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
//! This module provides infrastructure for the visitor pattern over the AirScript AST
//!
//! Implementations of [VisitMut] need only provide implementations of trait functions for
//! the specific AST nodes which they are interested in, or which provide important context.
//! By default, with no trait functions overridden, a visitor will simply traverse the AST
//! top-down. When you override one of the trait functions, it is up to the implementation to
//! drive the visitor down to children of the corresponding node type, if desired. For that purpose,
//! this module exposes a number of `visit_mut_*` functions which can be called to perform the
//! default visitor traversal for that node.
use core::ops::ControlFlow;

use crate::ast;

/// This trait represents a mutable visitor over the AST.
///
/// See the example below for usage.
///
/// Each node visitor returns a `ControlFlow<T>`, which allows implementations to terminate the
/// traversal early, which is particularly useful for error handling, but can be used for other
/// purposes as well.
///
/// ## Example
///
/// ```rust
/// use std::ops::ControlFlow;
///
/// use miden_diagnostics::{Span, Spanned};
///
/// use air_parser::ast::{self, visit};
///
/// /// A simple visitor which replaces accesses to constant values with the values themselves,
/// /// evaluates constant expressions (i.e. expressions whose operands are constant), and propagates
/// /// constants through let-bound variables (i.e. let bindings which are constant get replaced with
/// /// the constant itself).
/// struct ConstantPropagationVisitor {
///     constants: std::collections::HashMap<ast::Identifier, Span<ast::ConstantExpr>>,
/// }
/// impl visit::VisitMut<()> for ConstantPropagationVisitor {
///     // We override the visitor for constants so that we can record all of the known constant values
///     fn visit_mut_constant(&mut self, constant: &mut ast::Constant) -> ControlFlow<()> {
///         debug_assert_eq!(self.constants.get(&constant.name), None);
///         let span = constant.span();
///         self.constants.insert(constant.name, Span::new(span, constant.value.clone()));
///         ControlFlow::Continue(())
///     }
///
///     // We override the visitor for scalar expressions to propagate constants by evaluating any expressions
///     // whose values or operands are all constant.
///     fn visit_mut_scalar_expr(&mut self, expr: &mut ast::ScalarExpr) -> ControlFlow<()> {
///         let span = expr.span();
///         match expr {
///             ast::ScalarExpr::Const(_) => ControlFlow::Continue(()),
///             ast::ScalarExpr::SymbolAccess(sym) => {
///                 let constant_value = self.constants.get(sym.name.as_ref()).cloned();
///                 match constant_value.map(|s| (s.span(), s.item)){
///                     None => (),
///                     Some((span, ast::ConstantExpr::Scalar(value))) => {
///                         assert_eq!(sym.access_type, ast::AccessType::Default);
///                         core::mem::replace(expr, ast::ScalarExpr::Const(Span::new(span, value)));
///                     }
///                     Some((span, ast::ConstantExpr::Vector(value))) => {
///                         match sym.access_type {
///                             ast::AccessType::Index(idx) => {
///                                 core::mem::replace(expr, ast::ScalarExpr::Const(Span::new(span, value[idx])));
///                             }
///                             _ => panic!("invalid constant reference, expected scalar access"),
///                         }
///                     }
///                     Some((span, ast::ConstantExpr::Matrix(value))) => {
///                         match sym.access_type {
///                             ast::AccessType::Matrix(row, col) => {
///                                 core::mem::replace(expr, ast::ScalarExpr::Const(Span::new(span, value[row][col])));
///                             }
///                             _ => panic!("invalid constant reference, expected scalar access"),
///                         }
///                     }
///                 }
///                 ControlFlow::Continue(())
///             }
///             ast::ScalarExpr::Binary(ast::BinaryExpr { op: ast::BinaryOp::Add, lhs, rhs, .. }) => {
///                 visit::visit_mut_scalar_expr(self, lhs)?;
///                 visit::visit_mut_scalar_expr(self, rhs)?;
///                 // If both operands are constant, evaluate to a scalar constant
///                 if let (ast::ScalarExpr::Const(l), ast::ScalarExpr::Const(r)) = (lhs.as_mut(), rhs.as_mut()) {
///                     let folded = l.item + r.item;
///                     core::mem::replace(expr, ast::ScalarExpr::Const(Span::new(span, folded)));
///                 }
///                 ControlFlow::Continue(())
///             }
///             /// The other arithmetic ops are basically the same as above
///             _ => unimplemented!(),
///         }
///     }
///
///     // The implementation of this visitor is left as an exercise for the reader, but would be necessary
///     // to ensure that we propagate constants through let-bound variables whose expressions are constant.
///     //
///     // It would also be necessary for us to preserve and update the bindings map in our visitor upon entry
///     // to the let, and replace the original on exit from the let. This would automatically ensure that constants
///     // get propagated through let-bound variables. All other identifiers can be safely ignored, with the exception
///     // of those which shadow a binding that was previously constant, in which case it effectively erases that binding
///     // from view.
///     fn visit_mut_let(&mut self, _expr: &mut ast::Let) -> ControlFlow<()> {
///         todo!()
///     }
/// }
/// ```
///
pub trait VisitMut<T> {
    fn visit_mut_module(&mut self, module: &mut ast::Module) -> ControlFlow<T> {
        visit_mut_module(self, module)
    }
    fn visit_mut_import(&mut self, expr: &mut ast::Import) -> ControlFlow<T> {
        visit_mut_import(self, expr)
    }
    fn visit_mut_constant(&mut self, expr: &mut ast::Constant) -> ControlFlow<T> {
        visit_mut_constant(self, expr)
    }
    fn visit_mut_evaluator_function(
        &mut self,
        expr: &mut ast::EvaluatorFunction,
    ) -> ControlFlow<T> {
        visit_mut_evaluator_function(self, expr)
    }
    fn visit_mut_function(&mut self, expr: &mut ast::Function) -> ControlFlow<T> {
        visit_mut_function(self, expr)
    }
    fn visit_mut_bus(&mut self, expr: &mut ast::Bus) -> ControlFlow<T> {
        visit_mut_bus(self, expr)
    }
    fn visit_mut_periodic_column(&mut self, expr: &mut ast::PeriodicColumn) -> ControlFlow<T> {
        visit_mut_periodic_column(self, expr)
    }
    fn visit_mut_public_input(&mut self, expr: &mut ast::PublicInput) -> ControlFlow<T> {
        visit_mut_public_input(self, expr)
    }
    fn visit_mut_trace_segment(&mut self, expr: &mut ast::TraceSegment) -> ControlFlow<T> {
        visit_mut_trace_segment(self, expr)
    }
    fn visit_mut_trace_binding(&mut self, expr: &mut ast::TraceBinding) -> ControlFlow<T> {
        visit_mut_trace_binding(self, expr)
    }
    fn visit_mut_evaluator_trace_segment(
        &mut self,
        expr: &mut ast::TraceSegment,
    ) -> ControlFlow<T> {
        visit_mut_evaluator_trace_segment(self, expr)
    }
    fn visit_mut_evaluator_trace_binding(
        &mut self,
        expr: &mut ast::TraceBinding,
    ) -> ControlFlow<T> {
        visit_mut_evaluator_trace_binding(self, expr)
    }
    fn visit_mut_statement_block(&mut self, expr: &mut Vec<ast::Statement>) -> ControlFlow<T> {
        visit_mut_statement_block(self, expr)
    }
    fn visit_mut_statement(&mut self, expr: &mut ast::Statement) -> ControlFlow<T> {
        visit_mut_statement(self, expr)
    }
    fn visit_mut_let(&mut self, expr: &mut ast::Let) -> ControlFlow<T> {
        visit_mut_let(self, expr)
    }
    fn visit_mut_boundary_constraints(
        &mut self,
        exprs: &mut Vec<ast::Statement>,
    ) -> ControlFlow<T> {
        self.visit_mut_statement_block(exprs)
    }
    fn visit_mut_enforce(&mut self, expr: &mut ast::ScalarExpr) -> ControlFlow<T> {
        visit_mut_scalar_expr(self, expr)
    }
    fn visit_mut_enforce_if(
        &mut self,
        expr: &mut ast::ScalarExpr,
        selector: &mut ast::ScalarExpr,
    ) -> ControlFlow<T> {
        self.visit_mut_enforce(expr)?;
        self.visit_mut_scalar_expr(selector)
    }
    fn visit_mut_enforce_all(&mut self, expr: &mut ast::ListComprehension) -> ControlFlow<T> {
        self.visit_mut_list_comprehension(expr)
    }
    fn visit_mut_bus_enforce(&mut self, expr: &mut ast::ListComprehension) -> ControlFlow<T> {
        self.visit_mut_list_comprehension(expr)
    }
    fn visit_mut_integrity_constraints(
        &mut self,
        exprs: &mut Vec<ast::Statement>,
    ) -> ControlFlow<T> {
        self.visit_mut_statement_block(exprs)
    }
    fn visit_mut_expr(&mut self, expr: &mut ast::Expr) -> ControlFlow<T> {
        visit_mut_expr(self, expr)
    }
    fn visit_mut_scalar_expr(&mut self, expr: &mut ast::ScalarExpr) -> ControlFlow<T> {
        visit_mut_scalar_expr(self, expr)
    }
    fn visit_mut_binary_expr(&mut self, expr: &mut ast::BinaryExpr) -> ControlFlow<T> {
        visit_mut_binary_expr(self, expr)
    }
    fn visit_mut_list_comprehension(
        &mut self,
        expr: &mut ast::ListComprehension,
    ) -> ControlFlow<T> {
        visit_mut_list_comprehension(self, expr)
    }
    fn visit_mut_call(&mut self, expr: &mut ast::Call) -> ControlFlow<T> {
        visit_mut_call(self, expr)
    }
    fn visit_mut_bus_operation(&mut self, expr: &mut ast::BusOperation) -> ControlFlow<T> {
        visit_mut_bus_operation(self, expr)
    }
    fn visit_mut_range_bound(&mut self, expr: &mut ast::RangeBound) -> ControlFlow<T> {
        visit_mut_range_bound(self, expr)
    }
    fn visit_mut_access_type(&mut self, expr: &mut ast::AccessType) -> ControlFlow<T> {
        visit_mut_access_type(self, expr)
    }
    fn visit_mut_const_symbol_access(
        &mut self,
        expr: &mut ast::ConstSymbolAccess,
    ) -> ControlFlow<T> {
        visit_mut_const_symbol_access(self, expr)
    }
    fn visit_mut_bounded_symbol_access(
        &mut self,
        expr: &mut ast::BoundedSymbolAccess,
    ) -> ControlFlow<T> {
        visit_mut_bounded_symbol_access(self, expr)
    }
    fn visit_mut_symbol_access(&mut self, expr: &mut ast::SymbolAccess) -> ControlFlow<T> {
        visit_mut_symbol_access(self, expr)
    }
    fn visit_mut_resolvable_identifier(
        &mut self,
        expr: &mut ast::ResolvableIdentifier,
    ) -> ControlFlow<T> {
        visit_mut_resolvable_identifier(self, expr)
    }
    fn visit_mut_identifier(&mut self, expr: &mut ast::Identifier) -> ControlFlow<T> {
        visit_mut_identifier(self, expr)
    }
    fn visit_mut_typed_identifier(
        &mut self,
        expr: &mut (ast::Identifier, ast::Type),
    ) -> ControlFlow<T> {
        visit_mut_typed_identifier(self, expr)
    }
}

impl<V, T> VisitMut<T> for &mut V
where
    V: ?Sized + VisitMut<T>,
{
    fn visit_mut_module(&mut self, module: &mut ast::Module) -> ControlFlow<T> {
        (**self).visit_mut_module(module)
    }
    fn visit_mut_import(&mut self, expr: &mut ast::Import) -> ControlFlow<T> {
        (**self).visit_mut_import(expr)
    }
    fn visit_mut_constant(&mut self, expr: &mut ast::Constant) -> ControlFlow<T> {
        (**self).visit_mut_constant(expr)
    }
    fn visit_mut_evaluator_function(
        &mut self,
        expr: &mut ast::EvaluatorFunction,
    ) -> ControlFlow<T> {
        (**self).visit_mut_evaluator_function(expr)
    }
    fn visit_mut_function(&mut self, expr: &mut ast::Function) -> ControlFlow<T> {
        (**self).visit_mut_function(expr)
    }
    fn visit_mut_bus(&mut self, expr: &mut ast::Bus) -> ControlFlow<T> {
        (**self).visit_mut_bus(expr)
    }
    fn visit_mut_periodic_column(&mut self, expr: &mut ast::PeriodicColumn) -> ControlFlow<T> {
        (**self).visit_mut_periodic_column(expr)
    }
    fn visit_mut_public_input(&mut self, expr: &mut ast::PublicInput) -> ControlFlow<T> {
        (**self).visit_mut_public_input(expr)
    }
    fn visit_mut_trace_segment(&mut self, expr: &mut ast::TraceSegment) -> ControlFlow<T> {
        (**self).visit_mut_trace_segment(expr)
    }
    fn visit_mut_trace_binding(&mut self, expr: &mut ast::TraceBinding) -> ControlFlow<T> {
        (**self).visit_mut_trace_binding(expr)
    }
    fn visit_mut_evaluator_trace_segment(
        &mut self,
        expr: &mut ast::TraceSegment,
    ) -> ControlFlow<T> {
        (**self).visit_mut_evaluator_trace_segment(expr)
    }
    fn visit_mut_evaluator_trace_binding(
        &mut self,
        expr: &mut ast::TraceBinding,
    ) -> ControlFlow<T> {
        (**self).visit_mut_evaluator_trace_binding(expr)
    }
    fn visit_mut_statement_block(&mut self, expr: &mut Vec<ast::Statement>) -> ControlFlow<T> {
        (**self).visit_mut_statement_block(expr)
    }
    fn visit_mut_statement(&mut self, expr: &mut ast::Statement) -> ControlFlow<T> {
        (**self).visit_mut_statement(expr)
    }
    fn visit_mut_let(&mut self, expr: &mut ast::Let) -> ControlFlow<T> {
        (**self).visit_mut_let(expr)
    }
    fn visit_mut_boundary_constraints(
        &mut self,
        exprs: &mut Vec<ast::Statement>,
    ) -> ControlFlow<T> {
        (**self).visit_mut_boundary_constraints(exprs)
    }
    fn visit_mut_integrity_constraints(
        &mut self,
        exprs: &mut Vec<ast::Statement>,
    ) -> ControlFlow<T> {
        (**self).visit_mut_integrity_constraints(exprs)
    }
    fn visit_mut_enforce(&mut self, expr: &mut ast::ScalarExpr) -> ControlFlow<T> {
        (**self).visit_mut_enforce(expr)
    }
    fn visit_mut_enforce_if(
        &mut self,
        expr: &mut ast::ScalarExpr,
        selector: &mut ast::ScalarExpr,
    ) -> ControlFlow<T> {
        (**self).visit_mut_enforce_if(expr, selector)
    }
    fn visit_mut_enforce_all(&mut self, expr: &mut ast::ListComprehension) -> ControlFlow<T> {
        (**self).visit_mut_enforce_all(expr)
    }
    fn visit_mut_bus_enforce(&mut self, expr: &mut ast::ListComprehension) -> ControlFlow<T> {
        (**self).visit_mut_bus_enforce(expr)
    }
    fn visit_mut_expr(&mut self, expr: &mut ast::Expr) -> ControlFlow<T> {
        (**self).visit_mut_expr(expr)
    }
    fn visit_mut_scalar_expr(&mut self, expr: &mut ast::ScalarExpr) -> ControlFlow<T> {
        (**self).visit_mut_scalar_expr(expr)
    }
    fn visit_mut_binary_expr(&mut self, expr: &mut ast::BinaryExpr) -> ControlFlow<T> {
        (**self).visit_mut_binary_expr(expr)
    }
    fn visit_mut_list_comprehension(
        &mut self,
        expr: &mut ast::ListComprehension,
    ) -> ControlFlow<T> {
        (**self).visit_mut_list_comprehension(expr)
    }
    fn visit_mut_call(&mut self, expr: &mut ast::Call) -> ControlFlow<T> {
        (**self).visit_mut_call(expr)
    }
    fn visit_mut_bus_operation(&mut self, expr: &mut ast::BusOperation) -> ControlFlow<T> {
        (**self).visit_mut_bus_operation(expr)
    }
    fn visit_mut_range_bound(&mut self, expr: &mut ast::RangeBound) -> ControlFlow<T> {
        (**self).visit_mut_range_bound(expr)
    }
    fn visit_mut_access_type(&mut self, expr: &mut ast::AccessType) -> ControlFlow<T> {
        (**self).visit_mut_access_type(expr)
    }
    fn visit_mut_const_symbol_access(
        &mut self,
        expr: &mut ast::ConstSymbolAccess,
    ) -> ControlFlow<T> {
        (**self).visit_mut_const_symbol_access(expr)
    }
    fn visit_mut_bounded_symbol_access(
        &mut self,
        expr: &mut ast::BoundedSymbolAccess,
    ) -> ControlFlow<T> {
        (**self).visit_mut_bounded_symbol_access(expr)
    }
    fn visit_mut_symbol_access(&mut self, expr: &mut ast::SymbolAccess) -> ControlFlow<T> {
        (**self).visit_mut_symbol_access(expr)
    }
    fn visit_mut_resolvable_identifier(
        &mut self,
        expr: &mut ast::ResolvableIdentifier,
    ) -> ControlFlow<T> {
        (**self).visit_mut_resolvable_identifier(expr)
    }
    fn visit_mut_identifier(&mut self, expr: &mut ast::Identifier) -> ControlFlow<T> {
        (**self).visit_mut_identifier(expr)
    }
    fn visit_mut_typed_identifier(
        &mut self,
        expr: &mut (ast::Identifier, ast::Type),
    ) -> ControlFlow<T> {
        (**self).visit_mut_typed_identifier(expr)
    }
}

pub fn visit_mut_module<V, T>(visitor: &mut V, module: &mut ast::Module) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    for import in module.imports.values_mut() {
        visitor.visit_mut_import(import)?;
    }
    for constant in module.constants.values_mut() {
        visitor.visit_mut_constant(constant)?;
    }
    for evaluator in module.evaluators.values_mut() {
        visitor.visit_mut_evaluator_function(evaluator)?;
    }
    for function in module.functions.values_mut() {
        visitor.visit_mut_function(function)?;
    }
    for bus in module.buses.values_mut() {
        visitor.visit_mut_bus(bus)?;
    }
    for column in module.periodic_columns.values_mut() {
        visitor.visit_mut_periodic_column(column)?;
    }
    for input in module.public_inputs.values_mut() {
        visitor.visit_mut_public_input(input)?;
    }
    for segment in module.trace_columns.iter_mut() {
        visitor.visit_mut_trace_segment(segment)?;
    }
    if let Some(bc) = module.boundary_constraints.as_mut() {
        if !bc.is_empty() {
            visitor.visit_mut_boundary_constraints(bc)?;
        }
    }
    if let Some(ic) = module.integrity_constraints.as_mut() {
        if !ic.is_empty() {
            visitor.visit_mut_integrity_constraints(ic)?;
        }
    }

    ControlFlow::Continue(())
}

pub fn visit_mut_import<V, T>(_visitor: &mut V, _expr: &mut ast::Import) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    ControlFlow::Continue(())
}

pub fn visit_mut_constant<V, T>(visitor: &mut V, expr: &mut ast::Constant) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name)
}

pub fn visit_mut_trace_segment<V, T>(
    visitor: &mut V,
    expr: &mut ast::TraceSegment,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    for binding in expr.bindings.iter_mut() {
        visitor.visit_mut_trace_binding(binding)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_trace_binding<V, T>(
    visitor: &mut V,
    expr: &mut ast::TraceBinding,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    if let Some(name) = expr.name.as_mut() {
        visitor.visit_mut_identifier(name)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_evaluator_function<V, T>(
    visitor: &mut V,
    expr: &mut ast::EvaluatorFunction,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name)?;
    for segment in expr.params.iter_mut() {
        visitor.visit_mut_evaluator_trace_segment(segment)?;
    }
    visitor.visit_mut_statement_block(&mut expr.body)
}

pub fn visit_mut_function<V, T>(visitor: &mut V, expr: &mut ast::Function) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name)?;
    for param in expr.params.iter_mut() {
        visitor.visit_mut_typed_identifier(param)?;
    }
    visitor.visit_mut_statement_block(&mut expr.body)
}

pub fn visit_mut_bus<V, T>(visitor: &mut V, expr: &mut ast::Bus) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name)
}

pub fn visit_mut_evaluator_trace_segment<V, T>(
    visitor: &mut V,
    expr: &mut ast::TraceSegment,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    for binding in expr.bindings.iter_mut() {
        visitor.visit_mut_evaluator_trace_binding(binding)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_evaluator_trace_binding<V, T>(
    visitor: &mut V,
    expr: &mut ast::TraceBinding,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    if let Some(name) = expr.name.as_mut() {
        visitor.visit_mut_identifier(name)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_periodic_column<V, T>(
    visitor: &mut V,
    expr: &mut ast::PeriodicColumn,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name)
}

pub fn visit_mut_public_input<V, T>(visitor: &mut V, expr: &mut ast::PublicInput) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_identifier(&mut expr.name())
}

pub fn visit_mut_statement_block<V, T>(
    visitor: &mut V,
    statements: &mut [ast::Statement],
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    for statement in statements.iter_mut() {
        visitor.visit_mut_statement(statement)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_statement<V, T>(visitor: &mut V, expr: &mut ast::Statement) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    match expr {
        ast::Statement::Let(expr) => visitor.visit_mut_let(expr),
        ast::Statement::Enforce(expr) => visitor.visit_mut_enforce(expr),
        ast::Statement::EnforceIf(expr, selector) => visitor.visit_mut_enforce_if(expr, selector),
        ast::Statement::EnforceAll(expr) => visitor.visit_mut_enforce_all(expr),
        ast::Statement::Expr(expr) => visitor.visit_mut_expr(expr),
        ast::Statement::BusEnforce(expr) => visitor.visit_mut_bus_enforce(expr),
    }
}

pub fn visit_mut_let<V, T>(visitor: &mut V, expr: &mut ast::Let) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_expr(&mut expr.value)?;
    visitor.visit_mut_identifier(&mut expr.name)?;
    for statement in expr.body.iter_mut() {
        visitor.visit_mut_statement(statement)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_expr<V, T>(visitor: &mut V, expr: &mut ast::Expr) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    match expr {
        ast::Expr::Const(_) => ControlFlow::Continue(()),
        ast::Expr::Range(range) => {
            visitor.visit_mut_range_bound(&mut range.start)?;
            visitor.visit_mut_range_bound(&mut range.end)?;
            ControlFlow::Continue(())
        }
        ast::Expr::Vector(exprs) => {
            for expr in exprs.iter_mut() {
                visitor.visit_mut_expr(expr)?;
            }
            ControlFlow::Continue(())
        }
        ast::Expr::Matrix(matrix) => {
            for exprs in matrix.iter_mut() {
                for expr in exprs.iter_mut() {
                    visitor.visit_mut_scalar_expr(expr)?;
                }
            }
            ControlFlow::Continue(())
        }
        ast::Expr::SymbolAccess(expr) => visitor.visit_mut_symbol_access(expr),
        ast::Expr::Binary(expr) => visitor.visit_mut_binary_expr(expr),
        ast::Expr::Call(expr) => visitor.visit_mut_call(expr),
        ast::Expr::ListComprehension(expr) => visitor.visit_mut_list_comprehension(expr),
        ast::Expr::Let(expr) => visitor.visit_mut_let(expr),
        ast::Expr::BusOperation(expr) => visitor.visit_mut_bus_operation(expr),
        ast::Expr::Null(_) | ast::Expr::Unconstrained(_) => ControlFlow::Continue(()),
    }
}

pub fn visit_mut_scalar_expr<V, T>(visitor: &mut V, expr: &mut ast::ScalarExpr) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    match expr {
        ast::ScalarExpr::Const(_)
        | ast::ScalarExpr::Null(_)
        | ast::ScalarExpr::Unconstrained(_) => ControlFlow::Continue(()),
        ast::ScalarExpr::SymbolAccess(expr) => visitor.visit_mut_symbol_access(expr),
        ast::ScalarExpr::BoundedSymbolAccess(expr) => visitor.visit_mut_bounded_symbol_access(expr),
        ast::ScalarExpr::Binary(expr) => visitor.visit_mut_binary_expr(expr),
        ast::ScalarExpr::Call(expr) => visitor.visit_mut_call(expr),
        ast::ScalarExpr::Let(expr) => visitor.visit_mut_let(expr),
        ast::ScalarExpr::BusOperation(expr) => visitor.visit_mut_bus_operation(expr),
    }
}

pub fn visit_mut_binary_expr<V, T>(visitor: &mut V, expr: &mut ast::BinaryExpr) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_scalar_expr(expr.lhs.as_mut())?;
    visitor.visit_mut_scalar_expr(expr.rhs.as_mut())
}

pub fn visit_mut_list_comprehension<V, T>(
    visitor: &mut V,
    expr: &mut ast::ListComprehension,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    for binding in expr.bindings.iter_mut() {
        visitor.visit_mut_identifier(binding)?;
    }
    for iterable in expr.iterables.iter_mut() {
        visitor.visit_mut_expr(iterable)?;
    }
    if let Some(selector) = expr.selector.as_mut() {
        visitor.visit_mut_scalar_expr(selector)?;
    }
    visitor.visit_mut_scalar_expr(expr.body.as_mut())
}

pub fn visit_mut_call<V, T>(visitor: &mut V, expr: &mut ast::Call) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_resolvable_identifier(&mut expr.callee)?;
    for arg in expr.args.iter_mut() {
        visitor.visit_mut_expr(arg)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_bus_operation<V, T>(
    visitor: &mut V,
    expr: &mut ast::BusOperation,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_resolvable_identifier(&mut expr.bus)?;
    for arg in expr.args.iter_mut() {
        visitor.visit_mut_expr(arg)?;
    }
    ControlFlow::Continue(())
}

pub fn visit_mut_range_bound<V, T>(visitor: &mut V, expr: &mut ast::RangeBound) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    match expr {
        ast::RangeBound::Const(_) => ControlFlow::Continue(()),
        ast::RangeBound::SymbolAccess(access) => visitor.visit_mut_const_symbol_access(access),
    }
}

pub fn visit_mut_access_type<V, T>(visitor: &mut V, expr: &mut ast::AccessType) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    match expr {
        ast::AccessType::Default | ast::AccessType::Index(_) | ast::AccessType::Matrix(_, _) => {
            ControlFlow::Continue(())
        }
        ast::AccessType::Slice(range) => {
            visitor.visit_mut_range_bound(&mut range.start)?;
            visitor.visit_mut_range_bound(&mut range.end)
        }
    }
}

pub fn visit_mut_const_symbol_access<V, T>(
    visitor: &mut V,
    expr: &mut ast::ConstSymbolAccess,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_resolvable_identifier(&mut expr.name)
}

pub fn visit_mut_bounded_symbol_access<V, T>(
    visitor: &mut V,
    expr: &mut ast::BoundedSymbolAccess,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_symbol_access(&mut expr.column)
}

pub fn visit_mut_symbol_access<V, T>(
    visitor: &mut V,
    expr: &mut ast::SymbolAccess,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    visitor.visit_mut_resolvable_identifier(&mut expr.name)
}

pub fn visit_mut_resolvable_identifier<V, T>(
    _visitor: &mut V,
    _expr: &mut ast::ResolvableIdentifier,
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    ControlFlow::Continue(())
}

pub fn visit_mut_identifier<V, T>(_visitor: &mut V, _expr: &mut ast::Identifier) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    ControlFlow::Continue(())
}

pub fn visit_mut_typed_identifier<V, T>(
    _visitor: &mut V,
    _expr: &mut (ast::Identifier, ast::Type),
) -> ControlFlow<T>
where
    V: ?Sized + VisitMut<T>,
{
    ControlFlow::Continue(())
}