Skip to content

Commit 4aaedff

Browse files
Correct a few spelling mistakes in docs (#35)
Co-authored-by: Katrin Leinweber <[email protected]>
1 parent 36d9c7d commit 4aaedff

File tree

6 files changed

+11
-11
lines changed

6 files changed

+11
-11
lines changed

README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ For example, let's take an `Integer` in Ruby:
5757
1
5858
```
5959

60-
It's corresponding s-expression would be:
60+
Its corresponding s-expression would be:
6161

6262
```ruby
6363
s(:int, 1)
@@ -198,7 +198,7 @@ def my_method
198198
end
199199
```
200200

201-
It's corresponding s-expression would be:
201+
Its corresponding s-expression would be:
202202

203203
```ruby
204204
ast =

docs/experiments.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -130,8 +130,8 @@ line tool.
130130
- And the `policy` is executed to check if the current change is valuable
131131

132132
If the file contains multiple `before` or `after` blocks, each removal will
133-
occur independently and the successfull removals will be combined as a
134-
secondary change. The process repeates until find all possible combinations.
133+
occur independently and the successful removals will be combined as a
134+
secondary change. The process repeats until find all possible combinations.
135135

136136
See more examples in [experiments](experiments) folder.
137137

docs/ideas.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@ This example, shows adds and removals from specific node targets between two
4141
different files.
4242

4343
If we start tracking AST transition synapses and associating with "Fixes" or
44-
"Reverts" we can predict introduction of new bugs by inpecting if the
44+
"Reverts" we can predict introduction of new bugs by inspecting whether the
4545
introduction of new patterns that can be possibly reverted or improved.
4646

4747
## Fast Rewriter with pure strings

docs/shortcuts.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ several interesting cases in action.
1313

1414
## List your fast shortcuts
1515

16-
As the interface is very rudimentar, let's build a shortcut to print what
16+
As the interface is very rudimentary, let's build a shortcut to print what
1717
shortcuts are available. This is a good one to your `$HOME/Fastfile`:
1818

1919
```ruby
@@ -46,7 +46,7 @@ I always miss bringing something simple as `grep keyword` where I can leave a si
4646
search in all types of nodes and report interesting things about it.
4747

4848
Let's consider a very flexible search that can target any code related to some
49-
keyword. Considering that we're talking about code indentifiers:
49+
keyword. Considering that we're talking about code identifiers:
5050

5151

5252
```ruby

docs/similarity_tutorial.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -76,14 +76,14 @@ Fast.search_file('(class (const nil $_))','lib/fast.rb').grep(Symbol)
7676
:ExperimentFile]
7777
```
7878

79-
The idea of this inspecton is build a proof of concept to show the similarity
79+
The idea of this inspection is building a proof of concept to show the similarity
8080
of matcher classes because they only define a `match?` method.
8181

8282
```ruby
8383
patterns = Fast.search_file('class','lib/fast.rb').map{|n|Fast.expression_from(n)}
8484
```
8585

86-
A simple comparison between the patterns size versus `.uniq.size` can proof if
86+
A simple comparison between the patterns size versus `.uniq.size` can prove that
8787
the idea will work.
8888

8989
```ruby

docs/syntax.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -192,7 +192,7 @@ def duplicate(value)
192192
end
193193
```
194194

195-
The expression is matching nodes that have a integer granchild and also with
195+
The expression is matching nodes that have an integer grandchild and also with
196196
type `def`.
197197

198198
## `...` is a **node** with children
@@ -305,7 +305,7 @@ Double check the expressions that have matched printing the AST:
305305

306306
## `{}` is for **any** matches like **union** conditions with **or** operator
307307

308-
Let's say we to add check all occurrencies of the constant `ANSWER`.
308+
Let's say we want to add check all occurrences of the constant `ANSWER`.
309309

310310
We'll need to get both `casgn` and `const` node types. For such cases we can
311311
surround the expressions with `{}` and it will return if the node matches with

0 commit comments

Comments
 (0)