A Windows Shell Extension for more advanced bulk renaming using search and replace or regular expressions
-
Updated
Jan 7, 2023 - 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.
A Windows Shell Extension for more advanced bulk renaming using search and replace or regular expressions
A high-performance C++ regex library and lexical analyzer generator with Unicode support. Extends Flex++ with Unicode support, indent/dedent anchors, lazy quantifiers, functions for lex and syntax error reporting and more. Seamlessly integrates with Bison and other parsers.
A minimalist single-header library for building pattern-matchers, lexers, and parsers.
SolidityCheck is a static code problem detection tool based on regular expressions and program instrumentation, which is developed for Ethereum smart contracts. 《计算机科学》(Computer Science)
C++17 (CLI/embeddable) Lexical Scanner Generator
Rapid prototyping parser generator
🦙 Simple, one file, easy to use C++11 std::regex wrapper for lazy people.
Regular Expression (Regex) tool that assist in creating and testing expressions.
CMP3004 - Formal Languages and Automata Theory Course Project
Fast, parallel c++ implementation of grep command line utility.
Library Management Portal.
C++ interface to PCRE2 library compatible with <regex>
Converting Regular Expressions to Non-deterministic Finite Automaton(NFA) using C++ and displaying the NFA using OpenGL
A multi-engine tester for Regular Expressions.
A Python library to plan a call center workforce based on expected call distribution and operator contract rules, availability and preferences.
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