lang/ast/iterate.h

#ifndef _AST_ITERATE_H_
#define _AST_ITERATE_H_

struct ivy_ast_node_iterator;
struct ivy_ast_node;

extern void ast_node_iterator_enqueue_node(
	struct ivy_ast_node_iterator *it, struct ivy_ast_node *parent,
	struct ivy_ast_node *node);

#endif
lang: ast: implement ast iteration iteration is implementing without recursion, instead using type-specific callbacks to construct a queue of nodes to iterate through. ast priting is implemented using this functionality. 2024-11-24 20:50:12 +00:00			`#ifndef _AST_ITERATE_H_`
			`#define _AST_ITERATE_H_`

lang: add user args to ast iterator; combine pre/post-order traversal modes the caller can now provide a pointer arg to ivy_ast_node_iterate, which will be forwarded to the specified callback function each time it is called. the iterator now behaves similarly to fts, in that it visits each node in both pre-order and post-order, and indicates to the callback whether the current iteration is pre- or post-order. 2025-04-14 12:24:42 +01:00			`struct ivy_ast_node_iterator;`
			`struct ivy_ast_node;`

lang: ast: implement ast iteration iteration is implementing without recursion, instead using type-specific callbacks to construct a queue of nodes to iterate through. ast priting is implemented using this functionality. 2024-11-24 20:50:12 +00:00			`extern void ast_node_iterator_enqueue_node(`
ast: implement postorder ast traversal 2025-04-14 09:44:37 +01:00			`struct ivy_ast_node_iterator it, struct ivy_ast_node parent,`
lang: ast: implement ast iteration iteration is implementing without recursion, instead using type-specific callbacks to construct a queue of nodes to iterate through. ast priting is implemented using this functionality. 2024-11-24 20:50:12 +00:00			`struct ivy_ast_node *node);`

ast: implement postorder ast traversal 2025-04-14 09:44:37 +01:00			`#endif`