Design an algorithm to recognize Lex-lookahead patterns of the form ri/r 2 , where r\ and r 2 are regular expressions. Show how your algorithm works on the following inputs: a) (abcd\abc)jd  b)...

Design an algorithm to recognize Lex-lookahead patterns of the form ri/r 2 , where r\ and r 2 are regular expressions. Show how your algorithm works on the following inputs:


a) (abcd\abc)jd

b) (a\ab)/ba

c) aa * j a*

Construct the minimum-state DFA's for the following regular expressions:


a) (a|b)*a(a|b).

b) (a|b)*a(a|b)(a|b).

c) (a|b)*a(a|b)(a|b)(a|b).

Do you see a pattern?