equal
deleted
inserted
replaced
94 % BF IDE |
94 % BF IDE |
95 % https://www.microsoft.com/en-us/p/brainf-ck/9nblgggzhvq5 |
95 % https://www.microsoft.com/en-us/p/brainf-ck/9nblgggzhvq5 |
96 |
96 |
97 \section*{Coursework 9 (Scala)} |
97 \section*{Coursework 9 (Scala)} |
98 |
98 |
|
99 \mbox{}\hfill\textit{``[Google’s MapReduce] abstraction is inspired by the}\\ |
|
100 \mbox{}\hfill\textit{map and reduce primitives present in Lisp and many}\\ |
|
101 \mbox{}\hfill\textit{other functional language.''}\smallskip\\ |
|
102 \mbox{}\hfill\textit{ --- Dean and Ghemawat, who designed this concept at Google}\bigskip |
|
103 |
|
104 \noindent |
99 This coursework is worth 10\%. It is about a regular expression |
105 This coursework is worth 10\%. It is about a regular expression |
100 matcher and the shunting yard algorithm by Dijkstra. The first part is |
106 matcher and the shunting yard algorithm by Dijkstra. The first part is |
101 due on \cwNINE{} at 11pm; the second, more advanced part, is due on |
107 due on \cwNINE{} at 11pm; the second, more advanced part, is due on |
102 \cwNINEa{} at 11pm. In the first part, you are asked to implement a |
108 \cwNINEa{} at 11pm. In the first part, you are asked to implement a |
103 regular expression matcher based on derivatives of regular |
109 regular expression matcher based on derivatives of regular |