Sale!

Homework 4 – Semantics

$30.00

Category:
Rate this product

CS 381 Homework 4 – Semantics
Part 1: Stack Language 1
Consider the stack language S defined by the following grammar.
S ∷= C | C, S
C ∷= LD Int | ADD | MULT | DUP
An S1-program essentially consists of a (non-empty) sequence of commands/operations C. The meaning
of an S1-program is to start with an empty stack and to perform its first operation on it, which results in a
new stack to which the second operation in S (if it exists) is applied, and so forth. The stack that results
from the application of the last command is the result of the program.
The following are the definitions of the operations.
 LD Int – loads its integer parameter onto the stack.
 ADD – removes the two topmost integers from the stack and puts their sum onto the stack. If
the stack contains fewer than two elements, ADD produces an error.
 MULT – removes the two topmost integers from the stack and puts their product onto the
stack. If the stack contains fewer than two elements, MULT produces an error.
 DUP – places a copy of the stack’s topmost element on the stack. If the stack is empty then
DUP produces an error.
Here is a definition of the abstract syntax and type definitions that you should use.
type prog = [Cmd]
data Cmd
= LD Int
| ADD
| MULT
| DUP
deriving Show
type Stack = [Int]
run ∷ Prog → Stack → Maybe Stack
A program is ran with a stack. If there is an error in the program you can return “Nothing”, otherwise
return “Just” the contents of the stack.
When defining the run function you will probably need auxiliary functions for the semantics of the
individual operations. For example:
semCmd ∷ Cmd →Stack→ Maybe Stack
semCmd (LD n ) s = Just (n:s)
Name your file stacklang1.hs
CS 381 Homework 4 – Semantics
You can use the following S-programs to test Stack Lang 1.
stack1 = [1, 2, 3, 4, 5]
test1 = [LD 3,DUP,ADD,DUP,MULT]
test2 = [LD 3,ADD]
test3 = []
test4 = [ADD, ADD, ADD, ADD]
Part 2: Stack Language 2
A stack language with two types (integers and booleans), comparisons and if-else commands.
To the Stack language in Part 1, add/modify the following commands/operations
 LDI Int – loads its integer parameter onto the stack (replaces LD)
 LDB Bool – loads its boolean parameter onto the stack.
 ADD – same as with Stack Language 1 only adds integers
 MULT – same as with Stack Language 1 only multiplies integers
 DUP – places a copy of the stack’s topmost element on the stack. If the stack is empty then
DUP produces an error. Works with both integer and Boolean values.
 LEQ – removes the top integer from the stack, removes the second integer from the stack. If
top ≤ second the True is pushed on the stack else False is pushed onto the stack.
 IFELSE Prog Prog – if the value on top of the stack is true, then run the first program, else
run the second program.
Here is a definition of the abstract syntax and type definitions that you should use.
type prog = [Cmd]
type Stack = [Either Bool Int]
CS 381 Homework 4 – Semantics
data Cmd
= LDI Int
| LDB Bool
| LEQ
| ADD
| MULT
| DUP
| IFELSE Prog Prog
deriving Show
run ∷ Prog → Stack → Maybe Stack
Since the stack can contain two types use the Either with Bool on the ”Left” and Int on the “Right”. A
stack containing the integers 1, 2 and 3 would be defines as [Right 1, Right 2, Right 3] and a stack with a
true and the integer 6 would be [Left True, Right 6]. Again the command run will return a Maybe stack.
Name your file stacklang2.hs.
You can use the following S2-programs to test Stack Lang 2.

Scroll to Top