Normal quotes

14-03.md

@@ -10,7 +10,7 @@ modified version of the text of this chapter) shows that this
 implementation is generally much slower than **REPNZ SCASB,** although
 it does come close when searching for long patterns. Listing 14.1 is
 designed primarily to make later assembly implemenmore comprehensible,
-rather than faster; Sedge’s implementation uses arrays rather than
+rather than faster; Sedge's implementation uses arrays rather than
 pointers, is a great deal more compact and very clever, and may be
 somewhat faster. Regardless, the far superior performance of **REPNZ
 SCASB** clearly indicates that assembly language is in order at this
@@ -18,17 +18,17 @@ point.
 
 * * * * *
 
-“g;”
+"g;"
 
-“Yogi”
+"Yogi"
 
-“igoY”
+"igoY"
 
-“Adrian”
+"Adrian"
 
-“Conclusion”
+"Conclusion"
 
-“You don’t know what you know”
+"You don't know what you know"
 
 * * * * *
 
@@ -140,14 +140,14 @@ Table 14.1 Comparison of searching techniques.
 
 * * * * *
 
-The entry “Standard Boyer-Moore in ASM” in Table 14.1 refers to
+The entry "Standard Boyer-Moore in ASM" in Table 14.1 refers to
 straight-forward hand optimization of Listing 14.1, code that is not
 included in this chapter for the perfectly good reason that it is slower
 in most cases than **REPNZ SCASB.** I say this casually now, but not so
 yesterday, when I had all but concluded that Boyer-Moore was simply
 inferior on the x86, due to two architectural quirks: the string
 instructions and slow branch. I had even coined a neat phrase for it:
-Architecture is destiny. Has a nice ring, doesn’t it?
+Architecture is destiny. Has a nice ring, doesn't it?
 
   ------------------------ --------------------------------- --------------------
   [Previous](14-02.html)   [Table of Contents](index.html)   [Next](14-04.html)