Question: Q 1 : Assume S = { a , b } . Build a CFG for the language of all strings with a triple a

Q1:
Assume S ={a, b}.
Build a CFG for the language of all strings with a triple a in them. Build a regular grammar for the same language. Convert the CFG into CNF grammar.
Q2:
Assume S ={a, b}.
Q2-1) Build a CFG for the language defined by (aaa+b)*. Convert the CFG into CNF grammar.
Q2-2) Give a leftmost derivation for baaabbaaaaaabb and aaabaaabbbaaa using the CFG grammar in Q2-1.

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 Databases Questions!