News for hackers. Stuff that matters.
Re:Python code to solve xkcd 1313 by Peter Norvig by jules on Tuesday January 07, 2014 @11:40AM (#7018174)
You would be much better off just generating the DFA of the straightforward regex and minimizing that DFA. This is simpler and faster to generate and faster to execute. Furthermore, in a parser for a programming language you do not want to match some things in one list but not in this other list, you want to match some things in this list and nothing else.

There are no comments on this comment yet.