| 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).

Implementing a Regular Expression Engine

From: "andrew cooke" <andrew@...>

Date: Sun, 22 Mar 2009 20:21:29 -0400 (CLT)

A week or two ago I posted a message here saying I had implemented a
regular expression engine.  I deleted it today...

It would be more correct to say I have been learning about how to
implement a regular expression engine by failing to implement one. 
However, I am making some progress.

My initial take on regular expressions was to treat them as a tree
(basically the parse tree you would expect from their string
representation).  While that wasn't necessarily wrong, it made life a lot
harder than it should have been - it is much easier to model them as
directed graphs.

One translated into graph form, it's pretty easy to generate a
non-deterministic finite automaton that does the appropriate matching. 
That's because it's pretty much the same as the core loop for trampolined
recursive descent parser.  You can even get all the different matches with
back-tracking (technically I am therefore implementing the NFA (with eta
transitions, which are useful to order different parts of the automoaton)
using a PDA, which is more general and so explains the connection to
recursive descent parsing).

That's as far as I have got.  A previous post here gives references on how
to translate the NFA to a DFA (which being deterministic is a lot easier
to "run"; the flip side is that it may have exponentially more states and
there's no way to implement it so that all variations (non greedy matching
etc) are returned).

My aim is to make this NFA a standard LEPL matcher.  The DFA
implementation will be used for lexing.  In the future I'd also like to
see if compiling Any, Literal, Word etc (and combinations with And, Or,
Repeat) to NFA make things faster.

Andrew

http://en.wikipedia.org/wiki/Automata_theory - the table at the bottom is
particularly useful.

Initial DFA Results

From: "andrew cooke" <andrew@...>

Date: Tue, 24 Mar 2009 20:52:27 -0400 (CLT)

This is sweet - it's nice when a piece of code does things you didn't
really expect it to do (I mean, in theory, I can see why it works, but in
practice, the way it solves the problems is almost "intelligent").

Here's an example for the regexp a(bc|b*d):

     a      d
  0 ---> 1 +--> 2* <--+----.
           |b     c/d |    |
           `--> 3 +---'    |
                  |b      d|
                  `--> 4 +-'
                  '      |b
                  |      |
                  `------'

or, as printed (the [...] are the original nfa nodes):

  0 [0]       a:1,
  1 [3, 5, 6] d:2;b:3,
  2 [1, 2]    label,
  3 [4, 5, 6] b:4;[c-d]:2,
  4 [5, 6]    b:4;d:2

Andrew

Original NFA

From: "andrew cooke" <andrew@...>

Date: Tue, 24 Mar 2009 21:11:09 -0400 (CLT)

Just for fun, here's the underlying NFA (with eta/empty transitions). 
This is easier to construct (both by hand and in code)

      a     b      c
  0 ---> 3 +--> 4 ----------+> 1 ---> 2 "label"
           |                |
           |              d |
           `--> 5 +--> 6 ---'
           '      |
           |   b  |
           `------'

0 a:3
1 2
2 label
3 b:4 5
4 c:1
5 b:5 6,
6 d:1

(This is all left to right except for the b* loop from/to 5 at the bottom)

Andrew

Epsilon!

From: "andrew cooke" <andrew@...>

Date: Tue, 24 Mar 2009 21:25:35 -0400 (CLT)

I've been calling my epsilons etas!  Ooops.  Andrew

Comment on this post