Defining Languages
A grammar states the rules of a language.
A recursive algorithm can be written based on this grammar that determines whether a given string is a member of the language ==> recognition algorithm.
For expressing a grammar we use special symbols:
X.Y or simply X Y means X followed by Y
<xyz> an instance of entity xyz