Visitor #
Visit (Syntax.Ast.visit
) every item in an abstract syntax tree Syntax.Ast.Ast
recursively
using the class Syntax.Ast.Visitor
.
A class for visiting an abstract syntax tree (AST) in depth first order.
The result of visiting the AST or an error.
- start : σ → σ
This method is called before beginning traversal of the AST.
- visit_pre : Syntax.AstItems.Ast → StateT σ (Except String) PUnit
This method is called on an
Ast
before descending into childAst
nodes. - visit_post : Syntax.AstItems.Ast → StateT σ (Except String) PUnit
This method is called on an
Ast
after descending all of its childAst
nodes. - visit_class_set_item_pre : Syntax.AstItems.ClassSetItem → StateT σ (Except String) PUnit
This method is called on every [
ClassSetItem
] before descending into child nodes. - visit_class_set_item_post : Syntax.AstItems.ClassSetItem → StateT σ (Except String) PUnit
This method is called on every [
ClassSetItem
] after descending into child nodes. - visit_class_set_binary_op_pre : Syntax.AstItems.ClassSetBinaryOp → StateT σ (Except String) PUnit
This method is called on every [
ClassSetBinaryOp
] before descending into child nodes. - visit_class_set_binary_op_post : Syntax.AstItems.ClassSetBinaryOp → StateT σ (Except String) PUnit
This method is called on every [
ClassSetBinaryOp
] after descending into child nodes. - visit_class_set_binary_op_in : Syntax.AstItems.ClassSetBinaryOp → StateT σ (Except String) PUnit
This method is called between the left hand and right hand child nodes
Instances
Instances For
Visit every item in an Ast
recursively
Equations
- One or more equations did not get rendered due to their size.