equal
deleted
inserted
replaced
3 \usepackage{../langs} |
3 \usepackage{../langs} |
4 |
4 |
5 |
5 |
6 \begin{document} |
6 \begin{document} |
7 |
7 |
8 \section*{Handout 6 (Parser Combinators)} |
8 \section*{Handout 6 (Grammars \& Parser)} |
9 |
9 |
10 While regular expressions are very useful for lexing and for recognising |
10 While regular expressions are very useful for lexing and for recognising |
11 many patterns in strings (like email addresses), they have their limitations. For |
11 many patterns in strings (like email addresses), they have their limitations. For |
12 example there is no regular expression that can recognise the language |
12 example there is no regular expression that can recognise the language |
13 $a^nb^n$. Another example for which there exists no regular expression is the language of well-parenthesised |
13 $a^nb^n$. Another example for which there exists no regular expression is the language of well-parenthesised |