handouts/ho05.tex
changeset 152 90e27fafc5c7
parent 151 df229ec49b22
child 153 70ab41cb610e
--- a/handouts/ho05.tex	Fri Oct 25 14:13:27 2013 +0100
+++ b/handouts/ho05.tex	Fri Oct 25 14:33:35 2013 +0100
@@ -58,7 +58,13 @@
 
 \section*{Handout 5}
 
-
+Whenever you want to design a programming language or implement a compiler for an
+existing language, the first task is to fix the basic ``words'' of the language, like what are the k
+eywords, what are permitted identifiers and so on. One convenient way to do this is, of 
+course, to use regular expressions. In this course we want to take a closer look at the 
+WHILE-language. This is a simple imperative language consisting of arithmetic
+expressions, assignments and loops only. For example the Fibonacci program can be
+written in this language as follows
 
 
 \end{document}