Scribd
Upload
328 views

Regular Expressions

Regular expressions can be used to define formal languages by representing patterns of strings. There are primitive regular expressions like single characters or the empty string that define basic languages. More complex regular expressions can be built up by applying operators like concatenation, Kleene closure, and alternation to existing regular expressions. Regular expressions have a direct correspondence to the formal languages they define. Examples are provided of building regular expressions to define languages with certain properties over a given alphabet.

Uploaded by

sriramdangeti
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
328 views

Regular Expressions

Regular expressions can be used to define formal languages by representing patterns of strings. There are primitive regular expressions like single characters or the empty string that define basic languages. More complex regular expressions can be built up by applying operators like concatenation, Kleene closure, and alternation to existing regular expressions. Regular expressions have a direct correspondence to the formal languages they define. Examples are provided of building regular expressions to define languages with certain properties over a given alphabet.

Uploaded by

sriramdangeti
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Regular Expressions :

Primitive Regular Expressions :


A regular expression can be used to define a language. A regular expression
represents a "pattern;" strings that match the pattern are in the language, strings
that do not match the pattern are not in the language.

As usual, the strings are over some alphabet .

The following are primitive regular expressions:

• x, for each x ,
• , the empty string, and
• , indicating no strings at all.

Thus, if | | = n, then there are n+2 primitive regular expressions defined over .

Here are the languages defined by the primitive regular expressions:

• For each x , the primitive regular expression x denotes the language {x}.
That is, the only string in the language is the string "x".
• The primitive regular expression denotes the language { }. The only
string in this language is the empty string.
• The primitive regular expression denotes the language {}. There are no
strings in this language.

Every primitive regular expression is a regular expression.

We can compose additional regular expressions by applying the following rules


a finite number of times:

• If r1 is a regular expression, then so is (r1).


• If r1 is a regular expression, then so is r1*.
• If If r1 and r2 are regular expressions, then so is r1r2.
• If If r1 and r2 are regular expressions, then so is r1+r2.

Here's what the above notation means:

• Parentheses are just used for grouping.


• The postfix star indicates zero or more repetitions of the preceding regular
expression. Thus, if x , then the regular expression x* denotes the
language { , x, xx, xxx, ...}.
• Juxtaposition of r1 and r2 indicates any string described by r1 immediately
followed by any string described by r2. For example, if x, y , then the
regular expression xy describes the language {xy}.
• The plus sign, read as "or," denotes the language containing strings
described by either of the component regular expressions. For example, if
x, y , then the regular expression x+y describes the language {x, y}.

Precedence: * binds most tightly, then justaposition, then +. For example, a+bc* denotes the
language {a, b, bc, bcc, bccc, bcccc, ...}.

Languages Defined by Regular Expressions


There is a simple correspondence between regular expressions and the languages
they denote:
Regular expression L(regular expression)
x, for each x {x}
{ }
{}
(r1) L(r1)
r1* (L(r1))*
r1 r2 L(r1) L(r2)
r1 + r2 L(r1) L(r2)

Building Regular Expressions


Here are some hints on building regular expressions. We will assume = {a, b, c}.
Zero or more.
a* means "zero or more a's." To say "zero or more ab's," that is, { , ab, abab,
ababab, ...}, you need to say (ab)*. Don't say ab*, because that denotes the
language {a, ab, abb, abbb, abbbb, ...}.
One or more.
Since a* means "zero or more a's", you can use aa* (or equivalently, a*a) to
mean "one or more a's." Similarly, to describe "one or more ab's," that is,
{ab, abab, ababab, ...}, you can use ab(ab)*.
Zero or one.
You can describe an optional a with (a+ ).
Any string at all.
To describe any string at all (with = {a, b, c}), you can use (a+b+c)*.
Any nonempty string.
This can be written as any character from followed by any string at all:
(a+b+c)(a+b+c)*.
Any string not containing....
To describe any string at all that doesn't contain an a (with = {a, b, c}),
you can use (b+c)*.
Any string containing exactly one...
To describe any string that contains exactly one a, put "any string not
containing an a," on either side of the a, like this: (b+c)*a(b+c)*.

Examples :

Give regular expressions for the following languages on = {a, b, c}.


All strings containing exactly one a.
(b+c)*a(b+c)*
All strings containing no more than three a's.
We can describe the string containing zero, one, two, or three a's (and
nothing else) as
( +a)( +a)( +a)

Now we want to allow arbitrary strings not containing a's at the places
marked by X's:
X( +a)X( +a)X( +a)X

so we put in (b+c)* for each X:


(b+c)*( +a)(b+c)*( +a)(b+c)*( +a)(b+c)*
All strings which contain at least one occurrence of each symbol in .
The problem here is that we cannot assume the symbols are in any
particular order. We have no way of saying "in any order", so we have to
list the possible orders:
abc+acb+bac+bca+cab+cba

To make it easier to see what's happening, let's put an X in every place we


want to allow an arbitrary string:
XaXbXcX + XaXcXbX + XbXaXcX + XbXcXaX + XcXaXbX + XcXbXaX

Finally, replacing the X's with (a+b+c)* gives the final (unwieldy) answer:
(a+b+c)*a(a+b+c)*b(a+b+c)*c(a+b+c)* +
(a+b+c)*a(a+b+c)*c(a+b+c)*b(a+b+c)* +
(a+b+c)*b(a+b+c)*a(a+b+c)*c(a+b+c)* +
(a+b+c)*b(a+b+c)*c(a+b+c)*a(a+b+c)* +
(a+b+c)*c(a+b+c)*a(a+b+c)*b(a+b+c)* +
(a+b+c)*c(a+b+c)*b(a+b+c)*a(a+b+c)*
All strings which contain no runs of a's of length greater than two.
We can fairly easily build an expression containing no a, one a, or one aa:
(b+c)*( +a+aa)(b+c)*

but if we want to repeat this, we need to be sure to have at least one non-a
between repetitions:
(b+c)*( +a+aa)(b+c)*((b+c)(b+c)*( +a+aa)(b+c)*)*
All strings in which all runs of a's have lengths that are multiples of three.
(aaa+b+c)*

You might also like