Compiler-Design-Lab

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

Name		Name	Last commit message	Last commit date
Latest commit History 15 Commits
Exp1.cpp		Exp1.cpp
Exp10.cpp		Exp10.cpp
Exp2.cpp		Exp2.cpp
Exp3.cpp		Exp3.cpp
Exp4.cpp		Exp4.cpp
Exp5.cpp		Exp5.cpp
Exp6.cpp		Exp6.cpp
Exp7.cpp		Exp7.cpp
Exp7input.txt		Exp7input.txt
Exp8.cpp		Exp8.cpp
Exp8input.txt		Exp8input.txt
Exp9.cpp		Exp9.cpp
README.md		README.md

Provide feedback