| 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

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; Foxes Using Magnetic Fields To Hunt; 5 Rounds RC5 No Rotation; JP Morgan and Madoff; Ori - Secure, Distributed File System; Physical Unclonable Functions (PUFs); Prejudice on Reddit; Recursion OK; Optimizing Julia Code; Cash Handouts in Brazil; Couple Nice Music Videos; It Also Works!; Adaptive Plaintext; It Works!; RC5 Without Rotation (2); 8 Years...; Attack Against Encrypted Linux Disks; Pushing Back On NSA At IETF; Summary of Experimental Ethics; Very Good Talk On Security, Snowden; Locusts are Grasshoppers!; Vagrant (OpenSuse and IDEs); Interesting Take On Mandela's Context; Haskell Cabal O(n^2) / O(n) Fix; How I Am 4; Chilean Charity Supporting Women; Doing SSH right; Festival of Urban Intervention; Neat Idea - Wormholes Provide Entanglement; And a Link....; Simple Encryption for Python 2.7; OpenSuse 13.1 Is Better!; Little Gain...; More Details on Technofull Damage; Palmrest Cracked Too....; Tecnofull (Lenovo Support) Is Fucking Useless; The Neuroscientist Who Discovered He Was a Psychopath; Interpolating Polynomials; Bottlehead Crack as Pre-amp; Ooops K702!; Bottlehead Crack, AKG K701; Breaking RC5 Without Rotation; Great post thank you; Big Balls of Mud; Phabricator - Tools for working together; Amazing Julia RC5 Code Parameterized By Word Size; Chi-Square Can Be Two-Sided; Why Do Brits Accept Surveillance?; Statistics Done Wrong; Mesas Trape from Bravo; European Report on Crypto Primitives and Protocols; Interesting Omissions; Oryx And Crake (Margaret Atwood); Music and Theory; My Arduino Programs; Elliptic Curve Crypto; Re: Licensing Interpreted Code; Licensing Interpreted Code; ASUS 1015E-DS03 OpenSuse 12.3 SSD; translating lettuce feature files into stub steps files; Re: translating lettuce feature files into stub steps files; A Tale of Two Psychiatrists; The Real Reason the Poor Go Without Bank Accounts; The Rational Choices of Crack Addicts

© 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