Fix some of tims LaTeX formatting

papers/eecs444_report/hard.tex

@@ -8,7 +8,7 @@ \section{This is a Hard Problem}
 
 \begin{enumerate}[1.]
 \item
-  Reduction 3SAT -\textgreater{} AGSG {[}Shows AGSG at least NP-Hard{]}
+  Reduction 3SAT $\rightarrow$ AGSG {[}Shows AGSG at least NP-Hard{]}
 \item
   Proof of Poly-Time Verifiable Certificate {[}AGSG in NP{]}
 \end{enumerate}
@@ -18,7 +18,7 @@ \subsubsection{Decision Problem}
 
 Is the language generated by this grammar the empty language?
 
-\subsection{Reduction, 3SAT -\textgreater{} AGSG {[}Attribute Grammar
+\subsection{Reduction, 3SAT $\rightarrow$ AGSG {[}Attribute Grammar
 String Generation{]}}
 
 \subsubsection{Construct a grammar for the 3SAT instance}
@@ -53,7 +53,7 @@ \subsubsection{Construct a grammar for the 3SAT instance}
 xN -> TRUE
     | FALSE
     ;
-\engd{verbatim}
+\end{verbatim}
 With attributes which synthesize the values for each clause and with a
 condition which asserts that the whole expression is true.
 
@@ -202,7 +202,7 @@ \subsubsection{Construct a grammar for the 3SAT instance}
 O(\textbar{}C\textbar{} + \textbar{}V\textbar{}) where C = the clauses
 in 3SAT and V = the variables.
 
-\subsubsection{Show a solution for 3SAT ---\textgreater{} creates a
+\subsubsection{Show a solution for 3SAT $\rightarrow$ creates a
 parsable string for AGSG}
 
 In a solution for 3SAT all names (x1, x2, \ldots{} xN) always have
@@ -244,7 +244,7 @@ \subsubsection{Show a solution for 3SAT ---\textgreater{} creates a
 synthesize a value of \verb!True! on \verb!AndN.value! resulting in a
 parsable expression.
 
-\subsubsection{Show a string generated by the grammar ---\textgreater{}
+\subsubsection{Show a string generated by the grammar $\rightarrow$
 is a solution for 3SAT}
 
 In the above proof, we showed that the attributes on the grammar compute