Documentation

Regex.Syntax.Ast.Visitor

Visitor #

Visit (Syntax.Ast.visit) every item in an abstract syntax tree Syntax.Ast.Ast recursively using the class Syntax.Ast.Visitor.

class Syntax.AstItems.Visitor (α : Type v) (σ : Type w) :
Type (max v w)

A class for visiting an abstract syntax tree (AST) in depth first order.

Instances
    @[reducible, inline]
    abbrev Syntax.AstItems.M (σ : Type u_1) (String : Type u_2) (α : Type u_1) :
    Type (max u_1 u_2)
    Equations
    Instances For
      @[irreducible]
      Instances For
        def Syntax.AstItems.visit {α σ : Type} [Inhabited α] (β : Syntax.AstItems.Visitor α σ) (state : σ) (ast : Syntax.AstItems.Ast) :

        Visit every item in an Ast recursively

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For