equal
deleted
inserted
replaced
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 part 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 (4\%) 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 |
112 part, you are asked to implement a regular expression matcher based on |
112 part, you are asked to implement a regular expression matcher based on |