All the weekly lab work of the subject 18CSC304J Compiler Design.

An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）

KTU 7th Semester Compiler Design lab programs along with algorithms

1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings

A repository containing all experiments for the course Compiler Design.

Compiler Design Lab Programs

A Web Application to convert NFA to DFA.

A log of S7 KTU Compiler Design Lab

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

Graphical interface for designing finite automata

Converts a given regular expression into a NFA(Thompson's construction) then converts that NFA to a DFA(Subset construction)

An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)

🍁 Compiler Compiler based on CSharp with GUI Program

This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.

Implementation and Simulation of TicTacTie via Deterministic Finite State Automata

State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.

Programs covered in compiler design lab (CEN-603)

The Abstract Programming Language Interface (APLI) is a framework for generating Abstract Syntax Trees (ASTs) to enable developers to create domain-specific languages faster.

A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)