up
authorMart Lubbers <mart@martlubbers.net>
Tue, 11 Oct 2016 07:48:03 +0000 (09:48 +0200)
committerMart Lubbers <mart@martlubbers.net>
Tue, 11 Oct 2016 07:48:03 +0000 (09:48 +0200)
week7/Makefile [new file with mode: 0644]
week7/w7.tex [new file with mode: 0644]

diff --git a/week7/Makefile b/week7/Makefile
new file mode 100644 (file)
index 0000000..77ea797
--- /dev/null
@@ -0,0 +1,12 @@
+DOCUMENTS:=w7
+PDFLATEXFLAGS:=-halt-on-error
+PDFLATEX:=pdflatex $(PDFLATEXFLAGS)
+
+all: $(addsuffix .pdf,$(DOCUMENTS))
+
+%.pdf: %.tex
+       $(PDFLATEX) $<
+       $(PDFLATEX) $<
+
+clean:
+       $(RM) -v $(addprefix $(DOCUMENTS),.pdf .log .aux)
diff --git a/week7/w7.tex b/week7/w7.tex
new file mode 100644 (file)
index 0000000..d571622
--- /dev/null
@@ -0,0 +1,34 @@
+\documentclass[a4paper]{article}
+
+\usepackage{geometry}
+\usepackage{enumitem}
+
+\title{Exercise week 7}
+\author{Mart Lubbers}
+\date{\today}
+
+\begin{document}
+\maketitle
+\subsection*{Exercises Chapter 13}
+\begin{enumerate}[label=\Alph*)]
+       \item Flatten the grammar
+       \item It can propagate the multiple right hand side non-terminals by
+               remembering them. Instead of a single non-terminal as the result of a
+               production it can be multiple that in turn both have to fit when
+               parsing new words.
+       \item Remember from which rule a rule origins as a way of keeping back
+               pointers.
+       \item At some level the algorithm can already check whether the entry is
+               possible at all by peeking at the word. In this way a lot of trees can
+               be pruned as it is clear from the beginning that an \emph{NP} can never
+               start with a \emph{Verb}
+\end{enumerate}
+
+\subsection*{Exercises Chapter 15}
+\begin{enumerate}[label=\Alph*)]
+       \item
+       \item
+\end{enumerate}
+
+
+\end{document}