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
Fast JavaScript/TypeScript LR(1) parser generator
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 ♻️
Automaton execution and manipulation tool for Deno
Group Assignment for 01418334(66-2) Compiler Techniques
NFA and DFA simulator by Booker Martin
Node.js library for RegexSolver API.
An automata simulator (supporting DFA and NFA).
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 nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."