engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
Consider the following Context Free Grammar in Chomsky Normal Form.
\(S \rightarrow AB\)
\(A \rightarrow EF\)
\(B \rightarrow c\)
\(E \rightarrow a\)
\(F \rightarrow b\)
Find the yield length (max) for the above grammar.
Enter numerical value using the virtual keypad. Round off where necessary.