Skip to content

Commit 2489377

Browse files
authored
fix title casing
1 parent 00eb8c2 commit 2489377

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

posts/compiling-lisp-to-bytecode-and-running-it.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ This is a nice example of simple [bytecode](https://en.wikipedia.org/wiki/Byteco
2525

2626
In previous posts, I walked through [compiling Lisp to JavaScript](https://healeycodes.com/lisp-to-javascript-compiler) and [explored some optimizations](https://healeycodes.com/lisp-compiler-optimizations). This time, I'm taking a different approach: compiling Lisp to bytecode and running it in a custom VM. You don't need to have read my previous posts to follow along!
2727

28-
## Running bytecode
28+
## Running Bytecode
2929

3030
In [a recent commit](https://github.com/healeycodes/lisp-to-js/commit/c5252e313ad2aa7024363317aaccae3b296d4e57) to [lisp-to-js](https://github.com/healeycodes/lisp-to-js), I added the option to compile Lisp code to bytecode and run it in a [stack-based](https://en.wikipedia.org/wiki/Stack_machine) VM. My Lisp variant is quite simple (based on [Little Lisp](https://maryrosecook.com/blog/post/little-lisp-interpreter)). Below, I have a small program and the bytecode it produces.
3131

@@ -210,7 +210,7 @@ impl StackFrame {
210210
}
211211
```
212212

213-
## Generating bytecode
213+
## Generating Bytecode
214214

215215
After parsing, and an optional optimization pass, the compiler produces an Abstract Syntax Tree (AST) representing the Lisp expressions that need to be processed into bytecode.
216216

0 commit comments

Comments
 (0)