[rambligns + www
tom@zwizwa.be**20080614121808] hunk ./doc/ramblings.txt 29817
-ALL ASM + MACHINE CODE IS STORED IN REVERSED LISTS
-this makes the 'append' operation more efficient
+    In the code base, whenever assembly code, binary code, or word
+    structures appear in a list, it is REVERSE SORTED. This is easier
+    from the point of compilation.
+
+    Code ANALYSIS needs the reverse of that: code is linked in the
+    direction of instruction flow. This is how words are internally
+    linked: given a target word (entry point) it's inline fallthrough
+    can be easily obtained using 'target-chain->list', which again
+    returns reversed list.
hunk ./target/rep.ss 66
-;; unlinks a word into a (reverse) list of words.
+;; unlinks a word into a list of words in compilation order (reversed,
+;; so it can act as an 'append' list).
hunk ./www/catkit/index.html 4
-[<a href="http://catkit.goto10.org">goto10</a>]