|
|
|
|
|
|
|
|
|
|
|
|
| • | Define all
possible tree tiles for given m/c |
||||||||||
| instruction set |
|||||||||||
| • | Start at the
root of the program tree |
||||||||||
| – | Find largest
pattern that matches at the root |
||||||||||
| – | Cover root (and
adjacent nodes possibly) |
||||||||||
| with the tile –
leaving several sub-trees |
|||||||||||
| – | Recursively
munch each sub-tree |
||||||||||
| – | Output code for
this tile |
||||||||||
