about summary refs log tree commit diff
path: root/docs/dev/syntax.md
diff options
context:
space:
mode:
authorLukas Wirth <lukastw97@gmail.com>2021-02-03 13:40:24 +0100
committerLukas Wirth <lukastw97@gmail.com>2021-02-03 13:46:51 +0100
commitf82ce500a9c72a4153850f15e17b60388e95b2af (patch)
treebf5314dd20eb90e5b68872f11a5e0e269bcc8fe4 /docs/dev/syntax.md
parent81a9ad3672d547b2f5d265766bbb6c79909fb2da (diff)
downloadrust-f82ce500a9c72a4153850f15e17b60388e95b2af.tar.gz
rust-f82ce500a9c72a4153850f15e17b60388e95b2af.zip
Fix spelling mistakes in docs/dev
Diffstat (limited to 'docs/dev/syntax.md')
-rw-r--r--docs/dev/syntax.md29
1 files changed, 14 insertions, 15 deletions
diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md
index 1edafab680e..737cc7a7297 100644
--- a/docs/dev/syntax.md
+++ b/docs/dev/syntax.md
@@ -92,19 +92,18 @@ FN@0..17
     R_PAREN@5..6 ")"
   WHITESPACE@6..7 " "
   BLOCK_EXPR@7..17
-    BLOCK@7..17
-      L_CURLY@7..8 "{"
-      WHITESPACE@8..9 " "
-      BIN_EXPR@9..15
-        LITERAL@9..11
-          INT_NUMBER@9..11 "90"
-        WHITESPACE@11..12 " "
-        PLUS@12..13 "+"
-        WHITESPACE@13..14 " "
-        LITERAL@14..15
-          INT_NUMBER@14..15 "2"
-      WHITESPACE@15..16 " "
-      R_CURLY@16..17 "}"
+    L_CURLY@7..8 "{"
+    WHITESPACE@8..9 " "
+    BIN_EXPR@9..15
+      LITERAL@9..11
+        INT_NUMBER@9..11 "90"
+      WHITESPACE@11..12 " "
+      PLUS@12..13 "+"
+      WHITESPACE@13..14 " "
+      LITERAL@14..15
+        INT_NUMBER@14..15 "2"
+    WHITESPACE@15..16 " "
+    R_CURLY@16..17 "}"
 ```
 
 #### Optimizations
@@ -387,7 +386,7 @@ trait HasVisibility: AstNode {
     fn visibility(&self) -> Option<Visibility>;
 }
 
-impl HasVisbility for FnDef {
+impl HasVisibility for FnDef {
     fn visibility(&self) -> Option<Visibility> {
         self.syntax.children().find_map(Visibility::cast)
     }
@@ -527,7 +526,7 @@ In practice, incremental reparsing doesn't actually matter much for IDE use-case
 
 ### Parsing Algorithm
 
-We use a boring hand-crafted recursive descent + pratt combination, with a special effort of continuting the parsing if an error is detected.
+We use a boring hand-crafted recursive descent + pratt combination, with a special effort of continuing the parsing if an error is detected.
 
 ### Parser Recap