Bad performance of simple regular expression - why??

[Jascha Wetzel]

Manfred Nowak wrote:
> Also for maximal munching several regular expression there is no need 
> for backtracking. 

maximal munch, non-greedy matching and negative matches would usually
use backtracking. doing it without backtracking would require to use
several DFAs - or is there a simpler method?

afaik, the "school-book-way" for backtracking are deterministic pushdown
automatons (PDAs) that can also be interpreted efficiently or compiled
to bytecode.
so i don't see why there shouldn't be backtracking in the regexp
implementation.