diff options
author | quou <quou@disroot.org> | 2023-05-27 10:35:48 +1000 |
---|---|---|
committer | quou <quou@disroot.org> | 2023-05-27 10:35:48 +1000 |
commit | 54eda8c35d422595af57852074109cdc169304e0 (patch) | |
tree | 8c05cd07e51188341687cd75785ed594788cf943 /compiler.c | |
parent | 32d8c607e49ecaedc001196aaeb46e9a665311b5 (diff) |
Fix a spelling error.
Diffstat (limited to 'compiler.c')
-rw-r--r-- | compiler.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -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. * |