updates from Peter
[phd-thesis.git] / appx / bytecode.tex
index 6884e53..ce6c4df 100644 (file)
@@ -75,7 +75,7 @@ The byte code instructions are of variable length and automatically encoded and
                                                  &                     & \multicolumn{3}{l}{similar for Real and Long variants}\\
                \texttt{cast}\textsubscript{f-t}     &  & $st[sp\shortminus{}1] = cast_{f-t} (st[sp\shortminus{}1])$ & $sp$ & $pc+1$\\
                                                  &                     & \multicolumn{3}{l}{{\bf for all} $f,t\in\{Int, Real, Long\}$}\\
-               \pagebreak
+%              \pagebreak
                \texttt{mkTask}   & \texttt{Stable\textsubscript{n}} & $st[sp\shortminus{}n\shortminus{}1] = node (stable,$              & $sp\shortminus{}n+1$ & $pc+2$\\
                                                  &                                  & $\qquad\qquad st[sp\shortminus{}1], \ldots, st[sp\shortminus{}n\shortminus{}1])$\\
                                                  & \texttt{Unstable\textsubscript{n}} & $st[sp\shortminus{}n\shortminus{}1] = node (unstable,$          & $sp\shortminus{}n+1$ & $pc+2$\\