diff options
author | standenboy <standenboy@seacrossedlovers.xyz> | 2024-05-06 10:53:24 +0100 |
---|---|---|
committer | standenboy <standenboy@seacrossedlovers.xyz> | 2024-05-06 10:53:24 +0100 |
commit | 11ee832d7e5b1bf4d010ca1dd87e06198a16f275 (patch) | |
tree | 0e0a513633f01a2286fe9a39f98f33fd77037daa /comp/lucas-standen-NEA/writeup/coverpage.ms | |
parent | 24e4d6f4a3d349e79c39431c6877b90c8b727ffa (diff) |
Added a coverpage generator via pdftocgen
Diffstat (limited to 'comp/lucas-standen-NEA/writeup/coverpage.ms')
-rw-r--r-- | comp/lucas-standen-NEA/writeup/coverpage.ms | 3 |
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 |