Perl基础教程: 正则表达式

Perl正则表达式教程

简介
This page provides a basic tutorial on understanding,creating and using regular expressions
in Perl. It serves as a complement to the reference page on regular expressions perlre. Regular?
expressions are an integral part of the m//,s///,qr// and split operators and so this?
tutorial also overlaps with Regexp Quote-Like Operators in perlop and split.
本文是理解，创建和使用正则表达式的基础教程。
正则表达式是表达式:
? m//,
? s///,helvetica; font-size:14px">? qr,helvetica; font-size:14px">? split
的组成部分，本文将一一讲解。
Perl is widely renowned for excellence in text processing,and regular expressions are?
one of the big factors behind this fame. Perl regular expressions display an efficiency?
and flexibility unknown in most other computer languages. Mastering even the basics of?
regular expressions will allow you to manipulate text with surprising ease.
Perl在文本处理领域很出名，强大的正则表达式是其重要的原因之一。
What is a regular expression? A regular expression is simply a string that describes a pattern.?
Patterns are in common use these days; examples are the patterns typed into a search engine?
to find web pages and the patterns used to list files in a directory,e.g.,ls *.txt or dir *.*.?
In Perl,the patterns described by regular expressions are used to search strings,extract?
desired parts of strings,and to do search and replace operations.
正则表达式描述的是一个字符串的模式，可用于字符串搜索，提取想要的部分，进行搜索和替换操作。
Regular expressions have the undeserved reputation of being abstract and difficult to?understand.?
Regular expressions are constructed using simple concepts like conditionals and loops and are?
no more difficult to understand than the corresponding if conditionals and while loops in the?
Perl language itself. In fact,the main challenge in learning regular expressions is just?
getting used to the terse notation used to express these concepts.
学习正则表达式最有挑战的地方在于用简单的符号来表达像条件，迭代等这些概念。
This tutorial flattens the learning curve by discussing regular expression concepts,along?
with their notation,one at a time and with many examples. The first part of the tutorial?
will progress from the simplest word searches to the basic regular expression concepts.?
If you master the first part,you will have all the tools needed to solve about 98% of?
your needs. The second part of the tutorial is for those comfortable with the basics and?
hungry for more power tools. It discusses the more advanced regular expression operators?
and introduces the latest cutting-edge innovations.
本文的第一部分使用简单的字符搜索来讲解基本的正则表达式概念。
理解了第一部分，你就能自如地处理98%的情况。
第二部分则是高阶工具的讲解。
NOTE: to save time,'regular expression' is often abbreviated as regexp or regex.?
Regexp is a more natural abbreviation than regex,but is harder to pronounce. The Perl?
pod documentation is evenly split on regexp vs regex; in Perl,there is more than one?
way to abbreviate it. We'll use regexp in this tutorial.
'regular expression'通常缩写为'regex','regexp'.
1. Part 1: The basics【基础部分】?
1.1 Simple word matching 【简单的单词匹配】
The simplest regexp is simply a word,or more generally,a string of characters. A regexp?
consisting of a word matches any string that contains that word:
最简单的正则式是一个单词，或是字符串。
由一个单词去匹配包含这个单词的字体串组成。如下:
? ? "Hello World" =~ /World/; ?# matches
What is this Perl statement all about? "Hello World" is a simple double-quoted string.?
World is the regular expression and the // enclosing /World/ tells Perl to search a string?
for a match. The operator =~ associates the string with the regexp match and produces a true?
value if the regexp matched,or false if the regexp did not match. In our case,World?
matches the second word in "Hello World",so the expression is true. Expressions like?
this are useful in conditionals:
上面的表达式解释:?
? "Hello World" 是一个简单的双引号字符串;
? World ? ? ? ? 是正则式;
? /World/ ? ? ? 是告诉Perl为了匹配World去搜索字符串;
? =~ ? ? ? ? ? ?将正则式去匹配字符串，生成的结果是，
? ? ? ? ? ? ? ? ? 如果正则式在字体串获得了匹配，值为真;
? ? ? ? ? ? ? ? ? 否则，值为假.
因此，上面的表达式结果为真.
可以将上面的表达式应用在下面的代码中:
? ? if ("Hello World" =~ /World/) {
? ? ? ? print "It matchesn";
? ? }
? ? else {
? ? ? ? print "It doesn't matchn";
There are useful variations on this theme. The sense of the match can be reversed by?
using the !~ operator:
一个很有用的变体是，使用不匹配操作符 !~?:
? ? if ("Hello World" !~ /World/) {
The literal string in the regexp can be replaced by a variable:
可将字符串用变量代替:
? ? $greeting = "World";
? ? if ("Hello World" =~ /$greeting/) {
If you're matching against the special default variable $_,the $_ =~ part can be omitted:
还可以使用默认变量$_:
? ? $_ = "Hello World";
? ? if (/World/) {
And finally,the // default delimiters for a match can be changed to arbitrary delimiters?
by putting an 'm' out front:
最后，默认的分隔符//也可以用'm'加任意字符代替:
? ? "Hello World" =~ m!World!; ? # matches,delimited by '!'
? ? "Hello World" =~ m{World}; ? # matches,note the matching '{}'
? ? "/usr/bin/perl" =~ m"/perl"; # matches after '/usr/bin',51)">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# '/' becomes an ordinary char
/World/,m!World!,and m{World} all represent the same thing. When,the quote (")?
is used as a delimiter,the forward slash '/' becomes an ordinary character and can be?
used in this regexp without trouble.
Let's consider how different regexps would match "Hello World" :
来看下不同的表达式匹配"Hello World"的结果:
? ? "Hello World" =~ /world/; ?# doesn't match : 正则式区分大小写
? ? "Hello World" =~ /o W/; ? ?# matches
? ? "Hello World" =~ /oW/; ? ? # doesn't match : 正则式对空格敏感
? ? "Hello World" =~ /World /; # doesn't match : 正则式对空格敏感
The first regexp world doesn't match because regexps are case-sensitive. The second?
regexp matches because the substring 'o W' occurs in the string "Hello World" . The?
space character ' ' is treated like any other character in a regexp and is needed to?
match in this case. The lack of a space character is the reason the third regexp 'oW'?
doesn't match. The fourth regexp 'World ' doesn't match because there is a space at?
the end of the regexp,but not at the end of the string. The lesson here is that regexps?
must match a part of the string exactly in order for the statement to be true.
If a regexp matches in more than one place in the string,Perl will always match at the?
earliest possible point in the string:
如果正则式在字符串的多个位置都匹配，Perl首先匹配的是字符串的第一个位置。
? ? "Hello World" =~ /o/; ? ? ? # matches 'o' in 'Hello'
? ? "That hat is red" =~ /hat/; # matches 'hat' in 'That'
With respect to character matching,there are a few more points you need to know about.?
First of all,not all characters can be used 'as is' in a match. Some characters,called?
metacharacters,are reserved for use in regexp notation. The metacharacters are
需要注意的是:
第一，不是所有的字符都能用在正则式中去匹配，如下的元字符就是:
? ? {}[]()^$.|*+?
The significance of each of these will be explained in the rest of the tutorial,but for now,?
it is important only to know that a metacharacter can be matched by putting a backslash?
before it:
要匹配这些元字符，需要在元字符前使用反斜杠""做转义
? ? "2+2=4" =~ /2+2/; ? ?# doesn't match,+ is a metacharacter
? ? "2+2=4" =~ /2+2/; ? # matches,+ is treated like an ordinary +
? ? "The interval is [0,1)." =~ /[0,1)./ ? ? # is a syntax error!

? ? "#!/usr/bin/perl" =~ /#!/usr/bin/perl/; ?# matches
In the last regexp,the forward slash '/' is also backslashed,because it is used to delimit?
the regexp. This can lead to LTS (leaning toothpick syndrome),however,and it is often more?
readable to change delimiters.
可以用别的分隔符来代替，以方便阅读:
? ? "#!/usr/bin/perl" =~ m!#!/usr/bin/perl!; ?# easier to read
The backslash character '' is a metacharacter itself and needs to be backslashed:
'' 本身也是一个元字符，所以也需要做转义:
? ? 'C:WIN32' =~ /C:WIN/; ? # matches
In addition to the metacharacters,there are some ASCII characters which don't have printable?
character equivalents and are instead represented by escape sequences. Common examples?
are t for a tab,n for a newline,r for a carriage return and a for a bell (or alert).?
If your string is better thought of as a sequence of arbitrary bytes,the octal escape sequence,helvetica; font-size:14px">e.g.,33,or hexadecimal escape sequence,x1B may be a more natural representation?
for your bytes. Here are some examples of escapes:
第二，除了元字符外，不能打印的ASCII字符也需要使用转义字符代替:
? tab ? 用 t,51)">? 换行 ?用 n
? 回车 ?用 r
? 响铃 ?用 a
也可用其ASCII表值来做匹配.
? ? "1000t2000" =~ m(0t2) ? # matches
? ? "1000n2000" =~ /0n20/ ? # matches
? ? "1000t2000" =~ /00t2/ # doesn't match,"0" ne "00"
? ? "cat" ? =~ /o{143}x61x74/ # matches in ASCII,but a weird way
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# to spell cat
If you've been around Perl a while,all this talk of escape sequences may seem familiar.?
Similar escape sequences are used in double-quoted strings and in fact the regexps?
in Perl are mostly treated as double-quoted strings. This means that variables can be used?
in regexps as well. Just like double-quoted strings,the values of the variables in the regexp?
will be substituted in before the regexp is evaluated for matching purposes. So we have:
匹配式中有变量时，变量的值会先扩展，再进行匹配:
? ? $foo = 'house';
? ? 'housecat' =~ /$foo/; ? ? ?# matches
? ? 'cathouse' =~ /cat$foo/; ? # matches
? ? 'housecat' =~ /${foo}cat/; # matches
So far,so good. With the knowledge above you can already perform searches with just?
about any literal string regexp you can dream up. Here is a very simple emulation of?
the Unix grep program:
下面是上面的讲解的综合用例:
? ??% cat > simple_grep
? ? #!/usr/bin/perl
? ? $regexp = shift; ? ? ? ? ? # 将命令行的第一个参数作为正则式，第二个作为文件
? ? while (<>) { ? ? ? ? ? ? ? # 对文件的所有行进行处理 ?
? ? ? ? print if /$regexp/; ? ?# 打印匹配的行
? ? }
? ? ^D
? ? % chmod +x simple_grep
? ? % simple_grep abba /usr/dict/words
? ? Babbage
? ? cabbage
? ? cabbages
? ? sabbath
? ? Sabbathize
? ? Sabbathizes
? ? sabbatical
? ? scabbard
? ? scabbards
This program is easy to understand. #!/usr/bin/perl is the standard way to invoke a perl?
program from the shell. $regexp = shift; saves the first command line argument as the?
regexp to be used,leaving the rest of the command line arguments to be treated as files.?
while (<>) loops over all the lines in all the files. For each line,print if /$regexp/;?
prints the line if the regexp matches the line. In this line,both print and /$regexp/?
use the default variable $_ implicitly.
With all of the regexps above,if the regexp matched anywhere in the string,it was considered?
a match. Sometimes,we'd like to specify where in the string the regexp should try to?
match. To do this,we would use the anchor metacharacters ^ and $ . The anchor ^ means match?
at the beginning of the string and the anchor $ means match at the end of the string,or before?
a newline at the end of the string. Here is how they are used:
在上面的代码中，所有的匹配位置都在字符串中的第一次出现的位置，
可以使用锚元字符 ^ 和 $ 来做特别指定:
? ^ : 在字符串的开始处匹配;
? $ : 在字符串的结尾处匹配;
? ? "housekeeper" =~ /keeper/; ? ?# matches
? ? "housekeeper" =~ /^keeper/; ? # doesn't match
? ? "housekeeper" =~ /keeper$/; ? # matches
? ? "housekeepern" =~ /keeper$/; # matches
The second regexp doesn't match because ^ constrains keeper to match only at the beginning?
of the string,but "housekeeper" has keeper starting in the middle. The third regexp does?
match,since the $ constrains keeper to match only at the end of the string.
When both ^ and $ are used at the same time,the regexp has to match both the beginning and?
the end of the string,i.e.,the regexp matches the whole string. Consider
^ 和 $ 还可以同时用，结果是正则式完全匹配整个字符串
? ? "keeper" =~ /^keep$/; ? ? ?# doesn't match
? ? "keeper" =~ /^keeper$/; ? ?# matches
? ? "" ? ? ? =~ /^$/; ? ? ? ? ?# ^$ matches an empty string
The first regexp doesn't match because the string has more to it than keep . Since the?
second regexp is exactly the string,it matches. Using both ^ and $ in a regexp forces?
the complete string to match,so it gives you complete control over which strings match?
and which don't. Suppose you are looking for a fellow named bert,off in a string by himself:
如要在字符串中找 bert?
? ? "dogbert" =~ /bert/; ? # matches,but not what you want
? ? "dilbert" =~ /^bert/; ?# doesn't match,but ..
? ? "bertram" =~ /^bert/; ?# matches,so still not good enough
? ? "bertram" =~ /^bert$/; # doesn't match,good
? ? "dilbert" =~ /^bert$/; # doesn't match,helvetica; font-size:14px">? ? "bert" ? ?=~ /^bert$/; # matches,perfect
Of course,in the case of a literal string,one could just as easily use the string?
comparison $string eq 'bert' and it would be more efficient. The ^...$ regexp really?
becomes useful when we add in the more powerful regexp tools below.
^...$ 正则式真正有用的地方是在正则式工具中。
1.2 Using character classes【使用字符类】
Although one can already do quite a lot with the literal string regexps above,we've only?
scratched the surface of regular expression technology. In this and subsequent sections?
we will introduce regexp concepts (and associated metacharacter notations) that will allow?
a regexp to represent not just a single character sequence,but a whole class of them.
下面开始讲正则式的概念: 字符类
One such concept is that of a character class. A character class allows a set of possible?
characters,rather than just a single character,to match at a particular point in a regexp.?
Character classes are denoted by brackets [...],with the set of characters to be possibly?
matched inside. Here are some examples:
字符类，表示可能字符的集合，而不是一个字符。
字符类使用方括号[...]来表示,helvetica; font-size:14px">示例如下:
? ? /cat/; ? ? ? ? ? ? ? # matches 'cat' ? ? ? ? ? ? ? ? ? ? 匹配 cat?
? ? /[bcr]at/; ? ? ? ? ? # matches 'bat,'cat',or 'rat' ? ? 匹配 bat,cat 或 rat
? ? /item[0123456789]/; ?# matches 'item0' or ... or 'item9' 匹配 item0 ... 或 item9
? ? "abc" =~ /[cab]/; ? ?# matches 'a': 第一个字符'a'是正则式能在字符串中匹配的最先位置
In the last statement,even though 'c' is the first character in the class,helvetica; font-size:14px">'a' matches because the first character position in the string is the earliest point?
at which the regexp can match.
? ? /[yY][eE][sS]/; ? ? ?# match 'yes' in a case-insensitive way
? ? ? ? ? ? ? ? ? ? ? ? ?# 'yes','Yes','YES',etc. 不区分大小写的匹配
This regexp displays a common task: perform a case-insensitive match. Perl provides?
a way of avoiding all those brackets by simply appending an 'i' to the end of the match.?
Then /[yY][eE][sS]/; can be rewritten as /yes/i; . The 'i' stands for case-insensitive?
and is an example of a modifier of the matching operation. We will meet other modifiers?
later in the tutorial.
'i' : ?对于不区分大小写的匹配，可以在正则式中添加修饰符'i'。
We saw in the section above that there were ordinary characters,which represented themselves,helvetica; font-size:14px">and special characters,which needed a backslash to represent themselves. The same is true?
in a character class,but the sets of ordinary and special characters inside a character class?
are different than those outside a character class. The special characters for a character?
class are -]^$ (and the pattern delimiter,whatever it is). ] is special because it denotes?
the end of a character class. $ is special because it denotes a scalar variable. is special?
because it is used in escape sequences,just like above. Here is how the special characters ]$?
are handled:
在字符类中可以使用元字符时，同样要对元字符进行转义;
在字符类中可以使用变量;
? ?/[]c]def/; # matches ']def' or 'cdef'
? ?$x = 'bcr';
? ?/[$x]at/; ? # matches 'bat',or 'rat'
? ?/[$x]at/; ?# matches '$at' or 'xat'
? ?/[$x]at/; # matches 'at','bat,helvetica; font-size:14px">The last two are a little tricky. In [$x],the backslash protects the dollar sign,so the?
character class has two members $ and x . In [$x],the backslash is protected,so $x is?
treated as a variable and substituted in double quote fashion.
The special character '-' acts as a range operator within character classes,so that a?
contiguous set of characters can be written as a range. With ranges,the unwieldy?
[0123456789] and [abc...xyz] become the svelte [0-9] and [a-z] . Some examples are
'-' ?: 字符类中的范围操作符
? ? /item[0-9]/; ? ?# matches 'item0' or ... or 'item9' ?匹配item0 ... item9
? ? /[0-9bx-z]aa/; ?# matches '0aa',...,'9aa',? ? ? ? 匹配 0aa ... 9aa
? ? ? ? ? ? ? ? ? ? # 'baa','xaa','yaa',or 'zaa' ? ? ? ? ? baa,xaa ... zaa
? ? /[0-9a-fA-F]/; ?# matches a hexadecimal digit ? ? ? ?匹配十六进制数
? ? /[0-9a-zA-Z_]/; # matches a "word" character,? ? ? ?匹配一个单词
? ? ? ? ? ? ? ? ? ? # like those in a Perl variable name
If '-' is the first or last character in a character class,it is treated as an ordinary?
character; [-ab],[ab-] and [a-b] are all equivalent.
如果'-'是字符类的第一个或最后一个字符，则它表示原义，不是范围操作符。
The special character ^ in the first position of a character class denotes a negated character?
class,which matches any character but those in the brackets. Both [...] and [^...] must?
match a character,or the match fails. Then
'^' ?: 是字符类的第一个字符时，表示反字符类
? ? ? ?是字符类的最后个字符时，表示原义
? ? /[^a]at/; ?# doesn't match 'aat' or 'at',but matches
? ? ? ? ? ? ? ?# all other 'bat','cat,'0at','%at',etc.
? ? /[^0-9]/; ?# matches a non-numeric character
? ? /[a^]at/; ?# matches 'aat' or '^at'; here '^' is ordinary
Now,even [0-9] can be a bother to write multiple times,so in the interest of saving keystrokes?
and making regexps more readable,Perl has several abbreviations for common character classes,helvetica; font-size:14px">as shown below. Since the introduction of Unicode,unless the //a modifier is in effect,helvetica; font-size:14px">these character classes match more than just a few characters in the ASCII range.
Perl定义了一些通用字符类，如下所示:
d : matches a digit,not just [0-9] but also digits from non-roman scripts
? ? ?匹配数字，包括[0-9],以及 非罗马数字;
s : matches a whitespace character,the set [ trnf] and others
? ? ?匹配空格，包括[ trnf]等;
w : matches a word character (alphanumeric or _),not just [0-9a-zA-Z_]?
? ? ?but also digits and characters from non-roman scripts
? ? ?匹配一个单词
D : is a negated d; it represents any other character than a digit,or [^d]
? ? ?d 的反字符类，表示数字外的其它字符
S : is a negated s; it represents any non-whitespace character [^s]
? ? ?s 的反字符类，表示任何非空格的字符
W : is a negated w; it represents any non-word character [^w]
? ? ?w 的反字符类，表示任何非单词的字符
'.': The period '.' matches any character but "n" (unless the modifier //s is in effect,?
? ? ?as explained below).
? ? ?'.' 表示匹配除"n"(换行符)外的任何字符。但使用了//s时不起作用
N,like the period,matches any character but "n",but it does so regardless of whether?
? ? the modifier //s is in effect.
? ? 和'.'类似，匹配除换行符外的任何字符，和//s起不起作用无关。
The //a modifier,available starting in Perl 5.14,is used to restrict the matches of d,s,helvetica; font-size:14px">and w to just those in the ASCII range. It is useful to keep your program from being needlessly?
exposed to full Unicode (and its accompanying security considerations) when all you want is?
to process English-like text. (The "a" may be doubled,//aa,to provide even more restrictions,helvetica; font-size:14px">preventing case-insensitive matching of ASCII with non-ASCII characters; otherwise a?
Unicode "Kelvin Sign" would caselessly match a "k" or "K".)
//a : 修饰符，从Perl 5.14开始有效，用来限制d,w 只在ASCII范围内生效，以用于处理纯英文文本。
The dswDSW abbreviations can be used both inside and outside of character classes.?
Here are some in use:
通用字符类 dswDSW ?可以用在字符类里，也可用在字符类外:
? ? /dd:dd:dd/; # matches a hh:mm:ss time format ? ? ? ? ? ?匹配 hh:mm:ss 时间格式
? ? /[ds]/; ? ? ? ? # matches any digit or whitespace character 匹配任意数字或空格
? ? /wWw/; ? ? ? ? # matches a word char,followed by a ? ? ? ?匹配单词,非单词,单词模式
? ? ? ? ? ? ? ? ? ? ? # non-word char,followed by a word char
? ? /..rt/; ? ? ? ? ? # matches any two chars,followed by 'rt' ? 匹配两个字母后跟着'rt'
? ? /end./; ? ? ? ? ?# matches 'end.' ? ? ? ? ? ? ? ? ? ? ? ? ? ?匹配 'end.'
? ? /end[.]/; ? ? ? ? # same thing,matches 'end.'
Because a period is a metacharacter,it needs to be escaped to match as an ordinary period.?
Because,for example,d and w are sets of characters,it is incorrect to think of [^dw]?
as [DW] ; in fact [^dw] is the same as [^w],which is the same as [W] . Think DeMorgan's?
laws.
An anchor useful in basic regexps is the word anchor b . This matches a boundary between?
a word character and a non-word character wW or Ww :
b : 锚字符，表示单词的边界，或非单词的边界
? ? $x = "Housecat catenates house and cat";
? ? $x =~ /cat/; ? ? ?# matches cat in 'housecat'
? ? $x =~ /bcat/; ? ?# matches cat in 'catenates'
? ? $x =~ /catb/; ? ?# matches cat in 'housecat'
? ? $x =~ /bcatb/; ?# matches 'cat' at end of string
Note in the last example,the end of the string is considered a word boundary.
You might wonder why '.' matches everything but "n" - why not every character? The reason?
is that often one is matching against lines and would like to ignore the newline characters.?
For instance,while the string "n" represents one line,we would like to think of it as empty.?
Then
'.' : 匹配除换行符外的所有字符，为什么不是包括换行符的原因是，
? ? ? 匹配是针对除换行符外的整个一行
? ? "" ? =~ /^$/; ? ? # matches
? ? "n" =~ /^$/; ? ? # matches,$ anchors before "n"
? ? "" ? =~ /./; ? ? ?# doesn't match; it needs a char
? ? "" ? =~ /^.$/; ? ?# doesn't match; it needs a char
? ? "n" =~ /^.$/; ? ?# doesn't match; it needs a char other than "n"
? ? "a" ?=~ /^.$/; ? ?# matches
? ? "an" ?=~ /^.$/; ?# matches,helvetica; font-size:14px">This behavior is convenient,because we usually want to ignore newlines when we count and match?
characters in a line. Sometimes,we want to keep track of newlines. We might even?
want ^ and $ to anchor at the beginning and end of lines within the string,rather than just?
the beginning and end of the string. Perl allows us to choose between ignoring and paying?
attention to newlines by using the //s and //m modifiers. //s and //m stand for single line?
and multi-line and they determine whether a string is to be treated as one continuous string,helvetica; font-size:14px">or as a set of lines. The two modifiers affect two aspects of how the regexp is interpreted:?
1) how the '.' character class is defined,and?
2) where the anchors ^ and $ are able to match.?
将换行符排除在外是很方便的，因为我们在一行中进行计数和匹配通常都不需要换行符。
但是，有些应用需要将换行符包括进来。
甚至想将锚符号 ^ 和 $ 锚在包含字符串的行的开始和结尾，而不是字符串的开始和结尾。
通过修改饰符//s 和 //m 可以关闭和开启换行符的匹配。
这两个修饰符影响正则式的两个方面:
?1) '.' 字符类
?2) 锚符号 ^ 和 $
Here are the four possible combinations:
有下列四种可能的组合:
(//): ?no modifiers?
? ? ? ?Default behavior. ? ? ? ? ? ? ? ? ? ? ? ?默认行为?
? ? ? ?'.' matches any character except "n" . ?除"n"外的任意字符
? ? ? ? ^ ?matches only at the beginning of the string and ? ? ? ? 一行字符串的开始
? ? ? ? $ ?matches only at the end or before a newline at the end. 一行字符串的结尾
(//s): s modifier
? ? ? ?Treat string as a single long line. ? ? ?将字符串视为单一的长行
? ? ? ?'.' matches any character,even "n" . ? 包括"n"的任意字符
(//m): m modifier?
? ? ? ?Treat string as a set of multiple lines. 将字符串视为多行的集合?
? ? ? ? ^ ?match at the start of any line within the string ? ? ? ?字符串内任意行的开始 ? ? ? ? ?
? ? ? ? $ ?match at the end of any line within the string. ? ? ? ? 字符串内任意行的结尾
(//sm): both s and m modifiers ?
? ? ? ? Treat string as a single long line,? ? ?
? ? ? ? but detect multiple lines. ? ? ? ? ? ? ?将字符串视为单一长行，但进行多检测
? ? ? ? '.' matches any character,even "n" . ?包含"n"的任意字符
? ? ? ? ?^ ?match at the start of any line within the string ? ? 字符串内任意行的开始 ??
? ? ? ? ?$ ?match at the end of any line within the string. ? ? ?字符串内任意行的结尾
Here are examples of //s and //m in action:
下面是修饰符//s 和 //m 的应用示例:
? ? $x = "There once was a girlnWho programmed in Perln";
? ? $x =~ /^Who/; ? ? ? # doesn't match,"Who" not at start of string
? ? $x =~ /^Who/s; ? ? ?# doesn't match,helvetica; font-size:14px">? ? $x =~ /^Who/m; ? ? ?# matches,"Who" at start of second line
? ? $x =~ /^Who/sm; ? ? # matches,helvetica; font-size:14px">? ? $x =~ /girl.Who/; ? # doesn't match,"." doesn't match "n"
? ? $x =~ /girl.Who/s; ?# matches,"." matches "n"
? ? $x =~ /girl.Who/m; ?# doesn't match,helvetica; font-size:14px">? ? $x =~ /girl.Who/sm; # matches,helvetica; font-size:14px">Most of the time,the default behavior is what is wanted,but //s and //m are occasionally?
very useful. If //m is being used,the start of the string can still be matched with A and?
the end of the string can still be matched with the anchors Z (matches both the end and?
the newline before,like $ ),and z (matches only the end):
在使用 //m 时，还可以使用锚符号:
A ?: 匹配字符串的开始
Z ?: 匹配字符串的结尾，包括换行符
z ?: 仅匹配字符串的结尾
? ? $x =~ /^Who/m; ? # matches,helvetica; font-size:14px">? ? $x =~ /AWho/m; ?# doesn't match,"Who" is not at start of string
? ? $x =~ /girl$/m; ?# matches,"girl" at end of first line
? ? $x =~ /girlZ/m; # doesn't match,"girl" is not at end of string
? ? $x =~ /PerlZ/m; # matches,"Perl" is at newline before end
? ? $x =~ /Perlz/m; # doesn't match,"Perl" is not at end of string
We now know how to create choices among classes of characters in a regexp. What about choices?
among words or character strings? Such choices are described in the next section.
1.3 Matching this or that【匹配这个或那个】
Sometimes we would like our regexp to be able to match different possible words or?
character strings. This is accomplished by using the alternation metacharacter |.?
To match dog or cat,we form the regexp dog|cat . As before,Perl will try to match?
the regexp at the earliest possible point in the string. At each character position,helvetica; font-size:14px">Perl will first try to match the first alternative,dog . If dog doesn't match,Perl?
will then try the next alternative,cat . If cat doesn't match either,then the match?
fails and Perl moves to the next position in the string. Some examples:
| ?: 单词或字符串的选择元字符
? ? "cats and dogs" =~ /cat|dog|bird/; ?# matches "cat"
? ? "cats and dogs" =~ /dog|cat|bird/; ?# matches "cat"
Even though dog is the first alternative in the second regexp,cat is able to match?
earlier in the string.
? ? "cats" ? ? ? ? ?=~ /c|ca|cat|cats/; # matches "c"
? ? "cats" ? ? ? ? ?=~ /cats|cat|ca|c/; # matches "cats"
Here,all the alternatives match at the first string position,so the first alternative?
is the one that matches. If some of the alternatives are truncations of the others,put?
the longest ones first to give them a chance to match.
? ? "cab" =~ /a|b|c/ # matches "c"
? ? ? ? ? ? ? ? ? ? ?# /a|b|c/ == /[abc]/
The last example points out that character classes are like alternations of characters.?
At a given character position,the first alternative that allows the regexp match to?
succeed will be the one that matches.
1.4 Grouping things and hierarchical matching【分组和分层匹配】
Alternation allows a regexp to choose among alternatives,but by itself it is unsatisfying.?
The reason is that each alternative is a whole regexp,but sometime we want alternatives?
for just part of a regexp. For instance,suppose we want to search for housecats or?
housekeepers. The regexp housecat|housekeeper fits the bill,but is inefficient because?
we had to type house twice. It would be nice to have parts of the regexp be constant,helvetica; font-size:14px">like house,and some parts have alternatives,like cat|keeper .
选择元字符间都是正则式，还不能满足要求.
The grouping metacharacters () solve this problem. Grouping allows parts of a regexp?
to be treated as a single unit. Parts of a regexp are grouped by enclosing them in?
parentheses. Thus we could solve the housecat|housekeeper by forming the regexp as?
house(cat|keeper) . The regexp house(cat|keeper) means match house followed by either?
cat or keeper . Some more examples are
() ?: 分组元字符,可以将正则式的部分作为一个单元
? ? /(a|b)b/; ? ? ? ? ? ?# matches 'ab' or 'bb'
? ? /(ac|b)b/; ? ? ? ? ? # matches 'acb' or 'bb'
? ? /(^a|b)c/; ? ? ? ? ? # matches 'ac' at start of string or 'bc' anywhere
? ? /(a|[bc])d/; ? ? ? ? # matches 'ad','bd',or 'cd'
? ? /house(cat|)/; ? ? ? # matches either 'housecat' or 'house'
? ? /house(cat(s|)|)/; ? # matches either 'housecats' or 'housecat' or
? ? ? ? ? ? ? ? ? ? ? ? ?# 'house'. ?Note groups can be nested.
? ? /(19|20|)dd/; ? ? ?# match years 19xx,20xx,or the Y2K problem,xx
? ? "20" =~ /(19|20|)dd/; ?# matches the null alternative '()dd',
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# because '20dd' can't match
? ? ? ? ? ? ?# 正则式第二个选择匹配了字符串的20，但正则式剩下的dd无字符串匹配项，
? ? ? ? ? ? ?# 因此，Perl进行下一个选择项的匹配。
? ? ? ? ? ? ?# 它是一个为空的选择项，而正则式 ()dd 刚好匹配字符串。?
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?
Alternations behave the same way in groups as out of them: at a given string position,helvetica; font-size:14px">the leftmost alternative that allows the regexp to match is taken. So in the last example?
at the first string position,"20" matches the second alternative,but there is nothing?
left over to match the next two digits dd . So Perl moves on to the next alternative,helvetica; font-size:14px">which is the null alternative and that works,since "20" is two digits.
选择的行为和分组是一样的:
对于一个给定的字符串位置，从最左边的选择项开始进行匹配。
The process of trying one alternative,seeing if it matches,and moving on to the next?
alternative,while going back in the string from where the previous alternative was tried,helvetica; font-size:14px">if it doesn't,is called backtracking. The term 'backtracking' comes from the idea that?
matching a regexp is like a walk in the woods. Successfully matching a regexp is like?
arriving at a destination. There are many possible trailheads,one for each string position,helvetica; font-size:14px">and each one is tried in order,left to right. From each trailhead there may be many paths,helvetica; font-size:14px">some of which get you there,and some which are dead ends. When you walk along a trail and?
hit a dead end,you have to backtrack along the trail to an earlier point to try another?
trail. If you hit your destination,you stop immediately and forget about trying all the?
other trails. You are persistent,and only if you have tried all the trails from all the?
trailheads and not arrived at your destination,do you declare failure. To be concrete,helvetica; font-size:14px">here is a step-by-step analysis of what Perl does when it tries to match the regexp
这种尝试一个选择项，看其是否匹配，然后再进行下一个选择项的匹配，
如果不匹配，那么就回到前一个选择项尝试地方，叫做回溯法。
回溯这个词在正则匹配中很像林中漫步。成功地匹配一个正则式就像到达了一个目的地。
林中有很多可能的道路起点，就像每个字符串的位置，
然后从左到右，按顺序每个去尝试。
从每个道路起点出发，有很多条路，有些会去到这儿或那儿，有些是死路。
当沿着道路，到达一个死路，就需要沿着这条路回到起点去尝试另外一条路。
如果到达了目的地，就立即停止并不再尝试。
坚持地，只到所有道路尝试都失败后才声明失败。
为了更具体地说明这个过程，下面进行一步一步的示例说明:
? ? "abcde" =~ /(abd|abc)(df|d|de)/;
0
? Start with the first letter in the string 'a'.
? 从字符串的第一个字母'a'开始.
1
? Try the first alternative in the first group 'abd'.
? 对第一个分组的第一个选择项'abd'进行尝试匹配
2
? Match 'a' followed by 'b'. So far so good.
? 匹配了'a'和'b'。
3
? 'd' in the regexp doesn't match 'c' in the string - a dead end. So backtrack two characters?
? and pick the second alternative in the first group 'abc'.
? 正则式中的'd'不匹配字符串的'c' -- 这是条死路。因此回溯两个字符并从第一个分组中选取第二个选择项
4
? Match 'a' followed by 'b' followed by 'c'. We are on a roll and have satisfied the first?group.?
? Set $1 to 'abc'.
? 匹配了'abc'. 满足了第一个分组，所以将$1 = 'abc'。
5
? Move on to the second group and pick the first alternative 'df'.
? 开始第二个分组的第一个选项'df'。
6
? Match the 'd'.
? 匹配'd'。
7
? 'f' in the regexp doesn't match 'e' in the string,so a dead end. Backtrack one character?
? and pick the second alternative in the second group 'd'.
? 'f'不匹配，开始第二选项'd'
8
? 'd' matches. The second grouping is satisfied,so set $2 to 'd'.
? 'd'匹配，第二分组匹配成功，将$2 = 'd'。
9
? We are at the end of the regexp,so we are done! We have matched 'abcd' out of the string?
"abcde".
? 现在到了正则式的最后，匹配结束，匹配为'abcd'。
There are a couple of things to note about this analysis. First,the third alternative in?
the second group 'de' also allows a match,but we stopped before we got to it - at a given?
character position,leftmost wins. Second,we were able to get a match at the first character?
position of the string 'a'. If there were no matches at the first position,Perl would move?
to the second character position 'b' and attempt the match all over again. Only when all?
possible paths at all possible character positions have been exhausted does Perl give up?
and declare $string =~ /(abd|abc)(df|d|de)/; to be false.
上面的分析有两点要注意的:
? A: 第二个分组的第三个选项'de'同样能获得匹配，但在这之前匹配已结束 --?
? ? ?对于给定的字符位置，最左的获胜.
? B: 正则式可以在字符串的第一个字符'a'的位置获得匹配。
? ? ?如果在第一个字符位置未获得匹配，Perl将移到字符串的第二个字符'b'处再尝试,以此推进。
只有当所有可能的路径都失败后，结果才为假.
? ? ?
Even with all this work,regexp matching happens remarkably fast. To speed things up,helvetica; font-size:14px">Perl compiles the regexp into a compact sequence of opcodes that can often fit inside a?
processor cache. When the code is executed,these opcodes can then run at full throttle?
and search very quickly.
正则匹配经过了优化，速度很快。
1.5 Extracting matches【提取匹配】
The grouping metacharacters () also serve another completely different function:?
they allow the extraction of the parts of a string that matched. This is very useful to?
find out what matched and for text processing in general. For each grouping,the part?
that matched inside goes into the special variables $1,$2,etc. They can be used?
just as ordinary variables:
分组元字符()还另一个功能:
?将匹配的字符从字符串中提取出来。
如上面讲到的$1,$2，它们可以当做普通变量使用。
? ? # extract hours,minutes,seconds
? ? if ($time =~ /(dd):(dd):(dd)/) { ? ?# match hh:mm:ss format
? ? ? ? ? $hours ? = $1;
? ? ? ? ??$minutes = $2;
? ? ? ? ? $seconds = $3;
? ? }
or false value. In list context,it returns the list of matched values ($1,$3) .?
So we could write the code more compactly as
上面的代码还可以简写如下:
? ? ($hours,$minutes,$second) = ($time =~ /(dd):(dd):(dd)/);
If the groupings in a regexp are nested,$1 gets the group with the leftmost opening?parenthesis,helvetica; font-size:14px">$2 the next opening parenthesis,etc. Here is a regexp with nested groups:
如果正则式中的分组是嵌套的，则$1 是最左的括号匹配项，$2 是下一个括号匹配项。
如下所示
? ? /(ab(cd|ef)((gi)|j))/;
? ? ?1 ?2 ? ? ?34
If this regexp matches,helvetica; font-size:14px">$1 contains a string starting with 'ab',helvetica; font-size:14px">$2 is either set to 'cd' or 'ef',helvetica; font-size:14px">$3 equals either 'gi' or 'j',helvetica; font-size:14px">$4 is either set to 'gi',just like $3,or it remains undefined.
For convenience,Perl sets $+ to the string held by the highest numbered $1,...?
that got assigned (and,somewhat related,$^N to the value of the $1,helvetica; font-size:14px">most-recently assigned; i.e. the $1,... associated with the rightmost closing parenthesis?
used in the match).
$+ ?指最高序号的变量。
1.6 Backreferences【反向引用】
Closely associated with the matching variables $1,... are the backreferences?
g1,g2,... Backreferences are simply matching variables that can be used inside a regexp.?
This is a really nice feature; what matches later in a regexp is made to depend on?
what matched earlier in the regexp. Suppose we wanted to look for doubled words in a text,helvetica; font-size:14px">like 'the the'. The following regexp finds all 3-letter doubles with a space in between:
反向引用: 后一个正则式的匹配内容依赖于前一个正则式的匹配结果。
如寻找像'the the'这样的字符串 -- 后一个正则式是找和前一个相同的三个字符项:
? ? /b(www)sg1b/;
The grouping assigns a value to g1,so that the same 3-letter sequence is used for both parts.
A similar task is to find words consisting of two identical parts:
分组赋值给g1， 因此，相同的三个字符序列用于这两个部分,示例如下:
? ? % simple_grep '^(wwww|www|ww|w)g1$' /usr/dict/words
? ? beriberi
? ? booboo
? ? coco
? ? mama
? ? murmur
? ? papa
The regexp has a single grouping which considers 4-letter combinations,then 3-letter?combinations,helvetica; font-size:14px">?etc.,and uses g1 to look for a repeat. Although $1 and g1 represent the same thing,helvetica; font-size:14px">care should be taken to use matched variables $1,... only outside a regexp and?
backreferences g1,... only inside a regexp; not doing so may lead to surprising and?
unsatisfactory results.
1.7 Relative backreferences【相对反向引用】
Counting the opening parentheses to get the correct number for a backreference is error-prone?
as soon as there is more than one capturing group. A more convenient technique became?
available with Perl 5.10: relative backreferences. To refer to the immediately preceding?
capture group one now may write g{-1},the next but last is available via g{-2},and so on.
当有多个分组时，计算开括号的反向引用正确序号很容易出错，更方便使用的方法是:
相对反向引用: 指立即处理前一个获得匹配的分组，写为g{-1}， 前第二个用g{-2}。
Another good reason in addition to readability and maintainability for using?
relative backreferences is illustrated by the following example,where a simple pattern?
for matching peculiar strings is used:
如下面的例子:
? ? $a99a = '([a-z])(d)g2g1'; ? # matches a11a,g22g,x33x,helvetica; font-size:14px">Now that we have this pattern stored as a handy string,we might feel tempted to use it?
as a part of some other pattern:
? ? $line = "code=e99e";
? ? if ($line =~ /^(w+)=$a99a$/){ ? # unexpected behavior!
? ? ? ? print "$1 is validn";
? ? } else {
? ? ? ? print "bad line: '$line'n";
But this doesn't match,at least not the way one might expect. Only after inserting?
the interpolated $a99a and looking at the resulting full text of the regexp is it obvious?
that the backreferences have backfired. The subexpression (w+) has snatched number 1 and?
demoted the groups in $a99a by one rank. This can be avoided by using relative backreferences:
? ? $a99a = '([a-z])(d)g{-1}g{-2}'; ?# safe for being interpolated
上面的代码并不会按照想要的方式工作，因为(w+)的匹配项才是$1,所以这时用相对反向引用式更方便。
1.8 Named backreferences【命名反向引用】
Perl 5.10 also introduced named capture groups and named backreferences. To attach a name?
to a capturing group,you write either (?<name>...) or (?'name'...). The backreference may?
then be written as g{name} . It is permissible to attach the same name to more than one group,helvetica; font-size:14px">but then only the leftmost one of the eponymous set can be referenced. Outside of the pattern?
a named capture group is accessible through the %+ hash.
Perl 5.10还引入了可命名的分组和可命名的反向引用。
命名分组语法:?
? ? (?<name>...) 或 (?'name'...);
命名反向引用语法:
? ? g{name}
它允许对多个分组使用同一个命名，但只有最左的名称被使用。
外部使用命名分组的语法:
? ? %+ 哈希
Assuming that we have to match calendar dates which may be given in one of the three?
formats yyyy-mm-dd,mm/dd/yyyy or dd.mm.yyyy,we can write three suitable patterns?
where we use 'd','m' and 'y' respectively as the names of the groups capturing the?
pertaining components of a date. The matching operation combines the three patterns?
as alternatives:
使用示例如下:
? ? $fmt1 = '(?<y>dddd)-(?<m>dd)-(?<d>dd)';
? ? $fmt2 = '(?<m>dd)/(?<d>dd)/(?<y>dddd)';
? ? $fmt3 = '(?<d>dd).(?<m>dd).(?<y>dddd)';
? ? for my $d qw( 2006-10-21 15.01.2007 10/31/2005 ){
? ? ? ? if ( $d =~ m{$fmt1|$fmt2|$fmt3} ) # 有任何一个选择项匹配，都会赋值到%+的键值对
? ? ? ? {
? ? ? ? ? ? print "day=$+{d} month=$+{m} year=$+{y}n";
? ? ? ? }
If any of the alternatives matches,the hash %+ is bound to contain the three key-value pairs.
1.9 Alternative capture group numbering【可选择的分组序号】
Yet another capturing group numbering technique (also as from Perl 5.10) deals with the problem?
of referring to groups within a set of alternatives. Consider a pattern for matching a time of?
the day,civil or military style:
可以对分组使用选择:
? ? if ( $time =~ /(dd|d):(dd)|(dd)(dd)/ ){
? ? ? ? # process hour and minute
Processing the results requires an additional if statement to determine whether $1 and $2 or $3?
and $4 contain the goodies. It would be easier if we could use group numbers 1 and 2 in second?
alternative as well,and this is exactly what the parenthesized construct (?|...),set around?
an alternative achieves. Here is an extended version of the previous pattern:
? ? if ( $time =~ /(?|(dd|d):(dd)|(dd)(dd))s+([A-Z][A-Z][A-Z])/ ){
print "hour=$1 minute=$2 zone=$3n";
Within the alternative numbering group,group numbers start at the same position for each?
alternative. After the group,numbering continues with one higher than the maximum reached?
across all the alternatives.
1.10 Position information【位置信息】
In addition to what was matched,Perl (since 5.6.0) also provides the positions of what was?
matched as contents of the @- and @+ arrays. $-[0] is the position of the start of the entire
match and $+[0] is the position of the end. Similarly,$-[n] is the position of the start of?
the $n match and $+[n] is the position of the end. If $n is undefined,so are $-[n] and $+[n] .?
Then this code
Perl除了提供匹配内容外，还通过数组 @- 和 @+ 提供的匹配的位置信息:
$-[0] ?: ?整个匹配结果在字符串中的起始位置
$-[n] ?: ?第 $n 个匹配结果在字符串中的起始位置
$+[0] ?: ?整个匹配结果在字符串中的结束位置
$+[n] ?: ?第 $n 个匹配结果在字符串中的结束位置
示例代码如下:
? ? $x = "Mmm...donut,thought Homer";
? ? $x =~ /^(Mmm|Yech)...(donut|peas)/; # matches
? ? foreach $expr (1..$#-) {
? ? ? ? print "Match $expr: '${$expr}' at position ($-[$expr],$+[$expr])n";
prints
输出:
? ? Match 1: 'Mmm' at position (0,3)
? ? Match 2: 'donut' at position (6,11)
Even if there are no groupings in a regexp,it is still possible to find out what exactly?
matched in a string. If you use them,Perl will set $` to the part of the string before the?
will set $& to the part of the string that matched,and will set $' to the part of the string?
after the match. An example:
即使不在正则式中使用分组,同样能在字符串中找到正确的匹配:
$` ?: 匹配内容之前的字符串内容
$& ?: 匹配内容
$' ?: 匹配内容之后的字符串内容
? ? $x = "the cat caught the mouse";
? ? $x =~ /cat/; ?# $` = 'the ',$& = 'cat',$' = ' caught the mouse'
? ? $x =~ /the/; ?# $` = '',$& = 'the',$' = ' cat caught the mouse'
In the second match,$` equals '' because the regexp matched at the first character position?
in the string and stopped; it never saw the second 'the'. It is important to note that using $`?
and $' slows down regexp matching quite a bit,while $& slows it down to a lesser extent,helvetica; font-size:14px">because if they are used in one regexp in a program,they are generated for all regexps?
in the program. So if raw performance is a goal of your application,they should be avoided.?
If you need to extract the corresponding substrings,use @- and @+ instead:
$` 和 $' 的匹配会很慢，如果程序对性能的要求很高，就不要用两个变量，
可以使用 @- 和 @+ 代替,如下所示:
? ? $` is the same as substr( $x,$-[0] )
? ? $& is the same as substr( $x,$-[0],$+[0]-$-[0] )
? ? $' is the same as substr( $x,$+[0] )
As of Perl 5.10,the ${^PREMATCH},${^MATCH} and ${^POSTMATCH} variables may be used.?
These are only set if the /p modifier is present. Consequently they do not penalize the rest of?
the program.
1.11 Non-capturing groupings【未捕捉分组】
A group that is required to bundle a set of alternatives may or may not be useful as?
a capturing group. If it isn't,it just creates a superfluous addition to the set of?
available capture group values,inside as well as outside the regexp. Non-capturing groupings,helvetica; font-size:14px">denoted by (?:regexp),still allow the regexp to be treated as a single unit,helvetica; font-size:14px">but don't establish a capturing group at the same time. Both capturing and non-capturing?
groupings are allowed to co-exist in the same regexp. Because there is no extraction,helvetica; font-size:14px">non-capturing groupings are faster than capturing groupings. Non-capturing groupings?
are also handy for choosing exactly which parts of a regexp are to be extracted to?
matching variables:
在正则式的外部， 可以通过(?:regexp)来获得未捕捉分组。
捕捉分组和未捕捉分组可以在同一个正则式中使用。
? ? # match a number,$1-$4 are set,but we only want $1
? ? /([+-]? *(d+(.d*)?|.d+)([eE][+-]?d+)?)/;
? ? # match a number faster,only $1 is set
? ? /([+-]? *(?:d+(?:.d*)?|.d+)(?:[eE][+-]?d+)?)/;
? ? /([+-]? *(?:d+(?:.d*)?|.d+)(?:[eE]([+-]?d+))?)/;
Non-capturing groupings are also useful for removing nuisance elements gathered from?
a split operation where parentheses are required for some reason:
未捕捉分组可以用来做排除作业:
? ? $x = '12aba34ba5';
? ? @num = split /(a|b)+/,$x; ? ?# @num = ('12','a','34','5')
? ? @num = split /(?:a|b)+/,$x; ?# @num = ('12',helvetica; font-size:14px">1.12 Matching repetitions【匹配竞争】
The examples in the previous section display an annoying weakness. We were only matching?
3-letter words,or chunks of words of 4 letters or less. We'd like to be able to match words or,helvetica; font-size:14px">more generally,strings of any length,without writing out tedious alternatives?
like wwww|www|ww|w .
前面的示例有个不足的地方是只会生成最左的匹配项，而且都是一个字符一个字符的。
This is exactly the problem the quantifier metacharacters ?,*,+,and {} were created for.?
They allow us to delimit the number of repeats for a portion of a regexp we consider to be a?match.?
Quantifiers are put immediately after the character,character class,or grouping that we want?to?
specify. They have the following meanings:
要想解决这个问题，就要使用量词元字符:
? : ?匹配一次或零次;
* : ?匹配零次或任意次;
+ : ?匹配一次或任意次;
{}: ?匹配指定的次数,51)">它们是用来限制匹配项重复的个数，量词放在字符，字符类，或分组之后，如下所示:
a? means: match 'a' 1 or 0 times
a* means: match 'a' 0 or more times,any number of times
a+ means: match 'a' 1 or more times,at least once
a{n,m} means: match at least n times,but not more than m times.
a{n} means: match exactly n times
Here are some examples:
示例如下:?
? ? /[a-z]+s+d*/; ? ? ? ? ? ? ?# match a lowercase word,at least one space,and
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# any number of digits
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# 匹配一个小写字符，至少一个空格，和任意个数字
? ? /(w+)s+g1/; ? ? ? ? ? ? ? # match doubled words of arbitrary length
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# 匹配任意长的双单词
? ? /y(es)?/i; ? ? ? ? ? ? ? ? ? # matches 'y','Y',or a case-insensitive 'yes'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# 匹配'y',或区分大小写的'yes'。
? ? $year =~ /^d{2,4}$/; ? ? ? ?# make sure year is at least 2 but not more than 4 digits
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# 确保年份至少是2个但不多于4个数字
? ? $year =~ /^d{4}$|^d{2}$/; ?# better match; throw out 3-digit dates
? ? $year =~ /^d{2}(d{2})?$/; ?# same thing written differently. However,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# this captures the last two digits in $1
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# and the other does not.
? ? % simple_grep '^(w+)g1$' /usr/dict/words ? # isn't this easier?
For all of these quantifiers,Perl will try to match as much of the string as possible,helvetica; font-size:14px">while still allowing the regexp to succeed. Thus with /a?.../,Perl will first try to?
match the regexp with the a present; if that fails,Perl will try to match the regexp?
without the a present. For the quantifier *,we get the following:
对于这些量词，Perl会匹配尽可能多的字符串，如 ? 会先行匹配看a是否出现。
* 的匹配示例如下:
? ? $x = "the cat in the hat";
? ? $x =~ /^(.*)(cat)(.*)$/; # matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $1 = 'the '
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $2 = 'cat'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $3 = ' in the hat'
Which is what we might expect,the match finds the only cat in the string and locks onto it.
Consider,this regexp:
? ? $x =~ /^(.*)(at)(.*)$/; # matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'the cat in the h'
? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'at'
? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = '' ? (0 characters match)
One might initially guess that Perl would find the at in cat and stop there,but that?
wouldn't give the longest possible string to the first quantifier .*. Instead,the first
quantifier .* grabs as much of the string as possible while still having the regexp match.?
In this example,that means having the at sequence with the final at in the string.?
The other important principle illustrated here is that,when there are two or more elements?
in a regexp,the leftmost quantifier,if there is one,gets to grab as much of the string?
as possible,leaving the rest of the regexp to fight over scraps. Thus in our example,helvetica; font-size:14px">the first quantifier .* grabs most of the string,while the second quantifier .* gets?
the empty string. Quantifiers that grab as much of the string as possible are called?
maximal match or greedy quantifiers.
上面的结果出现的原因，是会对第一个量词.*进行尽可能长的匹配。
When a regexp can match a string in several different ways,we can use the principles above?
to predict which way the regexp will match:
当一个正则式可以以多个不同的方式字符串时，需要遵守下列原则:
Principle 0: Taken as a whole,any regexp will be matched at the earliest possible position?
? ? ? ? ? ? ?in the string.
? ? ? ? ? ? ?作为一个整体，正则式会从字符串最左的位置开始匹配
Principle 1: In an alternation a|b|c...,the leftmost alternative that allows a match for?
? ? ? ? ? ? ?the whole regexp will be the one used.
? ? ? ? ? ? ?对于选择项，最左的成功匹配选择项会使用
Principle 2: The maximal matching quantifiers ?,+ and {n,m} will in general match as?
? ? ? ? ? ? ?much of the string as possible while still allowing the whole regexp to match.
? ? ? ? ? ? ?对量词会使用最大的可能的匹配项
Principle 3: If there are two or more elements in a regexp,the leftmost greedy quantifier,helvetica; font-size:14px">? ? ? ? ? ? ?if any,will match as much of the string as possible while still allowing?
? ? ? ? ? ? ?the whole regexp to match. The next leftmost greedy quantifier,if any,helvetica; font-size:14px">? ? ? ? ? ? ?will try to match as much of the string remaining available to it as possible,helvetica; font-size:14px">? ? ? ? ? ? ?while still allowing the whole regexp to match. And so on,until all the regexp?
? ? ? ? ? ? ?elements are satisfied.
? ? ? ? ? ? ?如果有两个或多个元素，最左的优先匹配，但整体项都有匹配会是最高级的。
As we have seen above,Principle 0 overrides the others. The regexp will be matched?
as early as possible,with the other principles determining how the regexp matches at?
that earliest character position.
Here is an example of these principles in action:
下面有例子来说明这些原则:
? ? $x = "The programming republic of Perl";
? ? $x =~ /^(.+)(e|r)(.*)$/; ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'The programming republic of Pe'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'r'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = 'l'
This regexp matches at the earliest string position,'T' . One might think that e,being?
leftmost in the alternation,would be matched,but r produces the longest string in?
the first quantifier.
? ? $x =~ /(m{1,2})(.*)$/; ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'mm'
? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'ing republic of Perl'
quantifier,so it gets to match a maximal mm .
? ? $x =~ /.*(m{1,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'm'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'ing republic of Perl'
possible,leaving just a single 'm' for the second quantifier m{1,2}.
? ? $x =~ /(.?)(m{1,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'a'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'mm'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = 'ing republic of Perl'
'a' in programming,leaving m{1,2} the opportunity to match both m's.?
Finally,helvetica; font-size:14px">? ? "aXXXb" =~ /(X*)/; # matches with $1 = ''
because it can match zero copies of 'X' at the beginning of the string. If you definitely?
want to match at least one 'X',use X+,not X* .
Sometimes greed is not good. At times,we would like quantifiers to match a minimal piece of?
string,rather than a maximal piece. For this purpose,Larry Wall created the minimal match?
or non-greedy quantifiers ??,*?,+?,and {}?. These are the usual quantifiers with a ??
appended to them. They have the following meanings:
还有最小匹配原则的量词:
a?? means: ? match 'a' 0 or 1 times. Try 0 first,then 1.
a*? means: ? match 'a' 0 or more times,any number of times,but as few times as possible
a+? means: ? match 'a' 1 or more times,at least once,m}? means: match at least n times,not more than m times,as few times as possible
a{n}? ? means: match exactly n times. Because we match exactly n times,a{n}? is equivalent?
? ? ? ? ? ? ? ?to a{n} and is just there for notational consistency.
Let's look at the example above,but with minimal quantifiers:
来看一些最小优先匹配的量词示例:
? ? $x =~ /^(.+?)(e|r)(.*)$/; # matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'Th'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'e'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = ' programming republic of Perl'
The minimal string that will allow both the start of the string ^ and the alternation to?
match is Th,with the alternation e|r matching e . The second quantifier .* is free to?
gobble up the rest of the string.
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'ming republic of Perl'
The first string position that this regexp can match is at the first 'm' in programming .?
At this position,the minimal m{1,2}? matches just one 'm' . Although the second quantifier?
.*? would prefer to match no characters,it is constrained by the end-of-string anchor $?
to match the rest of the string.
? ? $x =~ /(.*?)(m{1,2}?)(.*)$/; ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $1 = 'The progra'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $2 = 'm'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = 'ming republic of Perl'
In this regexp,you might expect the first minimal quantifier .*? to match the empty string,helvetica; font-size:14px">because it is not constrained by a ^ anchor to match the beginning of the word. Principle 0?
applies here,however. Because it is possible for the whole regexp to match at the start of?
the string,it will match at the start of the string. Thus the first quantifier has to match
everything up to the first m. The second minimal quantifier matches just one m and the third?
quantifier matches the rest of the string.
? ? $x =~ /(.??)(m{1,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $1 = 'a'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $2 = 'mm'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $3 = 'ing republic of Perl'
Just as in the previous regexp,the first quantifier .?? can match earliest at position 'a',helvetica; font-size:14px">so it does. The second quantifier is greedy,so it matches mm,and the third matches?
the rest of the string.
We can modify principle 3 above to take into account non-greedy quantifiers:
原则3要修改如下:
? ? ? ? ? ? ?quantifier,will match as much (little) of the string as possible while
? ? ? ? ? ? ?still allowing the whole regexp to match. The next leftmost greedy (non-greedy)
? ? ? ? ? ? ?available to it as possible,while still allowing the whole regexp to match.?
? ? ? ? ? ? ?And so on,until all the regexp elements are satisfied.
Just like alternation,quantifiers are also susceptible to backtracking.?
Here is a step-by-step analysis of the example
和选择项一样，量词也使用回溯泽,示例如下:
? ? ? ? ? ? ? ? ? ? ? ? ? ? # $3 = '' ? (0 matches)
? Start with the first letter in the string 't'.
? The first quantifier '.*' starts out by matching the whole string 'the cat in the hat'.
? 'a' in the regexp element 'at' doesn't match the end of the string. Backtrack one character.
? 'a' in the regexp element 'at' still doesn't match the last letter of the string 't',so ?backtrack one more character.
? Now we can match the 'a' and the 't'.
? Move on to the third element '.*'. Since we are at the end of the string and '.*' can?
? match 0 times,assign it the empty string.
? We are done!
is fast. There are some pathological regexps,whose execution time exponentially?
grows with the size of the string. A typical structure that blows up in your face is of?
the form
? ? /(a|b+)*/;
The problem is the nested indeterminate quantifiers. There are many different ways of?
partitioning a string of length n between the + and * : one repetition with b+ of length n,helvetica; font-size:14px">two repetitions with the first b+ length k and the second with length n-k,m repetitions?
whose bits add up to length n,etc. In fact there are an exponential number of ways to?
partition a string as a function of its length. A regexp may get lucky and match early in?
the process,but if there is no match,Perl will try every possibility before giving up.?
So be careful with nested * 's,{n,m}'s,and + 's. The book Mastering Regular Expressions?
by Jeffrey Friedl gives a wonderful discussion of this and other efficiency issues.
嵌套式的量词很复杂，更多的内容再去找些书吧
1.14 Possessive quantifiers【所有格量词】
Backtracking during the relentless search for a match may be a waste of time,particularly?
when the match is bound to fail. Consider the simple pattern
回溯法在搜索时会有一些时间开销
? ? /^w+s+w+$/; # a word,spaces,a word
Whenever this is applied to a string which doesn't quite meet the pattern's expectations?
such as "abc " or "abc def ",the regex engine will backtrack,approximately once for each
character in the string. But we know that there is no way around taking all of the initial?
word characters to match the first repetition,that all spaces must be eaten by the middle?
part,and the same goes for the second word.
With the introduction of the possessive quantifiers in Perl 5.10,we have a way of?
instructing the regex engine not to backtrack,with the usual quantifiers with?
a + appended to them. This makes them greedy as well as stingy; once they succeed they?
won't give anything back to permit another solution. They have the following meanings:
所有格量词 + ， 让匹配次数尽可能多和匹配结果尽可能长
? ? ? ? ? ? ? ?and don't give anything up. a?+ is short for a{0,1}+
? ? ? ? ? ? ? ?anything up. a*+ is short for a{0,}+ and a++ is short for a{1,}+ .
a{n}+ ? means: match exactly n times. It is just there for notational consistency.
These possessive quantifiers represent a special case of a more general concept,helvetica; font-size:14px">the independent subexpression,see below.
As an example where a possessive quantifier is suitable we consider matching a quoted string,helvetica; font-size:14px">as it appears in several programming languages. The backslash is used as an escape character
that indicates that the next character is to be taken literally,as another character?
for the string. Therefore,after the opening quote,we expect a (possibly empty) sequence?
of alternatives:?
所有格量词很适合多语言的引用字符串:
either some character except an unescaped quote or backslash or an escaped character.
? ? /"(?:[^"]++|.)*+"/;
1.15 Building a regexp【构建正则式】
At this point,we have all the basic regexp concepts covered,so let's give a more involved?
example of a regular expression. We will build a regexp that matches numbers.
The first task in building a regexp is to decide what we want to match and what we want to?
exclude. In our case,we want to match both integers and floating point numbers and we want to?
reject any string that isn't a number.
首先，确定需求:
在我们的例子中，我们需要匹配整数和浮点数，将不是数字的字符串排除在外.
The next task is to break the problem down into smaller problems that are easily converted?
into a regexp.
接着，将问题进行分类细化，以利于正则式处理。
The simplest case is integers. These consist of a sequence of digits,with an optional
sign in front. The digits we can represent with d+ and the sign can be matched with [+-] .?
Thus the integer regexp is
最简单的情况是整数:?
由可选的正负号 -- ?[+-]? 和
数字序列 ? ? ? -- ?d+ ?组成,所以正则式如下:
? ? /[+-]?d+/; ? ? ?# matches integers
A floating point number potentially has a sign,an integral part,a decimal point,a fractional?
different possibilities. Floating point numbers which are in proper form include 123.,0.345,helvetica; font-size:14px">.34,-1e6,and 25.4E-72. As with integers,the sign out front is completely optional and can be?
matched by [+-]?. We can see that if there is no exponent,floating point numbers must have a?
decimal point,otherwise they are integers. We might be tempted to model these with d*.d*,helvetica; font-size:14px">but this would also match just a single decimal point,which is not a number. So the three cases?
of floating point number without exponent are
浮点数通常由 正负符号，整数部分，一个小数点，小数部分 和 指数 组成,这些部分有些是可选的，
因此要分析这些不同的组合。
浮点数包括有: 123.,.34,25.4E-72.
对于整数部分，正负符号是可选的，使用正则式 [+-]?
如果没有指数，浮点数必须有一个小数点，否则就是整数。
先将正则式设成 d*.d*,但是这个正则式会匹配只有单个小数点，无数字的情况。
因此，三种不带指数的浮点数是:
? ?/[+-]?d+./; ? ? # 1.,321.,helvetica; font-size:14px">? ?/[+-]?.d+/; ? ? # .1,.234,helvetica; font-size:14px">? ?/[+-]?d+.d+/; ?# 1.0,30.56,helvetica; font-size:14px">These can be combined into a single regexp with a three-way alternation:
可以将上面的三种分类组合成一个有三选项的正则式，如下:
? ?/[+-]?(d+.d+|d+.|.d+)/; ?# floating point,no exponent
In this alternation,it is important to put 'd+.d+' before 'd+.' . If 'd+.' were first,helvetica; font-size:14px">the regexp would happily match that and ignore the fractional part of the number.
Now consider floating point numbers with exponents. The key observation here is that both?
integers and numbers with decimal points are allowed in front of an exponent. Then exponents,helvetica; font-size:14px">like the overall sign,are independent of whether we are matching numbers with or without?
decimal points,and can be 'decoupled' from the mantissa. The overall form of the regexp now?
becomes clear:
在上面的选择中，将'd+.d+'放在'd+'之前很重要。
如果将'd+'放在第一个选择，正则式将会失败或忽略小数部分。
? ? /^(optional sign)(integer | f.p. mantissa)(optional exponent)$/;
The exponent is an e or E,followed by an integer. So the exponent regexp is
指数部分是由 e 或 E,后跟一个正数组成,正则式如下:
? ?/[eE][+-]?d+/; ?# exponent
Putting all the parts together,we get a regexp that matches numbers:
将所有的这些组合在一起:
? ?/^[+-]?(d+.d+|d+.|.d+|d+)([eE][+-]?d+)?$/; ?# Ta da!
Long regexps like this may impress your friends,but can be hard to decipher. In complex?
situations like this,the //x modifier for a match is invaluable. It allows one to put nearly?
arbitrary whitespace and comments into a regexp without affecting their meaning. Using it,helvetica; font-size:14px">we can rewrite our 'extended' regexp in the more pleasing form
很长的表达式很难看，可以用如下的分层方式:
? ? ? /^
? ? ? ? ? ? [+-]? ? ? ? ? # first,match an optional sign
? ? ? ? ? ? ( ? ? ? ? ? ? # then match integers or f.p. mantissas:
? ? ? ? ? ? ? ? ? ?d+.d+ ?# mantissa of the form a.b
? ? ? ? ? ? ? ? ? |d+. ? ? # mantissa of the form a.
? ? ? ? ? ? ? ? ? |.d+ ? ? # mantissa of the form .b
? ? ? ? ? ? ? ? ? |d+ ? ? ? # integer of the form a
? ? ? ? ? ? )
? ? ? ? ? ? ([eE][+-]?d+)? ?# finally,optionally match an exponent
? ? ? $/x;
If whitespace is mostly irrelevant,how does one include space characters in an extended regexp??
The answer is to backslash it ' ' or put it in a character class [ ] . The same thing goes for?
pound signs: use # or [#]. For instance,Perl allows a space between the sign and the mantissa?
or integer,and we could add this to our regexp as follows:
空格有时会在符号之后使用，正则式可用 ' ' 或 [ ] 表示，修改后如下:
? ? ? /^
? ? ? ? ? ? [+-]? * ? ? ?# first,match an optional sign *and space*
? ? ? ? ? ? ( ? ? ? ? ? ? # then match integers or f.p. mantissas:
? ? ? ? ? ? ? ? ? ?d+.d+ ?# mantissa of the form a.b
? ? ? ? ? ? ? ? ? |d+. ? ? # mantissa of the form a.
? ? ? ? ? ? ? ? ? |.d+ ? ? # mantissa of the form .b
? ? ? ? ? ? ? ? ? |d+ ? ? ? # integer of the form a
? ? ? ? ? ? )
? ? ? ? ? ? ([eE][+-]?d+)? ?# finally,optionally match an exponent
? ? ? $/x;
In this form,it is easier to see a way to simplify the alternation. Alternatives 1,2,and 4?
all start with d+,so it could be factored out:
可以将选项1， 2， 4进行合并优化后，修改如下:
? ?/^
? ? ? ? ? ? ? ? ? ? d+ ? ? ? # start out with a ...
? ? ? ? ? ? ? ? ? ? (
? ? ? ? ? ? ? ? ? ? ? ? ? ? .d* # mantissa of the form a.b or a.
? ? ? ? ? ? ? ? ? ? )? ? ? ? ?# ? takes care of integers of the form a
or written in the compact form,helvetica; font-size:14px">最后的格式
? ? /^[+-]? *(d+(.d*)?|.d+)([eE][+-]?d+)?$/;
This is our final regexp. To recap,we built a regexp by
正则式构建过程:
A. ?specifying the task in detail,? ? ? ? ? ? ? ?分析需求
B. ?breaking down the problem into smaller parts,划分问题
C. ?translating the small parts into regexps,? ? 转换
D. ?combining the regexps,? ? ? ? ? ? ? ? ? ? ? ?结合?
E. ?and optimizing the final combined regexp. ? ? 优化
These are also the typical steps involved in writing a computer program. This makes perfect?
sense,because regular expressions are essentially programs written in a little computer?
language that specifies patterns.
1.16 Using regular expressions in Perl【Perl中使用正则表达式】
The last topic of Part 1 briefly covers how regexps are used in Perl programs. Where do?
they fit into Perl syntax?
We have already introduced the matching operator in its default /regexp/ and arbitrary delimiter
?m!regexp! forms. We have used the binding operator =~ and its negation !~ to test for string?
matches. Associated with the matching operator,we have discussed the?
?single line //s,? 单行
?multi-line //m,? ?多行
?case-insensitive //i 区分大小写 and?
?extended //x ? ? ? ?扩展modifiers.?
There are a few more things you might want to know about matching operators.
1.16.1 Prohibiting substitution【禁用代替】
If you change $pattern after the first substitution happens,Perl will ignore it. If you don't?
want any substitutions at all,use the special delimiter m'':
在第一个代替之后使用了模式，将会被忽略，否则使用m''分隔符:
? ? @pattern = ('Seuss');
? ? while (<>) {
? ? ? ? print if m'@pattern'; ?# matches literal '@pattern',not 'Seuss'
Similar to strings,m'' acts like apostrophes on a regexp; all other m delimiters act like?
quotes. If the regexp evaluates to the empty string,the regexp in the last successful match is?
used instead. So we have
? ? "dog" =~ /d/; ?# 'd' matches
? ? "dogbert =~ //; ?# this matches the 'd' regexp used before
1.16.2 Global matching【全局匹配】
The final two modifiers we will discuss here,//g and //c,concern multiple matches. The?
modifier //g stands for global matching and allows the matching operator to match within a?
string as many times as possible. In scalar context,successive invocations against a string?
will have //g jump from match to match,keeping track of position in the string as it goes?
along. You can get or set the position with the pos() function.
//g 和 pos() 一起配合使用，能搜索整个文本
The use of //g is shown in the following example. Suppose we have a string that consists of?
words separated by spaces. If we know how many words there are in advance,we could extract?
the words using groupings:
? ? $x = "cat dog house"; # 3 words
? ? $x =~ /^s*(w+)s+(w+)s+(w+)s*$/; # matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $1 = 'cat'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $2 = 'dog'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $3 = 'house'
But what if we had an indeterminate number of words? This is the sort of task //g was made for.?
To extract all words,form the simple regexp (w+) and loop over all matches with /(w+)/g :
? ? while ($x =~ /(w+)/g) {
? ? ? ? print "Word is $1,ends at position ",pos $x,"n";
? ? Word is cat,ends at position 3
? ? Word is dog,ends at position 7
? ? Word is house,ends at position 13
A failed match or changing the target string resets the position. If you don't want the?
position reset after failure to match,add the //c,as in /regexp/gc . The current position?
in the string is associated with the string,not the regexp. This means that different strings?
have different positions and their respective positions can be set or read independently.
In list context,//g returns a list of matched groupings,or if there are no groupings,a list?
of matches to the whole regexp. So if we wanted just the words,we could use
如果不想在匹配失败后重置搜索位置，可以添加//c 修饰符，如 /regexp/gc。
? ? @words = ($x =~ /(w+)/g); ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $words[0] = 'cat'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $words[1] = 'dog'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $words[2] = 'house'
Closely associated with the //g modifier is the G anchor. The G anchor matches at the point?
where the previous //g match left off. G allows us to easily do context-sensitive matching:
? ? $metric = 1; ?# use metric units
? ? ...
? ? $x = <FILE>; ?# read in measurement
? ? $x =~ /^([+-]?d+)s*/g; ?# get magnitude
? ? $weight = $1;
? ? if ($metric) { # error checking
? ? ? ? print "Units error!" unless $x =~ /Gkg./g;
? ? else {
? ? ? ? print "Units error!" unless $x =~ /Glbs./g;
? ? $x =~ /Gs+(widget|sprocket)/g; ?# continue processing
The combination of //g and G allows us to process the string a bit at a time and use arbitrary?
Perl logic to decide what to do next. Currently,the G anchor is only fully supported when used?
to anchor to the start of the pattern.
G is also invaluable in processing fixed-length records with regexps. Suppose we have a snippet?
of coding region DNA,encoded as base pair letters ATCGTTGAAT... and we want to find all the?
stop codons TGA . In a coding region,codons are 3-letter sequences,so we can think of the DNA?
snippet as a sequence of 3-letter records. The naive regexp
? ? # expanded,this is "ATC GTT GAA TGC AAA TGA CAT GAC"
? ? $dna = "ATCGTTGAATGCAAATGACATGAC";
? ? $dna =~ /TGA/;
doesn't work; it may match a TGA,but there is no guarantee that the match is aligned with?
codon boundaries,the substring GTT GAA gives a match. A better solution is
? ? while ($dna =~ /(www)*?TGA/g) { ?# note the minimal *?
? ? ? ? print "Got a TGA stop codon at position ",pos $dna,helvetica; font-size:14px">which prints
? ? Got a TGA stop codon at position 18
? ? Got a TGA stop codon at position 23
Position 18 is good,but position 23 is bogus. What happened?
The answer is that our regexp works well until we get past the last real match. Then the regexp?
will fail to match a synchronized TGA and start stepping ahead one character position at a time,helvetica; font-size:14px">not what we want. The solution is to use G to anchor the match to the codon alignment:
? ? while ($dna =~ /G(www)*?TGA/g) {
This prints
which is the correct answer. This example illustrates that it is important not only to match?
what is desired,but to reject what is not desired.
(There are other regexp modifiers that are available,such as //o,but their specialized uses?
are beyond the scope of this introduction. )
1.16.3 Search and replace【搜索并替换】
Regular expressions also play a big role in search and replace operations in Perl. Search and?
replace is accomplished with the s/// operator. The general form is?
搜索替换的语法:
? s/regexp/replacement/modifiers,helvetica; font-size:14px">with everything we know about regexps and modifiers applying in?
this case as well. The replacement is a Perl double-quoted string that replaces in the string?
whatever is matched with the regexp . The operator =~ is also used here to associate a string?
with s///. If matching against $_,the $_ =~ can be dropped. If there is a match,s/// returns?
the number of substitutions made; otherwise it returns false. Here are a few examples:
s///返回替换的个数。示例如下:
? ? $x = "Time to feed the cat!";
? ? $x =~ s/cat/hacker/; ? # $x contains "Time to feed the hacker!"
? ? if ($x =~ s/^(Time.*hacker)!$/$1 now!/) {
? ? ? ? $more_insistent = 1;
? ? $y = "'quoted words'";
? ? $y =~ s/^'(.*)'$/$1/; ?# strip single quotes,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ?# $y contains "quoted words"
In the last example,the whole string was matched,but only the part inside the single quotes?
was grouped. With the s/// operator,the matched variables $1,etc. are immediately?
available for use in the replacement expression,so we use $1 to replace the quoted string with?
just what was quoted. With the global modifier,s///g will search and replace all occurrences of?
the regexp in the string:
? ? $x = "I batted 4 for 4";
? ? $x =~ s/4/four/; ? # doesn't do it all:
? ? ? ? ? ? ? ? ? ? ? ?# $x contains "I batted four for 4"
? ? $x =~ s/4/four/g; ?# does it all:
? ? ? ? ? ? ? ? ? ? ? ?# $x contains "I batted four for four"
If you prefer 'regex' over 'regexp' in this tutorial,you could use the following program to?
replace it:
? ? % cat > simple_replace
? ? #!/usr/bin/perl
? ? $regexp = shift;
? ? $replacement = shift;
? ? ? ? s/$regexp/$replacement/g;
? ? ? ? print;
? ? ^D
? ? % simple_replace regexp regex perlretut.pod
In simple_replace we used the s///g modifier to replace all occurrences of the regexp on each?
line. (Even though the regular expression appears in a loop,Perl is smart enough to compile it?
only once.) As with simple_grep,both the print and the s/$regexp/$replacement/g use $_?
implicitly.
If you don't want s/// to change your original variable you can use the non-destructive?
substitute modifier,s///r. This changes the behavior so that s///r returns the final?
substituted string (instead of the number of substitutions):
s///r : 不替换，只进行替换的测试:
? ? $x = "I like dogs.";
? ? $y = $x =~ s/dogs/cats/r;
? ? print "$x $yn";
That example will print "I like dogs. I like cats". Notice the original $x variable has not been?
affected. The overall result of the substitution is instead stored in $y . If the substitution?
doesn't affect anything then the original string is returned:
? ? $y = $x =~ s/elephants/cougars/r;
? ? print "$x $yn"; # prints "I like dogs. I like dogs."
One other interesting thing that the s///r flag allows is chaining substitutions:
? ? $x = "Cats are great.";
? ? print $x =~ s/Cats/Dogs/r =~ s/Dogs/Frogs/r =~ s/Frogs/Hedgehogs/r,helvetica; font-size:14px">? ? # prints "Hedgehogs are great."
A modifier available specifically to search and replace is the s///e evaluation modifier. s///e?
treats the replacement text as Perl code,rather than a double-quoted string. The value that the?
code returns is substituted for the matched substring. s///e is useful if you need to do a bit?
of computation in the process of replacing text. This example counts character frequencies in a?
line:
s///e ?: 进行替换测试
? ? $x = "Bill the cat";
? ? $x =~ s/(.)/$chars{$1}++;$1/eg; ?# final $1 replaces char with itself
? ? print "frequency of '$_' is $chars{$_}n"
? ? ? ? foreach (sort {$chars{$b} <=> $chars{$a}} keys %chars);
? ? frequency of ' ' is 2
? ? frequency of 't' is 2
? ? frequency of 'l' is 2
? ? frequency of 'B' is 1
? ? frequency of 'c' is 1
? ? frequency of 'e' is 1
? ? frequency of 'h' is 1
? ? frequency of 'i' is 1
? ? frequency of 'a' is 1
As with the match m// operator,s/// can use other delimiters,such as s!!! and s{}{},and even?
s{}//. If single quotes are used s''',then the regexp and replacement are treated as single-
quoted strings and there are no variable substitutions. s/// in list context returns the same?
thing as in scalar context,the number of matches.
1.16.4 The split function【切分函数】
The split() function is another place where a regexp is used. split /regexp/,string,limit?
separates the string operand into a list of substrings and returns that list. The regexp must be?
designed to match whatever constitutes the separators for the desired substrings. The limit,if?
present,constrains splitting into no more than limit number of strings. For example,to split a?
string into words,use
将字符串切分成单词:?
? ? $x = "Calvin and Hobbes";
? ? @words = split /s+/,$x; ?# $word[0] = 'Calvin'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $word[1] = 'and'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $word[2] = 'Hobbes'
If the empty regexp // is used,the regexp always matches and the string is split into?
individual characters. If the regexp has groupings,then the resulting list contains the matched?
substrings from the groupings as well. For instance,helvetica; font-size:14px">使用空正则式，会将字符串切分成单个字符。
如果使用分组，则会得到各个子串如下:
? ? $x = "/usr/bin/perl";
? ? @dirs = split m!/!,$x; ?# $dirs[0] = ''
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $dirs[1] = 'usr'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $dirs[2] = 'bin'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $dirs[3] = 'perl'
? ? @parts = split m!(/)!,$x; ?# $parts[0] = ''
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[1] = '/'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[2] = 'usr'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[3] = '/'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[4] = 'bin'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[5] = '/'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # $parts[6] = 'perl'
Since the first character of $x matched the regexp,split prepended an empty initial element to?
the list.
If you have read this far,congratulations! You now have all the basic tools needed to use?
regular expressions to solve a wide range of text processing problems. If this is your first?
time through the tutorial,why not stop here and play around with regexps a while.... Part 2?
concerns the more esoteric aspects of regular expressions and those concepts certainly aren't?
needed right at the start.
2. Part 2: Power tools【强大的工具】
OK,you know the basics of regexps and you want to know more. If matching regular expressions?
is analogous to a walk in the woods,then the tools discussed in Part 1 are analogous to topo maps?
and a compass,basic tools we use all the time. Most of the tools in part 2 are analogous to?
flare guns and satellite phones. They aren't used too often on a hike,but when we are stuck,helvetica; font-size:14px">they can be invaluable.

What follows are the more advanced,less used,or sometimes esoteric capabilities of Perl?
regexps. In Part 2,we will assume you are comfortable with the basics and concentrate on the?
advanced features.
2.1 More on characters,strings,and character classes
There are a number of escape sequences and character classes that we haven't covered yet.
There are several escape sequences that convert characters or strings between upper and lower?
case,and they are also available within patterns. l and u convert the next character to lower?
or upper case,respectively:
l ?: 将下个字符转换成小写
u ?: 将下个字符转换成大写
? ? $x = "perl";
? ? $string =~ /u$x/; ?# matches 'Perl' in $string
? ? $x = "M(rs?|s)."; # note the double backslash
? ? $string =~ /l$x/; ?# matches 'mr.','mrs.',and 'ms.',helvetica; font-size:14px">A L or U indicates a lasting conversion of case,until terminated by E or thrown over by?
another U or L :
L ?: 持续转换的起始
E ?: 持续转换的结束
? ? $x = "This word is in lower case:L SHOUTE";
? ? $x =~ /shout/; ? ? ? # matches
? ? $x = "I STILL KEYPUNCH CARDS FOR MY 360"
? ? $x =~ /Ukeypunch/; ?# matches punch card string
If there is no E,case is converted until the end of the string. The regexps Lu$word or?
uL$word convert the first character of $word to uppercase and the rest of the characters to?
lowercase.
Control characters can be escaped with c,so that a control-Z character would be matched with?
cZ . The escape sequence Q ...E quotes,or protects most non-alphabetic characters. For?
instance,51)">c ?: 避开 Ctrl
cZ : 避开 Ctrl-Z.
下面对非字母字符的保护:
? ? $x = "QThat !^*&%~& cat!";
? ? $x =~ /Q!^*&%~&E/; ? ? # check for rough language
It does not protect $ or @,so that variables can still be substituted.
Q,L,l,U,u and E are actually part of double-quotish syntax,and not part of regexp?
syntax proper. They will work if they appear in a regular expression embedded directly in a?
program,but not when contained in a string that is interpolated in a pattern.

With the advent of 5.6.0,Perl regexps can handle more than just the standard ASCII character?
set. Perl now supports Unicode,a standard for representing the alphabets from virtually all of?
the world's written languages,and a host of symbols. Perl's text strings are Unicode strings,helvetica; font-size:14px">so they can contain characters with a value (codepoint or character number) higher than 255.

What does this mean for regexps? Well,regexp users don't need to know much about Perl's?
internal representation of strings. But they do need to know 1) how to represent Unicode?
characters in a regexp and 2) that a matching operation will treat the string to be searched as?
a sequence of characters,not bytes. The answer to 1) is that Unicode characters greater than?
chr(255) are represented using the x{hex} notation,because x hex (without curly braces)?
doesn't go further than 255. (Starting in Perl 5.14,if you're an octal fan,you can also use?
o{oct} .)
? ? /x{263a}/; ?# match a Unicode smiley face :)
NOTE: In Perl 5.6.0 it used to be that one needed to say use utf8 to use any Unicode features.?
This is no more the case: for almost all Unicode processing,the explicit utf8 pragma is not?
needed. (The only case where it matters is if your Perl script is in Unicode and encoded in UTF
-8,then an explicit use utf8 is needed.)

Figuring out the hexadecimal sequence of a Unicode character you want or deciphering someone?
else's hexadecimal Unicode regexp is about as much fun as programming in machine code. So?
another way to specify Unicode characters is to use the named character escape sequence N
{name}. name is a name for the Unicode character,as specified in the Unicode standard. For?
could use
Unicode字符中的十六进制序列的处理:
? ? $x = "abcN{MERCURY}def";
? ? $x =~ /N{MERCURY}/; ? # matches
One can also use "short" names:
? ? print "N{GREEK SMALL LETTER SIGMA} is called sigma.n";
? ? print "N{greek:Sigma} is an upper-case sigma.n";
You can also restrict names to a certain alphabet by specifying the charnames pragma:
? ? use charnames qw(greek);
? ? print "N{sigma} is Greek sigman";
An index of character names is available on-line from the Unicode Consortium,helvetica; font-size:14px">http://www.unicode.org/charts/charindex.html; explanatory material with links to other resources?
at http://www.unicode.org/standard/where.
The answer to requirement 2) is,as of 5.6.0,that a regexp (mostly) uses Unicode characters.?
(The "mostly" is for messy backward compatibility reasons,but starting in Perl 5.14,any regex?
compiled in the scope of a use feature 'unicode_strings' (which is automatically turned on?
within the scope of a use 5.012 or higher) will turn that "mostly" into "always". If you want to?
handle Unicode properly,you should ensure that 'unicode_strings' is turned on.) Internally,helvetica; font-size:14px">this is encoded to bytes using either UTF-8 or a native 8 bit encoding,depending on the history?
tutorial about that.
Let us now discuss Unicode character classes. Just as with Unicode characters,there are named?
Unicode character classes represented by the p{name} escape sequence. Closely associated is the?
P{name} character class,which is the negation of the p{name} class. For example,to match?
lower and uppercase characters,helvetica; font-size:14px">? ? $x = "BOB";
? ? $x =~ /^p{IsUpper}/; ? # matches,uppercase char class
? ? $x =~ /^P{IsUpper}/; ? # doesn't match,char class sans uppercase
? ? $x =~ /^p{IsLower}/; ? # doesn't match,lowercase char class
? ? $x =~ /^P{IsLower}/; ? # matches,char class sans lowercase
(The "Is" is optional.)
Here is the association between some Perl named classes and the traditional Unicode classes:
? ? Perl class name ?Unicode class name or regular expression
? ? IsAlpha ? ? ? ? ?/^[LM]/
? ? IsAlnum ? ? ? ? ?/^[LMN]/
? ? IsASCII ? ? ? ? ?$code <= 127
? ? IsCntrl ? ? ? ? ?/^C/
? ? IsBlank ? ? ? ? ?$code =~ /^(0020|0009)$/ || /^Z[^lp]/
? ? IsDigit ? ? ? ? ?Nd
? ? IsGraph ? ? ? ? ?/^([LMNPS]|Co)/
? ? IsLower ? ? ? ? ?Ll
? ? IsPrint ? ? ? ? ?/^([LMNPS]|Co|Zs)/
? ? IsPunct ? ? ? ? ?/^P/
? ? IsSpace ? ? ? ? ?/^Z/ || ($code =~ /^(0009|000A|000B|000C|000D)$/
? ? IsSpacePerl ? ? ?/^Z/ || ($code =~ /^(0009|000A|000C|000D|0085|2028|2029)$/
? ? IsUpper ? ? ? ? ?/^L[ut]/
? ? IsWord ? ? ? ? ? /^[LMN]/ || $code eq "005F"
? ? IsXDigit ? ? ? ? $code =~ /^00(3[0-9]|[46][1-6])$/
You can also use the official Unicode class names with p and P,like p{L} for Unicode?
'letters',p{Lu} for uppercase letters,or P{Nd} for non-digits. If a name is just one letter,helvetica; font-size:14px">the braces can be dropped. For instance,pM is the character class of Unicode 'marks',for?
example accent marks. For the full list see perlunicode.

Unicode has also been separated into various sets of characters which you can test with p{...}?
(in) and P{...} (not in). To test whether a character is (or is not) an element of a script you?
would use the script name,for example p{Latin},p{Greek},or P{Katakana} .

What we have described so far is the single form of the p{...} character classes. There is also?
a compound form which you may run into. These look like p{name=value} or p{name:value} (the?
equals sign and colon can be used interchangeably). These are more general than the single form,helvetica; font-size:14px">and in fact most of the single forms are just Perl-defined shortcuts for common compound forms.?
For example,the script examples in the previous paragraph could be written equivalently as p
{Script=Latin},p{Script:Greek},and P{script=katakana} (case is irrelevant between the {}?
braces). You may never have to use the compound forms,but sometimes it is necessary,and their?
use can make your code easier to understand.
X is an abbreviation for a character class that comprises a Unicode extended grapheme cluster.?

This represents a "logical character": what appears to be a single character,but may be?
represented internally by more than one. As an example,using the Unicode full names,A +?
COMBINING RING is a grapheme cluster with base character A and combining character COMBINING?
RING,which translates in Danish to A with the circle atop it,as in the word Angstrom.
For the full and latest information about Unicode see the latest Unicode standard,or the?
Unicode Consortium's website http://www.unicode.org
As if all those classes weren't enough,Perl also defines POSIX-style character classes. These?
have the form [:name:],with name the name of the POSIX class. The POSIX classes are alpha,helvetica; font-size:14px">alnum,ascii,cntrl,digit,graph,lower,print,punct,space,upper,and xdigit,helvetica; font-size:14px">two extensions,word (a Perl extension to match w ),and blank (a GNU extension). The //a?
modifier restricts these to matching just in the ASCII range; otherwise they can match the same?
as their corresponding Perl Unicode classes: [:upper:] is the same as p{IsUpper},etc. (There?
are some exceptions and gotchas with this; see perlrecharclass for a full discussion.) The?
[:digit:],[:word:],and [:space:] correspond to the familiar d,w,and s character?
classes. To negate a POSIX class,put a ^ in front of the name,so that,[:^digit:]?
corresponds to D and,under Unicode,P{IsDigit} . The Unicode and POSIX character classes can?
be used just like d,with the exception that POSIX character classes can only be used inside?
of a character class:
? ? /s+[abc[:digit:]xyz]s*/; ?# match a,b,c,x,y,z,or a digit
? ? /^=items[[:digit:]]/; ? ? ?# match '=item',helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # followed by a space and a digit
? ? /s+[abcp{IsDigit}xyz]s+/; ?# match a,helvetica; font-size:14px">? ? /^=itemsp{IsDigit}/; ? ? ? ?# match '=item',helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # followed by a space and a digit
Whew! That is all the rest of the characters and character classes.
2.2 Compiling and saving regular expressions【编译和保存正则式】
In Part 1 we mentioned that Perl compiles a regexp into a compact sequence of opcodes. Thus,a?
compiled regexp is a data structure that can be stored once and used again and again. The regexp?
quote qr// does exactly that: qr/string/ compiles the string as a regexp and transforms the?
result into a form that can be assigned to a variable:
? ? $reg = qr/foo+bar?/; ?# reg contains a compiled regexp
Then $reg can be used as a regexp:
? ? $x = "fooooba";
? ? $x =~ $reg; ? ? # matches,just like /foo+bar?/
? ? $x =~ /$reg/; ? # same thing,alternate form
$reg can also be interpolated into a larger regexp:
? ? $x =~ /(abc)?$reg/; ?# still matches
As with the matching operator,the regexp quote can use different delimiters,qr!!,qr{}?
or qr~~. Apostrophes as delimiters (qr'') inhibit any interpolation.
Pre-compiled regexps are useful for creating dynamic matches that don't need to be recompiled?
each time they are encountered. Using pre-compiled regexps,we write a grep_step program which?
greps for a sequence of patterns,advancing to the next pattern as soon as one has been?
satisfied.
? ? % cat > grep_step
? ? # grep_step - match <number> regexps,one after the other
? ? # usage: multi_grep <number> regexp1 regexp2 ... file1 file2 ...
? ? $number = shift;
? ? $regexp[$_] = shift foreach (0..$number-1);
? ? @compiled = map qr/$_/,@regexp;
? ? while ($line = <>) {
? ? ? ? if ($line =~ /$compiled[0]/) {
? ? ? ? ? ? print $line;
? ? ? ? ? ? shift @compiled;
? ? ? ? ? ? last unless @compiled;
? ? % grep_step 3 shift print last grep_step
Storing pre-compiled regexps in an array @compiled allows us to simply loop through the regexps?
without any recompilation,thus gaining flexibility without sacrificing speed.
2.3 Composing regular expressions at runtime【运行时组成正则式】
Backtracking is more efficient than repeated tries with different regular expressions. If there?
are several regular expressions and a match with any of them is acceptable,then it is possible?
to combine them into a set of alternatives. If the individual expressions are input data,this?
can be done by programming a join operation. We'll exploit this idea in an improved version of?
the simple_grep program: a program that matches multiple patterns:
? ? % cat > multi_grep
? ? # multi_grep - match any of <number> regexps
? ? $pattern = join '|',helvetica; font-size:14px">? ? ? ? print $line if $line =~ /$pattern/;
? ? % multi_grep 2 shift for multi_grep
Sometimes it is advantageous to construct a pattern from the input that is to be analyzed and?
use the permissible values on the left hand side of the matching operations. As an example for?
this somewhat paradoxical situation,let's assume that our input contains a command verb which?
should match one out of a set of available command verbs,with the additional twist that?
commands may be abbreviated as long as the given string is unique. The program below?
demonstrates the basic algorithm.
? ? % cat > keymatch
? ? $kwds = 'copy compare list print';
? ? while( $command = <> ){
? ? ? ? $command =~ s/^s+|s+$//g; ?# trim leading and trailing spaces
? ? ? ? if( ( @matches = $kwds =~ /b$commandw*/g ) == 1 ){
? ? ? ? ? ? print "command: '@matches'n";
? ? ? ? } elsif( @matches == 0 ){
? ? ? ? ? ? print "no such command: '$command'n";
? ? ? ? } else {
? ? ? ? ? ? print "not unique: '$command' (could be one of: @matches)n";
? ? % keymatch
? ? li
? ? command: 'list'
? ? co
? ? not unique: 'co' (could be one of: copy compare)
? ? printer
? ? no such command: 'printer'
Rather than trying to match the input against the keywords,we match the combined set of?
keywords against the input. The pattern matching operation $kwds =~ /b($commandw*)/g does?
several things at the same time. It makes sure that the given command begins where a keyword?
begins (b ). It tolerates abbreviations due to the added w* . It tells us the number of?
matches (scalar @matches ) and all the keywords that were actually matched. You could hardly ask?
for more.
2.4 Embedding comments and modifiers in a regular expression【在正则式中嵌入注释和修饰】
Starting with this section,we will be discussing Perl's set of extended patterns. These are?
extensions to the traditional regular expression syntax that provide powerful new tools for?
pattern matching. We have already seen extensions in the form of the minimal matching constructs?
??,m}?,and {n,}?. Most of the extensions below have the form (?char...),where?
the char is a character that determines the type of extension.

The first extension is an embedded comment (?#text). This embeds a comment into the regular?
expression without affecting its meaning. The comment should not have any closing parentheses in?
the text. An example is
? ? /(?# Match an integer:)[+-]?d+/;
This style of commenting has been largely superseded by the raw,freeform commenting that is?
allowed with the //x modifier.
Most modifiers,such as //i,//m,//s and //x (or any combination thereof) can also be?
embedded in a regexp using (?i),(?m),(?s),and (?x). For instance,helvetica; font-size:14px">? ? /(?i)yes/; ?# match 'yes' case insensitively
? ? /yes/i; ? ? # same thing
? ? /(?x)( ? ? ?# freeform version of an integer regexp
? ? ? ? ? ?[+-]? ?# match an optional sign
? ? ? ? ? ?d+ ? ?# match a sequence of digits
? ? ? ? ?)
? ? /x;
Embedded modifiers can have two important advantages over the usual modifiers. Embedded?
modifiers allow a custom set of modifiers to each regexp pattern. This is great for matching an?
array of regexps that must have different modifiers:
? ? $pattern[0] = '(?i)doctor';
? ? $pattern[1] = 'Johnson';
? ? ? ? foreach $patt (@pattern) {
? ? ? ? ? ? print if /$patt/;
The second advantage is that embedded modifiers (except //p,which modifies the entire regexp)?
only affect the regexp inside the group the embedded modifier is contained in. So grouping can?
be used to localize the modifier's effects:
? ? /Answer: ((?i)yes)/; ?# matches 'Answer: yes','Answer: YES',helvetica; font-size:14px">Embedded modifiers can also turn off any modifiers already present by using,(?-i).?
Modifiers can also be combined into a single expression,(?s-i) turns on single line mode?
and turns off case insensitivity.
Embedded modifiers may also be added to a non-capturing grouping. (?i-m:regexp) is a non-
capturing grouping that matches regexp case insensitively and turns off multi-line mode.
2.5 Looking ahead and looking behind【向前找和向后找】
This section concerns the lookahead and lookbehind assertions. First,a little background.
In Perl regular expressions,most regexp elements 'eat up' a certain amount of string when they?
match. For instance,the regexp element [abc}] eats up one character of the string when it?
matches,in the sense that Perl moves to the next character position in the string after the
match. There are some elements,that don't eat up characters (advance the character?
position) if they match. The examples we have seen so far are the anchors. The anchor ^ matches?
the beginning of the line,but doesn't eat any characters. Similarly,the word boundary anchor?
b matches wherever a character matching w is next to a character that doesn't,but it doesn't?
at up any characters itself. Anchors are examples of zero-width assertions: zero-width,because?
they consume no characters,and assertions,because they test some property of the string. In?
the context of our walk in the woods analogy to regexp matching,most regexp elements move us?
along a trail,but anchors have us stop a moment and check our surroundings. If the local?
environment checks out,we can proceed forward. But if the local environment doesn't satisfy us,helvetica; font-size:14px">we must backtrack.
Checking the environment entails either looking ahead on the trail,looking behind,or both. ^?
looks behind,to see that there are no characters before. $ looks ahead,to see that there are?
no characters after. b looks both ahead and behind,to see if the characters on either side?
differ in their "word-ness".

The lookahead and lookbehind assertions are generalizations of the anchor concept. Lookahead and?
lookbehind are zero-width assertions that let us specify which characters we want to test for.??
The lookahead assertion is denoted by (?=regexp) and the lookbehind assertion is denoted by (?
<=fixed-regexp). Some examples are
? ? $x = "I catch the housecat 'Tom-cat' with catnip";
? ? $x =~ /cat(?=s)/; ? # matches 'cat' in 'housecat'
? ? @catwords = ($x =~ /(?<=s)catw+/g); ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $catwords[0] = 'catch'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# $catwords[1] = 'catnip'
? ? $x =~ /bcatb/; ?# matches 'cat' in 'Tom-cat'
? ? $x =~ /(?<=s)cat(?=s)/; # doesn't match; no isolated 'cat' in
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # middle of $x
Note that the parentheses in (?=regexp) and (?<=regexp) are non-capturing,since these are zero
-width assertions. Thus in the second regexp,the substrings captured are those of the whole?
regexp itself. Lookahead (?=regexp) can match arbitrary regexps,but lookbehind (?<=fixed-
regexp) only works for regexps of fixed width,a fixed number of characters long. Thus (?
<=(ab|bc)) is fine,but (?<=(ab)*) is not. The negated versions of the lookahead and lookbehind?
assertions are denoted by (?!regexp) and (?<!fixed-regexp) respectively. They evaluate true if?
the regexps do not match:
? ? $x = "foobar";
? ? $x =~ /foo(?!bar)/; ?# doesn't match,'bar' follows 'foo'
? ? $x =~ /foo(?!baz)/; ?# matches,'baz' doesn't follow 'foo'
? ? $x =~ /(?<!s)foo/; ?# matches,there is no s before 'foo'
The C is unsupported in lookbehind,because the already treacherous definition of C would?
become even more so when going backwards.
Here is an example where a string containing blank-separated words,numbers and single dashes is?
to be split into its components. Using /s+/ alone won't work,because spaces are not required?
between dashes,or a word or a dash. Additional places for a split are established by looking?
ahead and behind:
? ? $str = "one two - --6-8";
? ? @toks = split / s+ ? ? ? ? ? ? ?# a run of spaces
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? | (?<=S) (?=-) ? ?# any non-space followed by '-'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? | (?<=-) ?(?=S) ? # a '-' followed by any non-space
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? /x,$str; ? ? ? ? ?# @toks = qw(one two - - - 6 - 8)
?
2.6 Using independent subexpressions to prevent backtracking【使用独立的子表达式】
Independent subexpressions are regular expressions,in the context of a larger regular?
expression,that function independently of the larger regular expression. That is,they consume?
as much or as little of the string as they wish without regard for the ability of the larger?
regexp to match. Independent subexpressions are represented by (?>regexp). We can illustrate?
their behavior by first considering an ordinary regexp:
? ? $x = "ab";
? ? $x =~ /a*ab/; ?# matches
This obviously matches,but in the process of matching,the subexpression a* first grabbed the a?
. Doing so,wouldn't allow the whole regexp to match,so after backtracking,a*?
eventually gave back the a and matched the empty string. Here,what a* matched was dependent on?
what the rest of the regexp matched.
?
Contrast that with an independent subexpression:
? ? $x =~ /(?>a*)ab/; ?# doesn't match!
The independent subexpression (?>a*) doesn't care about the rest of the regexp,so it sees an a?
and grabs it. Then the rest of the regexp ab cannot match. Because (?>a*) is independent,there?
is no backtracking and the independent subexpression does not give up its a . Thus the match of?
the regexp as a whole fails. A similar behavior occurs with completely independent regexps:
? ? $x =~ /a*/g; ? # matches,eats an 'a'
? ? $x =~ /Gab/g; # doesn't match,no 'a' available
Here //g and G create a 'tag team' handoff of the string from one regexp to the other. Regexps?
with an independent subexpression are much like this,with a handoff of the string to the?
independent subexpression,and a handoff of the string back to the enclosing regexp.
?
The ability of an independent subexpression to prevent backtracking can be quite useful. Suppose?
we want to match a non-empty string enclosed in parentheses up to two levels deep. Then the?
following regexp matches:
? ? $x = "abc(de(fg)h"; ?# unbalanced parentheses
? ? $x =~ /( ( [^()]+ | ([^()]*) )+ )/x;
The regexp matches an open parenthesis,one or more copies of an alternation,and a close?
parenthesis. The alternation is two-way,with the first alternative [^()]+ matching a substring?
with no parentheses and the second alternative ([^()]*) matching a substring delimited by?
parentheses. The problem with this regexp is that it is pathological: it has nested?
indeterminate quantifiers of the form (a+|b)+. We discussed in Part 1 how nested quantifiers?
like this could take an exponentially long time to execute if there was no match possible. To?
prevent the exponential blowup,we need to prevent useless backtracking at some point. This can?
be done by enclosing the inner quantifier as an independent subexpression:
? ? $x =~ /( ( (?>[^()]+) | ([^()]*) )+ )/x;
string as possible and keeping it. Then match failures fail much more quickly.
2.7 Conditional expressions【条件表达式】
A conditional expression is a form of if-then-else statement that allows one to choose which?
patterns are to be matched,based on some condition. There are two types of conditional?
expression: (?(condition)yes-regexp) and (?(condition)yes-regexp|no-regexp). (?(condition)yes-
regexp) is like an 'if () {}' statement in Perl. If the condition is true,the yes-regexp will?
be matched. If the condition is false,the yes-regexp will be skipped and Perl will move onto?
the next regexp element. The second form is like an 'if () {} else {}' statement in Perl. If the?
condition is true,the yes-regexp will be matched,otherwise the no-regexp will be matched.
?
The condition can have several forms. The first form is simply an integer in parentheses?
(integer) . It is true if the corresponding backreference integer matched earlier in the?
regexp. The same thing can be done with a name associated with a capture group,written as?
(<name>) or ('name') . The second form is a bare zero-width assertion (?...),either a?
lookahead,a lookbehind,or a code assertion (discussed in the next section). The third set of?
forms provides tests that return true if the expression is executed within a recursion ((R) ) or?
is being called from some capturing group,referenced either by number ((R1),(R2),...) or by?
name ((R&name) ).
The integer or name form of the condition allows us to choose,with more flexibility,what to?
match based on what matched earlier in the regexp. This searches for words of the form "$x$x" or?
"$x$y$y$x" :
? ? % simple_grep '^(w+)(w+)?(?(2)g2g1|g1)$' /usr/dict/words
? ? couscous
? ? deed
? ? toot
? ? toto
? ? tutu
The lookbehind condition allows,along with backreferences,an earlier part of the match to?
influence a later part of the match. For instance,helvetica; font-size:14px">? ? /[ATGC]+(?(?<=AA)G|C)$/;
matches a DNA sequence such that it either ends in AAG,or some other base pair combination and?
C . Note that the form is (?(?<=AA)G|C) and not (?((?<=AA))G|C); for the lookahead,lookbehind?
or code assertions,the parentheses around the conditional are not needed.
?
2.8 Defining named patterns【定义模式】
Some regular expressions use identical subpatterns in several places. Starting with Perl 5.10,helvetica; font-size:14px">it is possible to define named subpatterns in a section of the pattern so that they can be?
called up by name anywhere in the pattern. This syntactic pattern for this definition group is?
(?(DEFINE)(?<name>pattern)...). An insertion of a named pattern is written as (?&name).
The example below illustrates this feature using the pattern for floating point numbers that was?
presented earlier on. The three subpatterns that are used more than once are the optional sign,helvetica; font-size:14px">the digit sequence for an integer and the decimal fraction. The DEFINE group at the end of the?
pattern contains their definition. Notice that the decimal fraction pattern is the first place?
where we can reuse the integer pattern.
? ?/^ (?&osg) * ( (?&int)(?&dec)? | (?&dec) )
? ? ? ? ? ? (?: [eE](?&osg)(?&int) )?
? ? ? ? $
? ? ? ? (?(DEFINE)
? ? ? ? ? ? (?<osg>[-+]?) ? ? ? ? # optional sign
? ? ? ? ? ? (?<int>d++) ? ? ? ? ?# integer
? ? ? ? ? ? (?<dec>.(?&int)) ? ? # decimal fraction
? ? ? ? )/x
2.9 Recursive patterns【递归模式】
This feature (introduced in Perl 5.10) significantly extends the power of Perl's pattern?
matching. By referring to some other capture group anywhere in the pattern with the construct?
(?group-ref),the pattern within the referenced group is used as an independent subpattern in?
place of the group reference itself. Because the group reference may be contained within the?
group it refers to,it is now possible to apply pattern matching to tasks that hitherto required?
a recursive parser.
?
To illustrate this feature,we'll design a pattern that matches if a string contains a?
palindrome. (This is a word or a sentence that,while ignoring spaces,interpunctuation and?
string containing just one word character is a palindrome. Otherwise it must have a word?
character up front and the same at its end,with another palindrome in between.
? ? /(?: (w) (?...Here be a palindrome...) g{-1} | w? )/x
Adding W* at either end to eliminate what is to be ignored,we already have the full pattern:
? ? my $pp = qr/^(W* (?: (w) (?1) g{-1} | w? ) W*)$/ix;
? ? for $s ( "saippuakauppias","A man,a plan,a canal: Panama!" ){
? ? ? ? print "'$s' is a palindromen" if $s =~ /$pp/;
In (?...) both absolute and relative backreferences may be used. The entire pattern can be?
reinserted with (?R) or (?0). If you prefer to name your groups,you can use (?&name) to recurse?
into that group.
2.10 A bit of magic: executing Perl code in a regular expression【在正则式中执行代码】
Normally,regexps are a part of Perl expressions. Code evaluation expressions turn that around?
by allowing arbitrary Perl code to be a part of a regexp. A code evaluation expression is?
denoted (?{code}),with code a string of Perl statements.
?
Be warned that this feature is considered experimental,and may be changed without notice.
Code expressions are zero-width assertions,and the value they return depends on their?
environment. There are two possibilities: either the code expression is used as a conditional in?
a conditional expression (?(condition)...),or it is not. If the code expression is a?
conditional,the code is evaluated and the result (i.e.,the result of the last statement) is?
used to determine truth or falsehood. If the code expression is not used as a conditional,the?
assertion always evaluates true and the result is put into the special variable $^R . The?
variable $^R can then be used in code expressions later in the regexp. Here are some silly?
examples:
? ? $x = "abcdef";
? ? $x =~ /abc(?{print "Hi Mom!";})def/; # matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# prints 'Hi Mom!'
? ? $x =~ /aaa(?{print "Hi Mom!";})def/; # doesn't match,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# no 'Hi Mom!'
Pay careful attention to the next example:
? ? $x =~ /abc(?{print "Hi Mom!";})ddd/; # doesn't match,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# but why not?
At first glance,you'd think that it shouldn't print,because obviously the ddd isn't going to?
match the target string. But look at this example:
? ? $x =~ /abc(?{print "Hi Mom!";})[dD]dd/; # doesn't match,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? # but _does_ print
Hmm. What happened here? If you've been following along,you know that the above pattern should?
be effectively (almost) the same as the last one; enclosing the d in a character class isn't?
going to change what it matches. So why does the first not print while the second one does?
The answer lies in the optimizations the regex engine makes. In the first case,all the engine?
sees are plain old characters (aside from the ?{} construct). It's smart enough to realize that?
the string 'ddd' doesn't occur in our target string before actually running the pattern through.?
But in the second case,we've tricked it into thinking that our pattern is more complicated. It?
takes a look,sees our character class,and decides that it will have to actually run the?
pattern to determine whether or not it matches,and in the process of running it hits the print?
statement before it discovers that we don't have a match.
To take a closer look at how the engine does optimizations,see the section Pragmas and?
debugging below.
More fun with ?{}:
? ? $x =~ /(?{print "Hi Mom!";})/; ? ? ? # matches,helvetica; font-size:14px">? ? $x =~ /(?{$c = 1;})(?{print "$c";})/; ?# matches,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?# prints '1'
? ? $x =~ /(?{$c = 1;})(?{print "$^R";})/; # matches,helvetica; font-size:14px">The bit of magic mentioned in the section title occurs when the regexp backtracks in the process?
of searching for a match. If the regexp backtracks over a code expression and if the variables?
used within are localized using local,the changes in the variables produced by the code?
expression are undone! Thus,if we wanted to count how many times a character got matched inside?
a group,we could use,helvetica; font-size:14px">? ? $x = "aaaa";
? ? $count = 0; ?# initialize 'a' count
? ? $c = "bob"; ?# test if $c gets clobbered
? ? $x =~ /(?{local $c = 0;}) ? ? ? ? # initialize count
? ? ? ? ? ? ? ? ? ? ? ( a ? ? ? ? ? ? ? ? ? ? ? ?# match 'a'
? ? ? ? ? ? ? ? ? ? ? ? ? (?{local $c = $c + 1;}) ?# increment count
? ? ? ? ? ? ? ? ? ? ? )* ? ? ? ? ? ? ? ? ? ? ? ? # do this any number of times,helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? aa ? ? ? ? ? ? ? ? ? ? ? ? # but match 'aa' at the end
? ? ? ? ? ? ? ? ? ? ? (?{$count = $c;}) ? ? ? ? ?# copy local $c var into $count
? ? ? ? ? ? ? ? ? ? /x;
? ? print "'a' count is $count,$c variable is '$c'n";
? ? 'a' count is 2,$c variable is 'bob'
If we replace the (?{local $c = $c + 1;}) with (?{$c = $c + 1;}),the variable changes are not?
undone during backtracking,and we get
? ? 'a' count is 4,helvetica; font-size:14px">Note that only localized variable changes are undone. Other side effects of code expression?
execution are permanent. Thus
? ? $x =~ /(a(?{print "Yown";}))*aa/;
produces
? ?Yow
The result $^R is automatically localized,so that it will behave properly in the presence of?
backtracking.
This example uses a code expression in a conditional to match a definite article,either 'the'?
in English or 'der|die|das' in German:
? ? $lang = 'DE'; ?# use German
? ? $text = "das";
? ? print "matchedn"
? ? ? ? if $text =~ /(?(?{
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? $lang eq 'EN'; # is the language English?
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? })
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? the | ? ? ? ? ? ? # if so,then match 'the'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? (der|die|das) ? ? # else,match 'der|die|das'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? )
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? /xi;
Note that the syntax here is (?(?{...})yes-regexp|no-regexp),not (?((?{...}))yes-regexp|no-
regexp). In other words,in the case of a code expression,we don't need the extra parentheses?
around the conditional.
If you try to use code expressions with interpolating variables,Perl may surprise you:
? ? $bar = 5;
? ? $pat = '(?{ 1 })';
? ? /foo(?{ $bar })bar/; # compiles ok,$bar not interpolated
? ? /foo(?{ 1 })$bar/; ? # compile error!
? ? /foo${pat}bar/; ? ? ?# compile error!
? ? $pat = qr/(?{ $foo = 1 })/; ?# precompile code regexp
? ? /foo${pat}bar/; ? ? ?# compiles ok
If a regexp has (1) code expressions and interpolating variables,or (2) a variable that?
interpolates a code expression,Perl treats the regexp as an error. If the code expression is?
precompiled into a variable,interpolating is ok. The question is,why is this an?
error?
The reason is that variable interpolation and code expressions together pose a security risk.?
The combination is dangerous because many programmers who write search engines often take user?
input and plug it directly into a regexp:
? ? $regexp = <>; ? ? ? # read user-supplied regexp
? ? $chomp $regexp; ? ? # get rid of possible newline
? ? $text =~ /$regexp/; # search $text for the $regexp
If the $regexp variable contains a code expression,the user could then execute arbitrary Perl?
code. For instance,some joker could search for system('rm -rf *'); to erase your files. In this?
using both interpolation and code expressions in the same regexp is not allowed. If you're not?
concerned about malicious users,it is possible to bypass this security check by invoking use re?
'eval' :
? ? use re 'eval'; ? ? ? # throw caution out the door
? ? /foo(?{ 1 })$bar/; ? # compiles ok
Another form of code expression is the pattern code expression. The pattern code expression is?
like a regular code expression,except that the result of the code evaluation is treated as a?
regular expression and matched immediately. A simple example is
? ? $length = 5;
? ? $char = 'a';
? ? $x = 'aaaaabb';
? ? $x =~ /(??{$char x $length})/x; # matches,there are 5 of 'a'
This final example contains both ordinary and pattern code expressions. It detects whether a?
binary string 1101010010001... has a Fibonacci spacing 0,1,3,5,... of the 1 's:
? ? $x = "1101010010001000001";
? ? $z0 = ''; $z1 = '0'; ? # initial conditions
? ? print "It is a Fibonacci sequencen"
? ? ? ? if $x =~ /^1 ? ? ? ? # match an initial '1'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? (?:
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ((??{ $z0 })) # match some '0'
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 1 ? ? ? ? ? ? # and then a '1'
? ? ? ? ? ? (?{ $z0 = $z1; $z1 .= $^N; })
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? )+ ? # repeat as needed
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? $ ? ? ?# that is all there is
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? /x;
? ? printf "Largest sequence matched was %dn",length($z1)-length($z0);
Remember that $^N is set to whatever was matched by the last completed capture group. This?
? ? It is a Fibonacci sequence
? ? Largest sequence matched was 5
Ha! Try that with your garden variety regexp package...
Note that the variables $z0 and $z1 are not substituted when the regexp is compiled,as happens?
for ordinary variables outside a code expression. Rather,the code expressions are evaluated?
when Perl encounters them during the search for a match.
The regexp without the //x modifier is
? ? /^1(?:((??{ $z0 }))1(?{ $z0 = $z1; $z1 .= $^N; }))+$/
which shows that spaces are still possible in the code parts. Nevertheless,when working with?
code and conditional expressions,the extended form of regexps is almost necessary in creating?
and debugging regexps.
2.11 Backtracking control verbs
Perl 5.10 introduced a number of control verbs intended to provide detailed control over the?
backtracking process,by directly influencing the regexp engine and by providing monitoring?
techniques. As all the features in this group are experimental and subject to change or removal?
in a future version of Perl,the interested reader is referred to Special Backtracking Control?
Verbs in perlre for a detailed description.
Below is just one example,illustrating the control verb (*FAIL),which may be abbreviated as?
(*F) . If this is inserted in a regexp it will cause it to fail,just as it would at some?
mismatch between the pattern and the string. Processing of the regexp continues as it would?
after any "normal" failure,for instance,the next position in the string or another?
alternative will be tried. As failing to match doesn't preserve capture groups or produce?
results,it may be necessary to use this in combination with embedded code.
? ?%count = ();
? ?"supercalifragilisticexpialidocious" =~
? ? ? ?/([aeiou])(?{ $count{$1}++; })(*FAIL)/i;
? ?printf "%3d '%s'n",$count{$_},$_ for (sort keys %count);
The pattern begins with a class matching a subset of letters. Whenever this matches,a statement?
like $count{'a'}++; is executed,incrementing the letter's counter. Then (*FAIL) does what it?
says,and the regexp engine proceeds according to the book: as long as the end of the string?
hasn't been reached,the position is advanced before looking for another vowel. Thus,match or?
no match makes no difference,and the regexp engine proceeds until the entire string has been?
inspected. (It's remarkable that an alternative solution using something like
? ?$count{lc($_)}++ for split('',"supercalifragilisticexpialidocious");
is considerably slower.)
2.12 Pragmas and debugging
Speaking of debugging,there are several pragmas available to control and debug regexps in Perl.?
We have already encountered one pragma in the previous section,use re 'eval';,that allows?
variable interpolation and code expressions to coexist in a regexp. The other pragmas are
? ? use re 'taint';
? ? $tainted = <>;
? ? @parts = ($tainted =~ /(w+)s+(w+)/; # @parts is now tainted
The taint pragma causes any substrings from a match with a tainted variable to be tainted as?
well. This is not normally the case,as regexps are often used to extract the safe bits from a?
tainted variable. Use taint when you are not extracting safe bits,but are performing some other?
processing. Both taint and eval pragmas are lexically scoped,which means they are in effect?
only until the end of the block enclosing the pragmas.
? ? use re '/m'; ?# or any other flags
? ? $multiline_string =~ /^foo/; # /m is implied
?
The re '/flags' pragma (introduced in Perl 5.14) turns on the given regular expression flags?
until the end of the lexical scope. See '/flags' mode in re for more detail.
? ? use re 'debug';
? ? /^(.*)$/s; ? ? ? # output debugging info
? ? use re 'debugcolor';
? ? /^(.*)$/s; ? ? ? # output debugging info in living color
The global debug and debugcolor pragmas allow one to get detailed debugging info about regexp?
compilation and execution. debugcolor is the same as debug,except the debugging information is?
displayed in color on terminals that can display termcap color sequences. Here is example?
output:
? ? % perl -e 'use re "debug"; "abc" =~ /a*b+c/;'
? ? Compiling REx 'a*b+c'
? ? size 9 first at 1
? ? ? ?1: STAR(4)
? ? ? ?2: ? EXACT <a>(0)
? ? ? ?4: PLUS(7)
? ? ? ?5: ? EXACT <b>(0)
? ? ? ?7: EXACT <c>(9)
? ? ? ?9: END(0)
? ? floating 'bc' at 0..2147483647 (checking floating) minlen 2
? ? Guessing start of match,REx 'a*b+c' against 'abc'...
? ? Found floating substr 'bc' at offset 1...
? ? Guessed: match at offset 0
? ? Matching REx 'a*b+c' against 'abc'
? ? ? Setting an EVAL scope,savestack=3
? ? ? ?0 <> <abc> ? ? ? ? ? ? | ?1: ?STAR
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?EXACT <a> can match 1 times out of 32767...
? ? ? ?1 <a> <bc> ? ? ? ? ? ? | ?4: ? ?PLUS
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?EXACT <b> can match 1 times out of 32767...
? ? ? ?2 <ab> <c> ? ? ? ? ? ? | ?7: ? ? ?EXACT <c>
? ? ? ?3 <abc> <> ? ? ? ? ? ? | ?9: ? ? ?END
? ? Match successful!
? ? Freeing REx: 'a*b+c'
If you have gotten this far into the tutorial,you can probably guess what the different parts?
of the debugging output tell you. The first part
describes the compilation stage. STAR(4) means that there is a starred object,in this case 'a'?
,and if it matches,goto line 4,PLUS(7) . The middle lines describe some heuristics and?
optimizations performed before a match:
Then the match is executed and the remaining lines describe the process:
Each step is of the form n <x> <y>,with <x> the part of the string matched and <y> the part not?
yet matched. The | 1: STAR says that Perl is at line number 1 in the compilation list above. See?
?
Debugging Regular Expressions in perldebguts for much more detail.
An alternative method of debugging regexps is to embed print statements within the regexp. This?
provides a blow-by-blow account of the backtracking in an alternation:
? ? "that this" =~ m@(?{print "Start at position ",pos,"n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? t(?{print "t1n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? h(?{print "h1n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? i(?{print "i1n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? s(?{print "s1n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? |
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? t(?{print "t2n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? h(?{print "h2n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? a(?{print "a2n";})
? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? (?{print "Done at position ",helvetica; font-size:14px">? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? @x;
? ? Start at position 0
? ? t1
? ? h1
? ? t2
? ? h2
? ? a2
? ? Done at position 4