> ... and can be compiled into finite state machines. ... I am not a big fan of this argument without a 'but'. It is usually overlooked that the finite state

> ... and can be compiled into finite state machines. ... I am not a big fan of this argument without a 'but'. It is usually overlooked that the finite state machine can become exponentially large (=totally unusable), because sets of non-deterministic states are used for deterministic states. This caused me major trouble in a project where this effect was not noticed during the design phase. I find this important to stress because the finite state machine can usually be constructed without problems (e.g. by the flex tool), so this property of regexps is undoubtedly useful. But sometimes, it may explode on you.