summaryrefslogtreecommitdiff
path: root/pod/perlsyn.pod
diff options
context:
space:
mode:
authorMichael Witten <mfwitten@gmail.com>2011-03-27 17:24:52 -0700
committerFather Chrysostomos <sprout@cpan.org>2011-03-27 17:24:52 -0700
commit6a0969e568c56d0d510daa00870342f6162a2cc9 (patch)
tree381ce579e0b8ba0f8307fb6b1ef23a77250d66ac /pod/perlsyn.pod
parentf66e0bd0e7a9a8e96187ff3c33fab1ac114c200c (diff)
downloadperl-6a0969e568c56d0d510daa00870342f6162a2cc9.tar.gz
Docs: perlsyn.pod Use dominant American spelling consistently.
The `z' in words like `optimize' appears to be already dominant in this document; the few uses of the British `s' have been replaced.
Diffstat (limited to 'pod/perlsyn.pod')
-rw-r--r--pod/perlsyn.pod8
1 files changed, 4 insertions, 4 deletions
diff --git a/pod/perlsyn.pod b/pod/perlsyn.pod
index c12ec4141e..33eb4ae137 100644
--- a/pod/perlsyn.pod
+++ b/pod/perlsyn.pod
@@ -281,7 +281,7 @@ the C<next> statement.
Extension modules can also hook into the Perl parser to define new
kinds of compound statement. These are introduced by a keyword which
-the extension recognises, and the syntax following the keyword is
+the extension recognizes, and the syntax following the keyword is
defined entirely by the extension. If you are an implementor, see
L<perlapi/PL_keyword_plugin> for the mechanism. If you are using such
a module, see the module's documentation for details of the syntax that
@@ -426,7 +426,7 @@ is therefore visible only within the loop. Otherwise, the variable is
implicitly local to the loop and regains its former value upon exiting
the loop. If the variable was previously declared with C<my>, it uses
that variable instead of the global one, but it's still localized to
-the loop. This implicit localisation occurs I<only> in a C<foreach>
+the loop. This implicit localization occurs I<only> in a C<foreach>
loop.
X<my> X<local>
@@ -676,12 +676,12 @@ will test only the regex, which causes both operands to be treated as boolean.
Watch out for this one, then, because an arrayref is always a true value, which
makes it effectively redundant.
-Tautologous boolean operators are still going to be optimised away. Don't be
+Tautologous boolean operators are still going to be optimized away. Don't be
tempted to write
when ('foo' or 'bar') { ... }
-This will optimise down to C<'foo'>, so C<'bar'> will never be considered (even
+This will optimize down to C<'foo'>, so C<'bar'> will never be considered (even
though the rules say to use a smart match on C<'foo'>). For an alternation like
this, an array ref will work, because this will instigate smart matching: