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:
“You will be again as normal and selfish and heartless as anybody
else.”
—Louise Bogan (1897–1970)
“One way to think about play, is as the process of finding new combinations for known things—combinations that may yield new forms of expression, new inventions, new discoveries, and new solutions....It’s exactly what children’s play seems to be about and explains why so many people have come to think that children’s play is so important a part of childhood—and beyond.”
—Fred Rogers (20th century)