Examination of regex range validation using lower and upper bound values
A programming challenge? Maybe a bit of one. If nothing else it is a neat algorithm and examination of generating capture groups that will handle numbers within ranges. The first posting I did on this I examined the generation of 0 through N ranges and ended with the examination of parsing 0-255 or a byte value. In this posting I examine using a lower bound that is not 0, how many decompositions are required to validate such a range, and a general purpose algorithm for doing so.
0 through N ranges are interesting, but what about M through N ranges.