Draw out the expression tree representation of the following regular expresssion
Convert the regular expression from above into an ε-NFA (i.e. an NFA with ε-edges) using Thompson's algorithm.
Use the ε-elimination technique to remove the ε-edges from the previous ε-NFA.
Let DotList be a language such that:
No other strings are in the language
Write an unambiguous grammar that recognizes DotList