[activities] Talk Suggestion: Efficiently Matching Input Against Many Regular Expressions

Title:
Efficiently Matching Input Against Many Regular Expressions

Abstract:
Matching input against regular expressions is not usually something that
most people worry about optimising, but when you have tens, hundreds or
thousands of regular expressions, then you want a more efficient solution
than merely iterating over the set. A simple approach is to wrap each one
with (? … ) and then join them together with |, which could be sufficient if
you just need to know whether one matched, but what if you want to know
which one(s) matched? In this talk, we will look at how efficiently matching
input against many regular expressions is possible and convenient with RE2,
the regular expression library that Google has released as open source.

-- 
SLUG Activities
Subscription info and FAQs: http://slug.org.au/faq/mailinglists.html