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:

    The word career is a divisive word. It’s a word that divides the normal life from business or professional life.
    Grace Paley (b. 1922)

    It is given to few to add the store of knowledge, to strike new springs of thought, or to shape new forms of beauty. But so sure as it is that men live not by bread, but by ideas, so sure is it that the future of the world lies in the hands of those who are able to carry the interpretation of nature a step further than their predecessors.
    Thomas Henry Huxley (1825–95)