Write down a Context Free Grammar with 6 productions (at least 2 of them must be NULL productions) including 3 variables and 2 terminals. Remove the NULL productions from the grammar and then convert the transformed context free grammar into its equivalent CNF. Now, consider your constructed grammar in its CNF. Take a string with length 5. Finally, apply the CYK algorithm to test the membership of that string for the grammar.

Answer rating: 100% (QA)

First a Context Free Grammar is presented below S ASa S bA A A B B 6 B The ... View the full answer