1

Regular Expression to Automata

Compiler Design - Regular Expressions
➢The language accepted by finite automata can be easily described by simple
expressions called Regular Expressions. It is the most effective way to
represent any language.
➢The languages accepted by some regular expression are referred to as Regular
languages.
➢A regular expression can also be described as a sequence of pattern that
defines a string.
➢Regular Expressions are used for representing certain sets of strings in an
algebraic fashion.
➢Regular expressions are used to match character combinations in strings.
String searching algorithm used this pattern to fin the operations on a string.
Regular Expression are used for representing certain sets of strings in an algebraic fashion

➢Any terminal symbol i.e. symbols ∈ Σ including ^ and ∅ are regular expressions.
a,b,c , ……….^ ,∅

➢The union of two regular expressions is also a regular expression.

R1, R2 (R1+R2) (Union)

➢The concatenation of two regular expressions is also a regular expression.

R1, R2→ (R1.R2)

➢The iteration(or closure) of a regular expression is also a regular expression. R → R*

a* = ^ ,a,aa,aaa,…
➢The regular expression over Σ are precisely those obtained recursively by the application of the
above rules once or several times.