Question: One use for regular expressions is to define concisely all the patterns that belong to a particular language formed from sequences of symbols. Consider the
One use for regular expressions is to define concisely all the patterns that belong to a particular language formed from sequences of symbols.
Consider the regular expression:
br?[ea]+d
Which of the following words does NOT belong to the language defined by this expression?
| bed | ||
| bard | ||
| bead | ||
| breed | ||
| brad | ||
| bad | ||
| bread |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
