1 files changed, 1 insertions, 1 deletions
diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md
index d4bc4b07c..f1bcdc4af 100644
--- a/docs/dev/syntax.md
+++ b/docs/dev/syntax.md
@@ -74,7 +74,7 @@ Points of note:
 * 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`.
 * Modifying the tree is roughly `O(depth)`.
-  We don't make special efforts to guarantree that the depth is not liner, but, in practice, syntax trees are branchy and shallow.
+  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.
 * If an extra erroneous input is present, it is wrapped into a node with `ERROR` kind, and treated just like any other node.
 * Parser errors are not a part of syntax tree.

diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md index d4bc4b07c..f1bcdc4af 100644 --- a/docs/dev/syntax.md +++ b/docs/dev/syntax.md
@@ -74,7 +74,7 @@ Points of note:
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 linerary 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 guarantree that the depth is not liner, 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.
79	* If an extra erroneous input is present, it is wrapped into a node with `ERROR` kind, and treated just like any other node.	79	* If an extra erroneous input is present, it is wrapped into a node with `ERROR` kind, and treated just like any other node.
80	* Parser errors are not a part of syntax tree.	80	* Parser errors are not a part of syntax tree.