--- internals.mdwn 2007/09/27 18:26:53 1.7 +++ internals.mdwn 2007/09/27 18:27:15 1.8 @@ -5,7 +5,7 @@ The main data structure used through the whole compiler is the [[NODE|NODE_structure]]. The parse trees are built out of [[NODE|NODE_structure]]s and it is the underlying data structure when generating code. The instruction generator searches for largest coverable tree, as described -in the Dragon [[books|book]] for example, but with additions from me to find the most +in the Dragon [[book|books]] for example, but with additions from me to find the most efficient instruction when there are multiple choices. The Sethi-Ullman calculations are pretty much straightforward, can be found
Powered by rcshistory.cgi 0.3