Home/ Questions/Q 8949041
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-15T13:08:47+00:00

Write a regular expression that describes all strings of zeroes and ones representing binary

  • 0

“Write a regular expression that describes all strings of zeroes and ones representing binary numbers that are either odd or divisible by 8. The numbers may not have any leading zeros.”

I gave my answer as (000|1)$ which was marked wrong. I cannot see the reason why. Please explain! Thanks in advance.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You forgot two of the requirements.

    1. It must contain only 1s and 0s:

      ^[01]*(000|1)$

    2. There may be no leading 0s:

      ^(?!0)[01]*(000|1)$

      If lookaheads are not allowed, it becomes a bit trickier:

      ^1[01]*(000|1)$|^1$

    Another addition, if you are allowed to use only the regular expression constructs that are available in “theoretical” regular expressions (alternation, group and repetition), it would look like this (anchors are implicit in this case):

    1(0|1)*(000|1)|1
    • 0