Trivial fixes.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43707 91177308-0d34-0410-b5e6-96231b3b80d8

2 files changed, 5 insertions, 5 deletions

diff --git a/docs/tutorial/JITTutorial1.html b/docs/tutorial/JITTutorial1.html
index 9819c77..14af4e9 100644
--- a/docs/tutorial/JITTutorial1.html
+++ b/docs/tutorial/JITTutorial1.html
@@ -91,7 +91,7 @@ int main(int argc, char**argv) {
 
 <p>Finally, we instantiate an LLVM <code>PassManager</code> and run the <code>PrintModulePass</code> on our module.  LLVM uses an explicit pass infrastructure to manage optimizations and various other things.  A <code>PassManager</code>, as should be obvious from its name, manages passes: it is responsible for scheduling them, invoking them, and insuring the proper disposal after we’re done with them.  For this example, we’re just using a trivial pass that prints out our module in textual form.</p>
 
-<p>Now onto the interesting part: creating a populating a module.  Here’s the first chunk of our <code>makeLLVMModule()</code>:</p>
+<p>Now onto the interesting part: creating and populating a module.  Here’s the first chunk of our <code>makeLLVMModule()</code>:</p>
 
 <div class="doc_code">
 <pre>
@@ -191,4 +191,4 @@ Module* makeLLVMModule() {
 </address>
 
 </body>
-</html>
\ No newline at end of file
+</html>
diff --git a/docs/tutorial/JITTutorial2.html b/docs/tutorial/JITTutorial2.html
index 63efd6a..06d0df1 100644
--- a/docs/tutorial/JITTutorial2.html
+++ b/docs/tutorial/JITTutorial2.html
@@ -47,7 +47,7 @@ unsigned gcd(unsigned x, unsigned y) {
 
 <p>The above is a graphical representation of a program in LLVM IR.  It places each basic block on a node of a graph, and uses directed edges to indicate flow control.  These blocks will be serialized when written to a text or bitcode file, but it is often useful conceptually to think of them as a graph.  Again, if you are unsure about the code in the diagram, you should skim through the <a href="../LangRef.html">LLVM Language Reference Manual</a> and convince yourself that it is, in fact, the GCD algorithm.</p>
 
-<p>The first part of our code is the same as from first tutorial.  The same basic setup is required: creating a module, verifying it, and running the <code>PrintModulePass</code> on it.  Even the first segment of  <code>makeLLVMModule()</code> looks the same, because <code>gcd</code> happens the have the same prototype as our <code>mul_add</code> function.</p>
+<p>The first part of our code is the same as from first tutorial.  The same basic setup is required: creating a module, verifying it, and running the <code>PrintModulePass</code> on it.  Even the first segment of  <code>makeLLVMModule()</code> looks the same, because <code>gcd</code> happens to have the same prototype as our <code>mul_add</code> function.</p>
 
 <div class="doc_code">
 <pre>
@@ -162,7 +162,7 @@ Module* makeLLVMModule() {
 </pre>
 </div>
 
-<p>And that's it!  You can compile your code and execute your code in the same way as before, by executing:</p>
+<p>And that's it!  You can compile and execute your code in the same way as before, by doing:</p>
 
 <div class="doc_code">
 <pre>
@@ -187,4 +187,4 @@ Module* makeLLVMModule() {
 </address>
 
 </body>
-</html>
\ No newline at end of file
+</html>