Skip to content

Commit

Permalink
Merge pull request #2953 from sfischer13/master
Browse files Browse the repository at this point in the history
Typos
  • Loading branch information
coke committed Aug 15, 2019
2 parents 65f0e41 + fcabf38 commit fc4d52b
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions doc/Language/regexes.pod6
Expand Up @@ -1872,7 +1872,7 @@ the distinction clear.
In the first example, the matching adverb (C<:exhaustive>) is contiguous to the
regex adverb (C<:i>), and as a matter of fact, the "definition" and the
"matching" go together; however, by using C<match> it becomes clear than C<:i>
"matching" go together; however, by using C<match> it becomes clear that C<:i>
is only used when defining the C<$regex> variable, and C<:ex> (short for
C<:exhaustive>) as an argument when matching. As a matter of fact, matching
adverbs cannot even be used in the definition of a regex:
Expand Down Expand Up @@ -2388,8 +2388,8 @@ say $string.chars - $string.index: 'SQL'; # OUTPUT: 23
=end code
Since there are 23 chars from the very end of the string to the very first I<S> of I<SQL>
the backtracking engine will need 23 "useless" matches to find the right one, that
is will need 24 steps to get the final result.
the backtracking engine will need 23 "useless" matches to find the right one, that is,
it will need 24 steps to get the final result.
Backtracking is a costly machinery, therefore it is possible to disable
it in those cases where the matching can be found I<forward> only.
Expand Down Expand Up @@ -2487,7 +2487,7 @@ Capture 1 = database!
[SQL][ database!]
=end code
This demonstrate that disabling backtracking does not mean disabling possible
This demonstrates that disabling backtracking does not mean disabling possible
multiple iterations of the matching engine, but rather disabling the backward
matching tuning.
Expand Down

0 comments on commit fc4d52b

Please sign in to comment.