https://adventofcode.com/2024/day/3 I am wondering if there's a way to have mul do and don't appear under the same group

Unlike the community regexes that just check if the field is two alpha digits, this checks the content for the actual US state abbreviation.

Finds valid ARRL sections

Parses the QSO line of the Amateur radio contest log file format called Cabrillo. This handles the CQ World-wide contest exchange format of RS[T] and a zone. It would be a starting point for other exchanges like ARRl Field Day or another one with spaces in the exchange. This does handle either a QSO...

The regex to be used in both parts of adventofcode.com 2024 day 3 puzzle

matches aws resources (arn:aws) strings

this will run in any flavor but python in regex101. based on wikipedia bugs: local part can have more than 64 chars if we abuse . or other things

A fully? complete Uniform Resource Identifier/Locator parser for all your need. it should support theses flavors with some changes or by using a different delimiter: PRCE2/PRCE, ECMAscript and should be able to support RUST, JAVA, GOLANG, .NET flavors with ease. for PYTHON, I don't really know.

Postal code format validation based on Canada Post Addressing Guidelines Accepts optional space or hyphens

Extract links from text simple as that.

This validates any mobile or landline phone number in the world.

remove repeated characters from a string

Regex for Matching Documentation Websites This repository contains a powerful regular expression designed to match URLs that commonly point to documentation-related websites. The regex is optimized for flexibility, covering various terms and URL patterns. Regex Pattern ...

just playing around

Match any of the weird dashes people figure out how to put in their data

sees if it is a proper email or not

Parses and groups elements inside the definition of a finite automaton, defined by the following backus naur form state ::= [a-zA-Z]+ set_of_final_states ::= "final states" = {state} simbol ::= [a-zA-Z]...

parses and groups elements inside the definition of a finite automaton, defined by the following backus naur form state ::= [a-zA-Z]+ set_of_final_states ::= "final states" = {state} simbol ::= [a-zA-Z]...

it parses and groups the final states of a finate automaton

This is an english sentence tokenizer; it tokenizes correct english sentences. This can be done in a very short, "regex" string. Incorrect sentence examples be like: awesome thats so cool!...