-b    use 'basic' (obsolete) regular expressions (see discussion below)
-c    clear all shell variables created by prior invocations of REGEX.
-i    ignore case
-n    no special characters
-v    print the reqular expression and teststring to the console (useful when CLI parsing may change text)

  REGEX 1.*abc   abc1xxxabc    # Run regex of "1.*abc" on "abc1xxxabc"
  ECHO $REGEX
  ECHO $RM_1
  ECHO $RS_1
  ECHO $RE_1

Output shows REGEX =1, with match being 1xxxabc.  That string starts at offset 3 within the input string and ends at offset 10...

  1
  1xxxabc
  3
  10

  REGEX  ^..  ABCD        # Run regex of "^.." on "ABCD"
  ECHO $REGEX
  ECHO $RM_1
  ECHO $RS_1
  ECHO $RE_1

Output shows REGEX =1, with match being AB.  That string starts at offset 0 within the input string and ends at offset 2...

  1
  AB
  0
  2

  REGEX ^AB(.)D ABCD        # Run regex of "^AB(.)D" on string "ABCD"
  ECHO $REGEX
  ECHO $RM_1
  ECHO $RM_2

Output shows REGEX = 2, with first match being ABCD, and the second match being 'C'...

   2
  ABCD
  C

  # This script issues a command to a uMon-based target to retrieve it's
  # IP address (echo $IPADD).  The response from the SEND (automatically
  # stored in $LASTLINE) is the board returning it's IP address.
  # Then the REGEX command is used to parse the response and break it
  # up into 4 tokens (using parenthesis).
  # The result is that $RM_2 thru $RM_5 are loaded with the four digits
  # of the IP address...
  SEND -p uMON> "echo \$IPADD"
  ECHO LASTLINE: $LASTLINE
  REGEX "(.*)\.(.*)\.(.*)\.(.*)" $LASTLINE
  ECHO REGEX: $REGEX
  IF $REGEX eq 5 GOTO SHOW_IP
  ECHO INVALID IP ADDRESS: $LASTLINE
  EXIT
  # SHOW_IP:
  ECHO IP Address is: ${RM_2}.${RM_3}.${RM_4}.${RM_5}
  EXIT

Output shows the interaction with uMon and the final line printed by the SHOW_IP code above...
This clearly demonstrates REGEX's ability to parse for multiple parameters

  echo $IPADD
  135.104.124.130
  uMON>LASTLINE: 135.104.124.130
  REGEX: 5
  IP Address is: 135.104.124.130

It is far beyond the scope of this text to describe the power and syntax of regular expressions.  There are plenty of resources on the web for that.  Here are a few I found useful (if they're still around):

https://www.regular-expressions.info/tutorial.html
https://en.wikipedia.org/wiki/Regular_expression

This command provides the user with the script-command-line version of the regcomp/regex facility provided by this engine.

Regular expressions ("REs"), as defined in  -p1003.2, come in two forms: modern REs (roughly those of egrep(1); 1003.2 calls these "extended" REs) and obsolete REs (roughly those of ed(1); 1003.2 "basic" REs). Obsolete REs mostly exist for backward compatibility in some old programs; they will be discussed at the end.  -p1003.2 leaves some aspects of RE syntax and semantics open; '‡' marks decisions on these aspects that may not be fully portable to other  -p1003.2 implementations.

A (modern) RE is one‡ or more non-empty‡ branches, separated by '|'. It matches anything that matches one of the branches.

A branch is one‡ or more pieces, concatenated. It matches a match for the first, followed by a match for the second, etc.

A piece is an atom possibly followed by a single‡ '*', '+', '?', or bound. An atom followed by '*' matches a sequence of 0 or more matches of the atom. An atom followed by '+' matches a sequence of 1 or more matches of the atom. An atom followed by '?' matches a sequence of 0 or 1 matches of the atom.

A bound is '{' followed by an unsigned decimal integer, possibly followed by ',' possibly followed by another unsigned decimal integer, always followed by '}'. The integers must lie between 0 and RE_DUP_MAX (255‡) inclusive, and if there are two of them, the first may not exceed the second. An atom followed by a bound containing one integer i and no comma matches a sequence of exactly i matches of the atom. An atom followed by a bound containing one integer i and a comma matches a sequence of i or more matches of the atom. An atom followed by a bound containing two integers i and j matches a sequence of i through j (inclusive) matches of the atom.

An atom is a regular expression enclosed in '()' (matching a match for the regular expression), an empty set of '()' (matching the null string)‡, a bracket expression (see below), '.' (matching any single character), '^' (matching the null string at the beginning of a line), '$' (matching the null string at the end of a line), a '\' followed by one of the characters '^.[$()|*+?{\' (matching that character taken as an ordinary character), a '\' followed by any other character‡ (matching that character taken as an ordinary character, as if the '\' had not been present‡), or a single character with no other significance (matching that character). A '{' followed by a character other than a digit is an ordinary character, not the beginning of a bound‡. It is illegal to end an RE with '\'.

A bracket expression is a list of characters enclosed in '[]'. It normally matches any single character from the list (but see below). If the list begins with '^', it matches any single character (but see below) not from the rest of the list. If two characters in the list are separated by '-', this is shorthand for the full range of characters between those two (inclusive) in the collating sequence, e.g.'[0-9]' in ASCII matches any decimal digit. It is illegal‡ for two ranges to share an endpoint, e.g.'a-c-e'. Ranges are very collating-sequence-dependent, and portable programs should avoid relying on them.

To include a literal ']' in the list, make it the first character (following a possible '^'). To include a literal '-', make it the first or last character, or the second endpoint of a range. To use a literal '-' as the first endpoint of a range, enclose it in '[.' and '.]' to make it a collating element (see below). With the exception of these and some combinations using '[' (see next paragraphs), all other special characters, including '\', lose their special significance within a bracket expression.

Within a bracket expression, a collating element (a character, a multi-character sequence that collates as if it were a single character, or a collating-sequence name for either) enclosed in '[.' and '.]' stands for the sequence of characters of that collating element. The sequence is a single element of the bracket expression's list. A bracket expression containing a multi-character collating element can thus match more than one character, e.g. if the collating sequence includes a 'ch' collating element, then the RE '[[.ch.]]*c' matches the first five characters of 'chchcc'.

Within a bracket expression, a collating element enclosed in '[=' and '=]' is an equivalence class, standing for the sequences of characters of all collating elements equivalent to that one, including itself. (If there are no other equivalent collating elements, the treatment is as if the enclosing delimiters were '[.' and '.].') For example, if 'x' and 'y' are the members of an equivalence class, then '[[=x=]]', '[[=y=]]', and '[xy]' are all synonymous. An equivalence class may not‡ be an endpoint of a range.

Within a bracket expression, the name of a character class enclosed in '[:' and ':]' stands for the list of all characters belonging to that class. Standard character class names are:

alnum  digit   punct
alpha  graph   space
blank  lower   upper
cntrl  print   xdigit
    
These stand for the character classes defined in ctype(3). A locale may provide others. A character class may not be used as an endpoint of a range.

There are two special cases‡ of bracket expressions: the bracket expressions '[[:<:]]' and '[[:>:]]' match the null string at the beginning and end of a word respectively. A word is defined as a sequence of word characters which is neither preceded nor followed by word characters. A word character is an alnum character (as defined by ctype(3)) or an underscore. This is an extension, compatible with but not specified by -p1003.2, and should be used with caution in software intended to be portable to other systems.

In the event that an RE could match more than one substring of a given string, the RE matches the one starting earliest in the string. If the RE could match more than one substring starting at that point, it matches the longest. Subexpressions also match the longest possible substrings, subject to the constraint that the whole match be as long as possible, with subexpressions starting earlier in the RE taking priority over ones starting later. Note that higher-level subexpressions thus take priority over their lower-level component subexpressions.

Match lengths are measured in characters, not collating elements. A null string is considered longer than no match at all. For example, 'bb*' matches the three middle characters of 'abbbc', '(wee|week)(knights|nights)' matches all ten characters of 'weeknights', when '(.*).*' is matched against 'abc' the parenthesized subexpression matches all three characters, and when '(a*)*' is matched against 'bc' both the whole RE and the parenthesized subexpression match the null string.

If case-independent matching is specified, the effect is much as if all case distinctions had vanished from the alphabet. When an alphabetic that exists in multiple cases appears as an ordinary character outside a bracket expression, it is effectively transformed into a bracket expression containing both cases, e.g.'x' becomes '[xX]'. When it appears inside a bracket expression, all case counterparts of it are added to the bracket expression, so that (e.g.) '[x]' becomes '[xX]' and '[^x]' becomes '[^xX]'.

No particular limit is imposed on the length of REs‡. Programs intended to be portable should not employ REs longer than 256 bytes, as an implementation can refuse to accept such REs and remain POSIX-compliant.

Obsolete ("basic") regular expressions differ in several respects. '|' is an ordinary character and there is no equivalent for its functionality. '+' and '?' are ordinary characters, and their functionality can be expressed using bounds ('{1,}' or '{0,1}' respectively). Also note that 'x+' in modern REs is equivalent to 'xx*'. The delimiters for bounds are '\{' and '\}', with '{' and '}' by themselves ordinary characters. The parentheses for nested subexpressions are '\(' and '\)', with '(' and ')' by themselves ordinary characters. '^' is an ordinary character except at the beginning of the RE or‡ the beginning of a parenthesized subexpression, '$' is an ordinary character except at the end of the RE or‡ the end of a parenthesized subexpression, and '*' is an ordinary character if it appears at the beginning of the RE or the beginning of a parenthesized subexpression (after a possible leading '^'). Finally, there is one new type of atom, a back reference: '\' followed by a non-zero decimal digit d matches the same sequence of characters matched by the d th parenthesized subexpression (numbering subexpressions by the positions of their opening parentheses, left to right), so that (e.g.) '\([bc]\)\1' matches 'bb' or 'cc' but not 'bc'.

The underlying regular expression engine used here is taken from the FreeBSD distribution of regex (originally written by Henry Spencer)...

/*
 * Copyright (c) 1994
 *  The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    This product includes software developed by the University of
 *    California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *  @(#)COPYRIGHT   8.1 (Berkeley) 3/16/94
 */