Several regexps I've written are behaving terribly slow. I understand this stems from the algorithm (NFA) perl uses. I understand, too, that it's very likely that my regexps are poorly written. Is there a module that changes the regexp algorithm (losing backreferences, I know) so it's a NDA? Or is there a tool (maybe it's theoretically impossible and I'm asking nonsense) that transforms my regexp into a NFA-efficient equivalent? I don't care about $1,$2... for now.
FYI, here's one of the offending regexps (I removed non-greedy repetitions and some nesting to no avail):
Could split() be my friend in this or similar cases (looking for something in the nth. element in a HTML table)?