[intro, lex] Remove unnecessary and awkward whitespace in and around lists from LaTeX source

Author: tkoeppe

source/intro.tex

@@ -54,7 +54,6 @@
 of this document. For dated references, only the edition cited applies.
 For undated references, the latest edition of the referenced document
 (including any amendments) applies.
-
 \begin{itemize}
 \item Ecma International, \doccite{ECMAScript Language Specification},
 Standard Ecma-262, third edition, 1999.
@@ -320,27 +319,23 @@
 they are phrased as requirements on programs, parts of programs, or
 execution of programs. Such requirements have the following meaning:
 \begin{itemize}
-
 \item
 If a program contains no violations of the rules in this
 International Standard, a conforming implementation shall,
 within its resource limits, accept and correctly execute\footnote{``Correct execution'' can include undefined behavior, depending on
 the data being processed; see~\ref{intro.defs} and~\ref{intro.execution}.}
 that program.
-
 \item
 \indextext{message!diagnostic}%
 If a program contains a violation of any diagnosable rule or an occurrence
 of a construct described in this Standard as ``conditionally-supported'' when
 the implementation does not support that construct, a conforming implementation
 shall issue at least one diagnostic message.
-
 \item
 \indextext{behavior!undefined}%
 If a program contains a violation of a rule for which no diagnostic
 is required, this International Standard places no requirement on
 implementations with respect to that program.
-
 \end{itemize}
 \begin{note}
 During template argument deduction and substitution,
@@ -672,17 +667,14 @@
 \pnum
 For every object \tcode{x}, there is some object called the
 \defn{complete object of} \tcode{x}, determined as follows:
-
 \begin{itemize}
-
 \item
 If \tcode{x} is a complete object, then the complete object
 of \tcode{x} is itself.
 
 \item
 Otherwise, the complete object of \tcode{x} is the complete object
 of the (unique) object that contains \tcode{x}.
-
 \end{itemize}
 
 \pnum
@@ -821,23 +813,18 @@
 \indextext{conformance requirements}
 \pnum
 The least requirements on a conforming implementation are:
-
 \begin{itemize}
-
 \item
 Access to volatile objects are evaluated strictly according to the
 rules of the abstract machine.
-
 \item
 At program termination, all data written into files shall be
 identical to one of the possible results that execution of the program
 according to the abstract semantics would have produced.
-
 \item
 The input and output dynamics of interactive devices shall take
 place in such a fashion that prompting output is actually delivered before a program waits for input. What constitutes an interactive device is
 \impldef{interactive device}.
-
 \end{itemize}
 
 These collectively are referred to as the
@@ -892,8 +879,6 @@
 
 \pnum
 A \defn{constituent expression} is defined as follows:
-%left blank intentionally for spacing reasons
-
 \begin{itemize}
 \item
 The constituent expression of an expression is that expression.
@@ -918,8 +903,6 @@
 
 \pnum
 The \defn{immediate subexpression}{s} of an expression \tcode{e} are
-%left blank intentionally for spacing reasons
-
 \begin{itemize}
 \item
 the constituent expressions of \tcode{e}'s operands (Clause \ref{expr}),
@@ -950,8 +933,6 @@
 
 \pnum
 A \defn{full-expression} is
-%left blank intentionally for spacing reasons
-
 \begin{itemize}
 \item
 an unevaluated operand (Clause \ref{expr}),
@@ -1244,46 +1225,36 @@
 An evaluation \placeholder{A} \defn{carries a dependency} to an evaluation \placeholder{B} if
 
 \begin{itemize}
-
 \item
 the value of \placeholder{A} is used as an operand of \placeholder{B}, unless:
 \begin{itemize}
-
 \item
 \placeholder{B} is an invocation of any specialization of
 \tcode{std::kill_dependency}~(\ref{atomics.order}), or
-
 \item
 \placeholder{A} is the left operand of a built-in logical AND (\tcode{\&\&},
 see~\ref{expr.log.and}) or logical OR (\tcode{||}, see~\ref{expr.log.or}) 
 operator, or
-
 \item
 \placeholder{A} is the left operand of a conditional (\tcode{?:}, see~\ref{expr.cond})
 operator, or
-
 \item
 \placeholder{A} is the left operand of the built-in comma (\tcode{,})
 operator~(\ref{expr.comma}); \end{itemize} or
-
 \item
 \placeholder{A} writes a scalar object or bit-field \placeholder{M}, \placeholder{B} reads the value
 written by \placeholder{A} from \placeholder{M}, and \placeholder{A} is sequenced before \placeholder{B}, or
-
 \item
 for some evaluation \placeholder{X}, \placeholder{A} carries a dependency to \placeholder{X}, and 
 \placeholder{X} carries a dependency to \placeholder{B}.
-
 \end{itemize}
-
 \begin{note} ``Carries a dependency to'' is a subset of ``is sequenced before'',
 and is similarly strictly intra-thread. \end{note}
 
 \pnum
 An evaluation \placeholder{A} is \defn{dependency-ordered before} an evaluation
 \placeholder{B} if
 \begin{itemize}
-
 \item
 \placeholder{A} performs a release operation on an atomic object \placeholder{M}, and, in
 another thread, \placeholder{B} performs a consume operation on \placeholder{M} and reads a
@@ -1303,33 +1274,25 @@
 \pnum
 An evaluation \placeholder{A} \defn{inter-thread happens before} an evaluation \placeholder{B}
 if
-
 \begin{itemize}
-
 \item
-\placeholder{A} synchronizes with \placeholder{B}, or
-
+  \placeholder{A} synchronizes with \placeholder{B}, or
 \item
-\placeholder{A} is dependency-ordered before \placeholder{B}, or
-
+  \placeholder{A} is dependency-ordered before \placeholder{B}, or
 \item
-for some evaluation \placeholder{X}
-
-\begin{itemize}
-\item
-\placeholder{A} synchronizes with \placeholder{X} and \placeholder{X} is sequenced before \placeholder{B},
-or
-
-\item
-\placeholder{A} is sequenced before \placeholder{X} and \placeholder{X} inter-thread happens before
-\placeholder{B}, or
-
-\item
-\placeholder{A} inter-thread happens before \placeholder{X} and \placeholder{X} inter-thread happens
-before \placeholder{B}.
-\end{itemize}
+  for some evaluation \placeholder{X}
+  \begin{itemize}
+  \item
+    \placeholder{A} synchronizes with \placeholder{X} and \placeholder{X}
+    is sequenced before \placeholder{B}, or
+  \item
+    \placeholder{A} is sequenced before \placeholder{X} and \placeholder{X}
+    inter-thread happens before \placeholder{B}, or
+  \item
+    \placeholder{A} inter-thread happens before \placeholder{X} and \placeholder{X}
+    inter-thread happens before \placeholder{B}.
+  \end{itemize}
 \end{itemize}
-
 \begin{note} The ``inter-thread happens before'' relation describes arbitrary
 concatenations of ``sequenced before'', ``synchronizes with'' and
 ``dependency-ordered before'' relationships, with two exceptions. The first
@@ -1349,12 +1312,10 @@
 \pnum
 An evaluation \placeholder{A} \defn{happens before} an evaluation \placeholder{B}
 (or, equivalently, \placeholder{B} \defn{happens after} \placeholder{A}) if:
-
 \begin{itemize}
 \item \placeholder{A} is sequenced before \placeholder{B}, or
 \item \placeholder{A} inter-thread happens before \placeholder{B}.
 \end{itemize}
-
 The implementation shall ensure that no program execution demonstrates a cycle
 in the ``happens before'' relation. \begin{note} This cycle would otherwise be
 possible only through the use of consume operations. \end{note}
@@ -1363,7 +1324,6 @@
 A \defnx{visible side effect}{side effects!visible} \placeholder{A} on a scalar object or bit-field \placeholder{M}
 with respect to a value computation \placeholder{B} of \placeholder{M} satisfies the
 conditions:
-
 \begin{itemize}
 \item \placeholder{A} happens before \placeholder{B} and
 \item there is no other
@@ -1514,21 +1474,12 @@
 \pnum
 The implementation may assume that any thread will eventually do one of the 
 following:
-
 \begin{itemize}
-\item 
-terminate,
-
-\item
-make a call to a library I/O function,
-
-\item
-read or modify a volatile object, or
-
-\item
-perform a synchronization operation or an atomic operation.
+\item terminate,
+\item make a call to a library I/O function,
+\item read or modify a volatile object, or
+\item perform a synchronization operation or an atomic operation.
 \end{itemize}
-
 \begin{note} This is intended to allow compiler transformations such as removal of
 empty loops, even when termination cannot be proven. \end{note}
 
@@ -1537,7 +1488,6 @@
 that are either defined to be lock-free~(\ref{atomics.flag})
 or indicated as lock-free~(\ref{atomics.lockfree})
 are \defnx{lock-free executions}{lock-free execution}.
-
 \begin{itemize}
 \item
   If there is only one thread that is not blocked~(\ref{defns.block})
@@ -1577,7 +1527,6 @@
 \pnum
 During the execution of a thread of execution, each of the following is termed
 an \defn{execution step}:
-
 \begin{itemize}
 \item termination of the thread of execution,
 \item access to a volatile object, or

source/lex.tex

@@ -294,7 +294,6 @@
 \pnum
 If the input stream has been parsed into preprocessing tokens up to a
 given character:
-
 \begin{itemize}
 \indextext{literal!string!raw}%
 \item If the next character begins a sequence of characters that could be the prefix