Nobody expects the Spanish Inquisition!

Fixed the number of terminator instructions from five to six.
Other minor fixes.

llvm-svn: 18683

1 files changed, 6 insertions, 6 deletions

diff --git a/llvm/docs/LangRef.html b/llvm/docs/LangRef.html
index 41379db..f1f4c1b 100644
--- a/llvm/docs/LangRef.html
+++ b/llvm/docs/LangRef.html
@@ -724,7 +724,7 @@ indicates which block should be executed after the current block is
 finished. These terminator instructions typically yield a '<tt>void</tt>'
 value: they produce control flow, not values (the one exception being
 the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction).</p>
-<p>There are five different terminator instructions: the '<a
+<p>There are six different terminator instructions: the '<a
  href="#i_ret"><tt>ret</tt></a>' instruction, the '<a href="#i_br"><tt>br</tt></a>'
 instruction, the '<a href="#i_switch"><tt>switch</tt></a>' instruction,
 the '<a href="#i_invoke"><tt>invoke</tt></a>' instruction, the '<a
@@ -957,7 +957,7 @@ no-return function cannot be reached, and other facts.</p>
 <div class="doc_text">
 <p>Binary operators are used to do most of the computation in a
 program.  They require two operands, execute an operation on them, and
-produce a single value.  Although, that single value might represent 
+produce a single value.  The operands might represent 
 multiple data, as is the case with the <a href="#t_packed">packed</a> data type. 
 The result value of a binary operator is not
 necessarily the same type as its operands.</p>
@@ -1135,7 +1135,7 @@ Operations</a> </div>
 <div class="doc_text">
 <p>Bitwise binary operators are used to do various forms of
 bit-twiddling in a program.  They are generally very efficient
-instructions, and can commonly be strength reduced from other
+instructions and can commonly be strength reduced from other
 instructions.  They require two operands, execute an operation on them,
 and produce a single value.  The resulting value of the bitwise binary
 operators is always the same type as its first operand.</p>
@@ -1360,7 +1360,7 @@ Operations</a></div>
 <p>A key design point of an SSA-based representation is how it
 represents memory.  In LLVM, no memory locations are in SSA form, which
 makes things very simple.  This section describes how to read, write,
-allocate and free memory in LLVM.</p>
+allocate, and free memory in LLVM.</p>
 </div>
 <!-- _______________________________________________________________________ -->
 <div class="doc_subsubsection"> <a name="i_malloc">'<tt>malloc</tt>'
@@ -1408,7 +1408,7 @@ memory heap, to be reallocated in the future.</p>
 that was allocated with the '<tt><a href="#i_malloc">malloc</a></tt>'
 instruction.</p>
 <h5>Semantics:</h5>
-<p>Access to the memory pointed to by the pointer is not longer defined
+<p>Access to the memory pointed to by the pointer is no longer defined
 after this instruction executes.</p>
 <h5>Example:</h5>
 <pre>  %array  = <a href="#i_malloc">malloc</a> [4 x ubyte]                    <i>; yields {[4 x ubyte]*}:array</i>
@@ -1428,7 +1428,7 @@ Instruction</a> </div>
 stack frame of the procedure that is live until the current function
 returns to its caller.</p>
 <h5>Arguments:</h5>
-<p>The the '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
+<p>The '<tt>alloca</tt>' instruction allocates <tt>sizeof(&lt;type&gt;)*NumElements</tt>
 bytes of memory on the runtime stack, returning a pointer of the
 appropriate type to the program.  The second form of the instruction is
 a shorter version of the first that defaults to allocating one element.</p>