MEERUT INSTITUTE OF ENGINEERING & TECHONOLOGY ,MEERUT
COMPILER DESIGN(RCS602)
Question Bank
Q1
a) Differentiate between the Compiler and Interpreters.
b) What is cross compiler?
c) How YACC can be used to generate parser?
d) What do you mean by a regular expression?
e) State the problems associated with the top down parsing.
f)What is translator?
g)Write down the shot note on symbol table.
i)What is the role of left recursion?
Q2. What is the role of left recursion? Consider the following grammar:
S→Aa/b, A→Ac/Sd/e.
Check whether left recursion exists and remove the left recursion.
Q3. Explain all the necessary phases and passes of a compiler design.
Q4. Explain how stack implementation of predictive parsing is done, considering the grammar:
E→TE', E'→+TE'/€, T→FT', T'→*FT'/€, F→ (E)/id
and input string as id+id*id.
Q5. Discuss the operator-precedence parsing algorithm. Consider the following operator grammar.
Compute the operator precedence table and precedence functions.* higher precedence then +
and left associative.
E→E+E/E*E/ (E)/id.
Q6. How does finite automata useful for lexical analysis? Construct the NFA and DFA for the
following regular expression (a+b)*abb.
Q7.Construct the SLR parser table for the grammar: E’→E, E→E+T/T, T→T*F/F,
F→ (E)/id.
Q8.Write a CF grammar to represent palindrome.
Q9.Construct the minimized DFA for regular expression (0+1)*(0+1)10.
Q10.Eliminate le� recursion from the following grammar
S→AB, A→BS/b, B→SA/A.
Q.11 Explain non recursive predic�ve parsing. Consider the following grammar and construct
the predic�ve parsing table. E→TE', E’→+TE'/€, T→FT', T→*FT'/€, F→F*/a/b.
Q12.Draw NFA for the regular expression ab*/ab.
Q13. What is a cross compiler? How is boot-strapping of a compiler done to a second
machine?
Q.14 Discuss the challenges in compiler design.
Q15 What do you mean by ambiguous grammar?Show that the following grammar is
ambiguous.
