Fix minor documentation nits (Michael Snyder, msnyder@vmware.com)

git-svn-id: svn://svn.valgrind.org/valgrind/trunk@11577

helgrind/docs/hg-manual.xml

@@ -229,7 +229,7 @@ Thread #1: lock order "0x7FEFFFAB0 before 0x7FEFFFA80" violated
 <para>When there are more than two locks in the cycle, the error is
 equally serious.  However, at present Helgrind does not show the locks
 involved, so as to avoid flooding you with information.  That could be
-fixed in future.  For example, here is a an example involving a cycle
+fixed in future.  For example, here is an example involving a cycle
 of five locks from a naive implementation the famous Dining
 Philosophers problem
 (see <computeroutput>helgrind/tests/tc14_laog_dinphils.c</computeroutput>).
@@ -262,7 +262,7 @@ are race-free is one of the central difficulties of threaded
 programming.</para>
 
 <para>Reliably detecting races is a difficult problem, and most
-of Helgrind's internals are devoted to do dealing with it.  
+of Helgrind's internals are devoted to dealing with it.  
 We begin with a simple example.</para>
 
 

memcheck/docs/mc-manual.xml

@@ -1089,7 +1089,7 @@ location.  We now consider the latter question.</para>
 associated valid-value (V) bit.  In addition, all bytes in memory, but
 not in the CPU, have an associated valid-address (A) bit.  This
 indicates whether or not the program can legitimately read or write that
-location.  It does not give any indication of the validity or the data
+location.  It does not give any indication of the validity of the data
 at that location -- that's the job of the V bits -- only whether or not
 the location may be accessed.</para>