--- a/cws/cw04.tex	Wed Jan 02 22:01:20 2019 +0000
+++ b/cws/cw04.tex	Wed Jan 16 12:20:34 2019 +0000
@@ -97,14 +97,16 @@
 
 This coursework is worth 10\%. It is about a regular expression
 matcher and the shunting yard algorithm by Dijkstra. The first part is
-due on 6 December at 11pm; the second, more advanced part, is due on
-20 December at 11pm. In the first part, you are asked to implement a
+due on \cwNINE{} at 11pm; the second, more advanced part, is due on
+\cwNINEa{} at 11pm. In the first part, you are asked to implement a
 regular expression matcher based on derivatives of regular
-expressions. The background is that regular expression matching in
-languages like Java, JavaScript and Python can sometimes be excruciatingly
-slow. The advanced part is about the shunting yard algorithm that
-transforms the usual infix notation of arithmetic expressions into the
-postfix notation, which is for example used in compilers.\bigskip
+expressions. The background is that ``out-of-the-box'' regular
+expression matching in mainstream languages like Java, JavaScript and
+Python can sometimes be excruciatingly slow. You are supposed to implement
+an regular expression macther that is much, much faster. The advanced part is
+about the shunting yard algorithm that transforms the usual infix
+notation of arithmetic expressions into the postfix notation, which is
+for example used in compilers.\bigskip
 
 \IMPORTANT{}