Let’s take a look at the following expression:
6 + 8 * 2
Whenever the compiler encounters any expression to be executed, it goes through the following three stages:
Our point of interest here is the second step, syntax analysis. This is the step that produces the abstract syntax tree (AST).
We’ll take our expression example again. In the first step of lexical analysis, the code will be broken down into smaller pieces called tokens.
In the next step of syntax analysis, the tokens are converted into a tree called the abstract syntax tree. The structure of the tree is similar to the code structure.
The tree also forms the basis of the hierarchy of steps to perform. For example, in our expression, the
* operation will be performed before the
One of the best uses of the AST is to find syntax errors in the code.
There are some core requirements of the compiler to process the AST correctly:
View all Courses