Implementing AST (Abstract Syntax Tree) Nodes

[ahmetozdemirrr]

Aim: To create a hierarchical representation of the source code and add the AST structure to the project to support the semantic analysis, code generation and optimization phases.

In the process of compiler or interpreter development, creating an Abstract Syntax Tree (AST) allows us to perform a structural and semantic analysis of the source code. The AST is a hierarchical representation of the code parse according to grammar rules and plays a critical role in phases such as code generation, optimization and interpretation.

To Do:

1 - Design AST Data Structure:

* Define AST node structure (e.g., node type, child nodes, values). 
* Specify node types for different expression and statement types. 

2 - Update Bison Rules:

* Create AST nodes in the bodies of grammar rules. 
* Link nodes using symbols such as $$, $1, $2, etc. 

3 - Symbolic Table Integration:

* Integrate symbolic table management for variables and functions with AST.
* Support type checking and scope management. 

4 - Visitor Functions for Code Generation:

* Write functions that generate intermediate or target code by traversing the AST. 
* Generate code templates for operations and expressions. 

5 - Memory Management and Debugging:

* Organize memory allocation and release for AST nodes. 
* Use location information in error messages to provide more meaningful feedback.