[llvm] 6bfd10f - Fix internal links in Kaleidoscope tutorial

[Jonathan Roelofs via llvm-commits]

Author: Jonathan Roelofs
Date: 2020-03-09T15:07:44-06:00
New Revision: 6bfd10ff80af827d1f2ecfd955496ca9d3550945

URL: https://github.com/llvm/llvm-project/commit/6bfd10ff80af827d1f2ecfd955496ca9d3550945
DIFF: https://github.com/llvm/llvm-project/commit/6bfd10ff80af827d1f2ecfd955496ca9d3550945.diff

LOG: Fix internal links in Kaleidoscope tutorial

Added: 
    

Modified: 
    llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl02.rst
    llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl06.rst
    llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl07.rst

Removed: 
    


################################################################################
diff  --git a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl02.rst b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl02.rst
index c07c3ab192b8..ab9656b2fb4b 100644
--- a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl02.rst
+++ b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl02.rst
@@ -314,7 +314,7 @@ Now that we have all of our simple expression-parsing logic in place, we
 can define a helper function to wrap it together into one entry point.
 We call this class of expressions "primary" expressions, for reasons
 that will become more clear `later in the
-tutorial <LangImpl6.html#user-defined-unary-operators>`_. In order to parse an arbitrary
+tutorial <LangImpl06.html#user-defined-unary-operators>`_. In order to parse an arbitrary
 primary expression, we need to determine what sort of expression it is:
 
 .. code-block:: c++

diff  --git a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl06.rst b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl06.rst
index dd3a3f171375..87c7a3753b37 100644
--- a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl06.rst
+++ b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl06.rst
@@ -113,7 +113,7 @@ keywords:
         return tok_identifier;
 
 This just adds lexer support for the unary and binary keywords, like we
-did in `previous chapters <LangImpl5.html#lexer-extensions-for-if-then-else>`_. One nice thing
+did in `previous chapters <LangImpl05.html#lexer-extensions-for-if-then-else>`_. One nice thing
 about our current AST, is that we represent binary operators with full
 generalisation by using their ASCII code as the opcode. For our extended
 operators, we'll use this same representation, so we don't need any new

diff  --git a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl07.rst b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl07.rst
index a30be9894c3a..d7abeeac8053 100644
--- a/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl07.rst
+++ b/llvm/docs/tutorial/MyFirstLanguageFrontend/LangImpl07.rst
@@ -399,7 +399,7 @@ the unabridged code):
       ...
 
 This code is virtually identical to the code `before we allowed mutable
-variables <LangImpl5.html#code-generation-for-the-for-loop>`_. The big 
diff erence is that we
+variables <LangImpl05.html#code-generation-for-the-for-loop>`_. The big 
diff erence is that we
 no longer have to construct a PHI node, and we use load/store to access
 the variable as needed.