검색어: jeffrey delarosa (영어 - 한국어)

jeffrey
제프리

jeffrey kelling
jeffrey kelling

korean name of jeffrey
제프의​​ 한국어 이름

i love u jeffrey simon
나는 제프리 사이먼을 사랑해.

jeffrey friedl 's book contains a lot of discussion about optimizing regular expressions for efficient performance.
with both maximizing and minimizing repetition, failure of what follows normally causes the repeated item to be re- evaluated to see if a different number of repeats allows the rest of the pattern to match. sometimes it is useful to prevent this, either to change the nature of the match, or to cause it fail earlier than it otherwise might, when the author of the pattern knows there is no point in carrying on. consider, for example, the pattern \d+foo when applied to the subject line 123456bar after matching all 6 digits and then failing to match "foo", the normal action of the matcher is to try again with only 5 digits matching the \d+ item, and then with 4, and so on, before ultimately failing. once-only subpatterns provide the means for specifying that once a portion of the pattern has matched, it is not to be re-evaluated in this way, so the matcher would give up immediately on failing to match "foo" the first time. the notation is another kind of special parenthesis, starting with (? as in this example: (? \d+)bar this kind of parenthesis "locks up" the part of the pattern it contains once it has matched, and a failure further into the pattern is prevented from backtracking into it. back- tracking past it to previous items, however, works as normal. an alternative description is that a subpattern of this type matches the string of characters that an identical standalone pattern would match, if anchored at the current point in the subject string. once-only subpatterns are not capturing subpatterns. simple cases such as the above example can be thought of as a maximizing repeat that must swallow everything it can. so, while both \d+ and \d+? are prepared to adjust the number of digits they match in order to make the rest of the pattern match, (? \d+) can only match an entire sequence of digits. this construction can of course contain arbitrarily complicated subpatterns, and it can be nested. once-only subpatterns can be used in conjunction with look- behind assertions to specify efficient matching at the end of the subject string. consider a simple pattern such as abcd$ when applied to a long string which does not match. because matching proceeds from left to right, pcre will look for each "a" in the subject and then see if what follows matches the rest of the pattern. if the pattern is specified as ^.*abcd$ then the initial .* matches the entire string at first, but when this fails (because there is no following "a"), it backtracks to match all but the last character, then all but the last two characters, and so on. once again the search for "a" covers the entire string, from right to left, so we are no better off. however, if the pattern is written as ^(? .*)(? =abcd) then there can be no backtracking for the .* item; it can match only the entire string. the subsequent lookbehind assertion does a single test on the last four characters. if it fails, the match fails immediately. for long strings, this approach makes a significant difference to the processing time. when a pattern contains an unlimited repeat inside a subpattern that can itself be repeated an unlimited number of times, the use of a once-only subpattern is the only way to avoid some failing matches taking a very long time indeed. the pattern (\d+_bar_ \d+ )*[!?] matches an unlimited number of substrings that either consist of non-digits, or digits enclosed in, followed by either! or?. when it matches, it runs quickly. however, if it is applied to aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa it takes a long time before reporting failure. this is because the string can be divided between the two repeats in a large number of ways, and all have to be tried. (the example used [!?] rather than a single character at the end, because both pcre and perl have an optimization that allows for fast failure when a single character is used. they remember the last single character that is required for a match, and fail early if it is not present in the string.) if the pattern is changed to ((? \d+)_bar_ \d+ )*[!?] sequences of non-digits cannot be broken, and failure happens quickly.

jeffrey friedl' s "mastering regular expressions", published by o'reilly (isbn 1-56592-257-3), covers them in great detail.
the following perl escape sequences are not supported: \l, \u, \l, \u, \e, \q. in fact these are implemented by perl's general string-handling and are not part of its pat- tern matching engine.