We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
Study Questions – Compiler Design
Short:
1. What are lexical analyzers?
2. What are tokens? 3. State input buffering. 4. State operator precedence parsing. 5. Define context-free grammars. 6. Define ambiguous grammars. 7. Write the importance of parser generators. 8. Write the importance of parser generators. 9. Differentiate parse trees and syntax trees. 10. Differentiate S attributes and inherited attributes. 11. Explicate top-down translation. 12. Explicate top-down translation. 13. Label the types of parameter passing. 14. Label the importance of type checking. 15. Inscribe the significance of three address code. 16. Inscribe the significance of procedure calls. 17. List the issues in the design of code generation. 18. List the variants of syntax trees. 19. What is peephole optimization? 20. What are the principal sources of optimization?
Brief:
1. Detail the design of a lexical analyzer generator.
2. Brief the compiler construction tools. 3. Describe the role of the parser. 4. Write a short note on the construction of syntax trees. 5. Write a short note on LR-Parsers. 6. Explain the features of source language issues. 7. Explain bottom-up evaluation of S-attributed definitions. 8. State the needs of code optimization. 9. Clarify control flow and backpatching. 10. Elucidate the structure of three address code. 11. What are the significances of intermediate code generation? 12. What are the significances of symbol tables? 13. State the issues in the design of code generation.
Long:
1. Outline the steps involved in writing a grammar.
2. Explain control flow and backpatching in detail. 3. Name and address the source language issues.