1)(i) Describe the software tools which are used to influence the source Programs.

(ii) prepare detailed notes on Compiler construction tools.

2) Create a nondeterministic finite automata by using Thompson’s construction for regular expression (a|b)*a(a|b)(a|b). Transform the obtained NFA into DFA.

3) Let the following grammar:
S->iSeS|a

Create the SLR parsing table and check whether input string “iaea” is valid or not.

4) Describe the different operations and semantic rules used in processing of declarations in nested procedures in detail.

5) describe how would you construct syntax trees for the expressions?

6) prepare down the issues in the design of the code generator? Describe in detail.

7) Describe the DAG representation of basic block with suitable ex

8) Describe the principle sources of code optimization in detail.