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:

    “Marriages will survive despite enormous strains. A lover will ask, “Is he happy? Can he still love her?” They don’t realise that’s not the point, it’s all the normal things they do together—going to the supermarket, choosing wallpaper, doing things with the children.”
    —Carol Clewlow (b. 1947)

    “You may melt your metals and cast them into the most beautiful moulds you can; they will never excite me like the forms which this molten earth flows out into. And not only it, but the institutions upon it are plastic like clay in the hands of the potter.”
    —Henry David Thoreau (1817–1862)