From f954f2f8c1922d63a6cc9401c20adfe09de1de4e Mon Sep 17 00:00:00 2001 From: Cassie Jones Date: Thu, 20 Feb 2020 16:26:25 +0100 Subject: [PATCH] Fix some small wording changes --- posts/2018/heat-signature.md | 2 +- posts/2018/llvm-hearts-peano-addition.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/posts/2018/heat-signature.md b/posts/2018/heat-signature.md index 9f7ddf6..d428d24 100644 --- a/posts/2018/heat-signature.md +++ b/posts/2018/heat-signature.md @@ -66,5 +66,5 @@ As I try to grab my unconscious body with my pod, the alarm timer countdown runs ----- And that's the story of how I failed my first Heat Signature daily mission in only 33 seconds. -This took several minutes of real time, because the game encourages you to pause frequently planning and reflexes, but the entire mission from start to finish only took 33 seconds of game time. +This took several minutes of real time, because the game encourages you to pause frequently for planning and reflexes, but the entire mission from start to finish only took 33 seconds of game time. If this sounds like your sort of game, consider [buying it for yourself][Heat Signature], and tell me what story you get yourself into. diff --git a/posts/2018/llvm-hearts-peano-addition.md b/posts/2018/llvm-hearts-peano-addition.md index fb40221..1221a3d 100644 --- a/posts/2018/llvm-hearts-peano-addition.md +++ b/posts/2018/llvm-hearts-peano-addition.md @@ -107,7 +107,7 @@ nat add(nat a, nat b) { The first important optimization here is tail call optimization. Above we see that we call `@add` into `%tmp4` and then immediately return it without doing anything else in between, which makes this a tail call. -Therefore, in order to avoid the cost of calling functions, the extra stack frames needed, and the expose more opportunities for optimizations, tail call optimization turns our tail recursion into a loop. +Therefore, in order to avoid the cost of calling functions, the extra stack frames needed, and to expose more opportunities for optimizations, tail call optimization turns our tail recursion into a loop. ```llvm define i32 @add(i32 %a, i32 %b) { -- 2.43.2