written 7.1 years ago by
snehalbailmare
• 320
|
modified 2.3 years ago
by
pedsangini276
• 4.8k
|
Mumbai University > Informatica Technology > Sem 4 > Automata Theory
Marks: 05
Year:May 16
|
written 7.1 years ago by
snehalbailmare
• 320
|
In a CFG, it may happen that all the production rules and symbols are not needed for the derivation of strings.
Besides, there may be some null productions and unit productions.
Elimination of these productions and symbols is called simplification of CFGs.
Simplification essentially comprises of the following steps − …
and 5 others joined a min ago.
and 5 others joined a min ago.