Normal Forms
Every context-free grammar that does not generate the empty string can be transformed into one in which no rule has the empty string as a product . If it does generate the empty string, it will be necessary to include the rule, but there need be no other ε-rule. Every context-free grammar with no ε-production has an equivalent grammar in Chomsky normal form or Greibach normal form. "Equivalent" here means that the two grammars generate the same language.
Because of the especially simple form of production rules in Chomsky Normal Form grammars, this normal form has both theoretical and practical implications. For instance, given a context-free grammar, one can use the Chomsky Normal Form to construct a polynomial-time algorithm that decides whether a given string is in the language represented by that grammar or not (the CYK algorithm).
Read more about this topic: Context-free Grammar
Famous quotes containing the words normal and/or forms:
“Philosophically, incest asks a fundamental question of our shifting mores: not simply what is normal and what is deviant, but whether such a thing as deviance exists at all in human relationships if they seem satisfactory to those who share them.”
—Elizabeth Janeway (b. 1913)
“[In government] the problem to be solved is, not what form of government is perfect, but which of the forms is least imperfect.”
—James Madison (1751–1836)