CHAPTER TWO
INFORMATION STRUCTURES
2.1. INTRODUCTION
[233]
We will illustrate methods of dealing with information structures in terms of the MMIX computer. A reader who does not care to look through detailed MMIX programs should at least study the ways in which structural information is represented in MMIX’s memory.
· · ·
As a more interesting example, suppose the elements of our table are intended to represent playing cards; we might have two-octabyte nodes broken into five fields, TAG, SUIT, RANK, TITLE, and NEXT:
(This format reflects the content of two octabytes; see Section 1.3.1´.)
[234]
TAG is stored as one BYTE; TAG = #80 means that ...
Get The MMIX Supplement: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
