Scribd
Upload
134 views

The CSE Machine: Programming Language Principles

This document describes the CSE Machine, an abstract machine for evaluating programs in the RPAL programming language. The CSE Machine uses a substitution mechanism based on lambda calculus to evaluate programs. It operates by controlling a sequence of operations on a stack in an environment. The environment maps names to objects and operations. RPAL programs are flattened into control structures that the CSE Machine can execute step-by-step by popping items off the control and performing operations. Examples are provided to demonstrate how the CSE Machine evaluates simple expressions and functions.

Uploaded by

Mrunal Ruikar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
134 views

The CSE Machine: Programming Language Principles

This document describes the CSE Machine, an abstract machine for evaluating programs in the RPAL programming language. The CSE Machine uses a substitution mechanism based on lambda calculus to evaluate programs. It operates by controlling a sequence of operations on a stack in an environment. The environment maps names to objects and operations. RPAL programs are flattened into control structures that the CSE Machine can execute step-by-step by popping items off the control and performing operations. Examples are provided to demonstrate how the CSE Machine evaluates simple expressions and functions.

Uploaded by

Mrunal Ruikar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

The CSE Machine

Programming Language Principles Lecture 12

Prepared by

Manuel E. Bermdez, Ph.D.


Associate Professor University of Florida

Mechanical Evaluation of RPAL Programs


Substitution mechanism (based on lambdacalculus) convenient for humans, but inconvenient for machines. Need an algorithm to complete the operational semantic specification of RPAL

Introducing the CSE Machine


C S E - Control a sequence of operations - Stack operands - Environment Initially, PE (Primitive Environment) Updated as evaluation proceeds

PE: a mapping from names to objects and operations.

CSE Machine programs: control structures


Flatten the RPAL program's ST into a "control structure (vs. a lambda-expression). Done using a simple pre-order tree traversal.

Example
Evaluate -2 ** (a-b), in an environment in which (somehow) a=6 and b=1. Flattened control structure: neg ** 2 - a b. Place this control structure on the Control of the CSE Machine.

CSE Machine Operation (informally)


1. Remove right-most item from control. 2. If a name, look it up in the CE (current environment), push onto the stack. 3. If , then rator = pop(stack) rand = pop(stack) push(apply(rator,rand), stack) 1. Stop if control is empty: value on the stack is the result.

Notes
Minus: function that subtracts its second argument from its first one. Minus6: a function that subtracts its argument from 6. Exp, likewise: the exponentiation function. Exp2: function that raises 2 to the power of its argument.

Notes (contd)
Notice difference between "neg" (a name), and "Neg" (the actual operator). Control contains gammas (and lambdas) and names. Stack contains "real" values.

Generating Control Structures


Begin with CS (control structure) 0: Perform a pre-order traversal of the standardized tree. For each node: a. If a name, add it to the current CS. b. If a , add it to the current CS. c. If a , add < k x> to the current CS. k: new index; x: 's left child. Generate control structure k: traverse the 's right child.

Generating Control Structures


We use a single symbol to represent a -expression, both on the control, and on the stack. The symbol is <i k x>. i: environment, k: CS of the function's body, x: the function's bound variable. The -expression becomes a -closure when its environment is determined, when it is placed on the stack.

Examples
Three examples of generating control structures.

Operation of the CSE Machine


Five rules Process driven by TOP symbol on the control. Need environment markers, on the Control and Stack. Every environment is linked to a previously created (but not necessarily currently active) environment. Thus, environment structure is a tree.

Examples of CSE Machine Operation


Lets run through the CSE machine, for our 3 examples.

The CSE Machine


Programming Language Principles Lecture 12

Prepared by

Manuel E. Bermdez, Ph.D.


Associate Professor University of Florida

You might also like