\section{Code generation}
+%our full names and student numbers.
+%{
+%The chapters from the previous exercise.
+%{
+%A chapter describing the chosen semantics of
+%SPL
+%, like call-by-reference or
+%call-by-value.
+%5
+%{
+%The compilation schemes used in your compiler. A concise informal or semi-
+%formal description suces. A complete formal description of the compilation
+%scheme is welcome, but not required. Typical things to explain here are call-
+%ing conventions, stack management, stack layout, heap layout, and heap
+%management.
+%{
+%A short description of the purpose of the example programs and the
+%test
+%results.
+%{
+%A concise but precise description of how the work was divided amongst the
+%members of the tea
\section{Lexing \& parsing}
+%On March 10 you have to give a very brief presentation. In this presentation you tell the other
+%students and us how your parser is constructed and demonstrate your parser and pretty printer.
+%You should mention things like implementation language used, changes to the grammar, and other
+%interesting points of your program.
+%For this demonstration you have to prepare at least 10 test programs in
+%SPL
+%. In your presentation
+%you have to show only the most interesting or challenging example. You can use the program
+%4
+%above as a starting point. Hand in the test programs, and a document containing the transformed
+%grammar as used by your parser. Indicate what parts of the semantic analysis are handled by your
+%scanner
\section{Semantic analysis}
+%The grammar used to parse
+%SPL
+%, if it is di erent from the given grammar.
+%{
+%The scoping rules you use and check in your compiler.
+%{
+%The typing rules used for
+%SPL
+%.
+%{
+%A brief guide telling what each of the examples tests (see next point).
+%{
+%A concise but precise description of how the work was divided amongst the
+%members of
+%the team.