1. Write a denotational semantic mapping for switch in c++.

2. Compute the weakest precondition for b=b+3*a-1 {b>2}

3. Prove the following program is correct

While countn do

count=count +1;

end {sum=1+2++n}

4. Perform the pairwise disjointness test for the following grammar rules

5. Given the following grammar and the right sentential form, draw a pares tree and show the phrase, simple phrase, and handle

right sentential form: bBab

6. Show a complete parse tree, including the parse stack, input string and action for the string (id*id) +id using the grammar and parse table in section 4.5.3

aBla aBla