summaryrefslogtreecommitdiff
path: root/comp/lucas-standen-NEA/writeup/coverpage.ms
diff options
context:
space:
mode:
Diffstat (limited to 'comp/lucas-standen-NEA/writeup/coverpage.ms')
-rw-r--r--comp/lucas-standen-NEA/writeup/coverpage.ms3
1 files changed, 2 insertions, 1 deletions
diff --git a/comp/lucas-standen-NEA/writeup/coverpage.ms b/comp/lucas-standen-NEA/writeup/coverpage.ms
index 2aced24..54e4746 100644
--- a/comp/lucas-standen-NEA/writeup/coverpage.ms
+++ b/comp/lucas-standen-NEA/writeup/coverpage.ms
@@ -276,7 +276,7 @@ When you solve that expression you know to start with (2 * 4), then 3 - the answ
We can represent the steps as a tree like so:
-.PSPIC ast.ps
+.PSPIC ast.ps
.PP
As you can see, you need to evaluate the expression in the most brackets first, then the next, and
@@ -379,6 +379,7 @@ int exec(ast_node *exp){
The rest of the code is the process of converting the string input to litteral values and inserting
them into the AST
+
.NH 1
Design
.NH 1