Question: 5) Using the alphabet ? = {a, b, e, (, ), +, *} (Note that e stands for the character of epsilon, to distinguish it
5) Using the alphabet ? = {a, b, e, (, ), +, *} (Note that "e" stands for the character of epsilon, to distinguish it from the empty string, ?. Also note that the left parenthesis and right parenthesis are letters in this alphabet) Then create a CFG that generates valid regular expressions. For example, the CFG could generate the word a+(bb)*, or abb*(aa+e). Is the language generated by the grammar you just constructed regular? Why or why not?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
