# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1382708015 -3600
# Node ID 90e27fafc5c7312840c152e9c087e5e0d4b8a4df
# Parent  df229ec49b227f957cbf91c0cf20ead2d1935580
added ho

diff -r df229ec49b22 -r 90e27fafc5c7 handouts/ho05.pdf
Binary file handouts/ho05.pdf has changed
diff -r df229ec49b22 -r 90e27fafc5c7 handouts/ho05.tex
--- 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}