| 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

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

© 2006-2013 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