This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Untangle the <stdio.h> #include nest for the stdchar test,
[perl5.git] / pod / perlop.pod
... / ...
CommitLineData
1=head1 NAME
2
3perlop - Perl operators and precedence
4
5=head1 SYNOPSIS
6
7Perl operators have the following associativity and precedence,
8listed from highest precedence to lowest. Operators borrowed from
9C keep the same precedence relationship with each other, even where
10C's precedence is slightly screwy. (This makes learning Perl easier
11for C folks.) With very few exceptions, these all operate on scalar
12values only, not array values.
13
14 left terms and list operators (leftward)
15 left ->
16 nonassoc ++ --
17 right **
18 right ! ~ \ and unary + and -
19 left =~ !~
20 left * / % x
21 left + - .
22 left << >>
23 nonassoc named unary operators
24 nonassoc < > <= >= lt gt le ge
25 nonassoc == != <=> eq ne cmp
26 left &
27 left | ^
28 left &&
29 left ||
30 nonassoc .. ...
31 right ?:
32 right = += -= *= etc.
33 left , =>
34 nonassoc list operators (rightward)
35 right not
36 left and
37 left or xor
38
39In the following sections, these operators are covered in precedence order.
40
41Many operators can be overloaded for objects. See L<overload>.
42
43=head1 DESCRIPTION
44
45=head2 Terms and List Operators (Leftward)
46
47A TERM has the highest precedence in Perl. They include variables,
48quote and quote-like operators, any expression in parentheses,
49and any function whose arguments are parenthesized. Actually, there
50aren't really functions in this sense, just list operators and unary
51operators behaving as functions because you put parentheses around
52the arguments. These are all documented in L<perlfunc>.
53
54If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
55is followed by a left parenthesis as the next token, the operator and
56arguments within parentheses are taken to be of highest precedence,
57just like a normal function call.
58
59In the absence of parentheses, the precedence of list operators such as
60C<print>, C<sort>, or C<chmod> is either very high or very low depending on
61whether you are looking at the left side or the right side of the operator.
62For example, in
63
64 @ary = (1, 3, sort 4, 2);
65 print @ary; # prints 1324
66
67the commas on the right of the sort are evaluated before the sort,
68but the commas on the left are evaluated after. In other words,
69list operators tend to gobble up all arguments that follow, and
70then act like a simple TERM with regard to the preceding expression.
71Be careful with parentheses:
72
73 # These evaluate exit before doing the print:
74 print($foo, exit); # Obviously not what you want.
75 print $foo, exit; # Nor is this.
76
77 # These do the print before evaluating exit:
78 (print $foo), exit; # This is what you want.
79 print($foo), exit; # Or this.
80 print ($foo), exit; # Or even this.
81
82Also note that
83
84 print ($foo & 255) + 1, "\n";
85
86probably doesn't do what you expect at first glance. See
87L<Named Unary Operators> for more discussion of this.
88
89Also parsed as terms are the C<do {}> and C<eval {}> constructs, as
90well as subroutine and method calls, and the anonymous
91constructors C<[]> and C<{}>.
92
93See also L<Quote and Quote-like Operators> toward the end of this section,
94as well as L<"I/O Operators">.
95
96=head2 The Arrow Operator
97
98"C<< -> >>" is an infix dereference operator, just as it is in C
99and C++. If the right side is either a C<[...]>, C<{...}>, or a
100C<(...)> subscript, then the left side must be either a hard or
101symbolic reference to an array, a hash, or a subroutine respectively.
102(Or technically speaking, a location capable of holding a hard
103reference, if it's an array or hash reference being used for
104assignment.) See L<perlreftut> and L<perlref>.
105
106Otherwise, the right side is a method name or a simple scalar
107variable containing either the method name or a subroutine reference,
108and the left side must be either an object (a blessed reference)
109or a class name (that is, a package name). See L<perlobj>.
110
111=head2 Auto-increment and Auto-decrement
112
113"++" and "--" work as in C. That is, if placed before a variable, they
114increment or decrement the variable before returning the value, and if
115placed after, increment or decrement the variable after returning the value.
116
117The auto-increment operator has a little extra builtin magic to it. If
118you increment a variable that is numeric, or that has ever been used in
119a numeric context, you get a normal increment. If, however, the
120variable has been used in only string contexts since it was set, and
121has a value that is not the empty string and matches the pattern
122C</^[a-zA-Z]*[0-9]*\z/>, the increment is done as a string, preserving each
123character within its range, with carry:
124
125 print ++($foo = '99'); # prints '100'
126 print ++($foo = 'a0'); # prints 'a1'
127 print ++($foo = 'Az'); # prints 'Ba'
128 print ++($foo = 'zz'); # prints 'aaa'
129
130The auto-decrement operator is not magical.
131
132=head2 Exponentiation
133
134Binary "**" is the exponentiation operator. It binds even more
135tightly than unary minus, so -2**4 is -(2**4), not (-2)**4. (This is
136implemented using C's pow(3) function, which actually works on doubles
137internally.)
138
139=head2 Symbolic Unary Operators
140
141Unary "!" performs logical negation, i.e., "not". See also C<not> for a lower
142precedence version of this.
143
144Unary "-" performs arithmetic negation if the operand is numeric. If
145the operand is an identifier, a string consisting of a minus sign
146concatenated with the identifier is returned. Otherwise, if the string
147starts with a plus or minus, a string starting with the opposite sign
148is returned. One effect of these rules is that C<-bareword> is equivalent
149to C<"-bareword">.
150
151Unary "~" performs bitwise negation, i.e., 1's complement. For
152example, C<0666 & ~027> is 0640. (See also L<Integer Arithmetic> and
153L<Bitwise String Operators>.) Note that the width of the result is
154platform-dependent: ~0 is 32 bits wide on a 32-bit platform, but 64
155bits wide on a 64-bit platform, so if you are expecting a certain bit
156width, remember use the & operator to mask off the excess bits.
157
158Unary "+" has no effect whatsoever, even on strings. It is useful
159syntactically for separating a function name from a parenthesized expression
160that would otherwise be interpreted as the complete list of function
161arguments. (See examples above under L<Terms and List Operators (Leftward)>.)
162
163Unary "\" creates a reference to whatever follows it. See L<perlreftut>
164and L<perlref>. Do not confuse this behavior with the behavior of
165backslash within a string, although both forms do convey the notion
166of protecting the next thing from interpolation.
167
168=head2 Binding Operators
169
170Binary "=~" binds a scalar expression to a pattern match. Certain operations
171search or modify the string $_ by default. This operator makes that kind
172of operation work on some other string. The right argument is a search
173pattern, substitution, or transliteration. The left argument is what is
174supposed to be searched, substituted, or transliterated instead of the default
175$_. When used in scalar context, the return value generally indicates the
176success of the operation. Behavior in list context depends on the particular
177operator. See L</"Regexp Quote-Like Operators"> for details.
178
179If the right argument is an expression rather than a search pattern,
180substitution, or transliteration, it is interpreted as a search pattern at run
181time. This can be less efficient than an explicit search, because the
182pattern must be compiled every time the expression is evaluated.
183
184Binary "!~" is just like "=~" except the return value is negated in
185the logical sense.
186
187=head2 Multiplicative Operators
188
189Binary "*" multiplies two numbers.
190
191Binary "/" divides two numbers.
192
193Binary "%" computes the modulus of two numbers. Given integer
194operands C<$a> and C<$b>: If C<$b> is positive, then C<$a % $b> is
195C<$a> minus the largest multiple of C<$b> that is not greater than
196C<$a>. If C<$b> is negative, then C<$a % $b> is C<$a> minus the
197smallest multiple of C<$b> that is not less than C<$a> (i.e. the
198result will be less than or equal to zero).
199Note than when C<use integer> is in scope, "%" gives you direct access
200to the modulus operator as implemented by your C compiler. This
201operator is not as well defined for negative operands, but it will
202execute faster.
203
204Binary "x" is the repetition operator. In scalar context or if the left
205operand is not enclosed in parentheses, it returns a string consisting
206of the left operand repeated the number of times specified by the right
207operand. In list context, if the left operand is enclosed in
208parentheses, it repeats the list.
209
210 print '-' x 80; # print row of dashes
211
212 print "\t" x ($tab/8), ' ' x ($tab%8); # tab over
213
214 @ones = (1) x 80; # a list of 80 1's
215 @ones = (5) x @ones; # set all elements to 5
216
217
218=head2 Additive Operators
219
220Binary "+" returns the sum of two numbers.
221
222Binary "-" returns the difference of two numbers.
223
224Binary "." concatenates two strings.
225
226=head2 Shift Operators
227
228Binary "<<" returns the value of its left argument shifted left by the
229number of bits specified by the right argument. Arguments should be
230integers. (See also L<Integer Arithmetic>.)
231
232Binary ">>" returns the value of its left argument shifted right by
233the number of bits specified by the right argument. Arguments should
234be integers. (See also L<Integer Arithmetic>.)
235
236=head2 Named Unary Operators
237
238The various named unary operators are treated as functions with one
239argument, with optional parentheses. These include the filetest
240operators, like C<-f>, C<-M>, etc. See L<perlfunc>.
241
242If any list operator (print(), etc.) or any unary operator (chdir(), etc.)
243is followed by a left parenthesis as the next token, the operator and
244arguments within parentheses are taken to be of highest precedence,
245just like a normal function call. Examples:
246
247 chdir $foo || die; # (chdir $foo) || die
248 chdir($foo) || die; # (chdir $foo) || die
249 chdir ($foo) || die; # (chdir $foo) || die
250 chdir +($foo) || die; # (chdir $foo) || die
251
252but, because * is higher precedence than ||:
253
254 chdir $foo * 20; # chdir ($foo * 20)
255 chdir($foo) * 20; # (chdir $foo) * 20
256 chdir ($foo) * 20; # (chdir $foo) * 20
257 chdir +($foo) * 20; # chdir ($foo * 20)
258
259 rand 10 * 20; # rand (10 * 20)
260 rand(10) * 20; # (rand 10) * 20
261 rand (10) * 20; # (rand 10) * 20
262 rand +(10) * 20; # rand (10 * 20)
263
264See also L<"Terms and List Operators (Leftward)">.
265
266=head2 Relational Operators
267
268Binary "<" returns true if the left argument is numerically less than
269the right argument.
270
271Binary ">" returns true if the left argument is numerically greater
272than the right argument.
273
274Binary "<=" returns true if the left argument is numerically less than
275or equal to the right argument.
276
277Binary ">=" returns true if the left argument is numerically greater
278than or equal to the right argument.
279
280Binary "lt" returns true if the left argument is stringwise less than
281the right argument.
282
283Binary "gt" returns true if the left argument is stringwise greater
284than the right argument.
285
286Binary "le" returns true if the left argument is stringwise less than
287or equal to the right argument.
288
289Binary "ge" returns true if the left argument is stringwise greater
290than or equal to the right argument.
291
292=head2 Equality Operators
293
294Binary "==" returns true if the left argument is numerically equal to
295the right argument.
296
297Binary "!=" returns true if the left argument is numerically not equal
298to the right argument.
299
300Binary "<=>" returns -1, 0, or 1 depending on whether the left
301argument is numerically less than, equal to, or greater than the right
302argument. If your platform supports NaNs (not-a-numbers) as numeric
303values, using them with "<=>" (or any other numeric comparison)
304returns undef.
305
306Binary "eq" returns true if the left argument is stringwise equal to
307the right argument.
308
309Binary "ne" returns true if the left argument is stringwise not equal
310to the right argument.
311
312Binary "cmp" returns -1, 0, or 1 depending on whether the left
313argument is stringwise less than, equal to, or greater than the right
314argument.
315
316"lt", "le", "ge", "gt" and "cmp" use the collation (sort) order specified
317by the current locale if C<use locale> is in effect. See L<perllocale>.
318
319=head2 Bitwise And
320
321Binary "&" returns its operators ANDed together bit by bit.
322(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
323
324=head2 Bitwise Or and Exclusive Or
325
326Binary "|" returns its operators ORed together bit by bit.
327(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
328
329Binary "^" returns its operators XORed together bit by bit.
330(See also L<Integer Arithmetic> and L<Bitwise String Operators>.)
331
332=head2 C-style Logical And
333
334Binary "&&" performs a short-circuit logical AND operation. That is,
335if the left operand is false, the right operand is not even evaluated.
336Scalar or list context propagates down to the right operand if it
337is evaluated.
338
339=head2 C-style Logical Or
340
341Binary "||" performs a short-circuit logical OR operation. That is,
342if the left operand is true, the right operand is not even evaluated.
343Scalar or list context propagates down to the right operand if it
344is evaluated.
345
346The C<||> and C<&&> operators differ from C's in that, rather than returning
3470 or 1, they return the last value evaluated. Thus, a reasonably portable
348way to find out the home directory (assuming it's not "0") might be:
349
350 $home = $ENV{'HOME'} || $ENV{'LOGDIR'} ||
351 (getpwuid($<))[7] || die "You're homeless!\n";
352
353In particular, this means that you shouldn't use this
354for selecting between two aggregates for assignment:
355
356 @a = @b || @c; # this is wrong
357 @a = scalar(@b) || @c; # really meant this
358 @a = @b ? @b : @c; # this works fine, though
359
360As more readable alternatives to C<&&> and C<||> when used for
361control flow, Perl provides C<and> and C<or> operators (see below).
362The short-circuit behavior is identical. The precedence of "and" and
363"or" is much lower, however, so that you can safely use them after a
364list operator without the need for parentheses:
365
366 unlink "alpha", "beta", "gamma"
367 or gripe(), next LINE;
368
369With the C-style operators that would have been written like this:
370
371 unlink("alpha", "beta", "gamma")
372 || (gripe(), next LINE);
373
374Using "or" for assignment is unlikely to do what you want; see below.
375
376=head2 Range Operators
377
378Binary ".." is the range operator, which is really two different
379operators depending on the context. In list context, it returns an
380array of values counting (up by ones) from the left value to the right
381value. If the left value is greater than the right value then it
382returns the empty array. The range operator is useful for writing
383C<foreach (1..10)> loops and for doing slice operations on arrays. In
384the current implementation, no temporary array is created when the
385range operator is used as the expression in C<foreach> loops, but older
386versions of Perl might burn a lot of memory when you write something
387like this:
388
389 for (1 .. 1_000_000) {
390 # code
391 }
392
393In scalar context, ".." returns a boolean value. The operator is
394bistable, like a flip-flop, and emulates the line-range (comma) operator
395of B<sed>, B<awk>, and various editors. Each ".." operator maintains its
396own boolean state. It is false as long as its left operand is false.
397Once the left operand is true, the range operator stays true until the
398right operand is true, I<AFTER> which the range operator becomes false
399again. It doesn't become false till the next time the range operator is
400evaluated. It can test the right operand and become false on the same
401evaluation it became true (as in B<awk>), but it still returns true once.
402If you don't want it to test the right operand till the next
403evaluation, as in B<sed>, just use three dots ("...") instead of
404two. In all other regards, "..." behaves just like ".." does.
405
406The right operand is not evaluated while the operator is in the
407"false" state, and the left operand is not evaluated while the
408operator is in the "true" state. The precedence is a little lower
409than || and &&. The value returned is either the empty string for
410false, or a sequence number (beginning with 1) for true. The
411sequence number is reset for each range encountered. The final
412sequence number in a range has the string "E0" appended to it, which
413doesn't affect its numeric value, but gives you something to search
414for if you want to exclude the endpoint. You can exclude the
415beginning point by waiting for the sequence number to be greater
416than 1. If either operand of scalar ".." is a constant expression,
417that operand is implicitly compared to the C<$.> variable, the
418current line number. Examples:
419
420As a scalar operator:
421
422 if (101 .. 200) { print; } # print 2nd hundred lines
423 next line if (1 .. /^$/); # skip header lines
424 s/^/> / if (/^$/ .. eof()); # quote body
425
426 # parse mail messages
427 while (<>) {
428 $in_header = 1 .. /^$/;
429 $in_body = /^$/ .. eof();
430 # do something based on those
431 } continue {
432 close ARGV if eof; # reset $. each file
433 }
434
435As a list operator:
436
437 for (101 .. 200) { print; } # print $_ 100 times
438 @foo = @foo[0 .. $#foo]; # an expensive no-op
439 @foo = @foo[$#foo-4 .. $#foo]; # slice last 5 items
440
441The range operator (in list context) makes use of the magical
442auto-increment algorithm if the operands are strings. You
443can say
444
445 @alphabet = ('A' .. 'Z');
446
447to get all normal letters of the alphabet, or
448
449 $hexdigit = (0 .. 9, 'a' .. 'f')[$num & 15];
450
451to get a hexadecimal digit, or
452
453 @z2 = ('01' .. '31'); print $z2[$mday];
454
455to get dates with leading zeros. If the final value specified is not
456in the sequence that the magical increment would produce, the sequence
457goes until the next value would be longer than the final value
458specified.
459
460=head2 Conditional Operator
461
462Ternary "?:" is the conditional operator, just as in C. It works much
463like an if-then-else. If the argument before the ? is true, the
464argument before the : is returned, otherwise the argument after the :
465is returned. For example:
466
467 printf "I have %d dog%s.\n", $n,
468 ($n == 1) ? '' : "s";
469
470Scalar or list context propagates downward into the 2nd
471or 3rd argument, whichever is selected.
472
473 $a = $ok ? $b : $c; # get a scalar
474 @a = $ok ? @b : @c; # get an array
475 $a = $ok ? @b : @c; # oops, that's just a count!
476
477The operator may be assigned to if both the 2nd and 3rd arguments are
478legal lvalues (meaning that you can assign to them):
479
480 ($a_or_b ? $a : $b) = $c;
481
482Because this operator produces an assignable result, using assignments
483without parentheses will get you in trouble. For example, this:
484
485 $a % 2 ? $a += 10 : $a += 2
486
487Really means this:
488
489 (($a % 2) ? ($a += 10) : $a) += 2
490
491Rather than this:
492
493 ($a % 2) ? ($a += 10) : ($a += 2)
494
495That should probably be written more simply as:
496
497 $a += ($a % 2) ? 10 : 2;
498
499=head2 Assignment Operators
500
501"=" is the ordinary assignment operator.
502
503Assignment operators work as in C. That is,
504
505 $a += 2;
506
507is equivalent to
508
509 $a = $a + 2;
510
511although without duplicating any side effects that dereferencing the lvalue
512might trigger, such as from tie(). Other assignment operators work similarly.
513The following are recognized:
514
515 **= += *= &= <<= &&=
516 -= /= |= >>= ||=
517 .= %= ^=
518 x=
519
520Although these are grouped by family, they all have the precedence
521of assignment.
522
523Unlike in C, the scalar assignment operator produces a valid lvalue.
524Modifying an assignment is equivalent to doing the assignment and
525then modifying the variable that was assigned to. This is useful
526for modifying a copy of something, like this:
527
528 ($tmp = $global) =~ tr [A-Z] [a-z];
529
530Likewise,
531
532 ($a += 2) *= 3;
533
534is equivalent to
535
536 $a += 2;
537 $a *= 3;
538
539Similarly, a list assignment in list context produces the list of
540lvalues assigned to, and a list assignment in scalar context returns
541the number of elements produced by the expression on the right hand
542side of the assignment.
543
544=head2 Comma Operator
545
546Binary "," is the comma operator. In scalar context it evaluates
547its left argument, throws that value away, then evaluates its right
548argument and returns that value. This is just like C's comma operator.
549
550In list context, it's just the list argument separator, and inserts
551both its arguments into the list.
552
553The => digraph is mostly just a synonym for the comma operator. It's useful for
554documenting arguments that come in pairs. As of release 5.001, it also forces
555any word to the left of it to be interpreted as a string.
556
557=head2 List Operators (Rightward)
558
559On the right side of a list operator, it has very low precedence,
560such that it controls all comma-separated expressions found there.
561The only operators with lower precedence are the logical operators
562"and", "or", and "not", which may be used to evaluate calls to list
563operators without the need for extra parentheses:
564
565 open HANDLE, "filename"
566 or die "Can't open: $!\n";
567
568See also discussion of list operators in L<Terms and List Operators (Leftward)>.
569
570=head2 Logical Not
571
572Unary "not" returns the logical negation of the expression to its right.
573It's the equivalent of "!" except for the very low precedence.
574
575=head2 Logical And
576
577Binary "and" returns the logical conjunction of the two surrounding
578expressions. It's equivalent to && except for the very low
579precedence. This means that it short-circuits: i.e., the right
580expression is evaluated only if the left expression is true.
581
582=head2 Logical or and Exclusive Or
583
584Binary "or" returns the logical disjunction of the two surrounding
585expressions. It's equivalent to || except for the very low precedence.
586This makes it useful for control flow
587
588 print FH $data or die "Can't write to FH: $!";
589
590This means that it short-circuits: i.e., the right expression is evaluated
591only if the left expression is false. Due to its precedence, you should
592probably avoid using this for assignment, only for control flow.
593
594 $a = $b or $c; # bug: this is wrong
595 ($a = $b) or $c; # really means this
596 $a = $b || $c; # better written this way
597
598However, when it's a list-context assignment and you're trying to use
599"||" for control flow, you probably need "or" so that the assignment
600takes higher precedence.
601
602 @info = stat($file) || die; # oops, scalar sense of stat!
603 @info = stat($file) or die; # better, now @info gets its due
604
605Then again, you could always use parentheses.
606
607Binary "xor" returns the exclusive-OR of the two surrounding expressions.
608It cannot short circuit, of course.
609
610=head2 C Operators Missing From Perl
611
612Here is what C has that Perl doesn't:
613
614=over 8
615
616=item unary &
617
618Address-of operator. (But see the "\" operator for taking a reference.)
619
620=item unary *
621
622Dereference-address operator. (Perl's prefix dereferencing
623operators are typed: $, @, %, and &.)
624
625=item (TYPE)
626
627Type-casting operator.
628
629=back
630
631=head2 Quote and Quote-like Operators
632
633While we usually think of quotes as literal values, in Perl they
634function as operators, providing various kinds of interpolating and
635pattern matching capabilities. Perl provides customary quote characters
636for these behaviors, but also provides a way for you to choose your
637quote character for any of them. In the following table, a C<{}> represents
638any pair of delimiters you choose.
639
640 Customary Generic Meaning Interpolates
641 '' q{} Literal no
642 "" qq{} Literal yes
643 `` qx{} Command yes (unless '' is delimiter)
644 qw{} Word list no
645 // m{} Pattern match yes (unless '' is delimiter)
646 qr{} Pattern yes (unless '' is delimiter)
647 s{}{} Substitution yes (unless '' is delimiter)
648 tr{}{} Transliteration no (but see below)
649
650Non-bracketing delimiters use the same character fore and aft, but the four
651sorts of brackets (round, angle, square, curly) will all nest, which means
652that
653
654 q{foo{bar}baz}
655
656is the same as
657
658 'foo{bar}baz'
659
660Note, however, that this does not always work for quoting Perl code:
661
662 $s = q{ if($a eq "}") ... }; # WRONG
663
664is a syntax error. The C<Text::Balanced> module on CPAN is able to do this
665properly.
666
667There can be whitespace between the operator and the quoting
668characters, except when C<#> is being used as the quoting character.
669C<q#foo#> is parsed as the string C<foo>, while C<q #foo#> is the
670operator C<q> followed by a comment. Its argument will be taken
671from the next line. This allows you to write:
672
673 s {foo} # Replace foo
674 {bar} # with bar.
675
676For constructs that do interpolate, variables beginning with "C<$>"
677or "C<@>" are interpolated, as are the following escape sequences. Within
678a transliteration, the first eleven of these sequences may be used.
679
680 \t tab (HT, TAB)
681 \n newline (NL)
682 \r return (CR)
683 \f form feed (FF)
684 \b backspace (BS)
685 \a alarm (bell) (BEL)
686 \e escape (ESC)
687 \033 octal char (ESC)
688 \x1b hex char (ESC)
689 \x{263a} wide hex char (SMILEY)
690 \c[ control char (ESC)
691 \N{name} named char
692
693 \l lowercase next char
694 \u uppercase next char
695 \L lowercase till \E
696 \U uppercase till \E
697 \E end case modification
698 \Q quote non-word characters till \E
699
700If C<use locale> is in effect, the case map used by C<\l>, C<\L>, C<\u>
701and C<\U> is taken from the current locale. See L<perllocale>. For
702documentation of C<\N{name}>, see L<charnames>.
703
704All systems use the virtual C<"\n"> to represent a line terminator,
705called a "newline". There is no such thing as an unvarying, physical
706newline character. It is only an illusion that the operating system,
707device drivers, C libraries, and Perl all conspire to preserve. Not all
708systems read C<"\r"> as ASCII CR and C<"\n"> as ASCII LF. For example,
709on a Mac, these are reversed, and on systems without line terminator,
710printing C<"\n"> may emit no actual data. In general, use C<"\n"> when
711you mean a "newline" for your system, but use the literal ASCII when you
712need an exact character. For example, most networking protocols expect
713and prefer a CR+LF (C<"\015\012"> or C<"\cM\cJ">) for line terminators,
714and although they often accept just C<"\012">, they seldom tolerate just
715C<"\015">. If you get in the habit of using C<"\n"> for networking,
716you may be burned some day.
717
718You cannot include a literal C<$> or C<@> within a C<\Q> sequence.
719An unescaped C<$> or C<@> interpolates the corresponding variable,
720while escaping will cause the literal string C<\$> to be inserted.
721You'll need to write something like C<m/\Quser\E\@\Qhost/>.
722
723Patterns are subject to an additional level of interpretation as a
724regular expression. This is done as a second pass, after variables are
725interpolated, so that regular expressions may be incorporated into the
726pattern from the variables. If this is not what you want, use C<\Q> to
727interpolate a variable literally.
728
729Apart from the behavior described above, Perl does not expand
730multiple levels of interpolation. In particular, contrary to the
731expectations of shell programmers, back-quotes do I<NOT> interpolate
732within double quotes, nor do single quotes impede evaluation of
733variables when used within double quotes.
734
735=head2 Regexp Quote-Like Operators
736
737Here are the quote-like operators that apply to pattern
738matching and related activities.
739
740=over 8
741
742=item ?PATTERN?
743
744This is just like the C</pattern/> search, except that it matches only
745once between calls to the reset() operator. This is a useful
746optimization when you want to see only the first occurrence of
747something in each file of a set of files, for instance. Only C<??>
748patterns local to the current package are reset.
749
750 while (<>) {
751 if (?^$?) {
752 # blank line between header and body
753 }
754 } continue {
755 reset if eof; # clear ?? status for next file
756 }
757
758This usage is vaguely depreciated, which means it just might possibly
759be removed in some distant future version of Perl, perhaps somewhere
760around the year 2168.
761
762=item m/PATTERN/cgimosx
763
764=item /PATTERN/cgimosx
765
766Searches a string for a pattern match, and in scalar context returns
767true if it succeeds, false if it fails. If no string is specified
768via the C<=~> or C<!~> operator, the $_ string is searched. (The
769string specified with C<=~> need not be an lvalue--it may be the
770result of an expression evaluation, but remember the C<=~> binds
771rather tightly.) See also L<perlre>. See L<perllocale> for
772discussion of additional considerations that apply when C<use locale>
773is in effect.
774
775Options are:
776
777 c Do not reset search position on a failed match when /g is in effect.
778 g Match globally, i.e., find all occurrences.
779 i Do case-insensitive pattern matching.
780 m Treat string as multiple lines.
781 o Compile pattern only once.
782 s Treat string as single line.
783 x Use extended regular expressions.
784
785If "/" is the delimiter then the initial C<m> is optional. With the C<m>
786you can use any pair of non-alphanumeric, non-whitespace characters
787as delimiters. This is particularly useful for matching path names
788that contain "/", to avoid LTS (leaning toothpick syndrome). If "?" is
789the delimiter, then the match-only-once rule of C<?PATTERN?> applies.
790If "'" is the delimiter, no interpolation is performed on the PATTERN.
791
792PATTERN may contain variables, which will be interpolated (and the
793pattern recompiled) every time the pattern search is evaluated, except
794for when the delimiter is a single quote. (Note that C<$(>, C<$)>, and
795C<$|> are not interpolated because they look like end-of-string tests.)
796If you want such a pattern to be compiled only once, add a C</o> after
797the trailing delimiter. This avoids expensive run-time recompilations,
798and is useful when the value you are interpolating won't change over
799the life of the script. However, mentioning C</o> constitutes a promise
800that you won't change the variables in the pattern. If you change them,
801Perl won't even notice. See also L<"qr/STRING/imosx">.
802
803If the PATTERN evaluates to the empty string, the last
804I<successfully> matched regular expression is used instead.
805
806If the C</g> option is not used, C<m//> in list context returns a
807list consisting of the subexpressions matched by the parentheses in the
808pattern, i.e., (C<$1>, C<$2>, C<$3>...). (Note that here C<$1> etc. are
809also set, and that this differs from Perl 4's behavior.) When there are
810no parentheses in the pattern, the return value is the list C<(1)> for
811success. With or without parentheses, an empty list is returned upon
812failure.
813
814Examples:
815
816 open(TTY, '/dev/tty');
817 <TTY> =~ /^y/i && foo(); # do foo if desired
818
819 if (/Version: *([0-9.]*)/) { $version = $1; }
820
821 next if m#^/usr/spool/uucp#;
822
823 # poor man's grep
824 $arg = shift;
825 while (<>) {
826 print if /$arg/o; # compile only once
827 }
828
829 if (($F1, $F2, $Etc) = ($foo =~ /^(\S+)\s+(\S+)\s*(.*)/))
830
831This last example splits $foo into the first two words and the
832remainder of the line, and assigns those three fields to $F1, $F2, and
833$Etc. The conditional is true if any variables were assigned, i.e., if
834the pattern matched.
835
836The C</g> modifier specifies global pattern matching--that is,
837matching as many times as possible within the string. How it behaves
838depends on the context. In list context, it returns a list of the
839substrings matched by any capturing parentheses in the regular
840expression. If there are no parentheses, it returns a list of all
841the matched strings, as if there were parentheses around the whole
842pattern.
843
844In scalar context, each execution of C<m//g> finds the next match,
845returning true if it matches, and false if there is no further match.
846The position after the last match can be read or set using the pos()
847function; see L<perlfunc/pos>. A failed match normally resets the
848search position to the beginning of the string, but you can avoid that
849by adding the C</c> modifier (e.g. C<m//gc>). Modifying the target
850string also resets the search position.
851
852You can intermix C<m//g> matches with C<m/\G.../g>, where C<\G> is a
853zero-width assertion that matches the exact position where the previous
854C<m//g>, if any, left off. Without the C</g> modifier, the C<\G> assertion
855still anchors at pos(), but the match is of course only attempted once.
856Using C<\G> without C</g> on a target string that has not previously had a
857C</g> match applied to it is the same as using the C<\A> assertion to match
858the beginning of the string.
859
860Examples:
861
862 # list context
863 ($one,$five,$fifteen) = (`uptime` =~ /(\d+\.\d+)/g);
864
865 # scalar context
866 $/ = "";
867 while (defined($paragraph = <>)) {
868 while ($paragraph =~ /[a-z]['")]*[.!?]+['")]*\s/g) {
869 $sentences++;
870 }
871 }
872 print "$sentences\n";
873
874 # using m//gc with \G
875 $_ = "ppooqppqq";
876 while ($i++ < 2) {
877 print "1: '";
878 print $1 while /(o)/gc; print "', pos=", pos, "\n";
879 print "2: '";
880 print $1 if /\G(q)/gc; print "', pos=", pos, "\n";
881 print "3: '";
882 print $1 while /(p)/gc; print "', pos=", pos, "\n";
883 }
884 print "Final: '$1', pos=",pos,"\n" if /\G(.)/;
885
886The last example should print:
887
888 1: 'oo', pos=4
889 2: 'q', pos=5
890 3: 'pp', pos=7
891 1: '', pos=7
892 2: 'q', pos=8
893 3: '', pos=8
894 Final: 'q', pos=8
895
896Notice that the final match matched C<q> instead of C<p>, which a match
897without the C<\G> anchor would have done. Also note that the final match
898did not update C<pos> -- C<pos> is only updated on a C</g> match. If the
899final match did indeed match C<p>, it's a good bet that you're running an
900older (pre-5.6.0) Perl.
901
902A useful idiom for C<lex>-like scanners is C</\G.../gc>. You can
903combine several regexps like this to process a string part-by-part,
904doing different actions depending on which regexp matched. Each
905regexp tries to match where the previous one leaves off.
906
907 $_ = <<'EOL';
908 $url = new URI::URL "http://www/"; die if $url eq "xXx";
909 EOL
910 LOOP:
911 {
912 print(" digits"), redo LOOP if /\G\d+\b[,.;]?\s*/gc;
913 print(" lowercase"), redo LOOP if /\G[a-z]+\b[,.;]?\s*/gc;
914 print(" UPPERCASE"), redo LOOP if /\G[A-Z]+\b[,.;]?\s*/gc;
915 print(" Capitalized"), redo LOOP if /\G[A-Z][a-z]+\b[,.;]?\s*/gc;
916 print(" MiXeD"), redo LOOP if /\G[A-Za-z]+\b[,.;]?\s*/gc;
917 print(" alphanumeric"), redo LOOP if /\G[A-Za-z0-9]+\b[,.;]?\s*/gc;
918 print(" line-noise"), redo LOOP if /\G[^A-Za-z0-9]+/gc;
919 print ". That's all!\n";
920 }
921
922Here is the output (split into several lines):
923
924 line-noise lowercase line-noise lowercase UPPERCASE line-noise
925 UPPERCASE line-noise lowercase line-noise lowercase line-noise
926 lowercase lowercase line-noise lowercase lowercase line-noise
927 MiXeD line-noise. That's all!
928
929=item q/STRING/
930
931=item C<'STRING'>
932
933A single-quoted, literal string. A backslash represents a backslash
934unless followed by the delimiter or another backslash, in which case
935the delimiter or backslash is interpolated.
936
937 $foo = q!I said, "You said, 'She said it.'"!;
938 $bar = q('This is it.');
939 $baz = '\n'; # a two-character string
940
941=item qq/STRING/
942
943=item "STRING"
944
945A double-quoted, interpolated string.
946
947 $_ .= qq
948 (*** The previous line contains the naughty word "$1".\n)
949 if /\b(tcl|java|python)\b/i; # :-)
950 $baz = "\n"; # a one-character string
951
952=item qr/STRING/imosx
953
954This operator quotes (and possibly compiles) its I<STRING> as a regular
955expression. I<STRING> is interpolated the same way as I<PATTERN>
956in C<m/PATTERN/>. If "'" is used as the delimiter, no interpolation
957is done. Returns a Perl value which may be used instead of the
958corresponding C</STRING/imosx> expression.
959
960For example,
961
962 $rex = qr/my.STRING/is;
963 s/$rex/foo/;
964
965is equivalent to
966
967 s/my.STRING/foo/is;
968
969The result may be used as a subpattern in a match:
970
971 $re = qr/$pattern/;
972 $string =~ /foo${re}bar/; # can be interpolated in other patterns
973 $string =~ $re; # or used standalone
974 $string =~ /$re/; # or this way
975
976Since Perl may compile the pattern at the moment of execution of qr()
977operator, using qr() may have speed advantages in some situations,
978notably if the result of qr() is used standalone:
979
980 sub match {
981 my $patterns = shift;
982 my @compiled = map qr/$_/i, @$patterns;
983 grep {
984 my $success = 0;
985 foreach my $pat (@compiled) {
986 $success = 1, last if /$pat/;
987 }
988 $success;
989 } @_;
990 }
991
992Precompilation of the pattern into an internal representation at
993the moment of qr() avoids a need to recompile the pattern every
994time a match C</$pat/> is attempted. (Perl has many other internal
995optimizations, but none would be triggered in the above example if
996we did not use qr() operator.)
997
998Options are:
999
1000 i Do case-insensitive pattern matching.
1001 m Treat string as multiple lines.
1002 o Compile pattern only once.
1003 s Treat string as single line.
1004 x Use extended regular expressions.
1005
1006See L<perlre> for additional information on valid syntax for STRING, and
1007for a detailed look at the semantics of regular expressions.
1008
1009=item qx/STRING/
1010
1011=item `STRING`
1012
1013A string which is (possibly) interpolated and then executed as a
1014system command with C</bin/sh> or its equivalent. Shell wildcards,
1015pipes, and redirections will be honored. The collected standard
1016output of the command is returned; standard error is unaffected. In
1017scalar context, it comes back as a single (potentially multi-line)
1018string, or undef if the command failed. In list context, returns a
1019list of lines (however you've defined lines with $/ or
1020$INPUT_RECORD_SEPARATOR), or an empty list if the command failed.
1021
1022Because backticks do not affect standard error, use shell file descriptor
1023syntax (assuming the shell supports this) if you care to address this.
1024To capture a command's STDERR and STDOUT together:
1025
1026 $output = `cmd 2>&1`;
1027
1028To capture a command's STDOUT but discard its STDERR:
1029
1030 $output = `cmd 2>/dev/null`;
1031
1032To capture a command's STDERR but discard its STDOUT (ordering is
1033important here):
1034
1035 $output = `cmd 2>&1 1>/dev/null`;
1036
1037To exchange a command's STDOUT and STDERR in order to capture the STDERR
1038but leave its STDOUT to come out the old STDERR:
1039
1040 $output = `cmd 3>&1 1>&2 2>&3 3>&-`;
1041
1042To read both a command's STDOUT and its STDERR separately, it's easiest
1043and safest to redirect them separately to files, and then read from those
1044files when the program is done:
1045
1046 system("program args 1>/tmp/program.stdout 2>/tmp/program.stderr");
1047
1048Using single-quote as a delimiter protects the command from Perl's
1049double-quote interpolation, passing it on to the shell instead:
1050
1051 $perl_info = qx(ps $$); # that's Perl's $$
1052 $shell_info = qx'ps $$'; # that's the new shell's $$
1053
1054How that string gets evaluated is entirely subject to the command
1055interpreter on your system. On most platforms, you will have to protect
1056shell metacharacters if you want them treated literally. This is in
1057practice difficult to do, as it's unclear how to escape which characters.
1058See L<perlsec> for a clean and safe example of a manual fork() and exec()
1059to emulate backticks safely.
1060
1061On some platforms (notably DOS-like ones), the shell may not be
1062capable of dealing with multiline commands, so putting newlines in
1063the string may not get you what you want. You may be able to evaluate
1064multiple commands in a single line by separating them with the command
1065separator character, if your shell supports that (e.g. C<;> on many Unix
1066shells; C<&> on the Windows NT C<cmd> shell).
1067
1068Beginning with v5.6.0, Perl will attempt to flush all files opened for
1069output before starting the child process, but this may not be supported
1070on some platforms (see L<perlport>). To be safe, you may need to set
1071C<$|> ($AUTOFLUSH in English) or call the C<autoflush()> method of
1072C<IO::Handle> on any open handles.
1073
1074Beware that some command shells may place restrictions on the length
1075of the command line. You must ensure your strings don't exceed this
1076limit after any necessary interpolations. See the platform-specific
1077release notes for more details about your particular environment.
1078
1079Using this operator can lead to programs that are difficult to port,
1080because the shell commands called vary between systems, and may in
1081fact not be present at all. As one example, the C<type> command under
1082the POSIX shell is very different from the C<type> command under DOS.
1083That doesn't mean you should go out of your way to avoid backticks
1084when they're the right way to get something done. Perl was made to be
1085a glue language, and one of the things it glues together is commands.
1086Just understand what you're getting yourself into.
1087
1088See L<"I/O Operators"> for more discussion.
1089
1090=item qw/STRING/
1091
1092Evaluates to a list of the words extracted out of STRING, using embedded
1093whitespace as the word delimiters. It can be understood as being roughly
1094equivalent to:
1095
1096 split(' ', q/STRING/);
1097
1098the difference being that it generates a real list at compile time. So
1099this expression:
1100
1101 qw(foo bar baz)
1102
1103is semantically equivalent to the list:
1104
1105 'foo', 'bar', 'baz'
1106
1107Some frequently seen examples:
1108
1109 use POSIX qw( setlocale localeconv )
1110 @EXPORT = qw( foo bar baz );
1111
1112A common mistake is to try to separate the words with comma or to
1113put comments into a multi-line C<qw>-string. For this reason, the
1114C<use warnings> pragma and the B<-w> switch (that is, the C<$^W> variable)
1115produces warnings if the STRING contains the "," or the "#" character.
1116
1117=item s/PATTERN/REPLACEMENT/egimosx
1118
1119Searches a string for a pattern, and if found, replaces that pattern
1120with the replacement text and returns the number of substitutions
1121made. Otherwise it returns false (specifically, the empty string).
1122
1123If no string is specified via the C<=~> or C<!~> operator, the C<$_>
1124variable is searched and modified. (The string specified with C<=~> must
1125be scalar variable, an array element, a hash element, or an assignment
1126to one of those, i.e., an lvalue.)
1127
1128If the delimiter chosen is a single quote, no interpolation is
1129done on either the PATTERN or the REPLACEMENT. Otherwise, if the
1130PATTERN contains a $ that looks like a variable rather than an
1131end-of-string test, the variable will be interpolated into the pattern
1132at run-time. If you want the pattern compiled only once the first time
1133the variable is interpolated, use the C</o> option. If the pattern
1134evaluates to the empty string, the last successfully executed regular
1135expression is used instead. See L<perlre> for further explanation on these.
1136See L<perllocale> for discussion of additional considerations that apply
1137when C<use locale> is in effect.
1138
1139Options are:
1140
1141 e Evaluate the right side as an expression.
1142 g Replace globally, i.e., all occurrences.
1143 i Do case-insensitive pattern matching.
1144 m Treat string as multiple lines.
1145 o Compile pattern only once.
1146 s Treat string as single line.
1147 x Use extended regular expressions.
1148
1149Any non-alphanumeric, non-whitespace delimiter may replace the
1150slashes. If single quotes are used, no interpretation is done on the
1151replacement string (the C</e> modifier overrides this, however). Unlike
1152Perl 4, Perl 5 treats backticks as normal delimiters; the replacement
1153text is not evaluated as a command. If the
1154PATTERN is delimited by bracketing quotes, the REPLACEMENT has its own
1155pair of quotes, which may or may not be bracketing quotes, e.g.,
1156C<s(foo)(bar)> or C<< s<foo>/bar/ >>. A C</e> will cause the
1157replacement portion to be treated as a full-fledged Perl expression
1158and evaluated right then and there. It is, however, syntax checked at
1159compile-time. A second C<e> modifier will cause the replacement portion
1160to be C<eval>ed before being run as a Perl expression.
1161
1162Examples:
1163
1164 s/\bgreen\b/mauve/g; # don't change wintergreen
1165
1166 $path =~ s|/usr/bin|/usr/local/bin|;
1167
1168 s/Login: $foo/Login: $bar/; # run-time pattern
1169
1170 ($foo = $bar) =~ s/this/that/; # copy first, then change
1171
1172 $count = ($paragraph =~ s/Mister\b/Mr./g); # get change-count
1173
1174 $_ = 'abc123xyz';
1175 s/\d+/$&*2/e; # yields 'abc246xyz'
1176 s/\d+/sprintf("%5d",$&)/e; # yields 'abc 246xyz'
1177 s/\w/$& x 2/eg; # yields 'aabbcc 224466xxyyzz'
1178
1179 s/%(.)/$percent{$1}/g; # change percent escapes; no /e
1180 s/%(.)/$percent{$1} || $&/ge; # expr now, so /e
1181 s/^=(\w+)/&pod($1)/ge; # use function call
1182
1183 # expand variables in $_, but dynamics only, using
1184 # symbolic dereferencing
1185 s/\$(\w+)/${$1}/g;
1186
1187 # Add one to the value of any numbers in the string
1188 s/(\d+)/1 + $1/eg;
1189
1190 # This will expand any embedded scalar variable
1191 # (including lexicals) in $_ : First $1 is interpolated
1192 # to the variable name, and then evaluated
1193 s/(\$\w+)/$1/eeg;
1194
1195 # Delete (most) C comments.
1196 $program =~ s {
1197 /\* # Match the opening delimiter.
1198 .*? # Match a minimal number of characters.
1199 \*/ # Match the closing delimiter.
1200 } []gsx;
1201
1202 s/^\s*(.*?)\s*$/$1/; # trim white space in $_, expensively
1203
1204 for ($variable) { # trim white space in $variable, cheap
1205 s/^\s+//;
1206 s/\s+$//;
1207 }
1208
1209 s/([^ ]*) *([^ ]*)/$2 $1/; # reverse 1st two fields
1210
1211Note the use of $ instead of \ in the last example. Unlike
1212B<sed>, we use the \<I<digit>> form in only the left hand side.
1213Anywhere else it's $<I<digit>>.
1214
1215Occasionally, you can't use just a C</g> to get all the changes
1216to occur that you might want. Here are two common cases:
1217
1218 # put commas in the right places in an integer
1219 1 while s/(\d)(\d\d\d)(?!\d)/$1,$2/g;
1220
1221 # expand tabs to 8-column spacing
1222 1 while s/\t+/' ' x (length($&)*8 - length($`)%8)/e;
1223
1224=item tr/SEARCHLIST/REPLACEMENTLIST/cds
1225
1226=item y/SEARCHLIST/REPLACEMENTLIST/cds
1227
1228Transliterates all occurrences of the characters found in the search list
1229with the corresponding character in the replacement list. It returns
1230the number of characters replaced or deleted. If no string is
1231specified via the =~ or !~ operator, the $_ string is transliterated. (The
1232string specified with =~ must be a scalar variable, an array element, a
1233hash element, or an assignment to one of those, i.e., an lvalue.)
1234
1235A character range may be specified with a hyphen, so C<tr/A-J/0-9/>
1236does the same replacement as C<tr/ACEGIBDFHJ/0246813579/>.
1237For B<sed> devotees, C<y> is provided as a synonym for C<tr>. If the
1238SEARCHLIST is delimited by bracketing quotes, the REPLACEMENTLIST has
1239its own pair of quotes, which may or may not be bracketing quotes,
1240e.g., C<tr[A-Z][a-z]> or C<tr(+\-*/)/ABCD/>.
1241
1242Note that C<tr> does B<not> do regular expression character classes
1243such as C<\d> or C<[:lower:]>. The <tr> operator is not equivalent to
1244the tr(1) utility. If you want to map strings between lower/upper
1245cases, see L<perlfunc/lc> and L<perlfunc/uc>, and in general consider
1246using the C<s> operator if you need regular expressions.
1247
1248Note also that the whole range idea is rather unportable between
1249character sets--and even within character sets they may cause results
1250you probably didn't expect. A sound principle is to use only ranges
1251that begin from and end at either alphabets of equal case (a-e, A-E),
1252or digits (0-4). Anything else is unsafe. If in doubt, spell out the
1253character sets in full.
1254
1255Options:
1256
1257 c Complement the SEARCHLIST.
1258 d Delete found but unreplaced characters.
1259 s Squash duplicate replaced characters.
1260
1261If the C</c> modifier is specified, the SEARCHLIST character set
1262is complemented. If the C</d> modifier is specified, any characters
1263specified by SEARCHLIST not found in REPLACEMENTLIST are deleted.
1264(Note that this is slightly more flexible than the behavior of some
1265B<tr> programs, which delete anything they find in the SEARCHLIST,
1266period.) If the C</s> modifier is specified, sequences of characters
1267that were transliterated to the same character are squashed down
1268to a single instance of the character.
1269
1270If the C</d> modifier is used, the REPLACEMENTLIST is always interpreted
1271exactly as specified. Otherwise, if the REPLACEMENTLIST is shorter
1272than the SEARCHLIST, the final character is replicated till it is long
1273enough. If the REPLACEMENTLIST is empty, the SEARCHLIST is replicated.
1274This latter is useful for counting characters in a class or for
1275squashing character sequences in a class.
1276
1277Examples:
1278
1279 $ARGV[1] =~ tr/A-Z/a-z/; # canonicalize to lower case
1280
1281 $cnt = tr/*/*/; # count the stars in $_
1282
1283 $cnt = $sky =~ tr/*/*/; # count the stars in $sky
1284
1285 $cnt = tr/0-9//; # count the digits in $_
1286
1287 tr/a-zA-Z//s; # bookkeeper -> bokeper
1288
1289 ($HOST = $host) =~ tr/a-z/A-Z/;
1290
1291 tr/a-zA-Z/ /cs; # change non-alphas to single space
1292
1293 tr [\200-\377]
1294 [\000-\177]; # delete 8th bit
1295
1296If multiple transliterations are given for a character, only the
1297first one is used:
1298
1299 tr/AAA/XYZ/
1300
1301will transliterate any A to X.
1302
1303Because the transliteration table is built at compile time, neither
1304the SEARCHLIST nor the REPLACEMENTLIST are subjected to double quote
1305interpolation. That means that if you want to use variables, you
1306must use an eval():
1307
1308 eval "tr/$oldlist/$newlist/";
1309 die $@ if $@;
1310
1311 eval "tr/$oldlist/$newlist/, 1" or die $@;
1312
1313=back
1314
1315=head2 Gory details of parsing quoted constructs
1316
1317When presented with something that might have several different
1318interpretations, Perl uses the B<DWIM> (that's "Do What I Mean")
1319principle to pick the most probable interpretation. This strategy
1320is so successful that Perl programmers often do not suspect the
1321ambivalence of what they write. But from time to time, Perl's
1322notions differ substantially from what the author honestly meant.
1323
1324This section hopes to clarify how Perl handles quoted constructs.
1325Although the most common reason to learn this is to unravel labyrinthine
1326regular expressions, because the initial steps of parsing are the
1327same for all quoting operators, they are all discussed together.
1328
1329The most important Perl parsing rule is the first one discussed
1330below: when processing a quoted construct, Perl first finds the end
1331of that construct, then interprets its contents. If you understand
1332this rule, you may skip the rest of this section on the first
1333reading. The other rules are likely to contradict the user's
1334expectations much less frequently than this first one.
1335
1336Some passes discussed below are performed concurrently, but because
1337their results are the same, we consider them individually. For different
1338quoting constructs, Perl performs different numbers of passes, from
1339one to five, but these passes are always performed in the same order.
1340
1341=over 4
1342
1343=item Finding the end
1344
1345The first pass is finding the end of the quoted construct, whether
1346it be a multicharacter delimiter C<"\nEOF\n"> in the C<<<EOF>
1347construct, a C</> that terminates a C<qq//> construct, a C<]> which
1348terminates C<qq[]> construct, or a C<< > >> which terminates a
1349fileglob started with C<< < >>.
1350
1351When searching for single-character non-pairing delimiters, such
1352as C</>, combinations of C<\\> and C<\/> are skipped. However,
1353when searching for single-character pairing delimiter like C<[>,
1354combinations of C<\\>, C<\]>, and C<\[> are all skipped, and nested
1355C<[>, C<]> are skipped as well. When searching for multicharacter
1356delimiters, nothing is skipped.
1357
1358For constructs with three-part delimiters (C<s///>, C<y///>, and
1359C<tr///>), the search is repeated once more.
1360
1361During this search no attention is paid to the semantics of the construct.
1362Thus:
1363
1364 "$hash{"$foo/$bar"}"
1365
1366or:
1367
1368 m/
1369 bar # NOT a comment, this slash / terminated m//!
1370 /x
1371
1372do not form legal quoted expressions. The quoted part ends on the
1373first C<"> and C</>, and the rest happens to be a syntax error.
1374Because the slash that terminated C<m//> was followed by a C<SPACE>,
1375the example above is not C<m//x>, but rather C<m//> with no C</x>
1376modifier. So the embedded C<#> is interpreted as a literal C<#>.
1377
1378=item Removal of backslashes before delimiters
1379
1380During the second pass, text between the starting and ending
1381delimiters is copied to a safe location, and the C<\> is removed
1382from combinations consisting of C<\> and delimiter--or delimiters,
1383meaning both starting and ending delimiters will should these differ.
1384This removal does not happen for multi-character delimiters.
1385Note that the combination C<\\> is left intact, just as it was.
1386
1387Starting from this step no information about the delimiters is
1388used in parsing.
1389
1390=item Interpolation
1391
1392The next step is interpolation in the text obtained, which is now
1393delimiter-independent. There are four different cases.
1394
1395=over 4
1396
1397=item C<<<'EOF'>, C<m''>, C<s'''>, C<tr///>, C<y///>
1398
1399No interpolation is performed.
1400
1401=item C<''>, C<q//>
1402
1403The only interpolation is removal of C<\> from pairs C<\\>.
1404
1405=item C<"">, C<``>, C<qq//>, C<qx//>, C<< <file*glob> >>
1406
1407C<\Q>, C<\U>, C<\u>, C<\L>, C<\l> (possibly paired with C<\E>) are
1408converted to corresponding Perl constructs. Thus, C<"$foo\Qbaz$bar">
1409is converted to C<$foo . (quotemeta("baz" . $bar))> internally.
1410The other combinations are replaced with appropriate expansions.
1411
1412Let it be stressed that I<whatever falls between C<\Q> and C<\E>>
1413is interpolated in the usual way. Something like C<"\Q\\E"> has
1414no C<\E> inside. instead, it has C<\Q>, C<\\>, and C<E>, so the
1415result is the same as for C<"\\\\E">. As a general rule, backslashes
1416between C<\Q> and C<\E> may lead to counterintuitive results. So,
1417C<"\Q\t\E"> is converted to C<quotemeta("\t")>, which is the same
1418as C<"\\\t"> (since TAB is not alphanumeric). Note also that:
1419
1420 $str = '\t';
1421 return "\Q$str";
1422
1423may be closer to the conjectural I<intention> of the writer of C<"\Q\t\E">.
1424
1425Interpolated scalars and arrays are converted internally to the C<join> and
1426C<.> catenation operations. Thus, C<"$foo XXX '@arr'"> becomes:
1427
1428 $foo . " XXX '" . (join $", @arr) . "'";
1429
1430All operations above are performed simultaneously, left to right.
1431
1432Because the result of C<"\Q STRING \E"> has all metacharacters
1433quoted, there is no way to insert a literal C<$> or C<@> inside a
1434C<\Q\E> pair. If protected by C<\>, C<$> will be quoted to became
1435C<"\\\$">; if not, it is interpreted as the start of an interpolated
1436scalar.
1437
1438Note also that the interpolation code needs to make a decision on
1439where the interpolated scalar ends. For instance, whether
1440C<< "a $b -> {c}" >> really means:
1441
1442 "a " . $b . " -> {c}";
1443
1444or:
1445
1446 "a " . $b -> {c};
1447
1448Most of the time, the longest possible text that does not include
1449spaces between components and which contains matching braces or
1450brackets. because the outcome may be determined by voting based
1451on heuristic estimators, the result is not strictly predictable.
1452Fortunately, it's usually correct for ambiguous cases.
1453
1454=item C<?RE?>, C</RE/>, C<m/RE/>, C<s/RE/foo/>,
1455
1456Processing of C<\Q>, C<\U>, C<\u>, C<\L>, C<\l>, and interpolation
1457happens (almost) as with C<qq//> constructs, but the substitution
1458of C<\> followed by RE-special chars (including C<\>) is not
1459performed. Moreover, inside C<(?{BLOCK})>, C<(?# comment )>, and
1460a C<#>-comment in a C<//x>-regular expression, no processing is
1461performed whatsoever. This is the first step at which the presence
1462of the C<//x> modifier is relevant.
1463
1464Interpolation has several quirks: C<$|>, C<$(>, and C<$)> are not
1465interpolated, and constructs C<$var[SOMETHING]> are voted (by several
1466different estimators) to be either an array element or C<$var>
1467followed by an RE alternative. This is where the notation
1468C<${arr[$bar]}> comes handy: C</${arr[0-9]}/> is interpreted as
1469array element C<-9>, not as a regular expression from the variable
1470C<$arr> followed by a digit, which would be the interpretation of
1471C</$arr[0-9]/>. Since voting among different estimators may occur,
1472the result is not predictable.
1473
1474It is at this step that C<\1> is begrudgingly converted to C<$1> in
1475the replacement text of C<s///> to correct the incorrigible
1476I<sed> hackers who haven't picked up the saner idiom yet. A warning
1477is emitted if the C<use warnings> pragma or the B<-w> command-line flag
1478(that is, the C<$^W> variable) was set.
1479
1480The lack of processing of C<\\> creates specific restrictions on
1481the post-processed text. If the delimiter is C</>, one cannot get
1482the combination C<\/> into the result of this step. C</> will
1483finish the regular expression, C<\/> will be stripped to C</> on
1484the previous step, and C<\\/> will be left as is. Because C</> is
1485equivalent to C<\/> inside a regular expression, this does not
1486matter unless the delimiter happens to be character special to the
1487RE engine, such as in C<s*foo*bar*>, C<m[foo]>, or C<?foo?>; or an
1488alphanumeric char, as in:
1489
1490 m m ^ a \s* b mmx;
1491
1492In the RE above, which is intentionally obfuscated for illustration, the
1493delimiter is C<m>, the modifier is C<mx>, and after backslash-removal the
1494RE is the same as for C<m/ ^ a s* b /mx>). There's more than one
1495reason you're encouraged to restrict your delimiters to non-alphanumeric,
1496non-whitespace choices.
1497
1498=back
1499
1500This step is the last one for all constructs except regular expressions,
1501which are processed further.
1502
1503=item Interpolation of regular expressions
1504
1505Previous steps were performed during the compilation of Perl code,
1506but this one happens at run time--although it may be optimized to
1507be calculated at compile time if appropriate. After preprocessing
1508described above, and possibly after evaluation if catenation,
1509joining, casing translation, or metaquoting are involved, the
1510resulting I<string> is passed to the RE engine for compilation.
1511
1512Whatever happens in the RE engine might be better discussed in L<perlre>,
1513but for the sake of continuity, we shall do so here.
1514
1515This is another step where the presence of the C<//x> modifier is
1516relevant. The RE engine scans the string from left to right and
1517converts it to a finite automaton.
1518
1519Backslashed characters are either replaced with corresponding
1520literal strings (as with C<\{>), or else they generate special nodes
1521in the finite automaton (as with C<\b>). Characters special to the
1522RE engine (such as C<|>) generate corresponding nodes or groups of
1523nodes. C<(?#...)> comments are ignored. All the rest is either
1524converted to literal strings to match, or else is ignored (as is
1525whitespace and C<#>-style comments if C<//x> is present).
1526
1527Parsing of the bracketed character class construct, C<[...]>, is
1528rather different than the rule used for the rest of the pattern.
1529The terminator of this construct is found using the same rules as
1530for finding the terminator of a C<{}>-delimited construct, the only
1531exception being that C<]> immediately following C<[> is treated as
1532though preceded by a backslash. Similarly, the terminator of
1533C<(?{...})> is found using the same rules as for finding the
1534terminator of a C<{}>-delimited construct.
1535
1536It is possible to inspect both the string given to RE engine and the
1537resulting finite automaton. See the arguments C<debug>/C<debugcolor>
1538in the C<use L<re>> pragma, as well as Perl's B<-Dr> command-line
1539switch documented in L<perlrun/"Command Switches">.
1540
1541=item Optimization of regular expressions
1542
1543This step is listed for completeness only. Since it does not change
1544semantics, details of this step are not documented and are subject
1545to change without notice. This step is performed over the finite
1546automaton that was generated during the previous pass.
1547
1548It is at this stage that C<split()> silently optimizes C</^/> to
1549mean C</^/m>.
1550
1551=back
1552
1553=head2 I/O Operators
1554
1555There are several I/O operators you should know about.
1556
1557A string enclosed by backticks (grave accents) first undergoes
1558double-quote interpolation. It is then interpreted as an external
1559command, and the output of that command is the value of the
1560pseudo-literal, j
1561string consisting of all output is returned. In list context, a
1562list of values is returned, one per line of output. (You can set
1563C<$/> to use a different line terminator.) The command is executed
1564each time the pseudo-literal is evaluated. The status value of the
1565command is returned in C<$?> (see L<perlvar> for the interpretation
1566of C<$?>). Unlike in B<csh>, no translation is done on the return
1567data--newlines remain newlines. Unlike in any of the shells, single
1568quotes do not hide variable names in the command from interpretation.
1569To pass a literal dollar-sign through to the shell you need to hide
1570it with a backslash. The generalized form of backticks is C<qx//>.
1571(Because backticks always undergo shell expansion as well, see
1572L<perlsec> for security concerns.)
1573
1574In scalar context, evaluating a filehandle in angle brackets yields
1575the next line from that file (the newline, if any, included), or
1576C<undef> at end-of-file or on error. When C<$/> is set to C<undef>
1577(sometimes known as file-slurp mode) and the file is empty, it
1578returns C<''> the first time, followed by C<undef> subsequently.
1579
1580Ordinarily you must assign the returned value to a variable, but
1581there is one situation where an automatic assignment happens. If
1582and only if the input symbol is the only thing inside the conditional
1583of a C<while> statement (even if disguised as a C<for(;;)> loop),
1584the value is automatically assigned to the global variable $_,
1585destroying whatever was there previously. (This may seem like an
1586odd thing to you, but you'll use the construct in almost every Perl
1587script you write.) The $_ variables is not implicitly localized.
1588You'll have to put a C<local $_;> before the loop if you want that
1589to happen.
1590
1591The following lines are equivalent:
1592
1593 while (defined($_ = <STDIN>)) { print; }
1594 while ($_ = <STDIN>) { print; }
1595 while (<STDIN>) { print; }
1596 for (;<STDIN>;) { print; }
1597 print while defined($_ = <STDIN>);
1598 print while ($_ = <STDIN>);
1599 print while <STDIN>;
1600
1601This also behaves similarly, but avoids $_ :
1602
1603 while (my $line = <STDIN>) { print $line }
1604
1605In these loop constructs, the assigned value (whether assignment
1606is automatic or explicit) is then tested to see whether it is
1607defined. The defined test avoids problems where line has a string
1608value that would be treated as false by Perl, for example a "" or
1609a "0" with no trailing newline. If you really mean for such values
1610to terminate the loop, they should be tested for explicitly:
1611
1612 while (($_ = <STDIN>) ne '0') { ... }
1613 while (<STDIN>) { last unless $_; ... }
1614
1615In other boolean contexts, C<< <I<filehandle>> >> without an
1616explicit C<defined> test or comparison elicit a warning if the
1617C<use warnings> pragma or the B<-w>
1618command-line switch (the C<$^W> variable) is in effect.
1619
1620The filehandles STDIN, STDOUT, and STDERR are predefined. (The
1621filehandles C<stdin>, C<stdout>, and C<stderr> will also work except
1622in packages, where they would be interpreted as local identifiers
1623rather than global.) Additional filehandles may be created with
1624the open() function, amongst others. See L<perlopentut> and
1625L<perlfunc/open> for details on this.
1626
1627If a <FILEHANDLE> is used in a context that is looking for
1628a list, a list comprising all input lines is returned, one line per
1629list element. It's easy to grow to a rather large data space this
1630way, so use with care.
1631
1632<FILEHANDLE> may also be spelled C<readline(*FILEHANDLE)>.
1633See L<perlfunc/readline>.
1634
1635The null filehandle <> is special: it can be used to emulate the
1636behavior of B<sed> and B<awk>. Input from <> comes either from
1637standard input, or from each file listed on the command line. Here's
1638how it works: the first time <> is evaluated, the @ARGV array is
1639checked, and if it is empty, C<$ARGV[0]> is set to "-", which when opened
1640gives you standard input. The @ARGV array is then processed as a list
1641of filenames. The loop
1642
1643 while (<>) {
1644 ... # code for each line
1645 }
1646
1647is equivalent to the following Perl-like pseudo code:
1648
1649 unshift(@ARGV, '-') unless @ARGV;
1650 while ($ARGV = shift) {
1651 open(ARGV, $ARGV);
1652 while (<ARGV>) {
1653 ... # code for each line
1654 }
1655 }
1656
1657except that it isn't so cumbersome to say, and will actually work.
1658It really does shift the @ARGV array and put the current filename
1659into the $ARGV variable. It also uses filehandle I<ARGV>
1660internally--<> is just a synonym for <ARGV>, which
1661is magical. (The pseudo code above doesn't work because it treats
1662<ARGV> as non-magical.)
1663
1664You can modify @ARGV before the first <> as long as the array ends up
1665containing the list of filenames you really want. Line numbers (C<$.>)
1666continue as though the input were one big happy file. See the example
1667in L<perlfunc/eof> for how to reset line numbers on each file.
1668
1669If you want to set @ARGV to your own list of files, go right ahead.
1670This sets @ARGV to all plain text files if no @ARGV was given:
1671
1672 @ARGV = grep { -f && -T } glob('*') unless @ARGV;
1673
1674You can even set them to pipe commands. For example, this automatically
1675filters compressed arguments through B<gzip>:
1676
1677 @ARGV = map { /\.(gz|Z)$/ ? "gzip -dc < $_ |" : $_ } @ARGV;
1678
1679If you want to pass switches into your script, you can use one of the
1680Getopts modules or put a loop on the front like this:
1681
1682 while ($_ = $ARGV[0], /^-/) {
1683 shift;
1684 last if /^--$/;
1685 if (/^-D(.*)/) { $debug = $1 }
1686 if (/^-v/) { $verbose++ }
1687 # ... # other switches
1688 }
1689
1690 while (<>) {
1691 # ... # code for each line
1692 }
1693
1694The <> symbol will return C<undef> for end-of-file only once.
1695If you call it again after this, it will assume you are processing another
1696@ARGV list, and if you haven't set @ARGV, will read input from STDIN.
1697
1698If angle brackets contain is a simple scalar variable (e.g.,
1699<$foo>), then that variable contains the name of the
1700filehandle to input from, or its typeglob, or a reference to the
1701same. For example:
1702
1703 $fh = \*STDIN;
1704 $line = <$fh>;
1705
1706If what's within the angle brackets is neither a filehandle nor a simple
1707scalar variable containing a filehandle name, typeglob, or typeglob
1708reference, it is interpreted as a filename pattern to be globbed, and
1709either a list of filenames or the next filename in the list is returned,
1710depending on context. This distinction is determined on syntactic
1711grounds alone. That means C<< <$x> >> is always a readline() from
1712an indirect handle, but C<< <$hash{key}> >> is always a glob().
1713That's because $x is a simple scalar variable, but C<$hash{key}> is
1714not--it's a hash element.
1715
1716One level of double-quote interpretation is done first, but you can't
1717say C<< <$foo> >> because that's an indirect filehandle as explained
1718in the previous paragraph. (In older versions of Perl, programmers
1719would insert curly brackets to force interpretation as a filename glob:
1720C<< <${foo}> >>. These days, it's considered cleaner to call the
1721internal function directly as C<glob($foo)>, which is probably the right
1722way to have done it in the first place.) For example:
1723
1724 while (<*.c>) {
1725 chmod 0644, $_;
1726 }
1727
1728is roughly equivalent to:
1729
1730 open(FOO, "echo *.c | tr -s ' \t\r\f' '\\012\\012\\012\\012'|");
1731 while (<FOO>) {
1732 chop;
1733 chmod 0644, $_;
1734 }
1735
1736except that the globbing is actually done internally using the standard
1737C<File::Glob> extension. Of course, the shortest way to do the above is:
1738
1739 chmod 0644, <*.c>;
1740
1741A (file)glob evaluates its (embedded) argument only when it is
1742starting a new list. All values must be read before it will start
1743over. In list context, this isn't important because you automatically
1744get them all anyway. However, in scalar context the operator returns
1745the next value each time it's called, or C<undef> when the list has
1746run out. As with filehandle reads, an automatic C<defined> is
1747generated when the glob occurs in the test part of a C<while>,
1748because legal glob returns (e.g. a file called F<0>) would otherwise
1749terminate the loop. Again, C<undef> is returned only once. So if
1750you're expecting a single value from a glob, it is much better to
1751say
1752
1753 ($file) = <blurch*>;
1754
1755than
1756
1757 $file = <blurch*>;
1758
1759because the latter will alternate between returning a filename and
1760returning false.
1761
1762It you're trying to do variable interpolation, it's definitely better
1763to use the glob() function, because the older notation can cause people
1764to become confused with the indirect filehandle notation.
1765
1766 @files = glob("$dir/*.[ch]");
1767 @files = glob($files[$i]);
1768
1769=head2 Constant Folding
1770
1771Like C, Perl does a certain amount of expression evaluation at
1772compile time whenever it determines that all arguments to an
1773operator are static and have no side effects. In particular, string
1774concatenation happens at compile time between literals that don't do
1775variable substitution. Backslash interpolation also happens at
1776compile time. You can say
1777
1778 'Now is the time for all' . "\n" .
1779 'good men to come to.'
1780
1781and this all reduces to one string internally. Likewise, if
1782you say
1783
1784 foreach $file (@filenames) {
1785 if (-s $file > 5 + 100 * 2**16) { }
1786 }
1787
1788the compiler will precompute the number which that expression
1789represents so that the interpreter won't have to.
1790
1791=head2 Bitwise String Operators
1792
1793Bitstrings of any size may be manipulated by the bitwise operators
1794(C<~ | & ^>).
1795
1796If the operands to a binary bitwise op are strings of different
1797sizes, B<|> and B<^> ops act as though the shorter operand had
1798additional zero bits on the right, while the B<&> op acts as though
1799the longer operand were truncated to the length of the shorter.
1800The granularity for such extension or truncation is one or more
1801bytes.
1802
1803 # ASCII-based examples
1804 print "j p \n" ^ " a h"; # prints "JAPH\n"
1805 print "JA" | " ph\n"; # prints "japh\n"
1806 print "japh\nJunk" & '_____'; # prints "JAPH\n";
1807 print 'p N$' ^ " E<H\n"; # prints "Perl\n";
1808
1809If you are intending to manipulate bitstrings, be certain that
1810you're supplying bitstrings: If an operand is a number, that will imply
1811a B<numeric> bitwise operation. You may explicitly show which type of
1812operation you intend by using C<""> or C<0+>, as in the examples below.
1813
1814 $foo = 150 | 105 ; # yields 255 (0x96 | 0x69 is 0xFF)
1815 $foo = '150' | 105 ; # yields 255
1816 $foo = 150 | '105'; # yields 255
1817 $foo = '150' | '105'; # yields string '155' (under ASCII)
1818
1819 $baz = 0+$foo & 0+$bar; # both ops explicitly numeric
1820 $biz = "$foo" ^ "$bar"; # both ops explicitly stringy
1821
1822See L<perlfunc/vec> for information on how to manipulate individual bits
1823in a bit vector.
1824
1825=head2 Integer Arithmetic
1826
1827By default, Perl assumes that it must do most of its arithmetic in
1828floating point. But by saying
1829
1830 use integer;
1831
1832you may tell the compiler that it's okay to use integer operations
1833(if it feels like it) from here to the end of the enclosing BLOCK.
1834An inner BLOCK may countermand this by saying
1835
1836 no integer;
1837
1838which lasts until the end of that BLOCK. Note that this doesn't
1839mean everything is only an integer, merely that Perl may use integer
1840operations if it is so inclined. For example, even under C<use
1841integer>, if you take the C<sqrt(2)>, you'll still get C<1.4142135623731>
1842or so.
1843
1844Used on numbers, the bitwise operators ("&", "|", "^", "~", "<<",
1845and ">>") always produce integral results. (But see also
1846L<Bitwise String Operators>.) However, C<use integer> still has meaning for
1847them. By default, their results are interpreted as unsigned integers, but
1848if C<use integer> is in effect, their results are interpreted
1849as signed integers. For example, C<~0> usually evaluates to a large
1850integral value. However, C<use integer; ~0> is C<-1> on twos-complement
1851machines.
1852
1853=head2 Floating-point Arithmetic
1854
1855While C<use integer> provides integer-only arithmetic, there is no
1856analogous mechanism to provide automatic rounding or truncation to a
1857certain number of decimal places. For rounding to a certain number
1858of digits, sprintf() or printf() is usually the easiest route.
1859See L<perlfaq4>.
1860
1861Floating-point numbers are only approximations to what a mathematician
1862would call real numbers. There are infinitely more reals than floats,
1863so some corners must be cut. For example:
1864
1865 printf "%.20g\n", 123456789123456789;
1866 # produces 123456789123456784
1867
1868Testing for exact equality of floating-point equality or inequality is
1869not a good idea. Here's a (relatively expensive) work-around to compare
1870whether two floating-point numbers are equal to a particular number of
1871decimal places. See Knuth, volume II, for a more robust treatment of
1872this topic.
1873
1874 sub fp_equal {
1875 my ($X, $Y, $POINTS) = @_;
1876 my ($tX, $tY);
1877 $tX = sprintf("%.${POINTS}g", $X);
1878 $tY = sprintf("%.${POINTS}g", $Y);
1879 return $tX eq $tY;
1880 }
1881
1882The POSIX module (part of the standard perl distribution) implements
1883ceil(), floor(), and other mathematical and trigonometric functions.
1884The Math::Complex module (part of the standard perl distribution)
1885defines mathematical functions that work on both the reals and the
1886imaginary numbers. Math::Complex not as efficient as POSIX, but
1887POSIX can't work with complex numbers.
1888
1889Rounding in financial applications can have serious implications, and
1890the rounding method used should be specified precisely. In these
1891cases, it probably pays not to trust whichever system rounding is
1892being used by Perl, but to instead implement the rounding function you
1893need yourself.
1894
1895=head2 Bigger Numbers
1896
1897The standard Math::BigInt and Math::BigFloat modules provide
1898variable-precision arithmetic and overloaded operators, although
1899they're currently pretty slow. At the cost of some space and
1900considerable speed, they avoid the normal pitfalls associated with
1901limited-precision representations.
1902
1903 use Math::BigInt;
1904 $x = Math::BigInt->new('123456789123456789');
1905 print $x * $x;
1906
1907 # prints +15241578780673678515622620750190521
1908
1909The non-standard modules SSLeay::BN and Math::Pari provide
1910equivalent functionality (and much more) with a substantial
1911performance savings.
1912
1913=cut