Answer Happy

(answer all please)
QUESTION 31 What is a correct context-free grammar for a language defined as {ab | n20}{a^2nn 20j? OAS-> AB A -> Ab | A B -> Bbb1A OBS ->AB A-> ADA B -> aBbb1 OCS-> SBA A-> Ab | A B -> aBbb | A ODS -> SAB A -> Ab | B -> Bbb | A

QUESTION 32 1 points What is a correct context free grammar for language an+1 n 20) OAS-> Sb. OBS-> Sba OCS-> Sbb OD.S-> Sb bb 1 points QUESTION 33 Which production should be in the grammar for a language L-MUN, where A is the start symbol for M and the start symbol for N, and S is the start symbol for L? OAS-> BSA OBS -> ASIA OCS-> AB ODS-> AB

Question completion Status: QUESTION 34 1 points What is not true about context free languages? O A Non-deterministic context free language is a subset of deterministic context free language OBALL(k) language is a context free language OC A regular language is a context free language D. Deterministic context free language is a subset of non-deterministic context free language QUESTION 35 1 points What is a correct context-free grammar for language and in 201*? OASSIA OB S -> ASIA AaAbi OCS-> SATA A- Abab OD. Both Band

QUESTION 36 What is a correct context-free grammar for a language defined as { an> 0 U {"22037 ОА. S-> AB A -> ADIA B-> aBbb OBS -> AB A-> ADIA B->aBbb | OCS-> SBA A-> Ab | B-> Bbb | A ODS -> SAIB A -> Ab | A B-> aBbb | A

QUESTION 37 1 points Which one of the following grammars is not an LLAR) grammar? OAS - SaS aabab OBS-Saa aab ab OC S-aT TabU U UU OD SaabTabT TaaTIA 1 pair QUESTION 38 When transforming the following grammar to Greibach normal form, do we need to add a new start symbols and a new production S>S? S5 TR TaTb 1A R-> BRIC True False Save AS A

1 poir QUESTION 39 Perform the left-factoring process for the following grammar to find an equivalent LL(K) grammar where k is as small as possible. Which answer is correct? SababcA AAA ОА. ST TBA CA AAA OB SabT TACA AAA Ос. SabTA TAC A+ A A OD. Both B and C

Question Completion Status: T - AC Aal O D. Both B and C QUESTION 40 Which of the following is an equivalent grammar with no left recursion for grammar S-Saas ab? ОА SabT T-STA OB SabT Taal OC SabT TaaSTab OD SabT TaaSTaa