All the weekly lab work of the subject 18CSC304J Compiler Design.
-
Updated
May 11, 2022 - C++
All the weekly lab work of the subject 18CSC304J Compiler Design.
A program to convert the given regular expression to Non Definite Automata (NFA)
states is a utility for working with NFA, DFA and regular expressions
Programs covered in compiler design lab (CEN-603)
Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL
Built a compiler generator tool which can be supplied with lexical and grammar rules of any programming language and used to generate the lexical and syntax analyzer needed to generate intermediate code.
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
18CSC304J Compiler Design Lab codes
Detect useless transitions in Pushdown Automata
A simple regular expression engine implemented in C++.
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."