/usr/lib/python3/dist-packages/ptk/regex.py is in python3-ptk 1.3.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 | # -*- coding: UTF-8 -*-
# (c) Jérôme Laheurte 2015
# See LICENSE.txt
"""
Simple regular expression engine used by ProgressiveParser.
"""
import six
import re
import collections
#===============================================================================
# Regex objects
class _State(object):
pass
class DeadState(Exception):
"""
Raised when the FSA reaches a dead state
"""
class RegularExpression(object):
"""
Regular expression object (non-deterministic FSA)
"""
def __init__(self):
self._transitions = list() # of (startState, class/None, endState)
self._startState = _State()
self._finalState = _State()
self._currentState = None
self._startStates = set()
def clone(self):
"""
Returns a clone of this object. Used by concat() and union()
so that if you pass several times the same expression states
don't get all mixed up...
"""
# pylint: disable=W0212
result = RegularExpression()
for startState, trans, endState in self._transitions:
if startState is self._startState:
startState = result._startState
if startState is self._finalState:
startState = result._finalState
if endState is self._startState:
endState = result._startState
if endState is self._finalState:
endState = result._finalState
result._transitions.append((startState, trans, endState))
result._startStates = set([state for state, _, _ in result._transitions])
return result
@staticmethod
def fromClass(klass):
"""
Builds a regular expression from a CharacterClass instance
"""
# pylint: disable=W0212
result = RegularExpression()
result._transitions = [(result._startState, klass, result._finalState)]
result._startStates = set([state for state, _, _ in result._transitions])
return result
@staticmethod
def concat(*rxs):
"""
Builds the concatenation of several RegularExpression instances
"""
# pylint: disable=W0212
rxs = [rx.clone() for rx in rxs]
result = RegularExpression()
if rxs:
result._startState = rxs[0]._startState
result._transitions = list(rxs[0]._transitions)
for rx1, rx2 in zip(rxs[:-1], rxs[1:]):
for startState, trans, endState in rx2._transitions:
if startState is rx2._startState:
startState = rx1._finalState
if endState is rx2._startState:
endState = rx1._finalState
result._transitions.append((startState, trans, endState))
result._finalState = rxs[-1]._finalState
else:
result._transitions = [(result._startState, None, result._finalState)]
result._startStates = set([state for state, _, _ in result._transitions])
return result
@staticmethod
def union(*rxs):
"""
Builds the union of several RegularExpression instances
"""
# pylint: disable=W0212
result = RegularExpression()
for rx in [rx.clone() for rx in rxs]:
result._transitions.extend(rx._transitions)
result._transitions.append((result._startState, None, rx._startState))
result._transitions.append((rx._finalState, None, result._finalState))
result._startStates = set([state for state, _, _ in result._transitions])
return result
@staticmethod
def kleene(rx):
"""
Kleene closure
"""
# pylint: disable=W0212
result = RegularExpression()
result._transitions = list(rx._transitions)
result._transitions.append((result._startState, None, result._finalState))
result._transitions.append((rx._finalState, None, rx._startState))
result._transitions.append((result._startState, None, rx._startState))
result._transitions.append((rx._finalState, None, result._finalState))
result._startStates = set([state for state, _, _ in result._transitions])
return result
@staticmethod
def exponent(rx, minCount, maxCount=None):
"""
Arbitrary exponent
"""
if maxCount is None:
return RegularExpression.concat(
RegularExpression.exponent(rx, minCount, minCount),
RegularExpression.kleene(rx)
)
else:
return RegularExpression.union(*tuple(
[RegularExpression.concat(*tuple([rx for _ in range(count)])) for count in range(minCount, maxCount+1)]))
# Matching
def _epsilonClose(self, states):
newStates = set(states) # Copy
while True:
added = False
for state in set(newStates):
for startState, trans, endState in self._transitions:
if startState == state and trans is None and endState not in newStates:
newStates.add(endState)
added = True
if not added:
break
return newStates
def _closure(self, states, char):
newStates = set()
for startState, trans, endState in self._transitions:
if trans is not None and startState in states and char in trans:
newStates.add(endState)
return newStates
def start(self):
"""
Resets the internal state to the start state
"""
self._currentState = self._epsilonClose(set([self._startState]))
return self
def feed(self, char):
"""
Advance the state according to char
"""
self._currentState = self._epsilonClose(self._closure(self._currentState, char))
if not self._currentState:
raise DeadState()
return self._finalState in self._currentState
def isDeadEnd(self):
"""
Checks if the current state is a dead end, i.e. if there are no outgoing transitions from it
"""
return self._currentState and all([state not in self._startStates for state in self._currentState])
def match(self, string):
"""
Match a whole string
"""
if six.PY3 and isinstance(string, bytes):
string = [chr(c).encode('ascii') for c in string]
self.start()
try:
for char in string:
self.feed(char)
return self._finalState in self._currentState
except DeadState:
return False
#===============================================================================
# Lexing
class TokenizeError(Exception):
"""Tokenization error in a regular expression"""
class BackslashAtEndOfInputError(TokenizeError):
"""Escape character at end of input"""
class UnterminatedClassError(TokenizeError):
"""Character class not ended"""
class InvalidClassError(TokenizeError):
"""Invalid class, e.g. z-a"""
class InvalidExponentError(TokenizeError):
"""Invalid exponent value"""
class CharacterClass(object): # pylint: disable=R0903
"""Base class for character classes"""
def __contains__(self, char): # pragma: no cover
raise NotImplementedError
class AnyCharacterClass(CharacterClass):
"""The ."""
def __contains__(self, char):
return char not in [six.u('\n'), six.b('\n')]
def __eq__(self, other):
return isinstance(other, AnyCharacterClass)
class RegexCharacterClass(CharacterClass): # pylint: disable=R0903
"""
Use an actual regex; for character classes
"""
_cache = dict()
def __init__(self, pattern):
if pattern not in self._cache:
try:
flags = 0
if six.PY2 and isinstance(pattern, unicode): # pylint: disable=E0602
flags = re.UNICODE
self._cache[pattern] = re.compile(pattern, flags)
except re.error as exc:
raise InvalidClassError(str(exc))
self._rx = self._cache[pattern]
def __eq__(self, other): # pragma: no cover
return self is other # Because of cache
def __contains__(self, char):
return self._rx.match(char) is not None
class LitteralCharacterClass(CharacterClass): # pylint: disable=R0903
"""
Single char
"""
def __init__(self, char):
self._char = char
def __eq__(self, other):
return type(self) is type(other) and self._char == other._char # pylint: disable=W0212
def __contains__(self, char):
return char == self._char
def __repr__(self):
return repr(self._char)
ExponentToken = collections.namedtuple('ExponentToken', ['minCount', 'maxCount'])
class RegexTokenizer(object): # pylint: disable=R0903
"""
Tokenization of regular expressions. Actually, this does a bit
more than plain tokenization; it also handles special cases for
character classes and exponentiation.
"""
TOK_CLASS = 1
TOK_EXPONENT = 2
TOK_LPAREN = 3
TOK_RPAREN = 4
TOK_UNION = 5
Token = collections.namedtuple('Token', ['type', 'value'])
def __init__(self, regex):
if six.PY3 and isinstance(regex, bytes):
self._stack = [chr(c).encode('ascii') for c in reversed(regex)]
else:
self._stack = list(reversed(regex))
self._state = 0
self._currentClass = None
self._exponentValue = 0
self._startExponent = None
# Six.[ub] behaves badly with strings such as '\\'
if six.PY2:
self.ubackslash = '\\'.decode('ascii')
self.bbackslash = '\\'
else:
self.ubackslash = '\\'
self.bbackslash = '\\'.encode('ascii')
def tokens(self):
"""
Returns a list of tokens for the regex passed to the
constructor. Items are 2-tuples (type, value) where 'type' is
one of the TOK_* constants.
"""
tokenList = list()
while self._stack:
char = self._stack.pop()
state = getattr(self, '_state%d' % self._state)
state = state(char, tokenList)
self._state = state if state is not None else self._state
if self._state == 1:
raise BackslashAtEndOfInputError('Backslash at end of string')
if 2 <= self._state <= 8:
raise UnterminatedClassError('Unterminated character class')
if 9 <= self._state <= 12:
raise InvalidExponentError('Unterminated {')
return tokenList
# "Normal" state
def _state0(self, char, tokenList):
# Normal state
if char in [six.u('*'), six.b('*')]:
tokenList.append(self.Token(self.TOK_EXPONENT, ExponentToken(0, None)))
elif char in [six.u('+'), six.b('+')]:
tokenList.append(self.Token(self.TOK_EXPONENT, ExponentToken(1, None)))
elif char in [six.u('.'), six.b('.')]:
tokenList.append(self.Token(self.TOK_CLASS, AnyCharacterClass()))
elif char in [six.u('('), six.b('(')]:
tokenList.append(self.Token(self.TOK_LPAREN, char))
elif char in [six.u(')'), six.b(')')]:
tokenList.append(self.Token(self.TOK_RPAREN, char))
elif char in [six.u('|'), six.b('|')]:
tokenList.append(self.Token(self.TOK_UNION, char))
elif char == six.u('['):
self._currentClass = six.StringIO()
self._currentClass.write(char)
return 2
elif char == six.b('['):
self._currentClass = six.BytesIO()
self._currentClass.write(char)
return 2
elif char in [six.u('{'), six.b('{')]:
return 9
elif char in [six.u(']'), six.b(']'), six.u('}'), six.b('}')]:
raise TokenizeError('Unexpected token "%s"' % char)
elif char in [self.ubackslash, self.bbackslash]:
return 1
else:
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(char)))
def _state1(self, char, tokenList):
# After a "\" in normal state
if char in [six.u('d'), six.u('s'), six.u('w'), six.u('D'), six.u('S'), six.u('W')]:
tokenList.append(self.Token(self.TOK_CLASS, RegexCharacterClass(self.ubackslash + char)))
elif char in [six.b('d'), six.b('s'), six.b('w'), six.b('D'), six.b('S'), six.b('W')]:
tokenList.append(self.Token(self.TOK_CLASS, RegexCharacterClass(self.bbackslash + char)))
elif char == six.u('n'):
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(six.u('\n'))))
elif char == six.u('t'):
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(six.u('\t'))))
elif char == six.b('n'):
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(six.b('\n'))))
elif char == six.b('t'):
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(six.b('\t'))))
else:
tokenList.append(self.Token(self.TOK_CLASS, LitteralCharacterClass(char)))
return 0
# Character classes
def _state2(self, char, tokenList):
# In character class
if char in [self.ubackslash, self.bbackslash]:
return 3
if char in [six.u(']'), six.b(']')]:
self._currentClass.write(char)
tokenList.append(self.Token(self.TOK_CLASS, RegexCharacterClass(self._currentClass.getvalue())))
self._currentClass = None
return 0
self._currentClass.write(char)
def _state3(self, char, tokenList): # pylint: disable=W0613
# After "\" in character class
if six.PY2 and isinstance(char, str):
self._currentClass.write(self.bbackslash + char)
else:
self._currentClass.write(self.ubackslash + char)
return 2
# Exponent
def _state9(self, char, tokenList): # pylint: disable=W0613
# Start of exponent
if not char.isdigit():
raise InvalidExponentError('Exponent not starting with a number')
self._exponentValue = int(char)
return 10
def _state10(self, char, tokenList):
# In exponent, computing start value
if char in [six.u('-'), six.b('-')]:
self._startExponent = self._exponentValue
return 11
elif char in [six.u('}'), six.b('}')]:
tokenList.append(self.Token(self.TOK_EXPONENT, ExponentToken(self._exponentValue, self._exponentValue)))
return 0
elif char.isdigit():
self._exponentValue *= 10
self._exponentValue += int(char)
else:
raise InvalidExponentError('Invalid character "%s"' % char)
def _state11(self, char, tokenList): # pylint: disable=W0613
# In exponent, expecting second term of interval
if char in [six.u('}'), six.b('}')]:
raise InvalidExponentError('Missing range end')
if not char.isdigit():
raise InvalidExponentError('Invalid character "%s"' % char)
self._exponentValue = int(char)
return 12
def _state12(self, char, tokenList):
# In exponent, computing end value
if char in [six.u('}'), six.b('}')]:
if self._startExponent > self._exponentValue:
raise InvalidExponentError('Invalid exponent range %d-%d' % (self._startExponent, self._exponentValue))
tokenList.append(self.Token(self.TOK_EXPONENT, ExponentToken(self._startExponent, self._exponentValue)))
return 0
if not char.isdigit():
raise InvalidExponentError('Invalid character "%s"' % char)
self._exponentValue *= 10
self._exponentValue += int(char)
#===============================================================================
# Parsing
class RegexParseError(Exception):
"""
Regular expression parse error
"""
class RegexParser(object):
"""
Actual parsing of regular expression strings
"""
def parse(self, tokens):
"""
Well, duh
"""
tokens = list(tokens)
expr, pos = self._parse_E1(tokens, 0)
if len(tokens) != pos:
raise RegexParseError('Unexpected token "%s"' % tokens[pos].value)
return expr
def _parse_E1(self, tokens, pos):
expr, pos = self._parse_E2(tokens, pos)
return self._parse_R1(expr, tokens, pos)
def _parse_R1(self, left, tokens, pos):
while pos != len(tokens) and tokens[pos].type == RegexTokenizer.TOK_UNION:
expr, pos = self._parse_E2(tokens, pos + 1)
left = self.union(left, expr)
return left, pos
def _parse_E2(self, tokens, pos):
expr, pos = self._parse_E3(tokens, pos)
return self._parse_R2(expr, tokens, pos)
def _parse_R2(self, left, tokens, pos):
while True:
try:
tempExpr, tempPos = self._parse_E3(tokens, pos)
self._parse_R2(tempExpr, tokens, tempPos)
except RegexParseError:
break
expr, pos = self._parse_E3(tokens, pos)
left = self.concat(left, expr)
return left, pos
def _parse_E3(self, tokens, pos):
expr, pos = self._parse_E(tokens, pos)
return self._parse_R3(expr, tokens, pos)
def _parse_R3(self, left, tokens, pos):
while pos != len(tokens) and tokens[pos].type == RegexTokenizer.TOK_EXPONENT:
left = self.exponent(left, tokens[pos].value)
pos += 1
return left, pos
def _parse_E(self, tokens, pos):
if pos == len(tokens):
raise RegexParseError('Expected "(" or letter')
if tokens[pos].type == RegexTokenizer.TOK_LPAREN:
expr, pos = self._parse_E1(tokens, pos + 1)
if pos == len(tokens) or tokens[pos].type != RegexTokenizer.TOK_RPAREN:
raise RegexParseError('Missing ")"')
return expr, pos + 1
elif tokens[pos].type == RegexTokenizer.TOK_CLASS:
return self.klass(tokens[pos].value), pos + 1
raise RegexParseError('Unexpected token "%s"' % tokens[pos].value)
# Delegate
def union(self, rx1, rx2): # pylint: disable=C0111,R0201
return RegularExpression.union(rx1, rx2)
def concat(self, rx1, rx2): # pylint: disable=C0111,R0201
return RegularExpression.concat(rx1, rx2)
def exponent(self, rx, exp): # pylint: disable=C0111,R0201
return RegularExpression.exponent(rx, exp.minCount, exp.maxCount)
def klass(self, charClass): # pylint: disable=C0111,R0201
return RegularExpression.fromClass(charClass)
def buildRegex(rx):
"""
Shortcut to build a RegularExpression object from a string
"""
return RegexParser().parse(RegexTokenizer(rx).tokens())
|