1 files changed, 1 insertions, 1 deletions
diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md
index c08062ef4..7e3ce9923 100644
--- a/docs/dev/syntax.md
+++ b/docs/dev/syntax.md
@@ -72,7 +72,7 @@ Points of note:
 * Trivia and non-trivia tokens are not distinguished on the type level.
 * Each token carries its full text.
 * The original text can be recovered by concatenating the texts of all tokens in order.
-* Accessing a child of particular type (for example, parameter list of a function) generally involves linerary traversing the children, looking for a specific `kind`.
+* Accessing a child of particular type (for example, parameter list of a function) generally involves linear traversing the children, looking for a specific `kind`.
 * Modifying the tree is roughly `O(depth)`.
  We don't make special efforts to guarantee that the depth is not linear, but, in practice, syntax trees are branchy and shallow.
 * If mandatory (grammar wise) node is missing from the input, it's just missing from the tree.

diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md index c08062ef4..7e3ce9923 100644 --- a/docs/dev/syntax.md +++ b/docs/dev/syntax.md
@@ -72,7 +72,7 @@ Points of note:
72	* Trivia and non-trivia tokens are not distinguished on the type level.	72	* Trivia and non-trivia tokens are not distinguished on the type level.
73	* Each token carries its full text.	73	* Each token carries its full text.
74	* The original text can be recovered by concatenating the texts of all tokens in order.	74	* The original text can be recovered by concatenating the texts of all tokens in order.
75	* Accessing a child of particular type (for example, parameter list of a function) generally involves linerary traversing the children, looking for a specific `kind`.	75	* Accessing a child of particular type (for example, parameter list of a function) generally involves linear traversing the children, looking for a specific `kind`.
76	* Modifying the tree is roughly `O(depth)`.	76	* Modifying the tree is roughly `O(depth)`.
77	We don't make special efforts to guarantee that the depth is not linear, but, in practice, syntax trees are branchy and shallow.	77	We don't make special efforts to guarantee that the depth is not linear, but, in practice, syntax trees are branchy and shallow.
78	* If mandatory (grammar wise) node is missing from the input, it's just missing from the tree.	78	* If mandatory (grammar wise) node is missing from the input, it's just missing from the tree.