Context-free Grammar - Normal Forms

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:

    Normality highly values its normal man. It educates children to lose themselves and to become absurd, and thus to be normal. Normal men have killed perhaps 100,000,000 of their fellow normal men in the last fifty years.
    —R.D. (Ronald David)

    The most passionate, consistent, extreme and implacable enemy of the Enlightenment and ... all forms of rationalism ... was Johann Georg Hamann. His influence, direct and indirect, upon the romantic revolt against universalism and scientific method ... was considerable and perhaps crucial.
    Isaiah Berlin (b. 1909)