Write a regular expression that matches all numbers between 5-32, (including 5 and 32).

Question

Question

Answer 1

Answer #1

^(2[0-9]|1[0-9]|[5-9]|3[0-2])
2[0-9] : this is for 20-29
1[0-9] : this is for 10-19
3[0-2] : this is for 30-32
5-9 : this is for 5-9

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me

Answer 2

Similar Homework Help Questions

Write a regular expression that matches whole numbers, such as 34, and 8, as well as...

Write a regular expression that matches whole numbers, such as 34, and 8, as well as real numbers with two decimal digits, such as 100.99 and 3.56. Your regular expression will not match numbers with one decimal digits, such as 3.4 or more than two decimal digits, such as 3.555. Answer:
Write a regular expression that matches: a) all strings that end with a dot character ".",...

Write a regular expression that matches: a) all strings that end with a dot character ".", without the quotes. b) all strings that begin with a "#" character, without the quotes. c) all floating-point numbers using standard notation (e.g., 12.345 or –12.345). Note that matching numbers may contain any number of digits before or after the decimal point. d) all floating-point numbers using scientific notation (e.g., 1.234e+5 or –1.234E–5). Again, matching numbers may contain any number of digits before or...
I. Write a regular expression that matches a string of bits only if: it starts with...

I. Write a regular expression that matches a string of bits only if: it starts with a '0', ends with a '00', and has a '1' between every '010'.

6. [4 marks] Write a regular expression over the alphabet of numeric digits that matches strings...

6. [4 marks] Write a regular expression over the alphabet of numeric digits that matches strings formatted as integers between 33 and 526 (inclusive). For example, the following strings should be accepted: • 33 • 51 • 290 • 526 But the following strings should not be accepted: • 9 • 31 • 607 • 1000
Write a PHP regular expression pattern that matches a string that satisfies the following description: The...

Write a PHP regular expression pattern that matches a string that satisfies the following description: The string must begin with the (uppercase) letter A. Any three alphanumeric characters must follow. After these, the letter B (uppercase or lowercase) must be repeated one or more times, and the string must end with two digits.
5. Describe informally the kind of pattern that matches the following extended regular expression: [b-d]a?e+ and...

5. Describe informally the kind of pattern that matches the following extended regular expression: [b-d]a?e+ and rewrite it using only the basic (not extended) features of formal regular expressions. [For example, character classes [.1 positive closures +, and optionals? are not basic features, and should be expressed using only the basic taxonomy instead]. [4 marks 6. Explain the assertion that " there is more to taking Compiler Construction course than solely at writing a typical compiler" aiming [3 marks 5....

Language: Java. Use regular expression to find matches where the word [Pg XX] appears. X is...

Language: Java. Use regular expression to find matches where the word [Pg XX] appears. X is one or more digits. the numbers is what we want saved. Examples: hahhaha[Pg XX] haha [Pg XX]aadjrfrur and so on
Question 6 10 pts For each regular expression below, fill in the table with an expression...

Question 6 10 pts For each regular expression below, fill in the table with an expression of length 5 which matches the expression and an expression of length 5 which does NOT match the expression. If any of these tasks is impossible, write "impossible" in the table and comment below. The alphabet for this problem is {0, 1, 2} Regular Expression String, length 5, which matches String, length 5, which does NOT match 0*((01112)* I (22)* ) * (012)*1 (20)*...
UNIX and Shell Programming. Given the regular expression, circle all the matching patterns. Probl...

UNIX and Shell Programming. Given the regular expression, circle all the matching patterns. Problem 1. \..\{3\}$ a. rs.ef$tt b. abc.ab c. abc.$$$$ d. abc e. none Problem 2: :?.? a. :a????????? b. eeeeeefffff?hhhh c. aaa::?????? d. :?.\? e. none Problem 3. Write a regular expression that matches a nonblank line.

5. Describe informally the kind of pattern that matches the following extended regular expression: [b-d]a?e+ and...

5. Describe informally the kind of pattern that matches the following extended regular expression: [b-d]a?e+ and rewrite it using only the basic (not extended) features of formal regular expressions. [For example, character classes [.1 positive closures +, and optionals? are not basic features, and should be expressed using only the basic taxonomy instead]. [4 marks 6. Explain the assertion that " there is more to taking Compiler Construction course than solely at writing a typical compiler" aiming [3 marks