Skip to content

Commit 0186c95

Browse files
committed
[DATALAD RUNCMD] Fix typo: cyles -> cycles in SPPF documentation
Co-Authored-By: Claude Code 2.1.81 / Claude Opus 4.6 <noreply@anthropic.com> === Do not change lines below === { "chain": [], "cmd": "uvx codespell -w", "exit": 0, "extra_inputs": [], "inputs": [], "outputs": [ "docs/_static/sppf/sppf.html" ], "pwd": "." } ^^^ Do not change lines above ^^^
1 parent adc6e55 commit 0186c95

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

docs/_static/sppf/sppf.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -161,7 +161,7 @@ <h2 id="structural-properties">Structural Properties</h2>
161161

162162
<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>
163163

164-
<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>
164+
<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>
165165

166166
<h2 id="transformation-to-an-abstract-syntax-tree">Transformation to an abstract syntax tree</h2>
167167

0 commit comments

Comments
 (0)