nfa-to-dfa-conversion

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

regex regular-expression-engine dfa dfa-minimization nfa-to-dfa-conversion thompson-algorithm

UpdatedJun 10, 2019
Java

Megha-Bose /Automata-Theory-Conversions

Star30

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

automata-theory dfa-to-regex regex-to-nfa nfa-to-dfa-conversion minimize-dfa

UpdatedApr 22, 2021
Python

devangi2000 /Compiler-Design

Star28

A repository containing all experiments for the course Compiler Design.

computer-science python3 parsing-expression-grammar lexical-analysis compiler-design automata-theory predictive-parsing intermediate-code-generation shift-reduce-parsers regex-to-nfa nfa-to-dfa-conversion first-follow-compiler

UpdatedApr 27, 2021
Python

rollrat /compiler-compiler

Star21

🍁 Compiler Compiler based on CSharp with GUI Program

parser-generator regular-expression lexer-generator lexical-analyzer compiler-construction dfa-minimization scanner-generator shift-reduce-parsers slr-parser compiler-compiler regex-to-nfa nfa-to-dfa-conversion

UpdatedOct 21, 2022
C#

amirkabiri /finite-automata

Star20

Graphical interface for designing finite automata

graphical-interface nfa dfa non-deterministic-finite-automaton dfa-minimization fa deterministic-finite-automata nfa2dfa finite-automata dfa-minimizer nfa-to-dfa-conversion dfa-complement

UpdatedOct 11, 2020
JavaScript

hritikbhandari /NFA-to-DFA-Converter

Star19

A Web Application to convert NFA to DFA.

javascript automata nfa dfa dfa-minimization nfa-to-dfa-conversion

UpdatedOct 7, 2020
JavaScript

tanmaya0102 /Compiler-Design-Programs

Star17

Compiler Design Lab Programs

c cpp lr-parser compiler-design lexical-analyzer leading-and-trailing directed-acyclic-graph intermediate-code-generation shift-reduce-parsers left-recursion-elimination nfa-to-dfa-conversion re-to-nfa first-and-follow left-factoring target-code-generation predictive-parser firstandfollow

UpdatedMay 12, 2021
C

squidscode /apli

Star13

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

interpreter parser-generator lexer-generator dfa nfa-to-dfa-conversion

UpdatedOct 11, 2023
C

Rakibul73 /Compiler_Autometa_Code

Star9

CIT-412 (Compiler Design and Autometa Theory Sessional)

recursive-descent-parser three-address-code top-down-parser slr-parser nfa-to-dfa-conversion ll1-parser whitespace-removal bottom-up-parser string-recognition first-and-follow predictive-parser lr0-parser identifier-validation identifying-comment recognize-string validate-identifier recognize-token recognize-blank-space whitespace-recognize

UpdatedFeb 12, 2024
Jupyter Notebook

Quentin18 /fsmdot

Star7

Implementation of finite-state machines and exportation to dot format

fsm nfa dfa graphviz-dot dfa-minimization nfa-to-dfa-conversion

UpdatedNov 30, 2020
Python

AmirHossein812002 /Regex2FA

Star6

Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.

automata spa vue js regex scss regular-expression finite-state-machine netlify nfa dfa automata-theory dfa-minimization vite nfa-to-dfa-conversion

UpdatedAug 9, 2023
JavaScript

man-yadul /S7-CSL411-COMPILER-LAB

Star6

parser compiler s7 lexical-analysis yacc compiler-design lexical-analyzer recursive-descent-parser ktu constant-propagation intermediate-code-generation shift-reduce-parsers left-recursion-elimination nfa-to-dfa-conversion yacc-lex first-of-grammar

UpdatedFeb 19, 2023
C

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)

python java fallback nfa automaton finite-state-automata dfa context-free-grammar automata-theory dfa-construction nfa2dfa left-recursion-elimination nfa-implementation nfa-to-dfa-conversion nfa-closure

UpdatedAug 3, 2020
Python

CS-Astronaut /Regex-To-Automata

Star5

A Tool for Drawing the DFA/NFA of a Regex for a Regular Language

regular-expression nfa dfa formal-languages automata-theory dfa-minimization finite-automata nfa-to-dfa-conversion thompson-construction regex-to-automata powerset-construction

UpdatedMay 29, 2025
Python

nichitaa /formal-languages-and-compiler-design

Star5

Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF

grammars regular-expression chomsky transition-table nfa-to-dfa-conversion finite-automaton cfg-to-cnf-conversion

UpdatedNov 5, 2021
TypeScript

igreat /regular-languages-simulator

Star4

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 ♻️

regex regular-expression nfa dfa regex-engine regular-languages dfa-minimization dfa-construction dfa-simulator regex-to-nfa nfa-to-dfa-conversion regex-parser nfa-to-regex gnfa nfa-simulator regex-simulator

UpdatedOct 1, 2024
TypeScript

Improve this page

Add a description, image, and links to thenfa-to-dfa-conversion topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with thenfa-to-dfa-conversion topic, visit your repo's landing page and select "manage topics."

Learn more

Movatterモバイル変換

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly