Chirala Engineering College:: Chirala

VIVA QUESTIONS
1. What is NFA?
2. What is subset construction algorithm?
3. What is closure?
4. What is Thompsons construction?
5. What is epsilon transition?
6. Why regular expressions are used to define lexical syntax of a language?
7. Differentiate the uses of regular expressions and grammars?
8. What are the different types of errors a program can contain?
9. Differentiate NFA and DFA.
10. Define DFA.
11. Differentiate between NFA and DFA.
12. Define context free grammar.
13. Define regular expression.
14. What is meant by transition table?
15. What is meant by moves?
16. Define epsilon closure.
17. Give the advantage and disadvantage of transition table.
18. Define recognizer.
19. What is finite automata?
20. Give types of finite automata.
21. What is meant by syntax analysis?
22. What is meant by syntax tree?
23. What is hierarchical analysis?
24. What is the role of parser?
25. What are the error recovery strategies?
26. What is panic-mode recovery?
27. What is phrase level recovery?
28. What is global correction?
29. Classify parser.
30. What is left factored grammar?
31. What is regular expression?
32. What is a translator?
33. Differentiate interpreters and compilers.
34. What are loaders and linkers?
35. What is an assembler?
36. What are the phases of a compiler?
37. What is bootstrapping a compiler?
38. What are the two parts of compilation? Explain briefly.
39. Explain in brief linear analysis.
40. Explain in brief hierarchical analysis.
41. Explain in brief semantic analysis.
42. Give the parse tree for the statement a := b + c * 60.
43. What is a symbol table?
44. Briefly explain code optimization.
45. What are rational preprocessors?
46. What is the use of scanner generator?
Dept of CSE, COMPILER DESIGN LAB manual, 2014-15

Chirala Engineering College:: Chirala

47. What are the characteristics of a high-level programming language?
48. What do you mean by syntax and semantics of a language?
49. Give the hierarchy of programming elements.
50. Explain in brief bookkeeping in compilation?
51. Give some four compiler-generator tools.
52. Explain Macros.
53. What is macro processor
54. Explain in brief code generation phase.
55. Explain in brief intermediate code generation phase.
56. Mention the cousins of the compiler.
57. What are the functions of a linker?
58. What is an object program?
59. Define a token.
60. What is a preprocessor?
61. Give the format of a macro definition.
62. What is the need of syntax analysis?
63. What are the capabilities of CFG?
64. Define regular expressions.
65. Define a finite state automation.
66. What is a transition diagram? Give example.
67. What is a recognizer?
68. What is CFG? Give example.
69. What is a parse tree?
70. Consider the grammar:
S --> (L)/a
L --> L,S/S
What are the terminals, non-terminals and start symbols?
71. Differentiate NFA and DFA.
72. What are the types of derivation?
73. What is right-most derivation? Give example.
74. What is left-most derivation? Give example.
75. Explain canonical derivations.
76. What is left-sentential form?
77. What is right-sentential form?
78. What is sentence of a grammar G?
79. What is Context-Free Language?
80. What is regular definition? Give example.
81. What is a non-regular set?
82. What is a Lexical analyzer?
83. Write the algorithm for moving forward pointer in "input buffering" scheme.
84. What is the use of sentinels?
85. Distinguish tokens, patterns and lexemes.
86. What are the lexical-error recovery actions?
Dept of CSE, COMPILER DESIGN LAB manual, 2014-15

Chirala Engineering College:: Chirala

87.
88.
89.
90.
91.
92.
93.
94.
95.
96.
97.
98.
99.

What is the need for input buffering?

Explain prefix and suffix of the string with example.
Explain proper prefix, proper suffix and proper substring with example.
What is subsequence of a sting?
Draw the transition diagram for identifiers.
What is the use of lexeme- beginning pointer and forward pointer?
What is a parser?
Write the role of parser.
Mention the error recovery strategies of parser.
What is ambiguity? Write the ways to eliminate ambiguity.
What is Left recursion? Write the rules to eliminate left recursion.
What is Left factoring? How do you eliminate it?
What is parsing table?
1.
2.
3.
4.
5.
6.
7.
8.
9.

What is the use of LEX?

What is a handle?
What is handle pruning?
What is a transition diagram? Give example?
What is the need for separating the parser from scanner?
Translate the arithmetic expression a*-(b+c) into a syntax tree.
. Define a Quadruple. How it is different from Triples.
What are Synthesized & Inherited Attributes?
What do you mean by back patching? Why we are going for back
patching.
10. What are the three storage allocation strategies? Explain each in detail.
11. Need for code optimization.
12. What do you mean by Peep-hole optimization?
13. Construct DAG for the following exp (a+b)-(e-(c+d)).
14. Write the mnemonic code for (a+b)-(e-(c+d)).
15. What do you mean by symbol table.Explain.
16. What informations are stored in symbol table?
17. Explain about static & stack allocation.
18. What are the code optimization techniques?
19. Explain about common sub exp elimination & renaming of temp variable
20. Explain in brief bookkeeping in compilation?
21. Give some four compiler-generator tools.
22. Mention the cousins of the compiler.
23. What is an object program?
24. What is a recognizer?

Dept of CSE, COMPILER DESIGN LAB manual, 2014-15