Subject: COMPILERS AND TRANSLATOR

3. What is the relationship between input stream of characters and tokens? (5 Marks) 4. Describe the rule or informal language accepted by the following finite automaton. (5 marks) a a.b so S2 b 5. Briefly describe the compilation process of a typical compiler with its schematics. (10 marks) 6. Construct a DFA for the Identifier in C language and build the corresponding table for a table- drivenimplementation. (10 marks) 7. Consider the regular expression (ab | ac) * (20 marks) a) Show the steps that an automated scanner generator might take with the same RE i. Use Thompson's construction to construct an NFA. (10 Marks) ii. Use the subset construction to convert this NFA to a DFA. (10 Marks) 8. Write a regular expression of an identifier, whose rule states that an alphabetic character is followed byan alphanumeric character, which allows few special characters such as underscore (), percentage sign (%) or the ampersand (&). (10 marks) 9. Consider the following code fragment. It shows a simple c++ programming language undertakingsummation of numbers between a particular range of numbers. (20 Marks) int FindSum (int a, int b, int N) { int i; int x,y; x = 0; y = 0; for (i = 0; i