diff -r 201c2c6d8696 -r 7ed2a25dd115 hws/hw08.tex
--- a/hws/hw08.tex	Tue Oct 28 06:01:00 2014 +0000
+++ b/hws/hw08.tex	Tue Oct 28 12:24:11 2014 +0000
@@ -1,27 +1,26 @@
 \documentclass{article}
-\usepackage{charter}
-\usepackage{hyperref}
-\usepackage{amssymb}
-\usepackage{amsmath}
-\usepackage{tikz}
-\usetikzlibrary{automata}
-
-\newcommand{\dn}{\stackrel{\mbox{\scriptsize def}}{=}}% for definitions
+\usepackage{../style}
+\usepackage{../graphics}
 
 \begin{document}
 
 \section*{Homework 8}
 
 \begin{enumerate}
-\item Write a program in the WHILE-language that calculates the factorial function.
+\item Write a program in the WHILE-language that calculates
+      the factorial function.
 
-\item What optimisations could a compiler perform when compiling a WHILE-program?
+\item What optimisations could a compiler perform when
+      compiling a WHILE-program?
 
-\item What is the main difference between the Java assembler (as processed by Jasmin) and
-Java Byte Code?
+\item What is the main difference between the Java assembler
+      (as processed by Jasmin) and Java Byte Code?
 
-\item Parser combinators can directly be given a string as input, without the need of a lexer. What are
-the advantages to first lex a string and then feed a sequence of tokens as input to the parser? 
+\item Parser combinators can directly be given a string as
+      input, without the need of a lexer. What are the
+      advantages to first lex a string and then feed a
+      sequence of tokens as input to the parser?
+      
 \end{enumerate}
 
 \end{document}