[DATALAD RUNCMD] run codespell throughout fixing typo automagically

=== Do not change lines below === { "chain": [], "cmd": "codespell -w", "exit": 0, "extra_inputs": [], "inputs": [], "outputs": [], "pwd": "." } ^^^ Do not change lines above ^^^
lark-parser · yarikoptic · Feb 14, 2024 · Feb 14, 2024 · Feb 14, 2024 · Feb 14, 2024
commit 3bc6da1909372145f087a00da08509d86bf946eb
diff --git a/docs/_static/sppf/sppf.html b/docs/_static/sppf/sppf.html
@@ -161,7 +161,7 @@ <h2 id="structural-properties">Structural Properties</h2>
 
 <p>Packed nodes $(t,k)$ have one or two children. The right child is a symbol node $(x,k,i)$ and the left child (if it exists) is a symbol or intermediate node with label $(s,j,k)$, where $j \leq k \leq i$. Packed nodes have always exactly one parent which is a symbol node or intermediate node.</p>
 
-<p>It is useful to observe that the SPPF is a bipartite graph, with on the one hand the set of intermediate and symbol nodes and on the other hand the set of packed nodes. Therefore edges always go from a node of the first type to a node of the second type, or the other way round. As a consequence, cyles in the SPPF are always of even length.</p>
+<p>It is useful to observe that the SPPF is a bipartite graph, with on the one hand the set of intermediate and symbol nodes and on the other hand the set of packed nodes. Therefore edges always go from a node of the first type to a node of the second type, or the other way round. As a consequence, cycles in the SPPF are always of even length.</p>
 
 <h2 id="transformation-to-an-abstract-syntax-tree">Transformation to an abstract syntax tree</h2>
 

diff --git a/examples/composition/main.py b/examples/composition/main.py
@@ -15,7 +15,7 @@
    The resulting transformer can evaluate both JSON and CSV in the parse tree.
 
   The methods of each transformer are renamed into their appropriate namespace, using the given prefix.
-  This approach allows full re-use: the transformers don't need to care if their grammar is used directly,
+  This approach allows full reuse: the transformers don't need to care if their grammar is used directly,
   or being imported, or who is doing the importing.
 
 """