Advanced Compiler Design — DU B. Voc – Web Designing Previous Year Question Papers

4. Parts of a question should be attempted together. Q]. (a) Define 'Left Factoring" and explain why it is used in parsing. @} What is a parse Tree? Differentiate it from an Abstract syntax Tree. (c) What ae the common conflicts that occur during shift-reduce parsing? (p. 2) (e) Define Three-Addess code and provide a simple example of its structure. ® Briefly explain the purpose of generating intermediate code representatioDs. (g) Explain the role of a symbol Table in a compiler. ® What is an "Activation Record':? Relate it to storage organization. (i) What is peephole optinrization? Provide two examples of improvements it can make` a) Explain the importance of Register Allocation in the code generati6n phase. Define a compiler and an htelpreter. Compae them in detail, bighligkting the;r advantages, disadvantages, and execution speeds. q]) What is Ambiguity in grammar? Prove that the expression grammar E-> E +E / E*E/ id is ambiguous and explain how to resolve it. Q3. (a) DefineHandles andHandleprming, and illustratehow a shift-reduce parser , identifies a handle using a step-by-step example. a) Construct the FmsT and FOLLOw sets for the following grammar: Q4. (a) Define symbol table. Explain different types of Data structure for symbol table a) Draw the fomat ofActivation Record in stack allocation and explain each field in it. Q5. (a) Giventhe following grammar: a) Q6. (a) Perform shift Reduce parsing for the following i) S->q;)|a L->L,SIS input string-(a,{a,a)) ii)E->E+E/E*E/®/id input string-(id*id+id) Explain optimization techniqires on Basic Blocks with simple examples? q]) Explain storage allocation strategies with suitable examples? Q7. (a) Explain polishNotatious a) Abstract syntax Tree (c) Directed Acyclic Graph