 |
|
| |
|
|
|
at Global Oneness Community.
Share your dreams and let others help you with the interpretation!
Dream Sharing Forum
|
|
Context-free grammar - Normal forms | | Context-free grammar - Normal forms: Encyclopedia II - Context-free grammar - Normal forms | | Every context-free grammar which does not generate the empty string can be transformed into an equivalent one 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 which decides whether a given string is in the language re ...
See also:Context-free grammar, Context-free grammar - Formal definition, Context-free grammar - Examples, Context-free grammar - Example 1, Context-free grammar - Example 2, Context-free grammar - Example 3, Context-free grammar - Example 4, Context-free grammar - Other examples, Context-free grammar - Derivations and syntax trees, Context-free grammar - Normal forms, Context-free grammar - Undecidable problems, Context-free grammar - Properties of context-free languages | | | Context-free grammar, Context-free grammar - Derivations and syntax trees, Context-free grammar - Example 1, Context-free grammar - Example 2, Context-free grammar - Example 3, Context-free grammar - Example 4, Context-free grammar - Examples, Context-free grammar - Formal definition, Context-free grammar - Normal forms, Context-free grammar - Other examples, Context-free grammar - Properties of context-free languages, Context-free grammar - Undecidable problems, Parsing, Formal grammar, Parsing expression grammar | | |
| | | Context-free grammar: Encyclopedia II - Context-free grammar - Normal forms
Context-free grammar - Normal forms
Every context-free grammar which does not generate the empty string can be transformed into an equivalent one 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 which decides whether a given string is in the language represented by that grammar or not (the CYK algorithm).
Other related archivesBackus-Naur Form, CYK algorithm, Chomsky normal form, Earley parser, Formal grammar, Greibach normal form, LL parsers, LR, LR parsers, Lojban, Panini, Parsing, Parsing expression grammar, Sanskrit, Tamil, Turing machine, Venpa, abstract syntax tree, ambiguous grammar, computer science, context-free, context-sensitive, context-sensitive languages, counterexample, formal grammar, formal language, formalism, linguistics, logical OR, non-terminal symbol, parsers, parsing algorithms, parsing expression grammar, programming languages, pumping lemma, push-down automata, regular, regular grammar, regular language, syntax
 Adapted from the Wikipedia article "Normal forms", under the G.N U Free Docmentation License. Please also see http://en.wikipedia.org/wiki |
|
|
|
More material related to Context-free Grammar can be found here:
|
|
|
« Back
|
Search the Global Oneness web site |
|
|
|
|
|
Sneak-Peek of Global Oneness Community
Hi friend! The Global Oneness Community, the place for information and sharing about Oneness is not really launched yet (you will see there is still some clean up to do) ...but it is now open for a sneak-peek! And if you wish - please register and become one of the very first members to do so! Jonas
Forum Home,
Articles,
Photo Gallery,
Videos,
News,
Sitemap
...and much more!
|
