|
@@ -10904,9 +10904,9 @@ integers.
|
|
|
i = i - 1
|
|
i = i - 1
|
|
|
print(sum)
|
|
print(sum)
|
|
|
\end{lstlisting}
|
|
\end{lstlisting}
|
|
|
-The \code{while} loop consists of a condition expression and a body (a
|
|
|
|
|
-sequence of statements). The body is evaluated repeatedly so long as
|
|
|
|
|
-the condition remains true.
|
|
|
|
|
|
|
+The \code{while} loop consists of a condition and a body (a sequence
|
|
|
|
|
+of statements). The body is evaluated repeatedly so long as the
|
|
|
|
|
+condition remains true.
|
|
|
%
|
|
%
|
|
|
\fi}
|
|
\fi}
|
|
|
|
|
|
|
@@ -11395,7 +11395,7 @@ order the mappings point-wise, using the ordering of $L$. So, given any
|
|
|
two mappings $m_i$ and $m_j$, $m_i \sqsubseteq_M m_j$ when $m_i(\ell)
|
|
two mappings $m_i$ and $m_j$, $m_i \sqsubseteq_M m_j$ when $m_i(\ell)
|
|
|
\subseteq m_j(\ell)$ for every block label $\ell$ in the program. The
|
|
\subseteq m_j(\ell)$ for every block label $\ell$ in the program. The
|
|
|
bottom element of $M$ is the mapping $\bot_M$ that sends every label
|
|
bottom element of $M$ is the mapping $\bot_M$ that sends every label
|
|
|
-to the empty set; that is, $\bot_M(\ell) = \emptyset$.
|
|
|
|
|
|
|
+to the empty set, $\bot_M(\ell) = \emptyset$.
|
|
|
|
|
|
|
|
We can think of one iteration of liveness analysis applied to the
|
|
We can think of one iteration of liveness analysis applied to the
|
|
|
whole program as being a function $f$ on the lattice $M$. It takes a
|
|
whole program as being a function $f$ on the lattice $M$. It takes a
|
|
@@ -11417,7 +11417,7 @@ the solution should be the \emph{least} fixed point.\index{subject}{least fixed
|
|
|
The Kleene fixed-point theorem states that if a function $f$ is
|
|
The Kleene fixed-point theorem states that if a function $f$ is
|
|
|
monotone (better inputs produce better outputs), then the least fixed
|
|
monotone (better inputs produce better outputs), then the least fixed
|
|
|
point of $f$ is the least upper bound of the \emph{ascending Kleene
|
|
point of $f$ is the least upper bound of the \emph{ascending Kleene
|
|
|
- chain} obtained by starting at $\bot$ and iterating $f$, as
|
|
|
|
|
|
|
+ chain} that starts at $\bot$ and iterates $f$ as
|
|
|
follows:\index{subject}{Kleene fixed-point theorem}
|
|
follows:\index{subject}{Kleene fixed-point theorem}
|
|
|
\[
|
|
\[
|
|
|
\bot \sqsubseteq f(\bot) \sqsubseteq f(f(\bot)) \sqsubseteq \cdots
|
|
\bot \sqsubseteq f(\bot) \sqsubseteq f(f(\bot)) \sqsubseteq \cdots
|
|
@@ -11679,9 +11679,8 @@ The new language forms, \code{get!}, \code{set!}, \code{begin}, and
|
|
|
{\if\edition\pythonEd\pythonColor
|
|
{\if\edition\pythonEd\pythonColor
|
|
|
%
|
|
%
|
|
|
The change needed for this pass is to add a case for the \code{while}
|
|
The change needed for this pass is to add a case for the \code{while}
|
|
|
-statement. The condition of a \code{while} loop is allowed to be a
|
|
|
|
|
-complex expression, just like the condition of the \code{if}
|
|
|
|
|
-statement.
|
|
|
|
|
|
|
+statement. The condition of a loop is allowed to be a complex
|
|
|
|
|
+expression, just like the condition of the \code{if} statement.
|
|
|
%
|
|
%
|
|
|
\fi}
|
|
\fi}
|
|
|
%
|
|
%
|
Jeremy G. Siek