DISTANCE EDUCATION
M.C.A./M.C.A. (Lateral) DEGREE EXAMINATION,
MAY 2017.
Fourth Semester
COMPILERN DESIGN LAB
(2010 Academic year onwards)
Time Three hours Maximum 100 marks
ONE question is to be given to each candidate by lot system.
Break-Up of Marks
Record Note Book 5
Algorithm/Flowchart 15
Program 35
Debugging Execution 35
Result 10
Total 100
1. Consider the following regular expressions:


ab*c*d
Write separate programs for each of the regular
expressions mentioned above.
2. Design a Lexical analyzer for identifying different types
of token used in C language.
Cut here
Sub. Code
406
DE-9553
Ws 6
2
3. Given a text-file which contains some regular
expressions, with only one RE in each line of the file.
Write a program which accepts a string from the user and
reports which regular expression accepts that string. If no
RE from the file accepts the string, then report that no
RE is matched.
4. Write a program to eliminate left recursion.
5. Write a program for Recursive Descent Calculator.
6. Write a program that recognizes different types of
English words.
7. Consider the following grammar:




Following any suitable parsing technique (prefer
top-down), design a parser which accepts a string and
tells whether the string is accepted by above grammar or
not.
Cut here
Cut here
Cut here
Cut here
DE-9553
Ws 6
3
8. Write a program which reads a left-recursive regular
grammar and removes left recursion from the grammar.
For example: A possible input grammar is


Its output after removal of left-recursion will be


9. Write a program which accepts a regular grammar with
no left-recursion and no null-production rules, and then it
accepts a string and reports whether the string is
accepted by the grammar or not.
10. Design a parser which accepts a mathematical expression
(containing Integers only). If the expression is valid, then
evaluate the expression else report that the expression is
invalid.