A Powerful and Fast regex engine. Featuring pure DFA match, Thompson NFA match(extended regex should be supported soon), regex operation(union, intersection , complementary), DFA to regex is also available

A basic implementation of regex.

最小化DFA

Automaton execution and manipulation tool for Deno

编译原理

a GUI and CLI tool for converting a non-deterministic finite automaton (NFA) to a deterministic finite automaton (DFA) and further minimizing the DFA.

Regex libraries benchmark

A Python program that uses an NFA to check if a regular expression matches a given string

REL is a non-backtracking regular expression engine with support for constant lookahead and submatch tracking.

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

lexer & parser generator for java

This repository contains solutions to some of the most commonly existing problems in automata and computation.

Aplikas Finite Automata Text Search menggunakan mesin nondeterministik finite automata (NFA) dengan menerapkan extended transition function (delta topi). Dalam text search, penerapan konsep NFA (Non-deterministic Finite Automata) dapat digambarkan saat kita diberi satu set string yang akan disebut dengan kata kunci (keyword), kemudian NFA akan m…

18CSC304J Compiler Design Lab codes

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

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

a simple compiler,from regexp,nfa,dfa,ll(1) to a simple compiler

Detect useless transitions in Pushdown Automata