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

C-ORM: docs, API.

Last 100 entries

Calling C From Fortran 95; Bjork DJ Set; Z3 Example With Python; Week 1; Useful Guide To Starting With IJulia; UK Election + Media; Review: Reinventing Organizations; Inline Assembly With Julia / LLVM; Against the definition of types; Dumb Crypto Paper; The Search For Quasi-Periodicity...; Is There An Alternative To Processing?; CARDIAC (CARDboard Illustrative Aid to Computation); The Bolivian Case Against Chile At The Hague; Clear, Cogent Economic Arguments For Immigration; A Program To Say If I Am Working; Decent Cards For Ill People; New Photo; Luksic And Barrick Gold; President Bachelet's Speech; Baltimore Primer; libxml2 Parsing Stream; configure.ac Recipe For Library Path; The Davalos Affair For Idiots; Not The Onion: Google Fireside Chat w Kissinger; Bicycle Wheels, Inertia, and Energy; Another Tax Fraud; Google's Borg; A Verion That Redirects To Local HTTP Server; Spanish Accents For Idiots; Aluminium Cans; Advice on Spray Painting; Female View of Online Chat From a Male; UX Reading List; S4 Subgroups - Geometric Interpretation; Fucking Email; The SQM Affair For Idiots; Using Kolmogorov Complexity; Oblique Strategies in bash; Curses Tools; Markov Chain Monte Carlo Without all the Bullshit; Email Para Matias Godoy Mercado; The Penta Affair For Idiots; Example Code To Create numpy Array in C; Good Article on Bias in Graphic Design (NYTimes); Do You Backup github?; Data Mining Books; SimpleDateFormat should be synchronized; British Words; Chinese Govt Intercepts External Web To DDOS github; Numbering Permutations; Teenage Engineering - Low Price Synths; GCHQ Can Do Whatever It Wants; Dublinesque; A Cryptographic SAT Solver; Security Challenges; Word Lists for Crosswords; 3D Printing and Speaker Design; Searchable Snowden Archive; XCode Backdoored; Derived Apps Have Malware (CIA); Rowhammer - Hacking Software Via Hardware (DRAM) Bugs; Immutable SQL Database (Kinda); Tor GPS Tracker; That PyCon Dongle Mess...; ASCII Fluid Dynamics; Brandalism; Table of Shifter, Cassette and Derailleur Compatability; Lenovo Demonstrates How Bad HTTPS Is; Telegraph Owned by HSBC; Smaptop - Sunrise (Music); Equation Group (NSA); UK Torture in NI; And - A Natural Extension To Regexps; This Is The Future Of Religion; The Shazam (Music Matching) Algorithm; Tributes To Lesbian Community From AIDS Survivors; Nice Rust Summary; List of Good Fiction Books; Constructing JSON From Postgres (Part 2); Constructing JSON From Postgres (Part 1); Postgres in Docker; Why Poor Places Are More Diverse; Smart Writing on Graceland; Satire in France; Free Speech in France; MTB Cornering - Where Should We Point Our Thrusters?; Secure Secure Shell; Java Generics over Primitives; 2014 (Charlie Brooker); How I am 7; Neural Nets Applied to Go; Programming, Business, Social Contracts; Distributed Systems for Fun and Profit; XML and Scheme; Internet Radio Stations (Curated List); Solid Data About Placebos; Half of Americans Think Climate Change Is a Sign of the Apocalypse; Saturday Surf Sessions With Juvenile Delinquents; Ssh, tty, stdout and stderr; Feathers falling in a vacuum; Santiago 30m Bike Route

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

Empty Loops in Regular Expressions

From: andrew cooke <andrew@...>

Date: Thu, 8 Jul 2010 09:04:14 -0400

Extended regular expressions (particularly) have empty transitions that can
occur in loops.  For example, (?(1)a) only matches "a" if group 1 exists, so
(?(1)a)* could be a repated matching od the empty string.

To some extent this is already avoided at compile time, by refusing to parse
things like a**, but there are many possible cases.  The problems for an
implementation are then:

- Whether to warn or reject such cases
- If not rejected, whether to try avoid infinite loops during evaluation

I am currently working on this with RXPY.  In general, I want to (i) provide a
safe system as a default, but (ii) allow the user complete control.  So it
seeems that two flags are necessary: one to disable compile time errors and
one to disable run time safety.

Implementation must also consider efficiency and ease of maintenance /
impementation.  It seems to me that many (but not all) cases could be
automatically rewritten to a safer version, but I don't currently have good
graph rewriting support (I talk about graphs here because the "opcodes" in
RXPY are nodes on a graph; the regular expression is "compiled" to a graph of
these nodes that is then "evaluated" against the input).

Since I do not have rewriting, and because that is not a complete solution
anyway, I need some other runtime scheme.  The best I have found so far is to
add additional nodes that "break" any dangerous loops.  A machine can then
verify that input has beenconsumed between each encounter with such a node.
This keeps almost all the cost to those expressions that need such a feature.

Also, the logic to generate these nodes can also be used to generate compile
time errors.  The graph API includes "consumer(lenient)" where lenient is a
boolean.  If lenient is true then consumer returns True except when a node (or
sequence of nodes) *cannot* consume input.  Repeating such nodes (or
sequences) gives a compile time error.  If lenient is false then consumer
returns True only when a node (or sequence) *guarantees* consumption (in all
cases).  This can be used to detect when to add the runtime check node (ie
when False).

This is not completely implemented, but an initial attempt is looking very
positive - "spinning" in empty loops is avoided at very little cost, and the
integration of logic for compile and runtime checks reduces the code / detail
required.

Andrew

Comment on this post