In the previous lecture we discussed the definition of a formal language by a grammar. We also saw how to represent a grammar as a particular form of an inductive definition. In this lecture we ...

We saw that we can represent the syntax of a program as an abstract syntax tree (AST), an algebraic data type that reflects the shape of the program. Syntax is, for our purposes, the "easy" part of ...