DISTANCE EDUCATION
M.C.A./M.C.A (Lateral) DEGREE EXAMINATION, MAY 2017.
Fifth Semester
LAB X — Compiler Design
(2005 to 2010 calendar year)
Time Three hours Maximum 100 marks
Examiner should select and give ONE question to each
candidate by LOT system.
1. Write a program in C to recognize identifier in the
given source code.
Write a C program to construct SLR parsing table
for the following grammar.
F
T T F/F
E E T/T



2. Write a C program to recognize constant in the
given sources code.
Write a C program to construct of a canonical LR
parsing table for the following grammar.
C cC d.
S CC


Cut here
Sub. Code
57
DE-9541
2
Ws2
3. Write a C program to convert infix expression to
postfix notation.
Write a C program to construct predictive parsing
table for the following production rule:
C b
SI es/ E is empty)
S iCt SSI/a



4. Write a C program to draw the transition diagram
for DFA by accepting the following regular
expression:
abb
1 .10 .
Write a C program to translate the expression
into post fix notation and
three address code, quadraples, triples and Indirect
triples.
5. Write a program to remove spaces, comment lines,
new lines and produce line numbers. (preliminary
scanning).
Construct a C program to accept a string and check
whether it satisfies the following production rule
(By Using Operator precedence grammar).
S AbB
A aBb
B Bba.
Cut here
Cut here
DE-9541
3
Ws2
6. Write a C program to accept a string and check
whether it satisfies the following production rule
(By using shift reduce parsing).
E E E E E E
Write a C program to construct predictive parsing
table for the following production rule:
S iCt SSI/a
eS/E is empty)
C