Thanks. This tool was really more or less for fun but I'd been thinking about it for a while. According to some benchmarks it appears the generated patterns are pretty fast. When I get some more time, I definitely want to see if converting the word trie to a DAWG and then to a regular expression will produce even better patterns. Of course, this means pattern construction will be slower.
More or less I'd like some input on ways to improve the efficiency of the whole thing. On Tuesday, July 30, 2013 3:49:49 AM UTC-7, Mikera wrote: > > On Monday, 29 July 2013 21:20:49 UTC+1, Joel Holdbrooks wrote: >> >> I spent some time this weekend writing a little tool for generating >> regular expressions *from known inputs*. My goal is to produce regular >> expressions that backtrack as few times as possible along with a complete >> and total disregard for readability. :) >> >> The code for the tool is here <https://github.com/noprompt/frak>. >> Suggestions/ideas would be greatly appreciated. >> > > Nice - I like the fact that it has a very simple API that focuses on doing > just one thing well! > -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
