COMPILER
CT-2
1. Explain a flow graph with an example.
2. Describe the representation 3 address code with an example.
3. Write the state to convert assignment statement in intermediate
code.
4. Describe about the syntax of case statement for intermediate
representation.
5. Write short note on annotated parse tree and give an example.
6. Illustrate an annotated parse tree for the string “3+2-4” using the
grammer EE+T|E-T|T, T 0|1|2….|9.
7. Explain dependency graph with an example.
8. Translate the arithmetic expression a*-(b+c)
9. Explain directed acylic graph with an example.
10. Explain syntax tree TAG from the following expression if X > 0
then X = 3 * ( y + 1 ) else y = y + 1.
11. Explain storage allocation strategy with an example.
12. Write short note on peep hold optimization technique.
13. Define dead code elimination with example.
14. Explain optimization technique on basic block with simple
example.
15. Write short note on global common sub-expression elimination
algorithm with an example.
16. Write the definition on loop annulling with an example.
17. Give the different forms in target program.
18. Illustrate and activation record explain how it is related with
runtime storage organization.
19. Write short note on static and stack storage allocation.
20. Explain various storage allocation stetegy with example.
21. Method to handle peep hold optimization.
22. Explain loop optimization with suitable example.
23. Write about all issues in code generation.
24. Write short note on process of optimization of basic blocks.
25. Describe lex, uses of lex.
26. Write short note on YAAC parser generation.
27. Write short note on compiler construction tool.
28. Write down the utility of the tool in simplifying the
development of a simple compiler.
29. Functionality of compilation development tool.
30. Benifities and drawback of parser generator.
31. Write down the advantage and disadvantage of lexer
generation.