@@ -137,7 +137,7 @@ \subsection{Flaws}
137
137
Bool(bool),
138
138
Int(i64),
139
139
Pointer(Pointer), // index into stack
140
- Adt { variant: usize, data_ptr : Pointer },
140
+ Adt { variant: usize, data : Pointer },
141
141
// ...
142
142
}
143
143
\end {minted }
@@ -224,7 +224,7 @@ \subsubsection{Undefined byte mask}
224
224
225
225
See \autoref {fig:undef } for an example undefined byte, represented by underscores. Note that there
226
226
would still be a value for the second byte in the byte array, but we don't care what it is. The
227
- bitmask would be $ 10 _2 $ i.e. \rust {[true, false]}.
227
+ bitmask would be $ 10 _2 $ , i.e. \rust {[true, false]}.
228
228
229
229
\begin {figure }[hb]
230
230
\begin {minted }[autogobble]{rust}
@@ -286,7 +286,7 @@ \section{Future work}
286
286
\item A graphical or text-mode debugger that steps through MIR execution one statement at a time,
287
287
for figuring out why some compile-time execution is raising an error or simply learning how Rust
288
288
works at a low level.
289
- \item An read-eval-print-loop (REPL) for Rust may be easier to implement on top of Miri than the
289
+ \item A read-eval-print-loop (REPL) for Rust may be easier to implement on top of Miri than the
290
290
usual LLVM back-end.
291
291
\item An extended version of Miri could be developed apart from the purpose of compile-time
292
292
execution that is able to run foreign functions from C/C++ and generally have full access to the
0 commit comments