cmsc 330: organization of programming languages · 4 a few questions about res how are res...
TRANSCRIPT
![Page 1: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/1.jpg)
CMSC 330: Organization of Programming Languages
Regular Expressions and Finite Automata
1CMSC330 Spring 2018
![Page 2: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/2.jpg)
2
How do regular expressions work?
What we’ve learned• What regular expressions are• What they can express, and cannot• Programming with them
What’s next: how they work• A great computer science result
![Page 3: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/3.jpg)
4
A Few Questions About REs
How are REs implemented?• Implementing a one-off RE is not so hard
Ø How to do it in general?
What are the basic components of REs?• Can implement some features in terms of others
Ø E.g., e+ is the same as ee*
What does a regular expression represent?• Just a set of strings
Ø This observation provides insight on how we go about our implementation
… next comes the math !
![Page 4: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/4.jpg)
5
Definition: Alphabet
An alphabet is a finite set of symbols• Usually denoted Σ
Example alphabets:• Binary:
• Decimal:
• Alphanumeric:
Σ = {0,1}
Σ = {0,1,2,3,4,5,6,7,8,9}
Σ = {0-9,a-z,A-Z}
![Page 5: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/5.jpg)
6
Definition: String
A string is a finite sequence of symbols from Σ• ε is the empty string ("" in Ruby)• |s| is the length of string s
Ø |Hello| = 5, |ε| = 0
• NoteØ Ø is the empty set (with 0 elements)Ø Ø ≠ { ε } ≠ ε
Example strings over alphabet Σ = {0,1} (binary):• 0101• 0101110• ε
![Page 6: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/6.jpg)
7
Definition: String concatenation
String concatenation is indicated by juxtaposition
s1 = super s2 = hero
•Sometimes also written s1·s2
For any string s, we have sε = εs = s• You can concatenate strings from different alphabets;
then the new alphabet is the union of the originals: Ø If s1 = super from Σ1 = {s,u,p,e,r} and s2 = hero from Σ2 =
{h,e,r,o}, then s1s2 = superhero from Σ3 = {e,h,o,p,r,s,u}
s1s2 = superhero
![Page 7: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/7.jpg)
8
Definition: LanguageA language L is a set of strings over an alphabet
Example: All strings of length 1 or 2 over alphabet Σ = {a, b, c} that begin with a• L = { a, aa, ab, ac }
Example: All strings over Σ = {a, b}• L = { ε, a, b, aa, bb, ab, ba, aaa, bba, aba, baa, … }• Language of all strings written Σ*
Example: All strings of length 0 over alphabet Σ• L = { s | s ∊ Σ* and |s| = 0 } “the set of strings s such that s is from Σ* and has length 0”
= {ε} ≠ Ø
![Page 8: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/8.jpg)
9
Definition: Language (cont.)Example: The set of phone numbers over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 9, (, ), -}• Give an example element of this language• Are all strings over the alphabet in the language?• Is there a Ruby regular expression for this language?
Example: The set of all valid Ruby programs• Later we’ll see how we can specify this language• (Regular expressions are useful, but not sufficient)
/\(\d{3,3}\)\d{3,3}-\d{4,4}/
No
(123)456-7890
![Page 9: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/9.jpg)
10
Operations on Languages
Let Σ be an alphabet and let L, L1, L2 be languages over Σ
Concatenation L1L2 is defined as• L1L2 = { xy | x ∊ L1 and y ∊ L2}
Union is defined as• L1 ∪ L2 = { x | x ∊ L1 or x ∊ L2}
Kleene closure is defined as• L* = { x | x = ε or x ∊ L or x ∊ LL or x ∊ LLL or …}
![Page 10: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/10.jpg)
Quiz 1: Which string is not in L3
A. aB. abdC.εD.d
L1 = {a, ab, c, d, ε} where Σ = {a,b,c,d}L2 = {d}L3 = L1 ∪ L2
11
![Page 11: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/11.jpg)
Quiz 1: Which string is not in L3
A. aB. abdC.εD.d
L1 = {a, ab, c, d, ε} where Σ = {a,b,c,d}L2 = {d}L3 = L1 ∪ L2
12
![Page 12: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/12.jpg)
Quiz 2: Which string is not in L3
A. aB. abdC.adadD.abdd
L1 = {a, ab, c, d, ε} where Σ = {a,b,c,d}L2 = {d}L3 = L1L2*
13
![Page 13: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/13.jpg)
Quiz 2: Which string is not in L3
A. aB. abdC.adadD.abdd
L1 = {a, ab, c, d, ε} where Σ = {a,b,c,d}L2 = {d}L3 = L1L2*
14
![Page 14: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/14.jpg)
15
Regular Expressions: Grammar
Similarly to how we expressed Micro-OCaml we can define a grammar for regular expressions R
R ::= Ø The empty language
| ε The empty string| σ A symbol from alphabet Σ| R1R2 The concatenation of two regexps| R1|R2 The union of two regexps| R* The Kleene closure of a regexp
![Page 15: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/15.jpg)
16
Regular Languages
Regular expressions denote languages. These are the regular languages• aka regular sets
Not all languages are regular• Examples (without proof):
Ø The set of palindromes over Σ
Ø {anbn | n > 0 } (an = sequence of n a�s)
Almost all programming languages are not regular• But aspects of them sometimes are (e.g., identifiers)
• Regular expressions are commonly used in parsing tools
![Page 16: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/16.jpg)
17
Semantics: Regular Expressions (1)
Given an alphabet Σ, the regular expressionsover Σ are defined inductively as follows
regular expression denotes languageØ Øε {ε}each symbol σ ∊ Σ {σ}
Constants
![Page 17: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/17.jpg)
18
Semantics: Regular Expressions (2)
Let A and B be regular expressions denoting languages LA and LB, respectively. Then:
There are no other regular expressions over Σ
regular expression denotes languageAB LALB
A|B LA ∪ LB
A* LA*
Operations
![Page 18: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/18.jpg)
19
Terminology etc.
Regexps apply operations to symbols• Generates a set of strings (i.e., a language)
Ø (Formal definition shortly)
• ExamplesØ a → {a}Ø a|b → {a} ∪ {b} = {a, b}Ø a* → {ε} ∪ {a} ∪ {aa} ∪… = {ε, a, aa, … }
If s ∊ language L generated by a RE r, we say that r accepts, describes, or recognizes string s
![Page 19: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/19.jpg)
20
Precedence
Order in which operators are applied is:• Kleene closure * > concatenation > union |• ab|c = ( a b ) | c → {ab, c}• ab* = a ( b* ) → {a, ab, abb …}• a|b* = a | ( b* ) → {a, ε, b, bb, bbb …}
We use parentheses ( ) to clarify• E.g., a(b|c), (ab)*, (a|b)*• Using escaped \( if parens are in the alphabet
![Page 20: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/20.jpg)
21
Ruby Regular Expressions
Almost all of the features we’ve seen for Ruby REs can be reduced to this formal definition• /Ruby/ – concatenation of single-symbol REs• /(Ruby|Regular)/ – union• /(Ruby)*/ – Kleene closure• /(Ruby)+/ – same as (Ruby)(Ruby)*• /(Ruby)?/ – same as (ε|(Ruby)) (// is ε)• /[a-z]/ – same as (a|b|c|...|z)• / [^0-9]/ – same as (a|b|c|...) for a,b,c,... ∈ Σ - {0..9}• ^, $ – correspond to extra symbols in alphabet
![Page 21: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/21.jpg)
22
Implementing Regular Expressions
We can implement a regular expression by turning it into a finite automaton• A �machine� for recognizing a regular language
�String�
�String�
�String�
�String�
�String�
�String�Yes
No
![Page 22: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/22.jpg)
23
Finite Automaton
Elements• States S
(start, final)• Alphabet Σ• Transition
edges δ
![Page 23: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/23.jpg)
24
Finite Automaton
Machine starts in start or initial stateRepeat until the end of the string s is reached• Scan the next symbol σ ∈ Σ of the string s• Take transition edge labeled with σ
String s is accepted if automaton is in finalstate when end of string s is reached
States
Start state Final state
Transition on 1
Elements• States S
(start, final)• Alphabet Σ• Transition
edges δ
![Page 24: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/24.jpg)
25
Finite Automaton: States
Start state• State with incoming transition from no other state• Can have only one start state
Final states• States with double circle• Can have zero or more final states• Any state, including the start state, can be final
S1 S2
![Page 25: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/25.jpg)
26
Finite Automaton: Example 1
0 0 1 0 1 1Accepted?
Yes
![Page 26: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/26.jpg)
27
Finite Automaton: Example 2
0 0 1 0 1 0Accepted?
No
![Page 27: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/27.jpg)
28
Quiz 3: What Language is This?
A. All strings over {0, 1} B. All strings over {1}C. All strings over {0, 1} of length 1 D. All strings over {0, 1} that end in 1
![Page 28: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/28.jpg)
29
Quiz 3: What Language is This?
A. All strings over {0, 1} B. All strings over {1}C. All strings over {0, 1} of length 1 D. All strings over {0, 1} that end in 1
regular expression for this language is (0|1)*1
![Page 29: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/29.jpg)
30
Finite Automaton: Example 3
(a,b,c notation shorthand for three self loops)
accepts?
state at end
string
aabcc
![Page 30: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/30.jpg)
31
Finite Automaton: Example 3
(a,b,c notation shorthand for three self loops)
YS2aabcc
accepts?
state at end
string
![Page 31: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/31.jpg)
32
Finite Automaton: Example 3
(a,b,c notation shorthand for three self loops)
accepts?
state at end
string
acca
![Page 32: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/32.jpg)
33
Finite Automaton: Example 3
(a,b,c notation shorthand for three self loops)
accepts?
state at end
string
NS3acca
![Page 33: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/33.jpg)
40
Quiz 4: Which string is not accepted?
(a,b,c notation shorthand for three self loops)
A. bccaB. abbbcC. cccD. ε
![Page 34: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/34.jpg)
41
Quiz 4: Which string is not accepted?
(a,b,c notation shorthand for three self loops)
A. bccaB. abbbcC. cccD. ε
![Page 35: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/35.jpg)
42
Finite Automaton: Example 3
What language does this FA accept?
a*b*c*
S3 is a dead state –a nonfinal state with no transition to another state
![Page 36: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/36.jpg)
43
Finite Automaton: Example 4
a*b*c* again, so FAs are not uniqueLanguage?
![Page 37: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/37.jpg)
44
Dead State: Shorthand Notation
If a transition is omitted, assume it goes to a dead state that is not shown
Language?• Strings over {0,1,2,3} with alternating even
and odd digits, beginning with odd digit
is short for
![Page 38: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/38.jpg)
Finite Automaton: Example 5
Description for each state• S0 = �Haven't seen anything yet� OR �Last
symbol seen was a b�• S1 = �Last symbol seen was an a�• S2 = �Last two symbols seen were ab�• S3 = �Last three symbols seen were abb�
45
![Page 39: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/39.jpg)
Finite Automaton: Example 5
Language as a regular expression?(a|b)*abb
46
![Page 40: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/40.jpg)
Quiz 5
47
Over Σ={a,b}, this FA accepts only:
0
ba
a 0
1
A. A string that contains a single a.B. Any string in {a,b}.C. A string that starts with b followed by a’s.D. Zero or more b’s, followed by one or more a’s.
![Page 41: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/41.jpg)
Quiz 5
48
Over Σ={a,b}, this FA accepts only:
0
ba
a 0
1
A. A string that contains a single a.B. Any string in {a,b}.C. A string that starts with b followed by a’s.D. Zero or more b’s, followed by one or more a’s.
![Page 42: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/42.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing two consecutive 0s followed by two consecutive 1sThat accepts strings with an odd number of 1sThat accepts strings containing an even number of 0s and any number of 1sThat accepts strings containing an odd number of 0s and odd number of 1sThat accepts strings that DO NOT contain odd number of 0s and an odd number of 1s
49
![Page 43: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/43.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings with an odd number of 1s
50
![Page 44: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/44.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings with an odd number of 1s
51
![Page 45: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/45.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing an even number of 0s and any number of 1s
52
![Page 46: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/46.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing an even number of 0s and any number of 1s
53
![Page 47: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/47.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing two consecutive 0s followed by two consecutive 1s
54
![Page 48: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/48.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing two consecutive 0s followed by two consecutive 1s
55
![Page 49: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/49.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings end with two consecutive 0s followed by two consecutive 1s
56
![Page 50: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/50.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings end with two consecutive 0s followed by two consecutive 1s
57
![Page 51: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/51.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing an odd number of 0s and odd number of 1s
58
![Page 52: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/52.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings containing an odd number of 0s and odd number of 1s
59
4 states:
0s 1se eo ee oo o
![Page 53: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/53.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings that DO NOT contain odd number of 0s and an odd number of 1s
60
![Page 54: CMSC 330: Organization of Programming Languages · 4 A Few Questions About REs How are REs implemented? •Implementing a one-off RE is not so hard ØHow to do it in general? What](https://reader030.vdocuments.us/reader030/viewer/2022040904/5e76f0c00e8f1e258d4603f9/html5/thumbnails/54.jpg)
Exercises: Define an FA over Σ = {0,1}
That accepts strings that DO NOT contain odd number of 0s and an odd number of 1s
61
Flip each state