Q1: What do Compilers do? Q2: What other programs may be required to create an executable target program? Q3: Draw the program build cycle. Q4: Draw the compilar structure and define each element on it. Q5: Define the regular expression Q6: What are the languages described by each RE 1. L(((aa)b)b) 2. L((((ab)ab)((ab)ba))(ba)) 3. L((ab)) 4. L((ab)+) 5. L(ab(ab)ab) Q7: Consider the following Language L=={a,b}. Regex =(ab). Write a regular expression of a language where: 1. All strings that start and end with the same letter 2. All strings that start with a and ends with bb 3. All strings that ends with abb or just a 4. All strings that contain a single a 5. All Strings that start and ends with different letters Q8: Define FSA, NFA, and DFA Q9: Find the NFA tree of the following RE 1. L((ab)ab) 2. L(baba) 3. L(a+abba ? ) 4. L(b(a+b)a) 5. L((ab) aa (ab)) Q10: Convert the NFA trees in point 1 , and 2 to a DFA