In the expressions, the dot operator is omitted and some parentheses are omitted, in which case the Kleene star operator (*) has the highest precedence, followed by the dot operator (.), followed by the or operator (|). Let getToken() be a function that returns the next token in the input. If we call it repeatedly it will return one token after another. When all the input is consumed, getToken() returns EOF (end of file). Assume that longest prefix-matching rule is used by getToken() and ties are broken in favor of the regular expression listed first.

Problem 1. Consider the following regular expressions Re-1| 2| 3 R1 1 | 2 1418 R2 -(a | b) (a* | b*) (a | b)