# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1444982185 -3600
# Node ID b88670c5d04b966b5f8e3c9c6cb5d8d3f4013640
# Parent  1e1b0fe6610751c17dca115106692bed97cd1c7a
updated

diff -r 1e1b0fe66107 -r b88670c5d04b slides/slides04.pdf
Binary file slides/slides04.pdf has changed
diff -r 1e1b0fe66107 -r b88670c5d04b slides/slides04.tex
--- a/slides/slides04.tex	Fri Oct 16 08:42:21 2015 +0100
+++ b/slides/slides04.tex	Fri Oct 16 08:56:25 2015 +0100
@@ -454,9 +454,16 @@
 
 \[
 \bl{(ab + a) \cdot (c + bc)}
-\]\bigskip
+\]\medskip
+
+and the string $\bl{abc}$.\pause\pause\bigskip
 
-and the string $\bl{abc}$
+Or, keywords are \pcode{if} and identifiers are 
+letters followed by ``letters + numbers + \_''$^*$
+
+\[
+\bl{iffoo}
+\]
 
 \end{frame}
 
@@ -478,7 +485,11 @@
 \small
 \hfill most posix matchers are buggy\\
 \footnotesize
-\hfill \url{http://www.haskell.org/haskellwiki/Regex_Posix}
+\hfill 
+\url{http://www.haskell.org/haskellwiki/Regex_Posix}
+\smallskip\pause
+
+\hfill \small traditional lexers are fast, but hairy
 
 %\url{http://www.technologyreview.com/tr10/?year=2011}  
 %finite deterministic automata/ nondeterministic automaton