X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=docs%2Ftutorial%2FLangImpl1.html;h=66843db5d3af0f0e6a45ba72d67fd4be53669549;hb=348c975cb89c0f92e2114d021388334c711292b5;hp=077575fe1197f10a8dfee338cf49255141a9fe1c;hpb=4134c2821f1b09550d882d6204f6637c7a7d794b;p=oota-llvm.git

diff --git a/docs/tutorial/LangImpl1.html b/docs/tutorial/LangImpl1.html
index 077575fe119..66843db5d3a 100644
--- a/docs/tutorial/LangImpl1.html
+++ b/docs/tutorial/LangImpl1.html
@@ -37,7 +37,7 @@
 
 <p>Welcome to the "Implementing a language with LLVM" tutorial.  This tutorial
 runs through the implementation of a simple language, showing how fun and
-easy it can be.  This tutorial will get you up and started as well as help to 
+easy it can be.  This tutorial will get you up and started as well as help to
 build a framework you can extend to other languages.  The code in this tutorial
 can also be used as a playground to hack on other LLVM specific things.
 </p>
@@ -54,9 +54,10 @@ teaching compiler techniques and LLVM specifically, <em>not</em> about teaching
 modern and sane software engineering principles.  In practice, this means that
 we'll take a number of shortcuts to simplify the exposition.  For example, the
 code leaks memory, uses global variables all over the place, doesn't use nice
-design patterns like visitors, etc... but it is very simple.  If you dig in and
-use the code as a basis for future projects, fixing these deficiencies shouldn't
-be hard.</p>
+design patterns like <a
+href="http://en.wikipedia.org/wiki/Visitor_pattern">visitors</a>, etc... but it
+is very simple.  If you dig in and use the code as a basis for future projects,
+fixing these deficiencies shouldn't be hard.</p>
 
 <p>I've tried to put this tutorial together in a way that makes chapters easy to
 skip over if you are already familiar with or are uninterested in the various
@@ -293,7 +294,7 @@ if you typed in "1.23".  Feel free to extend it :).  Next we handle comments:
   if (LastChar == '#') {
     // Comment until end of line.
     do LastChar = getchar();
-    while (LastChar != EOF &amp;&amp; LastChar != '\n' &amp; LastChar != '\r');
+    while (LastChar != EOF &amp;&amp; LastChar != '\n' &amp;&amp; LastChar != '\r');
     
     if (LastChar != EOF)
       return gettok();
@@ -328,6 +329,7 @@ build an Abstract Syntax Tree</a>.  When we have that, we'll include a driver
 so that you can use the lexer and parser together.
 </p>
 
+<a href="LangImpl2.html">Next: Implementing a Parser and AST</a>
 </div>
 
 <!-- *********************************************************************** -->
@@ -340,7 +342,7 @@ so that you can use the lexer and parser together.
 
   <a href="mailto:sabre@nondot.org">Chris Lattner</a><br>
   <a href="http://llvm.org">The LLVM Compiler Infrastructure</a><br>
-  Last modified: $Date: 2007-10-17 11:05:13 -0700 (Wed, 17 Oct 2007) $
+  Last modified: $Date$
 </address>
 </body>
 </html>