Content deleted Content added
this note is perhaps more important than the rest of the site expect the link to the www.sequitur.info |
No edit summary |
||
Line 13:
== Method summary ==
The algorithm works by scanning a sequence of [[terminal symbol]]s, building a list of all the symbol pairs which it has read. Whenever a second occurrence of a pair is discovered, the two occurrences are replaced in the sequence by an invented [[nonterminal symbol]], the list of symbol pairs is adjusted to match the new sequence, and scanning continues. Once the scanning has been completed, the transformed sequence can be interpreted as the top-level rule in a grammar for the original sequence. The rule definitions for the nonterminal symbols which it contains can be found in the list of symbol pairs. Those rule definitions may themselves contain additional nonterminal symbols whose rule definitions can also be read from elsewhere in the list of symbol pairs.
==See also==
* [[Context-free_grammar|context-free grammar]]
* [[Context-free_grammar_generation_algorithms|Algorithms for context-free grammar generation]]
* [[Lossless_compression|lossless data compression]]
* [[data compression]]
==References==
| |||