aboutsummaryrefslogtreecommitdiffstats
path: root/docs/tutorial/LangImpl3.html
diff options
context:
space:
mode:
authorBenjamin Kramer <benny.kra@googlemail.com>2009-10-12 14:46:08 +0000
committerBenjamin Kramer <benny.kra@googlemail.com>2009-10-12 14:46:08 +0000
commit5fb9d7e8d4fe8ec08d086e07c83c8c5952cf071a (patch)
tree611b8930c912c03403d721f81e51788a42c125df /docs/tutorial/LangImpl3.html
parentb26e279e163669d34e45697b2ebe0e1003b7d8f8 (diff)
downloadexternal_llvm-5fb9d7e8d4fe8ec08d086e07c83c8c5952cf071a.zip
external_llvm-5fb9d7e8d4fe8ec08d086e07c83c8c5952cf071a.tar.gz
external_llvm-5fb9d7e8d4fe8ec08d086e07c83c8c5952cf071a.tar.bz2
Documentation: Perform automated correction of common typos.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83849 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/tutorial/LangImpl3.html')
-rw-r--r--docs/tutorial/LangImpl3.html4
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/tutorial/LangImpl3.html b/docs/tutorial/LangImpl3.html
index bc5db46..e3d2117 100644
--- a/docs/tutorial/LangImpl3.html
+++ b/docs/tutorial/LangImpl3.html
@@ -183,7 +183,7 @@ Value *VariableExprAST::Codegen() {
</div>
<p>References to variables are also quite simple using LLVM. In the simple version
-of Kaleidoscope, we assume that the variable has already been emited somewhere
+of Kaleidoscope, we assume that the variable has already been emitted somewhere
and its value is available. In practice, the only values that can be in the
<tt>NamedValues</tt> map are function arguments. This
code simply checks to see that the specified name is in the map (if not, an
@@ -362,7 +362,7 @@ definition of this function.</p>
first, we want to allow 'extern'ing a function more than once, as long as the
prototypes for the externs match (since all arguments have the same type, we
just have to check that the number of arguments match). Second, we want to
-allow 'extern'ing a function and then definining a body for it. This is useful
+allow 'extern'ing a function and then defining a body for it. This is useful
when defining mutually recursive functions.</p>
<p>In order to implement this, the code above first checks to see if there is