[Solved]1 10 Show Cyk Algorithm Following Example Cnf Grammar G B Ccib W Ababa Ababa L G 2 5 Give Q37209306

1. (10) Show the CYK Algorithm with the following example: -CNF grammar G . Bà CCIb -w is ababa. Is ababa in L(G)? 2. (5) Give a CFG for (w w a n.b n], and convert it into CNF 3. (10) Prove using pumping lemma that (w w- an.b n.c n.dAn] is not Context free 4. (10)Give the grammar for numerical expressions-operations allowed are”, /. +,-, ^. (^ is exponentiation). Symbols allowed are the operations, left and right parentheses, and “num” can be used to refer to any number. Use the standard precedence and associativity. Show transcribed image text 1. (10) Show the CYK Algorithm with the following example: -CNF grammar G . Bà CCIb -w is ababa. Is ababa in L(G)? 2. (5) Give a CFG for (w w a n.b n], and convert it into CNF 3. (10) Prove using pumping lemma that (w w- an.b n.c n.dAn] is not Context free 4. (10)Give the grammar for numerical expressions-operations allowed are”, /. +,-, ^. (^ is exponentiation). Symbols allowed are the operations, left and right parentheses, and “num” can be used to refer to any number. Use the standard precedence and associativity.

Expert Answer

---

Answer to 1. (10) Show the CYK Algorithm with the following example: -CNF grammar G . Bà CCIb -w is ababa. Is ababa in L(G)? 2. (… . . .