Change bold code snippets to inline code blocks

14-02.md

@@ -48,7 +48,7 @@ character, as often happens, we can only skip ahead 1 byte, as usual.
 Look at it differently, though: What if we compare the pattern starting
 with the last (rightmost) byte, rather than the first (leftmost) byte?
 In other words, what if we compare from high memory toward low, in the
-direction in which string instructions go after the **STD** instruction?
+direction in which string instructions go after the `STD` instruction?
 After all, we're comparing one set of bytes (the pattern) to another set
 of bytes (a portion of the buffer); it doesn't matter in the least in
 what order we compare them, so long as all the bytes in one set are
@@ -70,7 +70,7 @@ in the pattern; that's how many locations there are in the buffer that
 *might* have matched, but have just been shown not to, because they
 overlap the mismatched character that doesn't belong in the pattern. In
 this case, we can skip ahead by the full pattern length in the buffer!
-This is how we can outperform even **REPNZ SCASB; REPNZ SCASB** has to
+This is how we can outperform even `REPNZ SCASB; REPNZ SCASB` has to
 check every byte in the buffer, but Boyer-Moore doesn't.
 
 Figure 14.1 illustrates the operation of a Boyer-Moore search when the