Jump to content

Colouring algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 207.194.162.158 (talk) at 04:15, 17 April 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Editing Colouring (Coloring) Algorithm is a simple style look up to virtual storage containing another stream to be parsed to generate a function which acts on the original input. This lookup may be performed recursively. The look up is arbitrary and is defined by rules which are defined by virtual default streams. Each of these may be over ridden, changed and removed by using an input stream. The problem herein lies with creating "enough" colouring to make all of this function. This is sometimes called "bootstrapping."