Derivatives-based regexp to DFA compiler
-
Updated
May 10, 2018 - TypeScript
Derivatives-based regexp to DFA compiler
Automaton execution and manipulation tool for Deno
NFA and DFA simulator by Booker Martin
React rewrite of my third-year project from university, an educational tool for finite automata. Currently in development.
An asynchronous sensitive word converter/validator based on DFA.
A javascript finite state machine library written in typescript heavily inspired by jakesgordon/javascript-state-machine
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
A library for finite automata and regular expressions in the context of JS RegExp
Fast JavaScript/TypeScript LR(1) parser generator
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."