| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

Last 100 entries

Mapa de Ciclovias en Santiago; How Unreliable is UDP?; SE Santiago 20m Bike Route; Cameron's Rap; Configuring libxml with Eclipse; Reducing Combinatorial Complexity With Occam - AI; Sentidos Comunes (Chilean Online Magazine); Hilary Mantel: The Assassination of Margaret Thatcher - August 6th 1983; NSA Interceptng Gmail During Delivery; General IIR Filters; What's happening with Scala?; Interesting (But Largely Illegible) Typeface; Retiring Essentialism; Poorest in UK, Poorest in N Europe; I Want To Be A Redneck!; Reverse Racism; The Lost Art Of Nomography; IBM Data Center (Photo); Interesting Account Of Gamma Hack; The Most Interesting Audiophile In The World; How did the first world war actually end?; Ky - Restaurant Santiago; The Black Dork Lives!; The UN Requires Unaninmous Decisions; LPIR - Steganography in Practice; How I Am 6; Clear Explanation of Verizon / Level 3 / Netflix; Teenage Girls; Formalising NSA Attacks; Switching Brakes (Tektro Hydraulic); Naim NAP 100 (Power Amp); AKG 550 First Impressions; Facebook manipulates emotions (no really); Map Reduce "No Longer Used" At Google; Removing RAID metadata; New Bike (Good Bike Shop, Santiago Chile); Removing APE Tags in Linux; Compiling Python 3.0 With GCC 4.8; Maven is Amazing; Generating Docs from a GitHub Wiki; Modular Shelves; Bash Best Practices; Good Emergency Gasfiter (Santiago, Chile); Readings in Recent Architecture; Roger Casement; Integrated Information Theory (Or Not); Possibly undefined macro AC_ENABLE_SHARED; Update on Charges; Sunburst Visualisation; Spectral Embeddings (Distances -> Coordinates); Introduction to Causality; Filtering To Help Colour-Blindness; ASUS 1015E-DS02 Too; Ready Player One; Writing Clear, Fast Julia Code; List of LatAm Novels; Running (for women); Building a Jenkins Plugin and a Jar (for Command Line use); Headphone Test Recordings; Causal Consistency; The Quest for Randomness; Chat Wars; Real-life Financial Co Without ACID Database...; Flexible Muscle-Based Locomotion for Bipedal Creatures; SQL Performance Explained; The Little Manual of API Design; Multiple Word Sizes; CRC - Next Steps; FizzBuzz; Update on CRCs; Decent Links / Discussion Community; Automated Reasoning About LLVM Optimizations and Undefined Behavior; A Painless Guide To CRC Error Detection Algorithms; Tests in Julia; Dave Eggers: what's so funny about peace, love and Starship?; Cello - High Level C Programming; autoreconf needs tar; Will Self Goes To Heathrow; Top 5 BioInformatics Papers; Vasovagal Response; Good Food in Vina; Chilean Drug Criminals Use Subsitution Cipher; Adrenaline; Stiglitz on the Impact of Technology; Why Not; How I Am 5; Lenovo X240 OpenSuse 13.1; NSA and GCHQ - Psychological Trolls; Finite Fields in Julia (Defining Your Own Number Type); Julian Assange; Starting Qemu on OpenSuse; Noisy GAs/TMs; Venezuela; Reinstalling GRUB with EFI; Instructions For Disabling KDE Indexing; Evolving Speakers; Changing Salt Size in Simple Crypt 3.0.0; Logarithmic Map (Moved); More Info; Words Found in Voynich Manuscript; An Inventory Of 3D Space-Filling Curves

© 2006-2013 Andrew Cooke (site) / post authors (content).

Interpreter for Python Regexps

From: andrew cooke <andrew@...>

Date: Thu, 27 May 2010 08:16:19 -0400

I have been working on a regular expression package for Python - a pure Python
implementation that will, eventually, be integrated into Lepl.  So far parsing
works (I can now parse almost all of Python's regular expression syntax) and I
have just got a very basic interpreter (effectively NFA) based engine running
some basic matches.  The following tests pass:

class VisitorTest(TestCase):
    
    def test_string(self):
        assert Visitor(Unicode(), parse('abc'), 'abc')
        assert Visitor(Unicode(), parse('abc'), 'abcd')
        assert not Visitor(Unicode(), parse('abc'), 'ab')
        
    def test_dot(self):
        assert Visitor(Unicode(), parse('a.c'), 'abc')
        assert Visitor(Unicode(), parse('...'), 'abcd')
        assert not Visitor(Unicode(), parse('...'), 'ab')

As I hoped, the parsing has been by far the hardest part.  Actually writing an
implementation given the parsed graph and visitor interfaces is pretty easy.

The parser, as implied above, generates a directed graph of nodes that reflect
the different operations supported.  This could then be "compiled" by an
implementation or simply used directly.  For direct use it supports a basic
visitor pattern, where each node implements .visit(visitor, state) and then
"calls back" on the visitor.  So the visitor callback methods are equivalent
to the different bytecodes that would be used in compilation:

class Visitor(object):
    def string(self, next, text, state=None):
    def character(self, next, state=None):
    def start_group(self, next, number, state=None):
    def end_group(self, next, number, state=None):
    def group_reference(self, next, number, state=None):
    def conditional(self, next, number, state=None):
    def split(self, next, state=None):
    def match(self, state=None):
    def dot(self, next, multiline, state=None):
    def start_of_line(self, next, multiline, state=None):
    def end_of_line(self, next, multiline, state=None):
    def lookahead(self, next, sense, forwards, state=None):
    def repeat(self, next, begin, end, state=None):
    def word_boundary(self, next, inverted, state=None):
    def digit(self, next, inverted, state=None):
    def space(self, next, inverted, state=None):
    def word(self, next, inverted, state=None):

(Note that "repeat" is replaced by explicit expansion in the parser if the
appropriate options are set; also, expansion of character classes is handled
by an "alphabet" that is not otherwise explicit here).

Andrew

Comment on this post