Compiler and Explain Dag Representation
2. Explain DAG representation of the basic blocks with suitable example.
3. Discuss the principle sources of optimiztion. What are the various ways of calling procedures ?
4. Elaborate storage organiztion and write detailed notes on parameter passing.
5. How back patching can be used to generate code for Boolean expressions and flow of control statements ?
6. How the types and their relative addresses of declared names are computed and how scope information is dealt with ?
7. Explain the three general approaches to the implementation of Lexical Analyzer. What are the possible errors recovery action in Lexical Analyzer ?
8. Let A be a 10*20 array with low 1=low 2=1. Here n1=10 and n2=20. Take w to be 4. Give the annotated parse tree for the assignment x:=A[Y,Z].
9. What are the various types of calling procedure ? Explain in detail.
10. Explain Single-address Instruction and Two-address instruction.
11. Differentiate between Bus buffering and Latching.
12. What is DMA ? Explain its function.
13. Differentiate between Static and Dynamic RAM.
14. What is cache memory ? Explain its utility for memory uses.
15. Explain Virtual memory mode with example.
16. What is Interrupt ? Describe the types of interrupt.
17. What is a Register ? Describe the types of registers.
Q 06-: Explain the Phases of Compiler
Q 07-: What do you mean by Symbol Table? Explain with example.
Q 08-: What is the function of Code Generation and Optimization?
Q 09-: Explain the Lexical Phase of the Compiler.
Q 10-: Explain the various types of Calling Procedure.
Q 11-: What is Run Time Environment Storage Organizations?
Q 12-: What is Software tools? Explain LEX and YACC.
Q 13-: Write the usefulness of Program development tools.
Q 14-: Construct Lexical takens parse tree and code generation.
Q 15-: What is the DAG? Explain with expression.
Q 16-: Explain Top down & Bottom up Parsing techniques.
Q 17. Elaborate of grouping of phases in a compiler.
Q 18. Write about
3. Discuss the principle sources of optimiztion. What are the various ways of calling procedures ?
4. Elaborate storage organiztion and write detailed notes on parameter passing.
5. How back patching can be used to generate code for Boolean expressions and flow of control statements ?
6. How the types and their relative addresses of declared names are computed and how scope information is dealt with ?
7. Explain the three general approaches to the implementation of Lexical Analyzer. What are the possible errors recovery action in Lexical Analyzer ?
8. Let A be a 10*20 array with low 1=low 2=1. Here n1=10 and n2=20. Take w to be 4. Give the annotated parse tree for the assignment x:=A[Y,Z].
9. What are the various types of calling procedure ? Explain in detail.
10. Explain Single-address Instruction and Two-address instruction.
11. Differentiate between Bus buffering and Latching.
12. What is DMA ? Explain its function.
13. Differentiate between Static and Dynamic RAM.
14. What is cache memory ? Explain its utility for memory uses.
15. Explain Virtual memory mode with example.
16. What is Interrupt ? Describe the types of interrupt.
17. What is a Register ? Describe the types of registers.
Q 06-: Explain the Phases of Compiler
Q 07-: What do you mean by Symbol Table? Explain with example.
Q 08-: What is the function of Code Generation and Optimization?
Q 09-: Explain the Lexical Phase of the Compiler.
Q 10-: Explain the various types of Calling Procedure.
Q 11-: What is Run Time Environment Storage Organizations?
Q 12-: What is Software tools? Explain LEX and YACC.
Q 13-: Write the usefulness of Program development tools.
Q 14-: Construct Lexical takens parse tree and code generation.
Q 15-: What is the DAG? Explain with expression.
Q 16-: Explain Top down & Bottom up Parsing techniques.
Q 17. Elaborate of grouping of phases in a compiler.
Q 18. Write about