DFA regular expression library & friends
clex is a simple lexer generator
non-backtracking NFA-based regular expression library, for C and Python
Russ Cox/Rob Pike pikevm regex implementation
Topologic Python Library. A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as …
Monorepo containing the spot text editor, an implementation of the m4 macro processor, and the Tornado Dodge console video game
18CSC304J - Compiler Design course
A simple free-form interpreted language for building Turing machines and other automata
This repository contains all of my codes of Compiler Lab
Regex matcher using Thompson’s construction.
Important programs for Automata Lab for C.S.E 4th Sem.
A collection of efficient automata algorithms implemented in the C programming language, designed to solve various computational problems.
A fast & efficient regular expression tool built using Thompson's Construction for regular expression to NFA conversion and a custom NFA-DFA conversion algorithm
First project of Theory of Computation course (IFCE) (2016.1)
This GitHub repository contains all the code implementations and practical exercises completed during my Theory of Computing course at IIT, University Of Dhaka . In this course, we explore the fascinating world of theoretical computer science, including the study of automata, formal languages, and computational complexity.
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."