In this lecture we introduced the basic notation and terminology required to describe formal grammar and languages, we showed how a finite set of production rules (a gram- mar) was a convenient way of describing a potentially infinitely large set of strings (a language), we describe how regular expressions provide a con- venient way of describing regular languages,.