Automata generators for multiple input types (regular expression, right linear grammar etc.)
-
Updated
Apr 19, 2014 - C++
#
Regular expression
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.
Here are 84 public repositories matching this topic...
states is a utility for working with NFA, DFA and regular expressions
-
Updated
Sep 16, 2014 - C++
Reverse regular expression engine that calculates strings matching a given regex
-
Updated
Oct 10, 2014 - C++
C++ Perl Compatible Regular Substitution library
-
Updated
Feb 13, 2017 - C++
Programs
client
sockets
dictionary
regular-expression
socket-server
pthreads
nfa
dfa
network-programming
mergesort-algorithm
socket-programming
merge-sort
-
Updated
Apr 24, 2017 - C++
Fast, parallel c++ implementation of grep command line utility.
-
Updated
May 7, 2017 - C++
High Performance Incremental Parser Engine
parser
regex
parser-generator
regular-expression
code-generation
regular-expression-engine
regex-engine
-
Updated
Jun 1, 2017 - C++
Programming Languages @ Hanyang Univ.
-
Updated
Jun 16, 2017 - C++
Generate regular expression from automata using Brzozowski algebraic method
-
Updated
Jul 7, 2017 - C++
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…
-
Updated
Dec 20, 2017 - C++
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.
university
regular-expression
formal-languages
automata-theory
state-finite-machines
thrax-gramma
regex-tasks
-
Updated
Feb 16, 2018 - C++
Java compiler of 2 phases: Lexical analyzer generator and Parser generator.
-
Updated
May 14, 2018 - C++
Procedural Programming concepts with C++ first project of the first year.
-
Updated
Sep 7, 2018 - C++
Copy files or directories filtered with multi ordered include or exclude regular expression
-
Updated
Nov 30, 2018 - C++
A regular expression testor like the rubular website
-
Updated
Apr 25, 2019 - C++
-
Updated
Apr 29, 2019 - C++