From 54eda8c35d422595af57852074109cdc169304e0 Mon Sep 17 00:00:00 2001 From: quou Date: Sat, 27 May 2023 10:35:48 +1000 Subject: Fix a spelling error. --- compiler.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/compiler.c b/compiler.c index e025992..c8335c6 100644 --- a/compiler.c +++ b/compiler.c @@ -10,11 +10,11 @@ * The first expression parser and generator I made for * my compiler was based on an Abstract Syntax Tree (AST), * where it would parse the source code into a tree - * structure and then recursively descent the tree and + * structure and then recursively descend the tree and * generate code for each branch. This works fine, but * trees are often quite wasteful on memory (even in * my case where the tree is fully static) and in the - * cast of ASTs they waste stack during recursion + * case of ASTs they waste stack during recursion * because there ends up being a lot of "empty" nodes * that only check a single parameter before descending. * -- cgit v1.2.3-54-g00ecf