question theory of automata from Mishra CHAPTER 6

 question theory of automata from Mishra CHAPTER 6

1. Construct a context-free grammar G generating all integers (with sign).

2. DERIVATION TREES

3. leftmost derivation and rightmost derivation.

4. AMBIGUITY IN CONTEXT-FREE GRAMMARS

5. If G is the grammar S -> SbS | a, show that G is ambiguous.

6. CONSTRUCTION OF REDUCED GRAMMARS.

7. ELIMINATION OF NULL PRODUCTIONS

8. ELIMINATION OF UNIT PRODUCTIONS

9. CHOMSKY NORMAL FORM

10. GREIBACH NORMAL FORM