Compiler Design Interview Questions

11/22/2012 1 Comment

Core Computer Science Interview Questions on Compiler Design.

These questions on Compiler Design can be expected in a freshers job interview.

  1. Can you differentiate between ‘syntax analysis’ and ‘semantic analysis’ during compiler design?
  2. In simple words, what shall be the basic difference between top-down and bottom-up parsing?
  3. Can you say something about type checking and its importance?
  4. What is meant by syntax analysis and lexical analysis?
  5. What is the need for Symbol Table in Compilers?
  6. What is three address code?
  7. What are the conflicts that can occur in shift-reduce parser?
  8. What is the use of backpatching?
  9. What do you mean by Cross-Compiler?
  10. What is constant folding?
  11. What is a syntax directed definition?
  12. Explain about the issues in the design of code generator.
  13. What is the difference between DFA and NFA?
  14. What do you mean by a synthesized attribute
  15. Define annotated parse tree.
  16. Explain dangling reference with an example.
  17. What are the conflicts that occur in shift-reduce parse?
  18. What is the difference between a loosely coupled and tightly coupled system?
  19. What do you mean by a assembler? Explain it types.
  20. What is the fundamental difference between a ‘compiler’ and an ‘Interpreter’?
  21. Define the terms patterns, lexeme and token.
  22. Can you list some of the lexical errors.
  23. Define ambiguous grammar.
  24. Which of the two – linker, loader – is essential in a microcomputer? Can you justify your answer?
  25. How is Code optimization done using DAG?
  26. What do you mean by data flow analysis? Explain with examples data flow abstraction.
  27. What are the functions performed in synthesis phase of a compiler?
  28. What are the techniques involved in loop optimization?
  29. Explain what are the advantages of LALR parsing over SLR and CLR methods? 
  30. What are the components of context free grammar?
  31. What is a annotated parse tree?
  32. Can you construct a DAG for the expression a=b*-c + b*-c 
  33. What do you meant by data-flow engine?
  34. What are the different methods employed by Parser to recover from a syntactic error?
  35. Explain in brief how is the syntax tree constructed?
  36. What are optimizing compilers?
  37. Translate the arithmetic expression a * - (b + c) into a syntax tree.
  38. Name two compiler construction tools.
  39. What is a postfix notation? Explain.
  40. Explain what are the techniques involved in loop optimization.
Dear users. Please use the comment section for feedback and answers.

1 comment :

 

Aired | The content is copyrighted and may not be reproduced on other websites. | Copyright © 2009-2016 | All Rights Reserved 2016

Contact Us | About Us | Privacy Policy and Disclaimer