Automata generators for multiple input types (regular expression, right linear grammar etc.)
-
Updated
Apr 19, 2014 - C++
A regular expression (shortened as regex or regexp), sometimes referred to as rational expression, is a sequence of characters that specifies a match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings, or for input validation.
Regular expression techniques are developed in theoretical computer science and formal language theory. They are used in search engines, in search and replace dialogs of word processors and text editors, in text processing utilities such as sed and AWK, and in lexical analysis. Regular expressions are also supported in many programming languages.
Different syntaxes for writing regular expressions have existed since the 1980s, one being the POSIX standard and another, widely used, being the Perl syntax.
Automata generators for multiple input types (regular expression, right linear grammar etc.)
states is a utility for working with NFA, DFA and regular expressions
Reverse regular expression engine that calculates strings matching a given regex
C++ Perl Compatible Regular Substitution library
Programs
Fast, parallel c++ implementation of grep command line utility.
Data Structures & Algorithms in C++
High Performance Incremental Parser Engine
Programming Languages @ Hanyang Univ.
Generate regular expression from automata using Brzozowski algebraic method
Repositorio de prácticas de la materia de Compiladores. Implementación de las clases AFD y AFN, Conversión de una expresión regular a un AFN utilizando las construcciones de Thompson, conversión de un AFN a un AFD por el algoritmo de subconjuntos, generación de un analizador léxico por medio de Jaccie, analizador sintáctico por descenso recursiv…
State finite machines examples, thrax gramma and simple regex tasks. Created at the University as the project within Automata Theory and Formal Languages classes in 2014. The purpose of those examples was to learn automata and formal languages theory and also create simple state finite machines.
Java compiler of 2 phases: Lexical analyzer generator and Parser generator.
Procedural Programming concepts with C++ first project of the first year.
Copy files or directories filtered with multi ordered include or exclude regular expression
A regular expression testor like the rubular website