The George Washington University
School of Engineering and Applied Science
Department of Computer Science
CSci 169 โ Software Paradigms โ Fall 2007
Homework Assignment
Due Date: October 22, 2007
Instructor: A. Bellaachia
Problem 1: (25 points)
E :: E โ+โ T | T
T :: T โ*โ F | F
F :: โ(โ E โ)โ | int
a) Draw the parse tree of (((3)))
b) Extend the grammar with the following construct: if-then-else statement
The following examples should be accepted by your extension.
If true then:
a=5;
b=c;
:else:
toto=4;
foo=0;
:
If true then:
a=5;
b=c;
:
If true then:
a=5;
If true then:
www=5;
:else:
toto=4;
foo=0;
:
Problem 2: (25 points)
Create a template to manipulate matrices. You template should include the following operation:
- Addition, Multiplication, Subtraction, and Transpose
(a) Implement you template using both java and C++
(b) Send you code to [email protected] and to me.
Problem 3: (25 points)
Problem 1: Do problem 29 on page 171 of your textbook.
Problem 4: (25 points)
Given the following C2 type language:
sub2(int x) {
int c = 10;
Return (x +c);
}
sub1(int i, int j) {
If (i<=j)
return i
else
return(sub2(j))
}
main() {
int n, m;
get(n, m);
print(sub1( m, n));
}
a) Give the SIMPLESEM code for this program.
b) Show the final state of your machine for n=3 and m = 5
c) Show the final state of your machine for n=5 and m = 3