- Give Me The Explanation I Need Fresh Answer So Dont Copy Past I Will Thumbs Down Your Answer 1 (52.26 KiB) Viewed 6 times
I NEED FRESH ANSWER SO DONT COPY PAST
I WILL THUMBS DOWN YOUR ANSWER
Q3. (4 pts) Considering following context free grammar G = ({S, A, B, K, U, T, V, W, Y, Z}, {a, b}, P, S) with below production rules S→ AV |AB|SB|WY|ZV|BV|ZB|BB|UU|a|b Ub V→ SB W → SU Y→ US Z → BA T→UA K → SA A → TK | TA|US|a|b decide employing the Cocke Kasami Younger (CKY) algorithm whether the string "x = aabab" belongs to the language L(G). Important. Recall that CKY algorithm functions on grammars in Chomsky Normal Form (CNF). Therefore make sure before employing the algorithm that G is already in CNF; transform G into an equivalent grammar in CNF, otherwise.