[sc-684] Update dictionary for guide.md

GUIDE.md

@@ -325,7 +325,7 @@ be turned into a tree!
 
 The `bend` is the opposite of the `fold`: instead of consuming something, it
 creates something. The way it works is, in some ways, similar to a while loop,
-but, admitedly, a little bit more bureaucratic, in 3 ways:
+but, admittedly, a little bit more bureaucratic, in 3 ways:
 
 1. You must explicit an initial state.
 
@@ -376,7 +376,7 @@ itself, forming a tree of descendants. In the end, you have a complete tree!
 
 The second way to explain is for the devs offended by this ultra simplified
 example: yes, `bend` is just a syntax-sugar for creating a recursive function,
-immediatelly calling it, and assigning the result to a variable. In other words,
+immediately calling it, and assigning the result to a variable. In other words,
 the program above is equivalent to:
 
 ```python
@@ -504,4 +504,4 @@ Benchmarks:
 
 ## ...
 
-TODO: conver IO and so many other aspects :')
+TODO: cover IO and so many other aspects :')

cspell.json

@@ -9,6 +9,7 @@
     "arity",
     "behaviour",
     "bitand",
+    "Bitonic",
     "builtins",
     "callcc",
     "chumsky",
@@ -24,6 +25,7 @@
     "destructures",
     "desugared",
     "desugars",
+    "devs",
     "dref",
     "dups",
     "effectful",
@@ -58,6 +60,7 @@
     "nullary",
     "numop",
     "nums",
+    "OOM's",
     "oper",
     "opre",
     "oprune",
@@ -67,6 +70,7 @@
     "postcondition",
     "powi",
     "prec",
+    "quadtree",
     "readback",
     "recursively",
     "redex",
@@ -111,6 +115,7 @@
     "/`.`/g",
     "/`..`/g",
     "/`...`/g",
-    "/`....`/g"
+    "/`....`/g",
+    "/```.*\n.*\n```/g"
   ]
-}
+}

src/imp/parser.rs

@@ -84,7 +84,7 @@ impl<'a> PyParser<'a> {
           Expr::Tup { els }
         } else {
           self.consume(")")?;
-          // A parenthesised expression
+          // A parenthesized expression
           head
         }
       }