- Exp1: Write a program to design Finite Automata that accepts all strings ending with “ing”, over ∑= a to z. (example “anything”, “something”, “nothing”, etc.)
- Exp2: Write a program to check whether a given line is comment or not.
- Exp3: Write a program to check whether a given identifier is valid or not.
- Exp4: Write a program to count number of tokens (keywords and identifiers) in a program.
- Exp5: Write a program to convert NFA into an equivalent DFA.
- Exp6: Write a program to implement Lexical Analyzer for the source code stored in a file.
- Exp7: Write a program to find FIRST set for any given grammar.
- Exp8: Write a program to find FOLLOW set for each non-terminal of any given grammar.
- Exp9: Write a program to implement recursive descent parser.
- Exp10: Write a program to implement operator precedence parser
-
Notifications
You must be signed in to change notification settings - Fork 0
aayush301/Compiler-Design-Lab
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This repository contains the experiments that are covered in Compiler Design Lab.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published