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 normal present connects the past and the future through limitation. Contiguity results, crystallization by means of solidification. There also exists, however, a spiritual present that identifies past and future through dissolution, and this mixture is the element, the atmosphere of the poet.
    Novalis [Friedrich Von Hardenberg] (1772–1801)

    When we speak the word “life,” it must be understood we are not referring to life as we know it from its surface of fact, but to that fragile, fluctuating center which forms never reach.
    Antonin Artaud (1896–1948)