1) Design a NFA for a*|b*.

2) What do you understand by Handle Pruning?

3) describe LR (0) items.

4) What do you understand by viable prefixes?

5) What do you understand by handle?

6) prepare down the algebraic properties of regular expressions?

7) What do you mean by finite automata?

8) prepare down the goals of error handler in a parser?

9) What is an ambiguous grammar? Give suitable ex.

10) What do you mean by phrase level error recovery?

11) prepare down the disadvantages of operator precedence parsing?

12) What do you mean by a predictive parser?

13) Remove left recursion from the following grammar
A->Ac/Aad/bd/c.

14) What do you mean by LL (1) grammar? prepare down the properties of LL (1) grammar.

15) prepare down the algorithm for Left Factoring a Grammar.