Note: Questions or discussion should be directed to the class newsgroup.

1) Evaluate your favorite language, based on the criteria given in class.

2) Given the following grammar:
 
          <assign>     -->   <id> := <expr>
          <id>            -->   A | B | C
          <expr>        -->   <expr> + <expr>
                               |     <expr> * <expr>
                               |     (<expr>)
                               |     <id>

   show a parse tree and a leftmost derivation for each of these statements.

a) A := (B+C) * C
b) A := (A+B*C) + (C)

S --> SS | 01 | 11 | 10 | 00

a) binary strings beginning in 101 and ending in 11
b) decimal integers divisible by 2
c) Java identifiers
d) binary strings containing two 1s and any number of 0s

ident := var
ident := ident + integer
ident := ident - integer
goto label
if var relop var goto label (where relop is =, <>, <, <=, >, or >= )

a) Pascal "for" loop
b) Algol 60 "for" loop
c) Ada "if-then-else" statement
d) Ada "case" statement
e) C's "switch"