From e5f4f7b85fbb91a293a7d89d7b85adfbaeeb51f4 Mon Sep 17 00:00:00 2001 From: Thalia Archibald Date: Fri, 21 Jun 2024 06:13:09 -0700 Subject: Format whitespace (#86) * Trim trailing whitespace * Ensure final new lines * Convert line endings from CRLF to LF * Replace tabs with spaces --- chapter02/README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'chapter02/README.md') diff --git a/chapter02/README.md b/chapter02/README.md index b5cb5dce..4b912465 100644 --- a/chapter02/README.md +++ b/chapter02/README.md @@ -7,7 +7,7 @@ multiplication, division, and unary minus. This allows us to write statements su return 1 + 2 * 3 + -5; ``` -Here is the [complete language grammar](docs/02-grammar.md) for this chapter. +Here is the [complete language grammar](docs/02-grammar.md) for this chapter. ## Extensions to Intermediate Representation @@ -96,7 +96,7 @@ structure: Our lattice elements can be one of three types: * The highest element is "top", denoted by T; assigning T means that the Node's value may or may not be a compile time constant. -* All elements in the middle are constants. +* All elements in the middle are constants. * The lowest is "bottom", denoted by ⊥; assigning ⊥ means that we know that the Node's value is **not** a compile time constant. An invariant of peephole optimizations is that the type of a Node always moves down the lattice. @@ -121,4 +121,4 @@ The following visual shows how the graph looks like pre-peephole optimization: ## Post-peephole -![Example Visual](./docs/02-post-peephole-ex1.svg) \ No newline at end of file +![Example Visual](./docs/02-post-peephole-ex1.svg) -- cgit v1.2.3