Regular Expressions Tutorial

A regular expression, regex or regexp (sometimes called a rational expression) is a sequence of characters that define a search pattern. Usually such patterns are used by string searching algorithms for "find" or "find and replace" operations on strings, or for input validation. It is a technique developed in theoretical computer science and formal language theory.

Topic covered:
Regular Expressions - Introduction
Regular Expressions - Basic Symbols (2:3)
Regular Expressions - Extended syntax (3:46)
Regular Expressions - Regex and finite state automata (6:15)
Regular Expressions - Bigger example (8:47)
******************
== Attribution
Course Created by: UC Computer Science Education
License: Creative Commons Attribution license (reuse allowed)
***********

Join our community and stay up to date with computer science
********************

[deborahwhy]

🌬So "regular expressions" (re) break "patterns" down into "symbols", which programmers can quickly use to explain "how" a process works; and or also to "determine" what a processs' outcome will likely be.👁 do i comprehnd-undrstnd correctly?👁 three "re" symbols are> () * | 👁however, there are othrs.👍pax 🕊