From 9a7441779fae45d246b8f0c79a6d2019bff4afb4 Mon Sep 17 00:00:00 2001 From: Danila Fedorin Date: Mon, 10 Feb 2020 19:38:46 -0800 Subject: [PATCH] Fix typo in compiler series --- content/blog/09_compiler_garbage_collection.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/blog/09_compiler_garbage_collection.md b/content/blog/09_compiler_garbage_collection.md index b041262..6dc0ff0 100644 --- a/content/blog/09_compiler_garbage_collection.md +++ b/content/blog/09_compiler_garbage_collection.md @@ -98,7 +98,7 @@ cycles in our graphs. Unsurprisingly, we implement this type of garbage collection in two stages: 1. __Mark__: We go through every node that is still needed by -the runtime, and recursively mark is, its children, and so on as "to keep". +the runtime, and recursively mark it, its children, and so on as "to keep". 2. __Sweep__: We go through every node we haven't yet freed, and, if it hasn't been marked as "to keep", we free it.