はてなブックマーク

What are Lightning Talks? Lightning Talks are sixteen five-minute talks in a ninety-minute time slot (or eleven in a sixty-minute slot.) Why Would You Want to do a Lightning Talk? Maybe you've never given a talk before, and you'd like to start small. For a Lightning Talk, you don't need to make slides, and if you do decide to make slides, you only need to make three. Maybe you're nervous and you'r

Mark-Jason Dominus Copyright © 1998 The Perl Journal. Reprinted with permission. This isn't an article about how to use regexes; you've probably seen plenty of those already. It's about how you would write a regex package from scratch, in a language like C that doesn't already have regexes. I'll demonstrate a new module, Regex.pm, which implements regexes from nothing, in Perl. This will give you

Matching ordinary regular expresions can be done in polynomial time, proportional to MN, where M is the length of the regular expression and N is the length of the string to be matched. The usual method for this is: Parse the regular expression and construct an equivalent finite automaton (FA), which will have O(M) states; then simulate the action of the FA on the input, which takes O(MN) time. My

Last Change: 11 July 2003 History of changes to my pages, including this one. Legend Added in the last four weeks. Updated in the last four weeks. Don't hold your breath. Complete List of Perl Paraphernalia Why I am boycotting Amazon -- $581.96 so far. List of upcoming public appearances Search Perl Paraphernalia Classes and Talks: General Information Lightning Talks / Communications éclair Paid C