Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.java.softwaretools > #17
| From | David Lamb <dalamb@cs.queensu.ca> |
|---|---|
| Newsgroups | comp.lang.java.softwaretools |
| Subject | Re: Regex tools |
| References | <9516p69657r0vi887067gnu632f0hvmrbv@4ax.com> |
| Message-ID | <GqMkp.1583$g56.573@newsfe04.iad> (permalink) |
| Date | 2011-03-30 16:31 -0400 |
On 30/03/2011 6:27 AM, Roedy Green wrote: > has anyone ever thought of writing a regex debugging frame. > The thing that bothers me is I am never sure a regex is fully > debugged. It has been far too long since I've looked at finite automata theory, but I suspect somebody already develiped some algorithm generating a minimal set of inputs that drives a deterministic finite state machine through some suitable set of paths through its states. (I'm thinking of needing only a few of test cases for (a)*: zero a's, one, and either 2 or some larger number. But regexes in programming languages are lots more complex than the ones usually used in theory (where all you get is primitives like single symbol, sequencing like ab, repetition like a*, and alternation like a|b.
Back to comp.lang.java.softwaretools | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Regex tools Roedy Green <see_website@mindprod.com.invalid> - 2011-03-30 03:27 -0700 Re: Regex tools David Lamb <dalamb@cs.queensu.ca> - 2011-03-30 16:31 -0400 Re: Regex tools terry0k <terryok00@gmail.com> - 2011-05-12 21:01 +0800 Re: Regex tools Robert Klemme <shortcutter@googlemail.com> - 2011-05-27 21:38 +0200
csiph-web