Question: 4. (4 points) Consider the context-free language generated by the grammar G=(V,T,S,P) where V = {S, A,B,C,D}, T = {4,6} and the following production rules,

4. (4 points) Consider the context-free language generated by the grammar G=(V,T,S,P) where V = {S, A,B,C,D}, T = {4,6} and the following production rules, P. SABBA AASTA BBS ABC BAD CAA DBB Are the strings i) bbabs and ii) abaabb accepted by this language? If so, show a derivation tree (Hint: 1 CYK algorithm)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
