Check in part 2: parser and ast.

llvm-svn: 43218

llvm/docs/tutorial/LangImpl1.html

@@ -56,7 +56,7 @@ which looks like this:</p>
 <pre>
 # Compute the x'th fibonacci number.
 def fib(x)
-  if x < 3 then
+  if x &lt; 3 then
     1
   else
     fib(x-1)+fib(x-2)
@@ -241,8 +241,8 @@ this code:</p>
 
 <p>With this, we have the complete lexer for the basic Kaleidoscope language.
 Next we'll <a href="LangImpl2.html">build a simple parser that uses this to 
-build an Abstract Syntax Tree</a>.  If you prefer, you can jump to the <a
-href="index.html">main tutorial index page</a>.
+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>
 
 </div>

llvm/docs/tutorial/index.html

@@ -28,7 +28,7 @@
   <li>Implementing a language with LLVM: Kaleidoscope
   <ol>
     <li><a href="LangImpl1.html">The basic language, with its lexer</a></li>
-    <li>Implementing a Parser and AST</li>
+    <li><a href="LangImpl2.html">Implementing a Parser and AST</a></li>
     <li>Implementing code generation to LLVM IR</li>
     <li>Adding JIT codegen support</li>
     <li>Extending the language: if/then/else</li>