A repository containing all experiments for the course Compiler Design.

Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.

🍁 Compiler Compiler based on CSharp with GUI Program

Code for Compiler Design Lab, Semester 7

A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.

A RegEx engine that builds NFA/DFA and always returns the longest match.

A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️

A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular

This is the repository for DSAAT CP

Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression

A comprehensive single tape Turing Machine simulator.

Automata implementations

A program that takes a regular expression and creates an NFA that accepts it. The description of an NFA should be compatible with a NFA 2 DFA program, which means that it can be translated into a form that can be run on a DFA simulator.

Resolução dos problemas de Teoria de Computação 2019/2020

A library for converting a regex to nfa and then to a dfa

A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm

Input any regular expression and an NFA for it will be generated.

Regex to Automata converter

A regex compiler using NFA/DFA conversion to build lexers on data streams