--- a/lex/index.html	Mon Mar 14 23:10:16 2016 +0000
+++ b/lex/index.html	Tue Mar 15 12:47:34 2016 +0000
@@ -33,7 +33,7 @@
 in order to deal with POSIX matching, which is the underlying
 disambiguation strategy for regular expressions needed in lexers.
 Sulzmann and Lu have made available on-line what they call a
-``rigorous proof'' of the correctness of their algorithm w.r.t. their
+''rigorous proof'' of the correctness of their algorithm w.r.t. their
 specification; regrettably, it appears to us to have unfillable gaps.
 In the first part of this paper we give our inductive definition of
 what a POSIX value is and show (i) that such a value is unique (for
@@ -64,7 +64,7 @@
   
 </TABLE>
 <P>
-<!-- hhmts start --> Last modified: Mon Mar 14 23:09:53 GMT 2016 <!-- hhmts end -->
+<!-- hhmts start --> Last modified: Tue Mar 15 12:47:17 GMT 2016 <!-- hhmts end -->
 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
 </BODY>
 </HTML>