diff options
| author | Chris Lattner <sabre@nondot.org> | 2007-11-04 19:42:13 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2007-11-04 19:42:13 +0000 |
| commit | 2e5d07e3ea5a64b8e65aa31c7ed8688bb4c71136 (patch) | |
| tree | e794f9c553c8b0dd05c6eb19c41d7bee341aee62 /docs/tutorial | |
| parent | fe6575c2bf1126c9dee3cc73ad321a375634fc42 (diff) | |
fix typos
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43682 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'docs/tutorial')
| -rw-r--r-- | docs/tutorial/LangImpl7.html | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/tutorial/LangImpl7.html b/docs/tutorial/LangImpl7.html index ca0d2f06e0..ccd15dca72 100644 --- a/docs/tutorial/LangImpl7.html +++ b/docs/tutorial/LangImpl7.html @@ -130,7 +130,7 @@ logic.</p> in SSA form, it does not require (or permit) memory objects to be in SSA form. In the example above, note that the loads from G and H are direct accesses to G and H: they are not renamed or versioned. This differs from some other -compiler systems, which does try to version memory objects. In LLVM, instead of +compiler systems, which do try to version memory objects. In LLVM, instead of encoding dataflow analysis of memory into the LLVM IR, it is handled with <a href="../WritingAnLLVMPass.html">Analysis Passes</a> which are computed on demand.</p> @@ -267,7 +267,7 @@ more powerful and can promote structs, "unions", and arrays in many cases.</li> <p> All of these properties are easy to satisfy for most imperative languages, and -we'll illustrated this below with Kaleidoscope. The final question you may be +we'll illustrate this below with Kaleidoscope. The final question you may be asking is: should I bother with this nonsense for my front-end? Wouldn't it be better if I just did SSA construction directly, avoiding use of the mem2reg optimization pass? In short, we strongly recommend that use you this technique |