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:

    Everyone in the full enjoyment of all the blessings of his life, in his normal condition, feels some individual responsibility for the poverty of others. When the sympathies are not blunted by any false philosophy, one feels reproached by one’s own abundance.
    Elizabeth Cady Stanton (1815–1902)

    A painter told me that nobody could draw a tree without in some sort becoming a tree; or draw a child by studying the outlines of its forms merely,—but by watching for a time his motions and plays, the painter enters into his nature and can then draw him at will in every attitude.
    Ralph Waldo Emerson (1803–1882)