6.3 Machine-Language Programming

IN THIS SECTION WE CONTINUE THE process of describing how the Java-language mechanisms that we considered earlier in the book can be implemented in TOY, in the context of TOY programs that accomplish interesting tasks. Our primary goals are to convince you that TOY programming is every bit as interesting and satisfying as Java programming, and that TOY is a much more powerful machine than you might think.

6.3.1 Testing primality

6.3.2 Fibonacci numbers

6.3.3 Compute the sum

6.3.4 Read an array

6.3.5 Search/insert in a BST

Programs in this section

Specifically, we consider TOY programs that implement functions, arrays, standard input and output, and linked structures—that is, the basic building blocks of programming. ...

Get Computer Science: An Interdisciplinary Approach 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.

Start your free trial