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

[Link, Future] Simulated Brain Drives Robot; [Link, Computing] Learned Index Structures; Solo Air Equalization; Update: Higher Pressures; Psychology; [Bike] Exercise And Fuel; Continental Race King 2.2; 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); [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

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

Compiling Recursive Descent to Regular Expressions

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

Date: Sat, 4 Apr 2009 09:20:37 -0400 (CLT)

I just finished some initial tests on "compiling" the recursive descent
parser in LEPL to a discrete finite automata (DFA) using regular
expressions.

There are some limitations, of course - I only change the lower parts of
the tree that match characters.  This is not quite as obvious as it may
sound because my regular expression engine can handle arbitrary Python
objects, so regular expressions do not have to be made of letters.  But I
do need to write the conversion from matcher to regular expression for
each matcher, and currently only handle And, Or, Any, Literal and some
calls to DepthFirst (which is the core repetition matcher).

But even that explanation is not complete, because those matchers are
actually a large fraction of what is used in most parsers (LEPL provides
many more matchers, but they are sugar built on top of these).  In
practice the biggest problem is that arbitrary transforms (functions) can
be invoked on the results as they are generated.

I ameliorated the effect of actions by making composition explicit -
composite actions are now available for inspection internally as lists of
functions, and the regular expression rewriting engine makes use of this
to identify "add" (the function used to combine strings).

Another limitation is that the fastest regular expression engine gives
only a single greedy match.  But a second engine, using a pushdown
automaton, is nearly as fast (see results below) and provides all possible
matches.


Anyway, as an example, here is the regular expression that is
auto-generated for the Float() matcher:
([\+\-]|)([0-9]([0-9])*(\.|)|([0-9]([0-9])*|)\.[0-9]([0-9])*)([Ee]([\+\-]|)[0-9]([0-9])*|)


Note that the code would be even faster if people used the Regexp()
matcher to provide a regular expression directly (which uses Python's fast
"re" library), but then you start to lose some of the other advantages of
LEPL (you only get the greedy match, the syntax is uglier, reuse is
harder).

Even then, I could replace my "greedy" engine with Python's (and keep the
automatic rewriting).  In practice, I don't do that because (1) the regexp
syntax I use is simpler and easier to target and (2) my engine works with
streams of data, while Python's requires (as far as I can tell) that the
string be in-memory (in theory you can use my regexp to parse a file that
is larger than the memory available to Python; testing large files is
still on my todo list).


Anyway, to the performance tests.  I used my standard expressions example,
but "spiced up" to add some complexity (yes, this improves the results
below).  So instead of matching integers I match float values (including
exponents).

The expression to match is '1.2e3 + 2.3e4 * (3.4e5 + 4.5e6 - 5.6e7)'

The results are (in arbitrary units):
Default config: 5.8
NFA (slower pushdown) regexp: 2.9
DFA (faster greedy) regexp: 2.8

So the parser is "twice as fast".  Note that this is only timing for
parsing - rewriting the parser will take more time with the extra
rewriting (I haven't measured it, and it's not noticeable in use, but it
must take more).


In summary the following aspects of LEPL's design helped here:
- Using a small core of matchers (with syntactic sugar on top)
- Exposing the DAG of matchers for rewriting before use
- Exposing composed actions to rewriting

Andrew

Comment on this post