-
Notifications
You must be signed in to change notification settings - Fork 2
Open
Description
I actually renamed the other question, but I was looking at the verbosity levels because I was really trying to get a dump of the strongly-typed ASTs to see how everything hangs together, could you maybe provide a pointer how to do that ?
I realize that there are different kinds of ASTs depending on the stage of the solver - I am mainly interested in the BFS implementation that traverses the AST to compare candidate trees.
In particular, I would like to learn how new objects/types are represented at the AST level.
Thank you
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels