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

Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL

Regular Expression Engine which Uses NFAs and DFAs to Match Regular Expression

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.

Principles of Compiler Design Programs

Implementing a simple database kernel

🖧 Program that loads a DFA/NFA from a file, then checks if words are accepted by the automata.

Lab experiments of Finite Automata Theory course (CSE 2206 at RUET)

regular expression engine

REGEX-NFA converter and NFA simulator

C++ impelementation of micro java compiler

18CSC304J Compiler Design Lab codes

编译原理

Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)

Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.

Implementation of a Non-deterministic Finite Automaton in C++. The program can show the dead states, check if the NFA is a DFA and analyze a string to see if it belongs to the NFA.

Detect useless transitions in Pushdown Automata

Playing around with NFAs and DFAs