|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Tree language
is based upon an abstract |
|||||||||||||||
| machine
architecture |
||||||||||||||||
| – | memory and
registers |
|||||||||||||||
| – | machine
operators (+ some r/t utilities) |
|||||||||||||||
| • | Operations
(nodes) in the tree categorised into |
|||||||||||||||
| – | expressions |
|||||||||||||||
| • | compute some
value |
|||||||||||||||
| – | statements |
|||||||||||||||
| • | perform side
effects on memory and registers and |
|||||||||||||||
| • | control flow
within the tree |
|||||||||||||||
