Overview

replay: Regular expressions and finite automata

replay is a library for compiling, manipulating, and using regular expressions and deterministic finite state automata.

This is a research project to explore different regular expression simulation and compilation techniques, and extensions of regular expressions. (e.g. replay regexps operate over infinite alphabets).

Currently replay does not support submatch extraction, speed, or new users.

Contacting the author

Please either file a bug report or ping me on the #python IRC channel on irc.freenode.net. My username there is ssbr.