Hacker Read

dave_au · 2009-06-02 00:51:32+00:00

I'd write a kick-ass regular expression engine.

http://perl.plover.com/NPC/NPC-3SAT.html

reply

raldi | karma 23818 | avg karma 6.05 · | 2015-08-22 20:18:52

Oh, neat.

Perl 6 appears to have assimilated that idea: http://doc.perl6.org/language/regexes#Subrules

reply

davidgay | karma 1176 | avg karma 2.65 · | 2023-07-22 09:23:15

The perl version of regexps is np-hard...

https://perl.plover.com/NPC/

reply

chaosfox | karma 509 | avg karma 4.35 · | 2019-06-27 17:22:52+00:00

see also, Perl Regular Expression Matching is NP-Hard: https://perl.plover.com/NPC/

fock | karma 1250 | avg karma 1.35 · | 2019-02-09 22:15:16

Oh yeah, let's write a parser for html, because regex is too hard https://blog.codinghorror.com/parsing-html-the-cthulhu-way/

michaelaiello | karma 354 | avg karma 3.81 · | 2016-04-10 12:10:18+00:00

This problem is also fun with perl regexes

http://www.perlmonks.org/?node_id=297616

reply

JadeNB | karma 5437 | avg karma 1.21 · | 2016-05-15 18:03:13

Like almost everything to do with regexes, Perl did it first: http://perldoc.perl.org/perlre.html#%2fx .

sateesh | karma 460 | avg karma 2.01 · | 2013-10-22 06:16:13

Oh that has already been done too, using perl :) http://stackoverflow.com/questions/4231382/regular-expressio... (Check the answer from tchrist)

bsaunder | karma 869 | avg karma 2.4 · | 2008-11-12 14:22:03+00:00

Your colleague may be interested in pcre (perl compatible regular expressions) see http://www.pcre.org

But I agree, C isn't the best choice for that task.

reply

k4st | karma 147 | avg karma 1.5 · | 2013-04-27 18:35:35+00:00

This reminds me a lot of the regular expression reAnimator: http://osteele.com/tools/reanimator/.

chli | karma 243 | avg karma 2.64 · | 2011-01-22 13:55:58+00:00

I use that to generate my regular expressions and test them :

http://www.ultrapico.com/Expresso.htm

reply

everybodyknows | karma 7076 | avg karma 3.28 · | 2023-01-28 09:14:32

This may be enough to make the Perl-style regexes comprehensible:

https://perldoc.perl.org/perlre#Character-Classes-and-other-...

reply

whoisjuan | karma 7408 | avg karma 6.63 · | 2019-04-04 05:14:11+00:00

REGEX in Perl 6 looks pretty amazing: https://docs.perl6.org/language/regexes

zacwest | karma 1414 | avg karma 10.32 · | 2024-02-11 04:21:19

Probably the first step would be a good, non-regular-expression (IIRC, URLs are not regular) based link parser that's ported to every possible language on the planet.

j1elo | karma 4797 | avg karma 4.42 · | 2021-03-10 06:50:20+00:00

Albeit the typical first reaction might be that of XKCD 927 (I must confess it was mine, at least), I believe that the regular expressions area is territory that could see some innovation. If told to pick just one feature from eggex, I'd choose the ability to parse statically!

FWIW I think this deserves a submission of its own, so here it is:

https://news.ycombinator.com/item?id=26408510

reply

Splendor | karma 1699 | avg karma 2.72 · | 2015-01-13 14:16:34+00:00

Or http://regexper.com/.

gbacon | karma 1191 | avg karma 2.13 · | 2019-07-07 20:01:27

Perl Regular Expression Matching is NP-Hard

https://perl.plover.com/NPC/

reply

haberman | karma 20020 | avg karma 5.73 · | 2011-06-11 22:27:26

I'm working on making my ideal tool: http://www.reverberate.org/gazelle/

It's been a long time coming, but I believe very strongly in it.

"pain in the ass to integrate" -- I can sympathize. I'm working tirelessly to make this as easy to integrate as regexes are in Perl, Python, Ruby, etc.

reply

JadeNB | karma 5437 | avg karma 1.21 · | 2011-11-12 20:26:02+00:00

> Still it makes me want to write an SKI interpreter.

How about in Perl-style regexes? http://www.perlmonks.org/?node_id=809842

reply

klyrs | karma 20410 | avg karma 2.5 · | 2021-03-01 17:47:04

Depends what you mean by "regular expression," but matching in perl regexps is NP-Hard.

https://perl.plover.com/NPC/

reply