92 \begin{document} |
92 \begin{document} |
93 |
93 |
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*{Part 9 (Scala)} |
98 |
98 |
99 \mbox{}\hfill\textit{``[Google’s MapReduce] abstraction is inspired by the}\\ |
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}\\ |
100 \mbox{}\hfill\textit{map and reduce primitives present in Lisp and many}\\ |
101 \mbox{}\hfill\textit{other functional language.''}\smallskip\\ |
101 \mbox{}\hfill\textit{other functional language.''}\smallskip\\ |
102 \mbox{}\hfill\textit{ --- Dean and Ghemawat, who designed this concept at Google} |
102 \mbox{}\hfill\textit{ --- Dean and Ghemawat, who designed this concept at Google} |
103 \bigskip\medskip |
103 \bigskip\medskip |
104 |
104 |
105 \noindent |
105 \noindent |
106 This coursework is about the shunting yard algorithm by Dijkstra and a |
106 This part is about the shunting yard algorithm by Dijkstra and a |
107 regular expression matcher by Brzozowski. The preliminary part is due on |
107 regular expression matcher by Brzozowski. The preliminary part is due on |
108 \cwNINE{} at 4pm; the core, more advanced part, is due on \cwNINEa{} |
108 \cwNINE{} at 4pm; the core, more advanced part, is due on \cwNINEa{} |
109 at 4pm. The preliminary part is about the Shunting Yard Algorithm that |
109 at 4pm. The preliminary part is about the Shunting Yard Algorithm that |
110 transforms the usual infix notation of arithmetic expressions into the |
110 transforms the usual infix notation of arithmetic expressions into the |
111 postfix notation, which is for example used in compilers. In the core |
111 postfix notation, which is for example used in compilers. In the core |