https://github.com/paulthomas20002/s7-compiler-lab
CSL411 COMPILER LAB , Prerequisite: A sound knowledge in C programming, Data Structures, Formal languages and Automata Theory and Compiler design.
https://github.com/paulthomas20002/s7-compiler-lab
c cd cd-lab compiler compiler-design compiler-design-lab csl411 dsa flat
Last synced: about 1 year ago
JSON representation
CSL411 COMPILER LAB , Prerequisite: A sound knowledge in C programming, Data Structures, Formal languages and Automata Theory and Compiler design.
- Host: GitHub
- URL: https://github.com/paulthomas20002/s7-compiler-lab
- Owner: PaulThomas20002
- Created: 2023-08-22T12:57:38.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2023-12-20T23:25:05.000Z (over 2 years ago)
- Last Synced: 2025-03-05T23:24:09.364Z (over 1 year ago)
- Topics: c, cd, cd-lab, compiler, compiler-design, compiler-design-lab, csl411, dsa, flat
- Language: C
- Homepage:
- Size: 2.68 MB
- Stars: 1
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
#SYLLABUS
1. Implementation of lexical analyzer using the tool LEX.
2. Implementation of Syntax analyzer using the tool YACC.
3. Application problems using NFA and DFA.
4. Implement Top-Down Parser.
5. Implement Bottom-up parser.
6. Simulation of code optimization Techniques.
7. Implement Intermediate code generation for simple expressions.
8. Implement the back end of the compiler.
#PRACTICE QUESTIONS
List of Exercises/Experiments:
1. Design and implement a lexical analyzer using C language to recognize all valid tokens
in the input program. The lexical analyzer should ignore redundant spaces, tabs and
newlines. It should also ignore comments.
2. Implement a Lexical Analyzer for a given program using Lex Tool.
3. Write a lex program to display the number of lines, words and characters in an input text.
4. Write a LEX Program to convert the substring abc to ABC from the given input string.
5. Write a lex program to find out total number of vowels and consonants from the given
input sting.
6. Generate a YACC specification to recognize a valid arithmetic expression that uses
operators +, – , *,/ and parenthesis
7. Generate a YACC specification to recognize a valid identifier which starts with a letter
followed by any number of letters or digits.
8. Implementation of Calculator using LEX and YACC
9. Convert the BNF rules into YACC form and write code to generate abstract
syntax tree.
10. Write a program to find ε – closure of all states of any given NFA with ε transition.
11. Write a program to convert NFA with ε transition to NFA without ε transition.
12. Write a program to convert NFA to DFA.
13. Write a program to minimize any given DFA.
14. Write a program to find First and Follow of any given grammar.
15. Design and implement a recursive descent parser for a given grammar.
16. Construct a Shift Reduce Parser for a given language.
17. Write a program to perform constant propagation.
18. Implement Intermediate code generation for simple expressions.
19. 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.