My solutions to problem sets from CS50's Introduction to Programming with Python 2022
-
Updated
Jun 13, 2024 - Python
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.
My solutions to problem sets from CS50's Introduction to Programming with Python 2022
node.js bindings for RE2: fast, safe alternative to backtracking regular expression engines.
Python bindings to the Rust regress crate which provides ECMA regular expressions
The chatbot is designed to engage in conversations with users based on predefined patterns and responses.
A command-line tool and Rust library with Python bindings for generating regular expressions from user-provided test cases
Regular expressions for the Savi standard library, written in pure Savi.
Extract emails from a file.
An SMT Solver for string constraints
The website contains 30 sample libraries for frontend developers
Материалите ми за упражнения по "Езици, автомати и изчислимост"
SQL Data Cleaning and Exploration
School Training Document: Regex Examples
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
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.
Drop-in replacement for regexp using re2, for any Go app
Computational Modeling WorkBench
Solutions to Susanna Epp's Discrete Mathematics book, 5th Edition
Regular expression tools for JavaScript developers.
An readable and intuitive way to generate Regular Expressions