1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
|
"""This test can read and parse PCRE regression tests to try out
on our regular expression library.
We currently only test against testoutput7 (DFA tests). We were doing
testoutput1, but that was PCRE matching, which was inconsistent with
our matching on strings like "[ab]{1,3}(ab*|b)" against 'aabbbb'.
"""
pcre_license = """
# The PCRE library is distributed under the BSD license. We have borrowed some
# of the regression tests (the ones that fit under the DFA scope) in order to
# exercise our regex implementation. Those tests are distributed under PCRE's
# BSD license. Here is the text:
# PCRE LICENCE
# ------------
#
# PCRE is a library of functions to support regular expressions whose syntax
# and semantics are as close as possible to those of the Perl 5 language.
#
# Release 7 of PCRE is distributed under the terms of the "BSD" licence, as
# specified below. The documentation for PCRE, supplied in the "doc"
# directory, is distributed under the same terms as the software itself.
#
# The basic library functions are written in C and are freestanding. Also
# included in the distribution is a set of C++ wrapper functions.
#
# THE BASIC LIBRARY FUNCTIONS
# ---------------------------
#
# Written by: Philip Hazel
# Email local part: ph10
# Email domain: cam.ac.uk
#
# University of Cambridge Computing Service,
# Cambridge, England.
#
# Copyright (c) 1997-2008 University of Cambridge
# All rights reserved.
#
# THE C++ WRAPPER FUNCTIONS
# -------------------------
#
# Contributed by: Google Inc.
#
# Copyright (c) 2007-2008, Google Inc.
# All rights reserved.
#
# THE "BSD" LICENCE
# -----------------
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
#
# * Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
#
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# * Neither the name of the University of Cambridge nor the name of Google
# Inc. nor the names of their contributors may be used to endorse or
# promote products derived from this software without specific prior
# written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
# LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
# CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
# SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
# ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
# POSSIBILITY OF SUCH DAMAGE.
#
# End
"""
import py
from rpython.rlib.parsing.regexparse import make_runner, unescape
import string
import re
this_dir = py.path.local(__file__).join('..')
#py.test.skip("Still in progress")
# Dumper's are objects that can dump/load the suite
class Dumper(object):
def __init__(self, file):
pass
def dump(self, tests):
pass
def load(self):
return []
class PickleDumper(Dumper):
import pickle
def __init__(self, fileobj):
self.file = fileobj
def dump(self, tests):
pickle.dump(suite, self.file)
def load(self):
suite = pickle.load(file)
return suite
class PythonDumper(Dumper):
def __init__(self, fileobj):
self.file = fileobj
def dump(self, tests):
self.file.write('# Auto-generated file of regular expressions from PCRE library\n')
self.file.write(pcre_license)
self.file.write('suite = []\n')
for test in tests:
self.file.write('suite.append(%r)\n' % test)
def load(self):
d = {}
text = self.file.read()
exec text in d
return d['suite']
def generate_output7():
"""Create the testoutput7.py file from the PCRE file testoutput7"""
create_pcre_pickle(this_dir.join('testoutput7').open(),
PythonDumper(this_dir.join('pcre_test_7.py').open('w')))
def create_pcre_pickle(file, dumper):
"""Create a filtered PCRE test file for the test."""
lines = [line for line in file.readlines()]
# Look for things to skip...
no_escape = r'(^|[^\\])(\\\\)*' # Make sure there's no escaping \
greedy_ops = re.compile(no_escape + r'[*?+}\(]\?') # Look for *? +? }? (?
back_refs = re.compile(no_escape + r'\(.*' + no_escape + r'\\1') # find a \1
caret_in_middle = re.compile(no_escape + r'[^\[\\]\^')
posix_char_classes = re.compile(no_escape + r'\[[^]]*\[:[^]]+:\][^]]*\]') # like [[:digit:]]
bad_backslashes = re.compile(no_escape + r'(\\Q|\\E|\\G|\\P|\\8|\\9|\\A|\\Z|\\F|\\R|\\B|\\b|\\h|\\H|\\v|\\V|\\z|\\N)') # PCRE allows \Q.....\E to quote substrings, we dont.
# Perl allows single-digit hex escapes. Change \x0 -> \x00, for example
expand_perl_hex = re.compile(r'\\x([0-9a-fA-F]{1})(?=[^0-9a-fA-F]|$)')
# suite = [
# [regex, flags, [(test,result),(test,result),...]]
# [regex, flags, [(test,result),(test,result),...]]
# ]
suite = []
while lines:
delim = None
regex = ''
# A line is marked by a start-delimeter and an end-delimeter.
# The delimeter is non-alphanumeric
# If a backslash follows the delimiter, then the backslash should
# be appended to the end. (Otherwise, \ + delim would not be a
# delim anymore!)
while 1:
regex += lines.pop(0)
if not delim:
if not regex.strip(): # Suppress blank lanes before delim
regex = ''
continue
delim = regex.strip()[0]
assert delim in (set(string.printable) - set(string.letters) - set(string.digits))
test_re = re.compile(r'%(delim)s(([^%(delim)s]|\\%(delim)s)*([^\\]))%(delim)s(\\?)([^\n\r]*)' % {'delim': delim})
# last two groups are an optional backslash and optional flags
matches = test_re.findall(regex)
if matches:
break
assert len(matches)==1 # check to make sure we matched right
regex = matches[0][0]
regex += matches[0][-2] # Add the backslash, if we gotta
flags = matches[0][-1] # Get the flags for the regex
# Gotta tolerate Perl's short hexes
regex = expand_perl_hex.sub(lambda m: r'\x0'+m.group(1), regex)
tests = []
if greedy_ops.search(regex) or back_refs.search(regex):
# Suppress complex features we can't do
pass
elif flags:
# Suppress any test that requires PCRE flags
pass
elif posix_char_classes.search(regex):
pass
elif caret_in_middle.search(regex):
pass
elif bad_backslashes.search(regex):
pass
else:
# In any other case, we're going to add the test
# All the above test fall through and DONT get appended
suite.append([regex, flags, tests])
# Now find the test and expected result
while lines:
test = lines.pop(0).strip()
if not test:
break # blank line ends the set
if test.endswith('\\'): # Tests that end in \ expect the \ to be chopped off
assert not test.endswith('\\\\\\') # Make sure not three \'s. otherwise this check will get ridiculous
if not test.endswith('\\\\'): # Two \'s means a real \
test = test[:-1]
test = expand_perl_hex.sub(lambda m: r'\x0'+m.group(1), test)
disqualify_test = bad_backslashes.search(test)
try:
test = unescape(test)
except Exception:
disqualify_test = True
print "Warning: could not unescape %r" % test
# Third line in the OUTPUT is the result, either:
# ' 0: ...' for a match (but this is ONLY escaped by \x__ types)
# 'No match' for no match
# (other kinds exist, but we ignore them)
while lines:
match = lines.pop(0).rstrip('\r\n')
match = re.sub(r'\\x([0-9a-fA-F]{2})', lambda m: chr(int(m.group(1),16)), match)
if match.startswith('No match') or match.startswith('Error') or match.startswith('Partial'):
match = None
break
elif match.startswith(' 0:'):
# Now we need to eat any further lines like:
# ' 1: ....' a subgroup match
match = match[4:]
while lines[0].strip():
# ' 0+ ...' is also possible here
if lines[0][2] in [':','+']:
lines.pop(0)
else:
break
break
elif not match:
print " *** %r ***" % match
raise Exception("Lost sync in output.")
if not disqualify_test:
tests.append((test,match))
# Last step, if there are regex's that dont have any tests,
# might as well strip them out
suite = [test for test in suite if test[2]]
dumper.dump(suite)
def run_individual_test(regex, tests):
"""Run a test from the PCRE suite."""
# Process the regex and make it ready for make_runner
regex_to_use = regex
anchor_left = regex_to_use.startswith('^')
anchor_right = regex_to_use.endswith('$') and not regex_to_use.endswith('\\$')
if anchor_left:
regex_to_use = regex_to_use[1:] # chop the ^ if it's there
if anchor_right:
regex_to_use = regex_to_use[:-1] # chop the $ if it's there
if not regex_to_use:
#print " SKIPPED (Cant do blank regex)"
return
print "%s:" % regex_to_use
runner = make_runner(regex_to_use)
# Now run the test expressions against the Regex
for test, match in tests:
print "/%r/%r/" % (test, match)
# Create possible subsequences that we should test
if anchor_left:
start_range = [0]
else:
start_range = range(0, len(test))
if anchor_right:
subseq_gen = ( (start, len(test)) for start in start_range )
else:
# Go backwards to simulate greediness
subseq_gen = ( (start, end) for start in start_range for end in range(len(test)+1, start-1, -1) )
# Search the possibilities for a match...
for start, end in subseq_gen:
attempt = test[start:end]
if runner.recognize(attempt):
assert attempt==match
break
else:
assert match is None
def test_output7():
suite = PythonDumper(this_dir.join('pcre_test_7.py').open()).load()
while suite:
regex, flags, tests = suite.pop(0)
yield run_individual_test, regex, tests
if __name__=="__main__":
for fcn, regex, tests in test_output7():
fcn(regex,tests)
|