Skip to content

Commit 5d19f75

Browse files
authored
more colons
1 parent d5fbf29 commit 5d19f75

File tree

1 file changed

+3
-5
lines changed

1 file changed

+3
-5
lines changed

posts/lisp-to-javascript-compiler.md

Lines changed: 3 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ The first step of this project involved choosing a Lisp to implement. There are
1111

1212
In Lisp terminology, a "form" is a fundamental concept referring to any syntactic construct that can be evaluated to produce a result.
1313

14-
My Lisp has these forms.
14+
My Lisp has these forms:
1515

1616
```lisp
1717
; atoms
@@ -187,9 +187,7 @@ The function that handles expressions, `compile_expression`, is pretty much just
187187

188188
The code generation logic was a lot of fun to write. I felt much more at home with JavaScript (compared to Lisp) and it was very much a dessert compared to battling types over in parse-land.
189189

190-
I'll show a few of my favorite snippets here.
191-
192-
Like supporting less-than expressions:
190+
I'll show a few of my favorite snippets here. Like supporting less-than expressions:
193191

194192
```rust
195193
// input: (< 1 2 3)
@@ -239,7 +237,7 @@ Expression::LambdaExpression(lambda_expression) => {
239237

240238
Usually, the first program I write with a new interpreter or compiler is a Fibonacci function. It's a good test for a range of functionality (variable binding, boolean logic, comparison, recursion, and sometimes performance too).
241239

242-
Here's my compiler's output for a Fibonacci function with all the odd spacing and hanging commas that my compiler produces.
240+
Here's my compiler's output for a Fibonacci function with all the odd spacing and hanging commas that my compiler produces:
243241

244242
```jsx
245243
/*

0 commit comments

Comments
 (0)