1. Explain the different phases of a compiler, with an example. (09 Marks) (Dec.2019/Jan.2020)

2. what is input buffering in lexical analysis? List the different methods of input buffering explain any one of them. (07 Marks) (Dec.2019/Jan.2020)

---

---

3. List and explain the reasons for separating the

4. analysis portion of a compiler into lexical and syntax analysis phases. (06 Marks) (Dec.2019/Jan.2020)

5. Construct the transition diagram to recognize the tokens of

i) Identifier

ii) Relational operators

iii) Unsigned numbers. (06 Marks) (Dec.2019/Jan.2020)

6. Define Tokens, patterns, lexemes.(04 Marks) (Dec.2019/Jan.2020)

7. With the help of a diagram, explain the various phases of complier. (08 Marks) (June/July 2019)

8. Explain the concept of input buffering in the lexical analysis. (04 Marks) (June/July 2019)

---

---

9. What design objectives, complier optimizations must meet. (04 Marks) (June/July 2019)

10. Write a LEX program for the tokens given below:

LEXEMES	TOKEN NAME	ATTRIBUTE VALUE
Any WS	-	-
if	if	-
then	then	-
else	else	-
Any id	id	ptr to table entry
Any number	number	ptr to table entry
<	reloop	LT
< =	reloop	LE
=	reloop	EQ
< >	reloop	NE
>	reloop	GT
> =	reloop	GE

(08 Marks) (June/July 2019)

11. Write regular definitions for unsigned numbers and draw the transition diagram for the same. (08 Marks) (June/July 2019)

---

---

12. List and explain the various phases of a compiler and show the output of each phase for the expression a:=b+c * 25 (08 Marks) (Dec.2018/Jan.2019)

13. Construct transition diagram for recognizing relational operators. Sketch the program segment to implement it. showing the first state and one in final state. (08 Marks) (Dec.2018/Jan.2019)

14. Explain input buffering strategy used in lexical analysis phase. (6 Marks) (Dec.2018/Jan.2019)

15. Write the regular definition for unsigned number, also write the transition diagram. (06 Marks) (Dec.2018/Jan.2019)

---

---

16. Construct the transition diagrams for a set of keywords like begin, end, if then and else and identifiers and constants along with a minimum set of relational operators. (04 Marks) (Dec.2018/Jan.2019)

17. What is compiler? Explain various phases of compiler with help of neat diagram. (10 Marks) (June/July 2018)

18. Explain the concept of input buffering in the lexical analysis. (06 Marks) (June/July 2018)

---

---

19. Construct the transition diagram to recognize the tokens given below:

i) Identifier

ii) Relational operator

iii) Unsigned number. (08 Marks) (June/July 2018)

---

---

20. Create a lexical analyser with Lex and explain the structure of Lex programs. (08 Marks) (June/July 2018)