aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorYusuke Tanaka <[email protected]>2020-09-20 17:44:38 +0100
committerYusuke Tanaka <[email protected]>2020-09-20 17:44:38 +0100
commit4530b717cb47036b57bcb0d8f10833e424abee93 (patch)
tree01a6fa15398bd821faabb4bb8eaf94e65cbfd836
parent203358a0d59d91bc18a7478e9d0266719e1d0be3 (diff)
Fix typo
-rw-r--r--docs/dev/syntax.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md
index 7e3ce9923..2eb08b7ca 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 linear traversing the children, looking for a specific `kind`. 75* Accessing a child of particular type (for example, parameter list of a function) generally involves linearly 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.