You have the following two tokens (t1 and t2) and their corresponding regular expressions. Token: t1:...

  

Transcribed Image Text:

You have the following two tokens (t1 and t2) and their corresponding regular expressions. Token: t1: t2: regular expression a (able)* a(b(ac)*)* In the above, alphabet is (a, b, c), *represents Kleene closure, and t1 has higher precedence than t2. Convert two regular expressions for t1 and t2 into two NFAs through the following two steps: 1. Build their own parse trees, and 2. Convert the parse tree into NFA using McNaughton-Yamada-Thompson algorithm. The NFA you construct must be precisely produced by the McNaughton-Yamada-Thompson algorithm-you are not allowed to omit any states or E-transitions no matter how unnecessary they may seem (especially for Kleene closure and union). You have the following two tokens (t1 and t2) and their corresponding regular expressions. Token: t1: t2: regular expression a (able)* a(b(ac)*)* In the above, alphabet is (a, b, c), *represents Kleene closure, and t1 has higher precedence than t2. Convert two regular expressions for t1 and t2 into two NFAs through the following two steps: 1. Build their own parse trees, and 2. Convert the parse tree into NFA using McNaughton-Yamada-Thompson algorithm. The NFA you construct must be precisely produced by the McNaughton-Yamada-Thompson algorithm-you are not allowed to omit any states or E-transitions no matter how unnecessary they may seem (especially for Kleene closure and union).