🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
-
Updated
Mar 27, 2020 - C++
🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.
18CSC304J Compiler Design Lab codes
A simple regular expression engine implemented in C++.
Detect useless transitions in Pushdown Automata
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
This is a basic regular expression simulator
Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)
Input any regular expression and an NFA for it will be generated.
Programs
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."