S-expressions are a classic example of something that <i>can&#x27;t</i> be matched with a DFA or NFA. In order to know how many parens are currently open (and therefore needing to be matched with closing parens) it would need an unbounded number of states.