Update for changes to Leo logic

recce.ltx

@@ -2758,12 +2758,13 @@ the Earley reduction for this case,
 contrary to the assumption that the grammar in unambiguous.
 It suffices therefore to consider the number of possible choices
 of the pair
-\end{sloppypar}
 \begin{equation*}
-[\Vorig{component}, \Vsym{transition}]
+[\Vorig{component}, \Vsym{transition}].
 \end{equation*}
+\end{sloppypar}
+
 \Vorig{component} came from $\Veimt{component} \in \Ves{j}$,
-and therefore there is at most 
+and therefore there are at most 
 $\bigsize{\Vtable{j}}$ choices for \Vorig{component}.
 The number of possibilities for \Vsym{lhs} is limited
 by the number of symbols,
@@ -2783,8 +2784,9 @@ Summing
 \var{reduction-tries} +
 \var{initial-tries},
 \end{multline*}
-we have
-where $\var{n} = \Vsize{\Cw}$, the size of the input,
+we have,
+where $\var{n} = \Vsize{\Cw}$,
+the size of the input,
 \begin{equation*}
 \begin{alignedat}{2}
 & \bigsize{\Vtable{0}} & \quad &