Jump to content

Colouring algorithm: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
(No difference)

Revision as of 04:15, 17 April 2003

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."