--- a/handouts/ho01.tex	Fri May 01 21:30:13 2015 +0100
+++ b/handouts/ho01.tex	Thu Sep 24 15:58:48 2015 +0100
@@ -16,7 +16,7 @@
 Knuth-Morris-Pratt algorithm, which is currently the most
 efficient general string search algorithm. But often we do
 \emph{not} just look for a particular string, but for string
-patterns. For example in programming code we need to identify
+patterns. For example in program code we need to identify
 what are the keywords, what are the identifiers etc. A pattern
 for identifiers could be stated as: they start with a letter,
 followed by zero or more letters, numbers and underscores.
@@ -69,11 +69,12 @@
 disposable.style.email.with+symbol@example.com
 \end{lstlisting}
 
-As mentioned above, identifiers, or variables, in program text are often required
-to satisfy the constraints that they start with a letter and
-then can be followed by zero or more letters or numbers and
-also can include underscores, but not as the first character.
-Such identifiers can be recognised with the regular expression
+As mentioned above, identifiers, or variables, in program code
+are often required to satisfy the constraints that they start
+with a letter and then can be followed by zero or more letters
+or numbers and also can include underscores, but not as the
+first character. Such identifiers can be recognised with the
+regular expression
 
 \begin{center}
 \pcode{[a-zA-Z] [a-zA-Z0-9_]*}