This a toy compiler of a hypothetical language whose grammar has been given in "PLCC Language Specifications.pdf" and the analysis of the same in "grammarAnalysis.pdf". The graphical representation of "deterministic finite automaton (DFA)" can be found in "dfa.jpg". This project was done in completion of the course "Compiler Construction".
saurabhanand1995/Compiler-Construction
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published