RCS History

--- /internals/node_structure.mdwn 2010/02/25 07:37:00 1.3
+++ /internals/node_structure.mdwn 2010/02/28 07:50:29 1.4
@@ -1,6 +1,6 @@
The main data structure used through the whole compiler is the NODE. The parse trees are built out of NODEs and it is the underlying data structure when generating code.
-The NODE structure contains lots of fields in unions to keep the size down of the struct. Different NODE types uses different elements in the structure. The NODE struct is declared like this:
+The NODE structure contains lots of fields in unions to kefep the size down of the struct. Different NODE types uses different elements in the structure. The NODE struct is declared like this:
typedef struct node {
int n_op;
@@ -91,7 +91,7 @@
- OREG
- An indirect reference to memory via an offset [resume service](http://cvresumewritingservices.org/) to a register. The register number is held in n\_rval, the offset in n\_lval.
+ An indirect reference to memory via an offset to a register. The register number is held in n\_rval, the offset in n\_lval.
### Unary Nodes
@@ -127,7 +127,7 @@
- UCALL/UFORTCALL/USTCALL
- Call to a function without arguments. UFORTCALL is to call a fortran function [custom paper](http://custom-paper-writing.com/), USTCALL for functions returning structures or unions.
+ Call to a function without arguments. UFORTCALL is to call a fortran function, USTCALL for functions returning structures or unions.
- FORCE