Today we will do something relatively easy: let's add a way to declare boolean variables and express boolean literals.

Now that we have the basic language set implemented we can consider adding new features to it. Today we will add arrays.

In this part we will complete the missing statements from part 6 and finish our front end.

In part 5 we described the objects that we will need to semantically analyze a tiny program. In current part we will extend the parser of part 4 to do the semantic analysis and create the GENERIC trees.

In the last installment of this series we saw how to verify that the sequence of tokens of the input is syntactically valid. Today we will see what we need to give it meaning.