From 2e5d07e3ea5a64b8e65aa31c7ed8688bb4c71136 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sun, 4 Nov 2007 19:42:13 +0000 Subject: [PATCH] fix typos git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43682 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/tutorial/LangImpl7.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/tutorial/LangImpl7.html b/docs/tutorial/LangImpl7.html index ca0d2f06e03..ccd15dca723 100644 --- a/docs/tutorial/LangImpl7.html +++ b/docs/tutorial/LangImpl7.html @@ -130,7 +130,7 @@ logic.

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 Analysis Passes which are computed on demand.

@@ -267,7 +267,7 @@ more powerful and can promote structs, "unions", and arrays in many cases.

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 -- 2.34.1