Revision as of 15:25, 17 April 2008 edit Derek Ross (talk \| contribs) Administrators 20,250 edits Overview of the algorithm ← Previous edit		Revision as of 15:26, 17 April 2008 edit undo Derek Ross (talk \| contribs) Administrators 20,250 edits m →Method summary: relink Next edit →
Line 4: == 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 [[~~non-terminal~~nonterminal symbol]], the list of symbol pairs is adjusted to match the new sequence, and scanning continues. Once the scanning has been completed, the list of symbol pairs can be interpreted as a grammar for the original sequence. ==External links==

Sequitur algorithm: Difference between revisions