An exploration of trie regexp matching
By David Leadbeater (dg) from London.pm
Date: Monday, 20 August 2012 11:50
Duration: 40 minutes
Target audience: Intermediate
Language: English
Tags: re2 regexp
The RE2 regular expression engine uses a data structure called a trie to match regexps. However perl itself can use this data structure under certain circumstances. We'll investigate Perl's behaviour, apply some insane optimisations and compare with RE2 (via re::engine::RE2).
Attended by: Martin Becker (martin), Karl Gaissmaier (Charly), Matthias Zeichmann, Bert, Alexey Surikov (ksurent), Catalin Ciurea (catalin), Nicholas Clark, Stefan Seifert (Nine), Gunnar Koppel (wk), Dominic Humphries (djh), Erik Johansen (uniejo), Aaron Crane (arc), Patrick Mevzek, Dennis Stosberg, Dagfinn Ilmari Mannsåker (ilmari), Richard Jelinek (TheWhip), Peter Heuchert, Michele Beltrame (arthas), Henrik Hald Nørgaard, Torsten Förtsch, Magnus Zeisig (magnuz), Dmitry Karasik (McFist), Ole Voß, Alex Timoshenko, Julien Fiegehenn (simbabque), Andreas Vögele, Winfried Puchinger (winpuc), Sébastien Aperghis-Tramoni (maddingue), Olivier Mengué (dolmen), Vladimir Lashko (Ostrovok), Caio Romão, Sören Laird Sörries, Gerhard Raffius, Christian Veigl (oftl), Anton Berezin (Grrrr), Hilko Bengen (hillu), anca grosan (ancag), Stefan O'Rear (sorear), Stéphane Payrard (cognominal), Kang-min Liu (gugod), Patrick Ringl (pari), Hans-Jürgen Schloz, John van Krieken (vladtz), Sebastian Stellingwerff (webmind), Laurent Boivin (Elbeho), Steffen Schwigon (renormalist),
