# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1445295716 -3600
# Node ID db106e5b7c4d9c529fc27d58471d08f67b50938a
# Parent  b3129cff41e9b21644c91f1a6d51f9b53b94a51d
updated

diff -r b3129cff41e9 -r db106e5b7c4d hws/hw04.pdf
Binary file hws/hw04.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw04.tex
--- a/hws/hw04.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw04.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -79,7 +79,7 @@
 Does simplification always preserve the meaning of a regular
 expression? 
      
-\item The Sulzmann algorithm contains the function $mkeps$
+\item The Sulzmann \& Lu algorithm contains the function $mkeps$
       which answers how a regular expression can match the
       empty string. What is the answer of $mkeps$ for the
       regular expressions:    
@@ -93,7 +93,7 @@
   \]
 
 \item What is the purpose of the record regular expression
-  in the Sulzmann algorithm?
+  in the Sulzmann \& Lu algorithm?
   
   
 %\item (Optional) The tokenizer in \texttt{regexp3.scala} takes as
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw05.pdf
Binary file hws/hw05.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw05.tex
--- a/hws/hw05.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw05.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -11,6 +11,9 @@
 
 \section*{Homework 5}
 
+\HEADER
+
+
 \begin{enumerate}
 \item Consider the basic regular expressions
 
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw06.pdf
Binary file hws/hw06.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw06.tex
--- a/hws/hw06.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw06.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -6,6 +6,8 @@
 
 \section*{Homework 6}
 
+\HEADER
+
 \begin{enumerate}
 \item (i) Give the regular expressions for lexing a language
 consisting of whitespaces, identifiers (some letters followed by digits), numbers,
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw07.pdf
Binary file hws/hw07.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw07.tex
--- a/hws/hw07.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw07.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -5,6 +5,8 @@
 
 \section*{Homework 7}
 
+\HEADER
+
 \begin{enumerate}
 \item Suppose the context-sensitive grammar
 
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw08.pdf
Binary file hws/hw08.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw08.tex
--- a/hws/hw08.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw08.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -6,6 +6,8 @@
 
 \section*{Homework 8}
 
+\HEADER
+
 \begin{enumerate}
 \item Write a program in the WHILE-language that calculates
       the factorial function.
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw09.pdf
Binary file hws/hw09.pdf has changed
diff -r b3129cff41e9 -r db106e5b7c4d hws/hw09.tex
--- a/hws/hw09.tex	Mon Oct 19 23:49:25 2015 +0100
+++ b/hws/hw09.tex	Tue Oct 20 00:01:56 2015 +0100
@@ -6,6 +6,8 @@
 
 \section*{Homework 9}
 
+\HEADER
+
 \begin{enumerate}
 \item Describe what is meant by \emph{eliminating tail
       recursion}, when such an optimization can be applied and