Colouring algorithm: Difference between revisions
Content deleted Content added
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
Colouring 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 |
Colouring 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 overridden, changed or 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." |
||
A variant of Coloring Algorithm is known as [[Graph Coloring Algorithm]]. |
A variant of Coloring Algorithm is known as [[Graph Coloring Algorithm]]. |
||
Revision as of 14:34, 9 November 2003
Colouring 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 overridden, changed or 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."
A variant of Coloring Algorithm is known as Graph Coloring Algorithm. It is used in various allocation strategies, like in register allocation in compiler development and resource allocation in operating systems