News for hackers. Stuff that matters.
Re:Go 1.1beta1 now on the benchmarks game by baq on Wednesday April 17, 2013 @12:24PM (#5565337)
As a member of the masses of programmers that typically deal with truckloads of trivial problems, his reply is worth as much as the benchmark he criticizes. I've never used anything but a trivial regexp (for some values of trivial) in production code (one-shot problems don't count) and I don't give a damn what is being benchmarked here - I only care if my Python script runs fast.
Re:Go 1.1beta1 now on the benchmarks game by kibwen on Wednesday April 17, 2013 @12:42PM (#5565444)
Actually, I might agree with Go here. I agree that most of my regexes are the trivial kind that don't exhibit exponential growth, but that's only because I also control the input to all those regexes. But Go's intended niche appears to be for user-facing server-side programs, and in that environment if you ever run a naive exponential-time regex against user-supplied input you're setting yourself up for a potential DOS attack.
Re:Go 1.1beta1 now on the benchmarks game by danieldk on Wednesday April 17, 2013 @01:07PM (#5565605)
But Go's intended niche appears to be for user-facing server-side programs, and in that environment if you ever run a naive exponential-time regex against user-supplied input you're setting yourself up for a potential DOS attack.

Yes, but for larger recognizers, one would probably use something like Ragel anyway. A DSL that provides intersection, union, difference, concatenation, composition, etc. makes it far easier to construct elaborate automata from smaller expression than the 'compile a big regex string' approach.

Re:Go 1.1beta1 now on the benchmarks game by Bakkot on Wednesday April 17, 2013 @12:52PM (#5565498)
Why not use the potentially exponential algorithm initially and timeout and fall back to the linear case if the sometimes-quick one has taken longer than the linear one would have? At most a 2x slowdown for complex cases, and substantial speedup for the simple ones.
Re:Go 1.1beta1 now on the benchmarks game by danieldk on Wednesday April 17, 2013 @01:12PM (#5565641)
It depends, if you have the opportunity to build a DFA once, why not do it? It's only a one-time cost.

I think the more serious problem is that what most people consider to be a 'regular expression' does not express a regular language, and hence cannot be expressed as a finite state automaton.

Re:Go 1.1beta1 now on the benchmarks game by ja30278 on Wednesday April 17, 2013 @12:33PM (#5565387)
Re:Go 1.1beta1 now on the benchmarks game by EdiX on Wednesday April 17, 2013 @01:25PM (#5565734)
I think his answer is useful. It does explain what's going on. If the performance characteristics of PCRE suit your problem better it's trivial to write a cgo wrapper for it. There's even one on github, though I don't know if it works.
Re:Go 1.1beta1 now on the benchmarks game by igouy on Wednesday April 17, 2013 @01:31PM (#5565769)
It works (and will be updated across the website once Go1.1 is released).

http://benchmarksgame.alioth.debian.org/u64q/benchmark.php?t...