do statements

We consider the statement

$$\begin{minipage}[t]{\linewidth}\begin{tabbing} \verb$do $$S$\verb$ while($$e$\verb$) ;$ \end{tabbing}\end{minipage}$$

where $e$ is an expression and $S$ is a statement. Again let $\mbox{\it INITS}$ and $e'$ be the results of applying the simplify algorithm to $e$. If $e' = e$, the transformed version is just

$$\begin{minipage}[t]{\linewidth}\begin{tabbing} \verb$do $$S'$\verb$ while($$e$\verb$) ;$ \end{tabbing}\end{minipage}$$

where $S'$ is the pre-translated version of $S$. Otherwise the transformed version is

$$\begin{minipage}[t]{\linewidth}\begin{tabbing} \verb$do {$ \... ...b$}$ \\ \verb$} while(true) ;$ \\ \end{tabbing}\end{minipage}$$