Small perldelta tweaks.

[p5sagit/p5-mst-13.2.git] / pod / perlrequick.pod

diff --git a/pod/perlrequick.pod b/pod/perlrequick.pod
index 3e29a4a..a31adab 100644 (file)
--- a/pod/perlrequick.pod
+++ b/pod/perlrequick.pod
@@ -219,11 +219,11 @@ boundary.
 
 =head2 Matching this or that
 
-We can match match different character strings with the B<alternation>
+We can match different character strings with the B<alternation>
 metacharacter C<'|'>.  To match C<dog> or C<cat>, we form the regex
 C<dog|cat>.  As before, perl will try to match the regex at the
 earliest possible point in the string.  At each character position,
-perl will first try to match the the first alternative, C<dog>.  If
+perl will first try to match the first alternative, C<dog>.  If
 C<dog> doesn't match, perl will then try the next alternative, C<cat>.
 If C<cat> doesn't match either, then the match fails and perl moves to
 the next position in the string.  Some examples:
@@ -238,7 +238,7 @@ C<cat> is able to match earlier in the string.
     "cats"          =~ /cats|cat|ca|c/; # matches "cats"
 
 At a given character position, the first alternative that allows the
-regex match to succeed wil be the one that matches. Here, all the
+regex match to succeed will be the one that matches. Here, all the
 alternatives match at the first string position, so th first matches.
 
 =head2 Grouping things and hierarchical matching
@@ -304,18 +304,30 @@ have the following meanings:
 
 =over 4
 
-=item * C<a?> = match 'a' 1 or 0 times
+=item *
+
+C<a?> = match 'a' 1 or 0 times
+
+=item *
+
+C<a*> = match 'a' 0 or more times, i.e., any number of times
+
+=item *
 
-=item * C<a*> = match 'a' 0 or more times, i.e., any number of times
+C<a+> = match 'a' 1 or more times, i.e., at least once
 
-=item * C<a+> = match 'a' 1 or more times, i.e., at least once
+=item *
 
-=item * C<a{n,m}> = match at least C<n> times, but not more than C<m>
+C<a{n,m}> = match at least C<n> times, but not more than C<m>
 times.
 
-=item * C<a{n,}> = match at least C<n> or more times
+=item *
+
+C<a{n,}> = match at least C<n> or more times
+
+=item *
 
-=item * C<a{n}> = match exactly C<n> times
+C<a{n}> = match exactly C<n> times
 
 =back