Compiler Algorithms to implement a Lexical Analysis
-
Updated
Jan 6, 2023 - C#
Compiler Algorithms to implement a Lexical Analysis
Project of Formal Language and Automata, University of Trento 2021. C implementation of regular expression parser and non-deterministic automaton generator, i.e. Thompson Construction.
Regular expression matching program
Regular Expression matching library
University course project on Data Structures and Algorithms
Implementación de análisis léxico usando automatas
Potata regex engine
A Python program to build Non-Deterministic Finite Automatons from Regular Expressions using Thompson’s construction.
thompson constructor.
Simple regular expression interpreter
implementation of automata in r7rs scheme
A simple regex-to-golang compiler based on Thompson's construction algorithm.
Add a description, image, and links to the thompson-construction topic page so that developers can more easily learn about it.
To associate your repository with the thompson-construction topic, visit your repo's landing page and select "manage topics."