Given the following grammar:
S → AaB | aBb A → a | C B → FAb | bA C → CDB | ϵ D → A | B | ab E → b | A F → aF
A CYK parser is parsing the input “Int , Int ⇒ Int”. The incomplete tables for two different grammars are given below.
Consider a context-free grammar without unit or ε-productions. Assume that the maximum number of symbols on the right hand side of any production is . Show that there exists an equivalent grammar in Chomsky normal form with no more than production rules. The set is the set of production rules and is the set of terminals.