1) Illustrate the language processors and describe some of its related concepts.
2) Describe the assembler and discuss the pass structure of assembler.
3) Explain the term macro. Describe the macro – definition, call and the expansion.
4) Describe the various concepts of loaders.
5) Describe different phases of the compiler with the help of diagram.
6) Explain what is meant by the finite automata? Describe the process of generating the non-deterministic finite automata from the regular expression with the help of an example.
7) Describe the predictive parsing algorithm and evaluate it for the following given grammar:
E → E + T/T
T → T * F/F
F → (E) / id and with input id + id * id.
8) Describe the operator grammar and discuss the operator precedence parsing algorithm with the proper illustration.
9) Specify various sources of the optimization.
10) Describe the loop invariant computation and induction of the variable elimination with appropriate examples.