Two problems
Name:
Anonymous
2009-09-23 16:53
How can I write regular expression that matches any combination of letters a-j up to 12 characters?
Name:
Anonymous
2009-09-23 16:57
[a-j]{0,12}
Name:
Anonymous
2009-09-23 16:57
[a-j]{0,12}
Name:
Anonymous
2009-09-23 16:59
I never understood how can anyone find regexen hard;
[a-j]{,12}
Name:
Anonymous
2009-09-23 17:12
Name:
s
2009-09-23 17:48
Name:
Anonymous
2009-09-23 18:14
i wrote a c compiler using a just a regex when i was 12
Name:
Anonymous
2009-09-23 18:44
[a-j][a-j][a-j][a-j][a-j][a-j][a-j][a-j][a-j][a-j][a-j][a-j]
Name:
Anonymous
2009-09-23 19:11
>>8
[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?[a-j]?
Name:
Anonymous
2009-09-23 20:07
>>4
NOT UNICODE COMPLIANT
Name:
Anonymous
2009-09-23 20:52
regexen
Name:
Anonymous
2009-09-24 4:54
REGEX MY ANUS
Name:
Anonymous
2009-09-24 5:04
Name:
Anonymous
2009-09-24 5:13
Name:
Anonymous
2009-09-24 7:10
ABCDEFGHIJKLMNOPQRSTUVWXYZ
Name:
Anonymous
2009-09-24 9:06
>>15
Thank god for Chrome