Regexp::Debugger can be elucidating. And remember ? making something non-greedy changes from "leftmost longest" to "leftmost shortest which still matches"; because the zero-space assertion follows it's got to backtrack and keep expanding until that's satisfied (by a transition from word-char to not-word-char).