Lec13 Jack

High-Level Language
Building a Modern Computer From First Principles
www.nand2tetris.org
Elements of Computing Systems, Nisan & Schocken, MIT Press, www.nand2tetris.org , Chapter 9: High-Level Language slide 1
Where we are at:
Human Abstract design Software

abstract interface
Thought hierarchy
Chapters 9, 12
H.L. Language Compiler
& abstract interface
Chapters 10 - 11
Operating Sys.
Virtual VM Translator
abstract interface
Machine Chapters 7 - 8
Assembly
Language
Assembler
Chapter 6
abstract interface
Computer
Machine Architecture
abstract interface
Language
Chapters 4 - 5
Hardware Gate Logic
abstract interface
Platform Chapters 1 - 3 Electrical
Chips & Engineering
Hardware Physics
Logic Gates
hierarchy
Some milestones in the evolution of programming languages
 Machine language (binary code)
 Assembly language (low-level symbolic programming)
 Simple procedural languages, e.g. Fortran, Basic,

Pascal, C
 Simple object-based languages (without inheritance),

e.g. early versions of Visual Basic, JavaScript Jack
 Fancy object-oriented languages (with inheritance):

C++, Java, C#
Programming languages
 Procedural programming (e.g. C, Fortran, Pascal)
 Object-oriented programming (e.g. C++, Java, Python)
 Functional programming (e.g. Lisp, ML, Haskell)
 Logic programming (e.g. Prolog)
ML
 fun fac(x) = if x=0 then 1
else x*fac(x-1);
 fun length(L) =
if (L=nil) then 0
else 1+length(tl(L));
Prolog
 Facts
 human(kate).
 human(bill).
 likes(bill,kate).
 likes(kate,john).
 likes(john,kate).
 Rules
 friend(X,Y) :- likes(X,Y),likes(Y,X).
Prolog
 Absolute value
abs(X, X) :- X>=0, !.
abs(X, Y) :- Y is –X.
?- abs(-9,R).
R=9
?- abs(-9,8).
No
 Length of a list
my_length([], 0).
my_length([_|T],R) :- my_length(T, R1), R is R1+1.
?- my_length([a, b, [c, d], e], R).

R=4
Procedure oriented programming
Object oriented programming
message
The Jack programming language
Jack: a simple, object-based, high-level language with a Java-like syntax
Some sample applications written in Jack:
procedural
programming
Pong game
Space Invaders
Tetris
Disclaimer
Although Jack is a real programming language, we don’t
view it as an end.
Rather, we use Jack as a means for teaching:

 How to build a compiler
 How the compiler and the language interface with
the operating system
 How the topmost piece in the software hierarchy
fits into the big picture
Jack can be learned (and un-learned) in one hour.
Roadmap for learning Jack
 Start with examples
 Hello World
 Procedure and array
 Abstract data types
 Linked list
 ...
 Formal Jack Spec.
 More complex examples
Hello world
/** Hello World program. */
class Main {
function void main () {
// Prints some text using the standard library
do Output.printString("Hello World");
do Output.println(); // New line
return;
}
}
Some observations:
 Java-like syntax  Class_name.method_name
 Classes  Standard library a set of OS
 Entry point: Main.main services (methods and functions)
organized in 8 supplied classes:
 Typical comments format
Math, String. Array, Output,
 do for function calls Keyboard, Screen, Memory, Sys
Jack standard library aka language extensions aka Jack OS
class Math {
function void init()
function int abs(int x)
function int multiply(int x, int y)
function int divide(int x, int y)
function int min(int x, int y)
function int max(int x, int y)
function int sqrt(int x)
}
Class String {
constructor String new(int maxLength)
method void dispose()
method int length()
method char charAt(int j)
method void setCharAt(int j, char c)
method String appendChar(char c)
method void eraseLastChar()
method int intValue()
method void setInt(int j)
function char backSpace()
function char doubleQuote()
function char newLine()
}
Class Array {
function Array new(int size)
class Memory {
function int peek(int address)
function void poke(int address, int value)
function Array alloc(int size)
function void deAlloc(Array o)
class Output {
function void moveCursor(int i, int j)
function void printChar(char c)
function void printString(String s)
function void printInt(int i)
function void println()
function void backSpace()
}
Class Screen {
function void clearScreen()
function void setColor(boolean b)
function void drawPixel(int x, int y)
function void drawLine(int x1, int y1, int x2, int y2)
function void drawRectangle(int x1, int y1, int x2, int y2)
function void drawCircle(int x, int y, int r)
}
Class Keyboard {
function char keyPressed()
function char readChar()
function String readLine(String message)
function int readInt(String message)
}
Class Sys {
function void halt():
function void error(int errorCode)
function void wait(int duration)
}
Typical programming tasks in Jack
Jack can be used to develop any app that comes to my mind, for example:
 Array processing reading/storing numbers in an array
 Procedural programming: a program that computes 1 + 2 + ... + n
 Object-oriented programming: a class representing bank accounts
 Abstract data type representation: a class representing fractions (like 2/5)
 Data structure representation: a class representing linked lists
We will now discuss the above examples
As we do so, we’ll begin to unravel how the magic of a high-level object-

based language is delivered by the compiler and by the VM
These insights will serve us in the next lectures, when we build the Jack
compiler.
Array example
class Main {  var: variable declaration
function void main () {  type: int, Array
var Array a;
var int length;  let: assignment
var int i, sum;  Array: provided by OS.
let length = Keyboard.readInt(“#number:”)
No type for an array.
let a = Array.new(length); Actually, it can contain
let i = 0; any type and even
different types in an
while (i < length) { array.
let a[i] = Keyboard.readInt("next: ");
let sum = sum + a[i];  Primitive types: int,
let i = i+1; boolean, char.
}
 All types in Jack occupy
do Output.printString("The average: "); one word. When declaring
do Output.printInt(sum / length); a variable of primitive
do Output.println(); types, the space is
return; reserved. For other
}
types, a reference is
}
reserved.
Procedural programming example
class Main { Jack program = a collection of
one or more classes
/** Sums up 1 + 2 + 3 + ... + n */
function int sum (int n) { Jack class = a collection of one
var int sum, i; or more subroutines
let sum = 0;
let i = 1; Execution order: when we
while (~(i > n)) { execute a Jack program,
let sum = sum + i; Main.main() starts running.
let i = i + 1;
} Jack subroutine:
return sum;
}  method
 constructor
var int n;  function (static method)
let n = Keyboard.readInt("Enter n: ");  (the example on the left
do Output.printString("The result is: "); has functions only, as it is
do Output.printInt(sum(n)); “object-less”)
return;
}
}
Object-oriented programming example
The BankAccount class (skeletal)
/** Represents a bank account.
A bank account has an owner, an id, and a balance.
The id values start at 0 and increment by 1 each
time a new account is created. */
class BankAccount {
/** Constructs a new bank account with a 0 balance. */
constructor BankAccount new(String owner)
/** Deposits the given amount in this account. */
method void deposit(int amount)
/** Withdraws the given amount from this account. */
method void withdraw(int amount)
/** Prints the data of this account. */
method void printInfo()
/** Disposes this account. */
}
Object-oriented programming example (continues)
/** Represents a bank account. */ // Code in any other class:
class BankAccount { var int x;
// class‐level variable var BankAccount b; 1
static int newAcctId; 3 let b = BankAccount.new("joe");
Explain b = BankAccount.new("joe")
// Private variables(fields/properties)
field int id; Calls the constructor (which creates a
field String owner; new BankAccount object)
field int balance; Explain return this
The constructor returns the RAM base
/** Constructs a new bank account */
address of the memory block that
constructor BankAccount new (String stores the data of the newly created
owner) { BankAccount object
let id = newAcctId;
let newAcctId = newAcctId + 1; Explain b = BankAccount.new("joe")
let this.owner = owner; stores in variable b a pointer to the
let balance = 0; object’s base memory address
return this; 2
}
// More BankAccount methods.
}
/** Represents a bank account. */ // Code in any other class:
class BankAccount { var int x;
// class‐level variable var BankAccount b; 1
static int newAcctId; 3 let b = BankAccount.new("joe");
Behind the scene (following compilation):
// Private variables(fields/properties)
field int id; // b = BankAccount.new("joe")
field String owner; push "joe"
field int balance; call BankAccount.new
pop b
/** Constructs a new bank account */ Explanation: the calling code pushes an
constructor BankAccount new (String argument and calls the constructor; the
owner) { constructor’s code (not shown above; the
let id = newAcctId; compiler generates Memory.alloc(n)
let newAcctId = newAcctId + 1; for constructors) creates a new object,
let this.owner = owner; pushes its base address onto the stack,
let balance = 0; and returns;
return this; 2
The calling code then pops the base
}
address into a variable that will now
point to the new object.
}
class BankAccount { ...
static int nAccounts; var BankAccount b1, b2;
...
field int id; let b1 = BankAccount.new("joe");
field String owner; let b2 = BankAccount.new("jane");
field int balance; do b1.deposit(5000);
do b1.withdraw(1000);
// Constructor ... (omitted) ...
/** Handles deposits */ Explain do b1.deposit(5000)

method void deposit (int amount) {  In Jack, void methods are invoked
let balance = balance+amount; using the keyword do
return;  (a compilation artifact)
}
The object-oriented method invocation

/** Handles withdrawls */ style b1.deposit(5000) is a fancy way to
method void withdraw (int amount){ express the procedural semantics
if (~(amount > balance)) { deposit(b1,5000)

let balance = balance‐amount;
Behind the scene (following compilation):
}
return; // do b1.deposit(5000)
} push b1
// More BankAccount methods. push 5000
} call BankAccount.deposit
class BankAccount { // Code in any other class:
static int nAccounts; ...
var int x;
field int id; var BankAccount b;
field String owner;
field int balance; let b = BankAccount.new("joe");
// Manipulates b...
// Constructor ... (omitted) do b.printInfo();
do b.dispose();
/** Prints information about this account. */
method void printInfo () { Explain
do Output.printInt(id);
do Output.printString(owner); do Memory.deAlloc(this)
do Output.printInt(balance);
return; This is a call to an OS
} function that knows how to
recycle the memory block
/** Disposes this account. */ whose base-address is this.
method void dispose () { We will write this function
do Memory.deAlloc(this); when we develop the OS
return; (project 12).
}
}
class BankAccount { // Code in any other class:
static int nAccounts; ...
var int x;
field int id; var BankAccount b;
field String owner;
field int balance; let b = BankAccount.new("joe");
// Manipulates b...
// Constructor ... (omitted) do b.printInfo();
do b.dispose();
/** Prints information about this account. */
method void printInfo () { Explain
do Output.printInt(id);
do Output.printString(owner); do b.dispose()
do Output.printInt(balance);
Jack has no garbage
return;
}
collection; The programmer
is responsible for explicitly
/** Disposes this account. */
recycling memory resources
method void dispose () {
of objects that are no
do Memory.deAlloc(this); longer needed. If you don’t
return; do so, you may run out of
} memory.
}
Abstract data type example
The Fraction class API (method signatures)
/** A fraction consists of a numerator and a denominator, both int values */
class Fraction {
/** Constructs a fraction from the given data */
constructor Fraction new(int numerator, int denominator)
/** Reduces this fraction, e.g. changes 20/100 to 1/5. */
method void reduce()
/** Accessors
method int getNumerator()
method int getDenominator()
/** Returns the sum of this fraction and the other one */
method Fraction plus(Fraction other)
/** Returns the product of this fraction and the other one */
method Fraction product(Fraction other)
/** Prints this fraction */
method void print()
/** Disposes this fraction */
}
}
Abstract data type example (continues)
class Fraction {
field int numerator, denominator;
constructor Fraction new (int numerator, int denominator) {

let this.numerator = numerator;
let this.denominator = denominator;
do reduce() // Reduces the new fraction
return this
}
/** Reduces this fraction */
method void reduce () { // Code omitted }
// A static method computing the greatest common denominator of a and b.
function int gcd (int a, int b) { // Code omitted }
method int getNumerator () {

return numerator; // Code in any other class:
} ...
var Fraction a, b;
method int getDenominator () { let a = Fraction.new(2,5);
return denominator; let b = Fraction.new(70,210);
}
do b.print() // prints "1/3"
// More Fraction methods follow. ...
// (print method in next slide)
Abstract data type example (continues)
...
// Constructor and previously defined methods omitted
/** Returns the sum of this fraction the other one */
method Fraction plus (Fraction other) {
var int sum;
let sum = (numerator * other.getDenominator()) +
(other.getNumerator() * denominator());
return Fraction.new(sum , denominator * other.getDenominator());
}
// Similar fraction arithmetic methods follow, code omitted.
/** Prints this fraction */
method void print () { // Code in any other class:
do Output.printInt(numerator); var Fraction a, b, c;
do Output.printString("/");
let a = Fraction.new(2,3);
do Output.printInt(denominator);
let b = Fraction.new(1,5);
return
} // computes c = a + b
let c = a.plus(b);
} do c.print(); // prints "13/15"
Data structure example
/** Represents a sequence of int values, implemented as a linked list.
The list consists of an atom, which is an int value,
and a tail, which is either a list or a null value. */ v 5
class List {
field int data;
v 2 3 5
field List next;
/* Creates a new list */
constructor List new (int car, List cdr) {
let data = car;
let next = cdr;
return this;
}
/* Disposes this list by recursively disposing its tail. */
method void dispose() {
if (~(next = null)) { // Code in any other class:
do next.dispose(); ...
} // Creates a list holding 2,3, and 5:
do Memory.deAlloc(this);
return; var List v;
} let v = List.new(5 , null);
... let v = List.new(2 , List.new(3,v));
...
} // class List.
Jack language specification
 Syntax
 Program structure
 Data types
 Variable kinds
 Expressions
 Statements
 Subroutine calling
(for complete language specification, see the book).
Jack syntactic elements
 A jack program is a sequence of tokens separated by an
arbitrary amount of white space and comments.
 Tokens can be symbols, reserved words, constants and
identifiers.
/** Hello World program. */

class Main {
// Prints some text using the standard library
do Output.printString("Hello World");
do Output.println(); // New line
return;
}
}
Jack program structure
About this spec:
class ClassName {
 Every part in this spec can appear 0
field variable declarations; or more times
static variable declarations;
 The order of the field / static
constructor type { parameterList ) {
declarations is arbitrary
local variable declarations;
statements  The order of the subroutine
} declarations is arbitrary
method type { parameterList ) {
 Each type is either int, boolean,
local variable declarations;
statements char, or a class name.
}
A Jack program:
function type { parameterList ) {
local variable declarations;  Each class is written in a separate
statements file (compilation unit)
}
}  Jack program = collection of one or
more classes, one of which must be
named Main
 The Main class must contain at least
one method, named main()
Jack data types
Primitive types (Part of the language; Realized by the compiler):
 int 16-bit 2’s complement (from ‐32768 to 32767)
 boolean 0 and –1, standing for true and false
 char unicode character (‘a’, ‘x’, ‘+’, ‘%’, ...)
Abstract data types (Standard language extensions; Realized by the OS

/ standard library):
 String
 Array
... (extensible)
Application-specific types (User-defined; Realized by user applications):

 BankAccount
 Fraction
 List
 Bat / Ball . . . (as needed)
Jack data types
Jack is weakly typed. The language does not define the results of
attempted assignment or conversion from one type to another, and
different compilers may allow or forbid it.
var char c; var String s;
Let c = 33; // ‘A’
// Equivalently
Let s = “A”; let c=s.charAt(0);
var Array a;
Let a = 5000;
Let a[100] = 77; // RAM[5100]=77
var Complex c; var Array a;

let a = Array.new(2);
Let a[0] = 7; let a[1] = 8;
Let c = a; // c==Complex(7, 8)
Jack variable kinds and scope
Jack Statements (five types)
let varName = expression;
or
let varName[expression] = expression;
if (expression) {
statements
}
else {
statements
}
while (expression) {
statements
}
do function-or-method-call;
return expression;
or
return;
Jack expressions
A Jack expression is any one of the following:
 A constant
 A variable name in scope (the variable may be static, field, local, or a

parameter)
 The keyword this, denoting the current object
 An array element using the syntax arrayName[expression],

where arrayNname is a variable name of type Array in scope
 A subroutine call that returns a non-void type
 An expression prefixed by one of the unary operators – or ~ :
 ‐expression (arithmetic negation)

 ~expression (logical negation)
 An expression of the form expression op expression where op is one of
the following:
 + ‐ * / (integer arithmetic operators)
 & | (boolean and and or operators, bit-wise)
 < > = (comparison operators)
 ( expression ) (an expression within parentheses)
Jack subroutine calls
General syntax: subroutineName(arg0, arg1, …)
where each argument is a valid Jack expression
Parameter passing is by-value (primitive types) or by-reference (object
types)
Example 1:
Consider the function (static method): function int sqrt(int n)
This function can be invoked as follows:
sqrt(17)
sqrt(x)
sqrt((b * b) – (4 * a * c))
sqrt(a * sqrt(c ‐ 17) + 3)
etc. In all these examples the argument value is computed and
passed by-value
Example 2:
Consider the method: method Matrix plus (Matrix other);
If u and v were variables of type Matrix, this method can be invoked
using: u.plus(v)
The v variable is passed by-reference, since it refers to an object.
Noteworthy features of the Jack language
 The (cumbersome) let keyword, as in let x = 0;
 The (cumbersome) do keyword, as in do reduce();
 No operator priority: (language does not define, compiler-dependent)
1 + 2 * 3 yields 9, since expressions are evaluated left-to-right;
To effect the commonly expected result, use 1 + (2 * 3)
 Only three primitive data types: int, boolean, char;
In fact, each one of them is treated as a 16-bit value
 No casting; a value of any type can be assigned to a variable of any type
 Array declaration: Array x; followed by x = Array.new();
 Static methods are called function
 Constructor methods are called constructor;
Invoking a constructor is done using the syntax ClassName.new(argsList)
Q: Why did we introduce these features into the Jack language?
A: To make the writing of the Jack compiler easy!
Any of these language features can be modified, with a reasonable amount
of work, to make them conform to a more typical Java-like syntax.
A simple game: square
 (Demo)
 Use Square as an example.
 Design a class: think of its
 States: data members
 Behaviors: function members
 Square
 x, y, size
 MoveUp, MoveDown, IncSize, …
Perspective
 Jack is an object-based language: no inheritance
 Primitive type system (3 types)
 Standard library
 Our hidden agenda: gearing up to learn how to develop the ...
 Compiler (projects 10 and 11)
 OS (project 12).
Principles of object-oriented programming
encapsulation (information hiding) polymorphism
inheritance
Which language should you learn?
Programming languages
Most popular PLs (2014/4)
Most popular PL trends
Final project
 Assembler for Hack/Toy

 VM translator
 Compiler for Jack
 Finish OS implementation
 Develop applications with Jack
 Design your own computers
 <Fill your ideas here>

Lec13 Jack

Uploaded by

Copyright:

Available Formats

Lec13 Jack

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lec13 Jack

Uploaded by

Copyright:

Available Formats

High-Level Language

Building a Modern Computer From First Principles

Human Abstract design Software

 Machine language (binary code)

 Assembly language (low-level symbolic programming)

 Simple procedural languages, e.g. Fortran, Basic,

 Simple object-based languages (without inheritance),

 Fancy object-oriented languages (with inheritance):

?- my_length([a, b, [c, d], e], R).

Rather, we use Jack as a means for teaching:

Jack can be learned (and un-learned) in one hour.

function Array new(int size)

method void dispose()

function int peek(int address)

function void poke(int address, int value)

function Array alloc(int size)

function void deAlloc(Array o)

 Array processing reading/storing numbers in an array

 Procedural programming: a program that computes 1 + 2 + ... + n

 Object-oriented programming: a class representing bank accounts

 Abstract data type representation: a class representing fractions (like 2/5)

 Data structure representation: a class representing linked lists

We will now discuss the above examples

As we do so, we’ll begin to unravel how the magic of a high-level object-

/** Handles deposits */ Explain do b1.deposit(5000)

constructor Fraction new (int numerator, int denominator) {

method int getNumerator () {

(for complete language specification, see the book).

/** Hello World program. */

Abstract data types (Standard language extensions; Realized by the OS

Application-specific types (User-defined; Realized by user applications):

var Complex c; var Array a;

 A variable name in scope (the variable may be static, field, local, or a

 An array element using the syntax arrayName[expression],

 An expression prefixed by one of the unary operators – or ~ :

 ‐expression (arithmetic negation)

 Primitive type system (3 types)

 Our hidden agenda: gearing up to learn how to develop the ...

 Compiler (projects 10 and 11)

 Assembler for Hack/Toy

You might also like