Timeline for Regular expression to match all binary strings with even number of ones and zeros [closed]
Current License: CC BY-SA 3.0
27 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 2, 2015 at 12:01 | review | Suggested edits | |||
Sep 2, 2015 at 12:34 | |||||
Sep 2, 2015 at 10:54 | review | Suggested edits | |||
Sep 2, 2015 at 10:56 | |||||
Sep 2, 2015 at 10:52 | review | Suggested edits | |||
Sep 2, 2015 at 10:53 | |||||
Sep 1, 2015 at 18:18 | comment | added | 200_success | This question has been mentioned on meta. | |
Sep 1, 2015 at 18:03 | history | closed | 200_success | Needs details or clarity | |
Sep 1, 2015 at 18:03 | history | edited | wvxvw | CC BY-SA 3.0 |
This has nothing to do with Emacs. Other previous edits were irrelevant.
|
Sep 1, 2015 at 18:01 | history | reopened | 200_success | ||
Sep 1, 2015 at 18:00 | history | edited | 200_success | CC BY-SA 3.0 |
deleted 30 characters in body; edited tags; edited title
|
Aug 31, 2015 at 18:10 | history | closed |
ratchet freak Malachi SuperBiasedMan janos Ethan Bierlein |
Not suitable for this site | |
Aug 31, 2015 at 16:55 | answer | added | rolfl | timeline score: 8 | |
Aug 31, 2015 at 16:46 | answer | added | ErikR | timeline score: 13 | |
Aug 31, 2015 at 16:33 | vote | accept | wvxvw | ||
Aug 31, 2015 at 16:29 | answer | added | jessehouwing | timeline score: 14 | |
Aug 31, 2015 at 16:18 | comment | added | wvxvw | @jessehouwing no, I can't be doing balancing, because then it wouldn't be an FDA :) that would send all the CS degrees obtained in the last 40 or so years down the drain :) | |
Aug 31, 2015 at 16:13 | comment | added | wvxvw | @jessehouwing zero is even, so empty string is a perfectly acceptable word in the language. Re' balancing groups, beside being unavailable in most popular regex engines, they extend the power of the language beyond regular. What really surprised me in this example is that despite being very easily expressible in one formal way, it's not exactly straight-forward to express it in a different way. | |
Aug 31, 2015 at 16:10 | comment | added | jessehouwing | It should be possible to use balancing groups as well, but I'm too lazy to look up the syntax ;) | |
Aug 31, 2015 at 15:40 | comment | added | wvxvw | @SuperBiasedMan this is not a question about basics of writing regexps... please take care to read it. Your effort is appreciated, but, unfortunately, misplaced. | |
Aug 31, 2015 at 15:40 | review | Close votes | |||
Aug 31, 2015 at 18:10 | |||||
Aug 31, 2015 at 15:36 | comment | added | SuperBiasedMan | You might find this site more helpful | |
Aug 31, 2015 at 15:32 | comment | added | wvxvw | @jessehouwing OK, assuming Python and JavaScript regex engines are bogus (I can understand the rationale behind your example), this regex will not accept 1001 string for example. | |
Aug 31, 2015 at 15:24 | comment | added | rolfl | I misunderstood the question, that there have to be an even number of 1's, and an even number of 0's. I just understood the need to be an even number of characters in total. | |
Aug 31, 2015 at 15:23 | comment | added | wvxvw |
@jessehouwing I'm trying to test this with Python re library, and, surprisingly, this doesn't match anything at all...
|
|
Aug 31, 2015 at 15:14 | history | edited | wvxvw | CC BY-SA 3.0 |
added 4 characters in body
|
Aug 31, 2015 at 15:14 | comment | added | wvxvw | @jessehouwing OK, I'll add the start / end requirements, but by matching I didn't mean partial match. So, I don't think this is essential. | |
Aug 31, 2015 at 15:12 | comment | added | wvxvw | @rolfl this will match 01 - which has odd number of zeros and ones. | |
Aug 31, 2015 at 15:08 | comment | added | rolfl |
And what's wrong with ([01][01])+ ?
|
|
Aug 31, 2015 at 15:03 | history | asked | wvxvw | CC BY-SA 3.0 |