FREE
AKTU Compiler Design Lab (BCS652H) Syllabus PDF – B.Tech 3rd Year
Compiler Design Lab BCS652H
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 6
- 0 downloads
- 0 views
Official AKTU syllabus of Compiler Design Lab (BCS652H) for B.Tech 3rd Year – 1 credits, L-T-P 0-0-2. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Compiler Design Lab
Download PDFBCS652H · 1 credits · L-T-P 0-0-2
Course Outcomes
At the end of course , the student will be able to
| CO 1 | Identify patterns, tokens & regular expressions for lexical analysis. | K K 2, 4 |
| CO 2 | Design Lexical analyser for given language using C and LEX /YACC tools | K K 3, 5 |
| CO 3 | Design and analyze top down and bottom up parsers. | K K 4, 5 |
| CO 4 | Generate the intermediate code | K K 4, 5 |
| CO 5 | Generate machine code from the intermediate code forms | K , K 3 4 |
Course Content
- Design and implement a lexical analyzer for given language using C and the lexical analyzer should ignore redundant spaces, tabs and new lines.
- Implementation of Lexical Analyzer using Lex Tool
- Generate YACC specification for a few syntactic categories.
- Program to recognize a valid arithmetic expression that uses operator +, – , * and /.
- Program to recognize a valid variable which starts with a letter followed by any number of letters or digits.
- Implementation of Calculator using LEX and YACC
- Convert the BNF rules into YACC form and write code to generate abstract syntax tree
- Write program to find ε – closure of all states of any given NFA with ε transition.
- Write program to convert NFA with ε transition to NFA without ε transition.
- Write program to convert NFA to DFA
- Write program to minimize any given DFA.
- Develop an operator precedence parser for a given language.
- Write program to find Simulate First and Follow of any given grammar.
- Construct a recursive descent parser for an expression.
- Construct a Shift Reduce Parser for a given language.
- Write a program to perform loop unrolling.
- Write a program to perform constant propagation.
- Implement Intermediate code generation for simple expressions.
- 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. )
Ratings & Reviews
No reviews yet — share your experience with this item.