An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
-
Updated
Mar 7, 2023 - TypeScript
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
Derivatives-based regexp to DFA compiler
An asynchronous sensitive word converter/validator based on DFA.
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 ♻️
Fast JavaScript/TypeScript LR(1) parser generator
Automaton execution and manipulation tool for Deno
A javascript finite state machine library written in typescript heavily inspired by jakesgordon/javascript-state-machine
Node.js library for RegexSolver API.
NFA and DFA simulator by Booker Martin
Finite state automaton animator
React rewrite of my third-year project from university, an educational tool for finite automata. Currently in development.
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."