AST Node Structures

Your Task

Design and implement AST node structures for a C-like language.

Requirements

1. Define an ASTNodeType enum covering:

   • Expressions: NODE_BINARY, NODE_UNARY, NODE_LITERAL, NODE_IDENTIFIER, NODE_CALL
   • Statements: NODE_RETURN, NODE_IF, NODE_WHILE, NODE_BLOCK, NODE_EXPR_STMT
   • Declarations: NODE_VAR_DECL, NODE_FUNC_DECL, NODE_PARAM
   • Program: NODE_PROGRAM (root node)

2. Create a flexible ASTNode struct:

   • Node type
   • Source location (line, column)
   • Union or tagged union for type-specific data
   • Array of child node pointers

3. Implement constructor functions:

   • ast_create_literal(value, type)
   • ast_create_binary(operator, left, right)
   • ast_create_unary(operator, operand)
   • ast_create_if(condition, then_branch, else_branch)
   • General ast_create_node(type)

4. Implement ast_destroy() that recursively frees the tree

Success Criteria

• Can represent: int x = 2 + 3;
• Can represent: if (x > 0) return x; else return -x;
• No memory leaks when tree is destroyed