Question: Have to construct 5 Context free grammars and take 3 strings for each of the grammar to test. In these 3 strings, 1 string will
Have to construct 5 Context free grammars and take 3 strings for each of the grammar to test. In these 3 strings, 1 string will be accepted by the grammar and other 2 strings will be rejected. the strings have to be minimum of length 5.
Have to do CNF(Chomsky normal form) and CYK algorithm for all the strings.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
