Implementation of a top-down recursive descent parser in C++.
-
Updated
Jun 9, 2022 - 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.
Implementation of a top-down recursive descent parser in C++.
A Python library to plan a call center workforce based on expected call distribution and operator contract rules, availability and preferences.
Course on automatic machines
C++ interface to PCRE2 library compatible with <regex>
I have tried to make a DFA-Maker. You enter a regular expression or regex containing concatenation, or and grouping operations and as an output, you will get a PNG file containing the DFA for that accepts that regular expression.
A repo containing some projects regarding Finite Languages and Automata
"This repository focuses on implementing Compiler-Related concepts."
cat utillity with regular expressions and color.
Regular expression. Scaner. Parser. Compiler. Engineering a Compiler, 2nd Edition - K. Cooper, L. Torczon (2012)
Advanced c++ programming class, lab10, regular expressions, boost string algorithm
My implementation of UCLA's CS31 Winter 2024 Programming Assignment/Project 3. A Quality Control (QC) Testing application written in C++ that validates and analyzes QC test results. The application checks if a QC result string is valid, calculates the total number of tests, passes, defects, and batches, and handles errors appropriately.
CMP3004 - Formal Languages and Automata Theory Course Project
Rename files with regular expressions. Created with Qt with the purpose to be used alongside KDEs Dolphin file manager as a service or an extension
A somewhat sophisticated regular expression parser utilizing a finite automata
A multi-engine tester for Regular Expressions.
이것저것 공부
Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL