Question: Consider the following grammar over Sigma = { a , b , c , d } : S - > Sa | dT T

Consider the following grammar over \Sigma ={a, b, c, d}:
S -> Sa | dT
T -> bTb | c
How many of the following strings are not in L(G)?
dc
dca
cad
dTaa
bcb

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!