Scribd
Upload
12 views2 pages

CD Ritik Raj

This document is a practical file for the Compiler Design Lab course (BCS 652) at Sunder Deep Engineering College, submitted by Ritik Raj Srivastav to Ms. Payal Goel. It includes an index of various programming assignments related to compiler design, such as implementing lexical analyzers, converting NFA to DFA, and generating intermediate code. The session for this practical file is 2024-2025.

Uploaded by

db880074
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
12 views2 pages

CD Ritik Raj

This document is a practical file for the Compiler Design Lab course (BCS 652) at Sunder Deep Engineering College, submitted by Ritik Raj Srivastav to Ms. Payal Goel. It includes an index of various programming assignments related to compiler design, such as implementing lexical analyzers, converting NFA to DFA, and generating intermediate code. The session for this practical file is 2024-2025.

Uploaded by

db880074
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
You are on page 1/ 2

Sunder Deep Engineering College

NH-9(24), Delhi- Hapur Road, Dasna, Ghaziabad-201015, (U.P.)


Tel: (0120) 2965554

Department: Computer Science and Engineering

Practical File
COMPILER DESIGN LAB
BCS 652
(6th Semester)
B. TECH (CSE)A

Submitted By Submitted To
RITIK RAJ SRIVASTAV Ms. PAYAL GOEL MAM
(2202400100086)

Session (2024-2025)
Sunder Deep Engineering College
NH-9(24), Delhi- Hapur Road, Dasna, Ghaziabad-201015, (U.P.)
Tel: (0120) 2965554

Department: Computer Science and Engineering

INDEX
S NO. Topic Date Signatur
e
1. Design and implement a lexical analyzer for given language
using C and the lexical analyzer
2. Implementation of lexical analyzer using Lex Tool.
3. Generate YACC specification for a few syntactic categories
4. WAP to find ℇ-closure of all states of any given NFA with ℇ
transition
5. WAP to convert NFA with ℇ transition to NFA without ℇ
transition.
6. WAP to convert NFA to DFA

7. WAP to minimize any given DFA


8. Develop an operator precedence parser for a given language.
9. WAP 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 WAP to perform loop unrolling
13. WAP 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 sample
move , add ,sub, jump etc.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy