Exercises 01
Exercise 1
Write a regular expression for binary numbers greater than 101.
Exercise 2
Write a regular expression for strings over the alphabet {a,b,c} that don't contain the continuous substring baa.
Exercise 3
Constructing a lexer's DFA. See Tiger Book, Chapter 2.4