equal
deleted
inserted
replaced
40 |
40 |
41 \def\VS{\Vspace[0.6em]} |
41 \def\VS{\Vspace[0.6em]} |
42 |
42 |
43 \begin{document} |
43 \begin{document} |
44 |
44 |
45 \section*{Handout 6} |
45 \section*{Handout 6 (Parser Combinators)} |
46 |
46 |
47 While regular expressions are very useful for lexing and for recognising |
47 While regular expressions are very useful for lexing and for recognising |
48 many patterns in strings (like email addresses), they have their limitations. For |
48 many patterns in strings (like email addresses), they have their limitations. For |
49 example there is no regular expression that can recognise the language |
49 example there is no regular expression that can recognise the language |
50 $a^nb^n$. Another example for which there exists no regular expression is the language of well-parenthesised |
50 $a^nb^n$. Another example for which there exists no regular expression is the language of well-parenthesised |