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

Removing Lowers; Mnesiacs; [Maths, Link] Dividing By Zero; [Book, Review] Ray Monk - Ludwig Wittgenstein: The Duty Of Genius; [Link, Bike, Computing] Evolving Lacing Patterns; [Jam] Strawberry and Orange Jam; [Chile, Privacy] Biometric Check During Mail Delivery; [Link, Chile, Spanish] Article on the Chilean Drought; [Bike] Extended Gear Ratios, Shimano XT M8000 (24/36 Chainring); Get Coffee Quotes for Cat Soft LLC; [Link, Politics, USA] The Future Of American Democracy; Mass Hysteria; [Review, Books, Links] Kazuo Ishiguro - Never Let Me Go; [Link, Books] David Mitchell's Favourite Japanese Fiction; [Link, Bike] Rear Suspension Geometry; [Link, Cycling, Art] Strava Artwork; [Link, Computing] Useful gcc flags; [Link] Voynich Manuscript Decoded; [Bike] Notes on Servicing Suspension Forks; [Links, Computing] Snap, Flatpack, Appimage; [Link, Computing] Oracle is leaving Java (to die); [Link, Politics] Cubans + Ultrasonics; [Book, Link] Laurent Binet; VirtualBox; [Book, Link] No One's Ways; [Link] The Biggest Problem For Cyclists Is Bad Driving; [Computing] Doxygen, Sphinx, Breathe; [Admin] Brokw Recent Permalinks; [Bike, Chile] Buying Bearings in Santiago; [Computing, Opensuse] Upgrading to 42.3; [Link, Physics] First Support for a Physics Theory of Life; [Link, Bike] Peruvian Frame Maker; [Link] Awesome Game Theory Tit-For-Tat Thing; [Food, Review] La Fabbrica - Good Italian Food In Santiago; [Link, Programming] MySQL UTF8 Broken; [Link, Books] Latin American Authors; [Link, Computing] Optimizatin Puzzle; [Link, Books, Politics] Orwell Prize; [Link] What the Hell Is Happening With Qatar?; [Link] Deep Learning + Virtual Tensor Machines; [Link] Scaled Composites: Largest Wingspan Ever; [Link] SCP Foundation; [Bike] Lessons From 2 Leading 2 Trailing; [Link] Veg Restaurants in Santiago; [Link] List of Contemporary Latin American Authors; [Bike] FTHR; [Link] Whoa - NSA Reduces Collection (of US Residents); [Link] Red Bull's Breitbart; [Link] Linux Threads; [Link] Punycode; [Link] Bull / Girl Statues on Wall Street; [Link] Beautiful Chair Video; Update: Lower Pressures; [Link] Neat Python Exceptions; [Link] Fix for Windows 10 to Avoid Ads; [Link] Attacks on ZRTP; [Link] UK Jazz Invasion; [Review] Cuba; [Link] Aricle on Gender Reversal of US Presidential Debate; {OpenSuse] Fix for Network Offline in Updater Applet; [Link] Parkinson's Related to Gut Flora; Farellones Bike Park; [Meta] Tags; Update: Second Ride; Schwalbe Thunder Burt 2.1 v Continental X-King 2.4; Mountain Biking in Santiago; Books on Ethics; Security Fail from Command Driven Interface; Everything Old is New Again; Interesting Take on Trump's Lies; Chutney v6; References on Entropy; Amusing "Alexa.." broadcast; The Shame of Chile's Education System; Playing mp4 gifs in Firefox on Opensuses Leap 42.2; Concurrency at Microsoft; Globalisation: Uk -> Chile; OpenSuse 42.2 and Synaptics Touch-Pads; Even; Cherry Jam; Lebanese Writer Amin Maalouf; C++ - it's the language of the future; Learning From Trump; Chinese Writer Hu Fayun; And; Apricot Jam; Also; Excellent Article on USA Politics; Oh Metafilter; Prejudice Against The Rurals; Also, Zizek; Trump; Why Trump Won; Doxygen + Latex on CentOS 6; SMASH - Solve 5 Biggest Problems in Physics; Good article on racism, brexit, and social divides; Grandaddy are back!; Consciousness From Max Entropy; Democrats; Harvard Will Fix Black Poverty; Modelling Bicycle Wheels

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