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)

    A strange effect of marriage, such as the nineteenth century has made it! The boredom of married life inevitably destroys love, when love has preceded marriage. And yet, as a philosopher has observed, it speedily brings about, among people who are rich enough not to have to work, an intense boredom with all quiet forms of enjoyment. And it is only dried up hearts, among women, that it does not predispose to love.
    Stendhal [Marie Henri Beyle] (1783–1842)