There are 2 repositories under nfa topic.
Lex machinary for go.
A low level regular expression library that uses deterministic finite automata.
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
All the weekly lab work of the subject 18CSC304J Compiler Design.
non-backtracking NFA-based regular expression library, for C and Python
These are my programs for compiler design lab work in my sixth semester
Some toy labs for compiler course
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
A Python library for simulating and visualizing finite automata
OCaml code to construct an NFA from a regular expression
Работа с регулярными выражениями средствами платформы 1С:Предриятие
A library for finite automata and regular expressions in the context of JS RegExp
Graphical interface for designing finite automata
A Web Application to convert NFA to DFA.
A tiny library which contains tools to convert, minimize and visualize Regular Expressions, NFA and DFA.
Business Rule Engine Hardware Accelerator
🌁 Nondeterministic Finite State Automata for Java (in plain English: flowcharts with multiple possible outcomes)
Simulations of deterministic finite automata in different languages!
A program to convert the given regular expression to Non Definite Automata (NFA)
A Shotgun Toolkit app to create flipbook of your current scene with use of SGTK templates.
Theory of machines and languages course project.
Input a Regex, get its AST, NFA, DFA and finally it Minimized DFA (Compiler Course Assignment)