Question: Need help with this step by step Grammars Consider the grammar below. S - > IIS | E I - > b | d |

Need help with this step by step
Grammars
Consider the grammar below.
S -> IIS | E
I -> b | d | h | l
E -> a | z
(a) Give derivations in G of the strings bdbbhha, ddbhllz and ddddbba.
(b) Is \lambda in L(G)? Explain your answer
(c) Express L(G) in set notation. Explain why your answer is correct.
(d) Dodgy Roger, a legendary graduate of Pigwarts, claims that the above grammar is a correct
specification of the legal sequences of instruments used in a ceremony (followed by the required
a or z of course). Give (at least) three reasons why Dodgy Roger is incorrect.
(e) Give a (correct) grammar for specifying legal sequences of instruments used in a ceremony.
Explain how you derived your grammar and why it is correct.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!