equal
deleted
inserted
replaced
56 |
56 |
57 \begin{document} |
57 \begin{document} |
58 |
58 |
59 \section*{Handout 5} |
59 \section*{Handout 5} |
60 |
60 |
61 |
61 Whenever you want to design a programming language or implement a compiler for an |
|
62 existing language, the first task is to fix the basic ``words'' of the language, like what are the k |
|
63 eywords, what are permitted identifiers and so on. One convenient way to do this is, of |
|
64 course, to use regular expressions. In this course we want to take a closer look at the |
|
65 WHILE-language. This is a simple imperative language consisting of arithmetic |
|
66 expressions, assignments and loops only. For example the Fibonacci program can be |
|
67 written in this language as follows |
62 |
68 |
63 |
69 |
64 \end{document} |
70 \end{document} |
65 |
71 |
66 %%% Local Variables: |
72 %%% Local Variables: |