Strongest date Regular Expression

1. Simple date judgment (YYYY/MM/DD): ^ \ d {4} (\-|\/ | \.) \ d {1, 2} \ 1 \ d {1, 2} $2. Evolutionary date judgment (YYYY/MM/DD | YY/MM/DD ): ^ (\ d {4} | \ d {2}) (\-| \/| \.) \ d {1, 2} \ 3 \ d {1, 2} $) | (^ \ d {4} year \ d {1, 2} month \ d {1, 2} day $) $3. Evaluation of joining a leap year: instance: ^ (1 [6-9] | [2-9] \ d) \ d {2 }) -(0? [1, 13578] | 1 [02])-(0? [1-9] | [12] \ d | 3 [01]) | (1 [6-9] | [2-9] \ d) \ d {2})-(0? [13456789] | 1 [012])-(0? [1-9] | [12] \ d | 30) | (1 [6-9] | [2-9] \ d) \ d {2 }) -0? 2-(0? [1-9] | 1 \ d | 2 [0-8]) | (1 [6-9] | [2-9] \ d) (0 [48] | [2468] [048] | [13579] [26]) | (16 | [2468] [048] | [3579] [26]) 00)-0? 2-29-) $ analysis: 1. What is a valid date range? This issue varies with different application scenarios. Here we adopt the conventions in MSDN: DateTimeValue Type indicates the date and time between midnight 12:00:00 on January 1, January 1, 0001 and 11:59:59 on January 1, December 31, 9999. 2. Explanation of a leap year. The earth's cycle around the sun is called a year of return, and the Earth returns to the Age of 365 at 05:48:46. Therefore, there are provisions on the Gregorian calendar for the Year of the year, compared to the year of the Year of the 365 days, a total of 0.2422 days, so every four years increase one, it is a leap year. However, the increase in one day in four years is more than 0.0312 days after four years of regression, and 400 days after 3.12. Therefore, three leap years are missing in 400, that is, only 97 leap years are set in 400, in this way, the average length of the Gregorian calendar year is similar to that of the Year of regression. Therefore, it is stipulated that the year must be a multiple of 400 to a hundred years, for example, 1900 and 2100 are not a leap year. First, verify the year. Obviously, the year range is 0001-9999, and the regular expression matching YYYY is: [0-9] {3} [1-9] | [0-9] {2} [1-9] [0-9] {1} | [0-9] {1} [1-9] [0-9] {2} | [1-9] [0-9] {3}[0-9] can also be expressed as \ d, but \ d is not as intuitive as [0-9], so I will always use [0-9]

There are two difficulties in verifying a date using regular expressions: one is that the number of days in a month is different, and the other is the consideration of a leap year.
For the first difficulty, we do not consider the leap year first. Assume that the year of February is 28 days. In this way, the month and date can be divided into three situations:

1. the month is 1, 3, 5, 7, 8, 10, 12, the number of days is 01-31, the regular expression that matches the MM-DD is:

(0 [0, 13578] | 1 [02])-(0 [1-9] | [12] [0-9] | 3 [01])2, the month is 4, 6, 9, 11, the number of days is 01-30, the regular expression that matches the MM-DD is: (0 [2, 469] | 11)-(0 [1-9] | [12] [0-9] | 30)3, the month is 2, consider the year, match the regular expression of the MM-DD is: 02-(0 [1-9] | [1] [0-9] | 2 [0-8])Based on the above results, we can obtain the regular expression matching the year date format as YYYY-MM-DD:

([0-9] {3} [1-9] | [0-9] {2} [1-9] [0-9] {1} | [0-9- 9] {1} [1-9] [0-9] {2} | [1-9] [0-9] {3 }) -(0 [13578] | 1 [02])-(0 [1-9] | [12] [0-9] | 3 [01]) | (0 [469] | 11)-(0 [1-9] | [12] [0-9] | 30 )) | (02-(0 [1-9] | [1] [0-9] | 2 [0-8])

Next we will solve the second difficulty: The consideration of the leap year. Based on the definition of a leap year, we can divide a leap year into two categories:

1. The year in which the product can be divisible by 4 but cannot be divisible by 100. Find the variation rules of the last two digits and quickly obtain the following regular match:

([0-9] {2}) (0 [48] | [2468] [048] | [13579] [26])2. The year to be divisible by 400. The number that can be divisible by 400 is certainly 100, so the last two must be 00. We only need to ensure that the first two can be divisible by 4. The corresponding regular expression is: (0 [48] | [2468] [048] | [3579] [26]) 00 2. Most Strong Verification Positive date Then Expression, Added Bytes Years Verify

ThisDate (positive)ThenExpressions supported
YYYY-MM-DD
YYYY/MM/DD
YYYY_MM_DD
YYYY. MM. DDFormat

Match: 2008-2-29 2008/02/29

Not match: 2008-2-30 2007-2-29CompleteThenThe expression is as follows:(^ (1 [8-9] \ d {2}) | ([2-9] \ d {3 }))([-\/\. _]) (10 | 12 | 0? [13578]) ([-\/\. _]) (3 [01] | [12] [0-9] | 0? [1-9]) $) | (^ (1 [8-9] \ d {2}) | ([2-9] \ d {3 })) ([-\/\. _]) (11 | 0? [469]) ([-\/\. _]) (30 | [12] [0-9] | 0? [1-9]) $) | (^ (1 [8-9] \ d {2}) | ([2-9] \ d {3 })) ([-\/\. _]) (0? 2) ([-\/\. _]) (2 [0-8] | 1 [0-9] | 0? [1-9]) $) | (^ ([2468] [048] 00) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([3579] [26] 00 )([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([1] [89] [0] [48]) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([2-9] [0-9] [0] [48]) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([1] [89] [2468] [048]) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([2-9] [0-9] [2468] [048]) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([1] [89] [13579] [26]) ([-\/\. _]) (0? 2 )([-\/\. _]) (29) $) | (^ ([2-9] [0-9] [13579] [26]) ([-\/\. _]) (0? 2) ([-\/\. _]) (29) $ ))A leap year has 29 days in February, so the regular expression that matches the leap year date format as YYYY-MM-DD is:

([0-9] {2}) (0 [48] | [2468] [048] | [13579] [26]) | (0 [48] | [2468] [048] | [3579] [26]) 00)-02-29At lastBytesDate of yearVerifyExpression merge, IAreGet the mostFinalOfVerifyDate FormatIsYYYY-MM-DDOfThenExpressionIs:

([0-9] {3} [1-9] | [0-9] {2} [1-9] [0-9] {1} | [0 -9] {1} [1-9] [0-9] {2} | [1-9] [0-9] {3 }) -(0 [13578] | 1 [02])-(0 [1-9] | [12] [0-9] | 3 [01]) | (0 [469] | 11)-(0 [1-9] | [12] [0-9] | 30 )) | (02-(0 [1-9] | [1] [0-9] | 2 [0-8]) | ([0-9] {2}) (0 [48] | [2468] [048] | [13579] [26]) | (0 [48] | [2468] [048] | [3579] [26]) 00)-02-29)

DD/MM/YYYYFormatVerifyExpressionIs:

(0 [1-9] | [12] [0-9] | 3 [01])/(0 [13578] | 1 [02]) | (0 [1-9] | [12] [0-9] | 30)/(0 [469] | 11 )) | (0 [1-9] | [1] [0-9] | 2 [0-8])/(02 )) /([0-9] {3} [1-9] | [0-9] {2} [1-9] [0-9] {1} | [0 -9] {1} [1-9] [0-9] {2} | [1-9] [0-9] {3 })) | (29/02/([0-9] {2}) (0 [48] | [2468] [048] | [13579] [26]) | (0 [48] | [2468] [048] | [3579] [26 )))