Empty lines after sections

[pipstransfo.git] / pipstransfo.tex

diff --git a/pipstransfo.tex b/pipstransfo.tex
index f24434a..9253d86 100644 (file)
--- a/pipstransfo.tex
+++ b/pipstransfo.tex
@@ -9,7 +9,7 @@
 \usepackage{hyperref}
 \usepackage{xspace}
 
-\def\PIPS{PIPS\xspace}
+\newcommand\PIPS{PIPS\xspace}
 
 
 \title{\PIPS~--- List of code transformations}
@@ -22,6 +22,7 @@
 \chapter{Summary}
 
 \section{SGuelton}
+
 \begin{itemize}
 % memory allocation alteration
 \item scalar renaming
@@ -65,6 +66,7 @@
 
 
 \section{Teraops}
+
 \begin{itemize}
 % memory allocation alteration
 \item scalar renaming
@@ -137,8 +139,8 @@
 
 \item[loop unrolling]{
   is a loop transformation.
-  Unrolling a loop by a factor of $n$ consists in the substitution of a loop
-  body by itself, replicated $n$ times. A prelude and/or postlude are
+  Unrolling a loop by a factor of \(n\) consists in the substitution of a loop
+  body by itself, replicated \(n\) times. A prelude and/or postlude are
   added to preserve the number of iteration.}
 
 \item[loop fusion]{
@@ -216,6 +218,7 @@
 \item[goto elimination]{
   is the process of replacing \texttt{goto} instructions by a hierarchical control flow
   graph.}
+
 \item[outlining]{
   is the process of extracting part of a function body into a new function
   and replacing it in the initial function by a function call.}
@@ -254,7 +257,7 @@
   operator by its expanded form.}
 
 \item[n address code generation]{is the process of splitting
-  complex expression in simpler ones that take at most $n$ operands.}
+  complex expression in simpler ones that take at most \(n\) operands.}
 
 \item[memory footprint reduction]{is the process of tiling a loop
   to make sure the iteration over the tile has a memory footprint bounded by