Question

2. Let w 100101 and G be the context-free grammar whose productions are given below (Note that G is in Chomsky Normal Form) 2. SKY 7. K ->YC 8. K 1 3, C CY 4. C1 Draw a parse tree for w. a. b. Test membership of w in L(G) using CYK algorithm (CYK algorithm is discussed in Section 7.4.4 of the textbook). Write down your solution step by step by giving proper explanations. c. Which nonterminals in G can be used to generate w?

Answer 1

Se we need 6 Rocos The Tesak watent C. S1 E, y

: . nt present ih given langue . → ky - vuLe,k) + ule,

(с, к) и うq, KY1yy 1 to 9,

プ$ ラダ Olo /oo 101 001 0 Son x43ラ0101 lol ! 이 이1010 1 すy

u (y →te cy づこ

lol oolo と,K) U s ho LE These se Yo Such man-ternoas. mir7 can e