You are a QB Reader user. Answer some questions about string parsing techniques you may use, for 10 points each.
[10m] In an attempt to differentiate Invisible Man from The Invisible Man, you query the QB Reader database using these strings. These strings use meta·characters like the Kleene star to help match patterns in a target string.
ANSWER: regular expressions [accept regex or regexp or rational expressions]
[10h] If your regex contains many nested quantifiers, it may take exponential time to run due to the “catastrophic” form of this process. In general, this process solves problems through a systematic search of the solution space, undoing partial solutions when they lead to dead ends.
ANSWER: backtracking [accept catastrophic backtracking; prompt on recursion]
[10e] To find mentions of the TV show M*A*S*H, which includes asterisks in its title, you precede the asterisks with characters of this name. A key with this name found on the top left of keyboards is often used to exit programs.
ANSWER: escape [accept escape character or escape sequence or Esc]
<JC, Other Science - Computer Science>