1. Write a BNF for integer numbers :

|

0 | 1 | .. | 9

+ | - |

Give a parse tree and left most derivation for any integer number.

2. Write a BNF for binary numbers and give parse tree and left most derivation for any binary number :

0 | 1 | 0 | 1

3. Write a BNF for the language that contains all strings of as and bs, give parse tree and left most derivation for abaabb

a | b | a | b

4. Write a BNF for identifier and give parse tree and left most derivation for any identifier :

| |

A|B| .|Z|a|b|..|z

0 | 1 | .. | 9

5. Write a BNF for declaration statement of identifiers (suppose that id is terminal) and give parse tree and left most derivation for any statement:

;

id | id ,

int | float | double