Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
-
Updated
Feb 23, 2026 - Java
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
🌁 Nondeterministic Finite State Automata for Java (in plain English: flowcharts with multiple possible outcomes)
A Theory of Computation mini project in progress using Java and JavaFX GUI.
A Java-based compiler prototype that performs lexical and syntactic analysis using NFA, DFA, and LL(1) parsing approaches.
A program in Java and QT Jambi to convert an NFA to a DFA and minimize it
The fast scanner generator for Java™ with full Unicode support
A Java program that can emulate various computational models
Java library for RegexSolver API.
Learning how to simulate a grammer in a Non Deterministic Finite Automata
Task 1 for the Compilers lab where the needed deliverable is a function that takes a regular expression as an input and outputs an equivalent NFA as per Thompson's methon
A little toolbox that provides detector and converter for DFA machines
lexer & parser generator for java
A very simple regex matcher written in Java.
A simple Java program to run non-deterministic final state automata (NFAs).
Implementation of a Finite Automata Simulator
Laboratorio B Diseño de Lenguajes de Programación
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."