1. 5
  1.  

  2. 2

    Correct me if I’m wrong, but worst-case backtracking is only a problem in regular expression parsing if you don’t first construct a deterministic finite state machine, right?

    1. 1

      Presumably they are talking about a specific regex engine that only does backtracking. I believe .NET’s default regex engine is one such example.