Scribd
Upload
16 views1 page

Compiler Design Lab

The document outlines the course outcomes and detailed syllabus for the Compiler Design Lab (BCS652) at Dr. A.P.J. Abdul Kalam Technical University. Students will learn to identify patterns, design lexical analyzers, and generate machine code, among other skills. The syllabus includes practical programming tasks using C, LEX, and YACC tools to implement various compiler components and algorithms.

Uploaded by

Shadab Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views1 page

Compiler Design Lab

The document outlines the course outcomes and detailed syllabus for the Compiler Design Lab (BCS652) at Dr. A.P.J. Abdul Kalam Technical University. Students will learn to identify patterns, design lexical analyzers, and generate machine code, among other skills. The syllabus includes practical programming tasks using C, LEX, and YACC tools to implement various compiler components and algorithms.

Uploaded by

Shadab Hussain
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DR. A.P.J.

ABDUL KALAM TECHNICAL UNIVERSITY, UTTAR PRADESH, LUCKNOW

Compiler Design Lab (BCS652)


Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to

Identify patterns, tokens & regular expressions for lexical analysis. K2, K4
CO 1
Design Lexical analyser for given language using C and LEX /YACC tools K3, K5
CO 2
Design and analyze top down and bottom up parsers. K4, K5
CO 3
Generate the intermediate code K4, K5
CO 4
Generate machine code from the intermediate code forms K3, K4
CO 5

DETAILED SYLLABUS
1. Design and implement a lexical analyzer for given language using C and the lexical analyzer should ignore
redundant spaces, tabs and new lines.
2. Implementation of Lexical Analyzer using Lex Tool
3. Generate YACC specification for a few syntactic categories.
a) Program to recognize a valid arithmetic expression that uses operator +, – , * and /.
b) Program to recognize a valid variable which starts with a letter followed by any number of letters or digits.
c) Implementation of Calculator using LEX and YACC
d) Convert the BNF rules into YACC form and write code to generate abstract syntax tree
4. Write program to find ε – closure of all states of any given NFA with ε transition.
5. Write program to convert NFA with ε transition to NFA without ε transition.
6. Write program to convert NFA to DFA
7. Write program to minimize any given DFA.
8. Develop an operator precedence parser for a given language.
9. Write program to find Simulate First and Follow of any given grammar.
10. Construct a recursive descent parser for an expression.
11. Construct a Shift Reduce Parser for a given language.
12. Write a program to perform loop unrolling.
13. Write a program to perform constant propagation.
14. Implement Intermediate code generation for simple expressions.
15. Implement the back end of the compiler which takes the three address code and produces the 8086 assembly
language instructions that can be assembled and run using an 8086 assembler. The target assembly instructions can
be simple move, add, sub, jump etc.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified manner
It is also suggested that open source tools should be preferred to conduct the lab (R , Python etc. )

Curriculum & Evaluation Scheme: CS, Computer Engineering and CSE (V & VI Semester) 33

You might also like