Raku Books / Creating a Compiler in Raku

Building AST

In this chapter, we will be working on implementing AST, the abstract syntax tree, that represents the program in the form of connected nodes, which are responsible for atomic actions such as variable declaration, or computing a sum of two values, or calling a function. This is probably the most difficult and brain puzzling chapter in the book.

But first, let me demonstrate why adding another layer of abstraction can be beneficial.

Course navigation

Review and test   |   Thinking of the if keyword