Binary file cws/cw05.pdf has changed

--- a/cws/cw05.tex	Mon Aug 29 08:26:59 2022 +0200
+++ b/cws/cw05.tex	Fri Sep 16 12:52:21 2022 +0100
@@ -7,26 +7,27 @@
 \definecolor{pansypurple}{rgb}{0.47, 0.09, 0.29}
 
 \begin{document}
-\color{pansypurple}
 
-\section*{RESIT / REPLACEMENT}
 
-{\bf
-The resit / replacement task is essentially CW5 (listed below) with
-the exception that the lexer and parser is already provided. The
-parser will generate an AST (see file \texttt{fun\_llvm.sc}). Your task
-is to generate an AST for the K-intermediate language and supply
-sufficient type annotations such that you can generate valid code for
-the LLVM-IR. The submission deadline is 9th August at 16:00. At the
-deadline, please send me an email containing a zip-file with your
-files.
-Feel free to reuse the files I have uploaded on KEATS (especially
-the files generating simple LLVM-IR code). Of help might also be the
-videos of Week~10.\bigskip
-
-\noindent
-Good Luck!}
-\color{black}
+%\color{pansypurple}
+%\section*{RESIT / REPLACEMENT}
+%
+%{\bf
+%The resit / replacement task is essentially CW5 (listed below) with
+%the exception that the lexer and parser is already provided. The
+%parser will generate an AST (see file \texttt{fun\_llvm.sc}). Your task
+%is to generate an AST for the K-intermediate language and supply
+%sufficient type annotations such that you can generate valid code for
+%the LLVM-IR. The submission deadline is 9th August at 16:00. At the
+%deadline, please send me an email containing a zip-file with your
+%files.
+%Feel free to reuse the files I have uploaded on KEATS (especially
+%the files generating simple LLVM-IR code). Of help might also be the
+%videos of Week~10.\bigskip
+%
+%\noindent
+%Good Luck!}
+%\color{black}
 
 
 \section*{Coursework 5}

Binary file handouts/notation.pdf has changed

--- a/handouts/notation.tex	Mon Aug 29 08:26:59 2022 +0200
+++ b/handouts/notation.tex	Fri Sep 16 12:52:21 2022 +0100
@@ -10,7 +10,7 @@
 
 \section*{A Crash-Course on Notation}
 
-There are innumerable books available about compilers, automata theory
+There are an innumerable number of books available on compilers, automata theory
 and formal languages. Unfortunately, they often use their own
 notational conventions and their own symbols. This handout is meant to
 clarify some of the notation I will use. I apologise in advance that