Describing ambiguous grammar and pushdown automata


1. Explain a context free grammar and what is language produced by CFG or G?

2. What do you mean by: (a) CFL (b) Sentential form.

3. What is the language produced by grammar G=(V,T,P,S) where P={S->aSb, S->ab}?

4. If S->aSb | aAb , A->bAa , A->ba. Determine the CFL.

5. What do you mean by ambiguous grammar?

6. Create a grammar for language L that has all the strings which are all palindrome over Σ={a, b}.

7. What do you mean by Pushdown Automata?

8. Write down the various kinds of language acceptances by a PDA and explain them.

9. What do you mean by Deterministic PDA?

10. Describe Instantaneous description(ID) in PDA in detail.

Request for Solution File

Ask an Expert for Answer!!
Theory of Computation: Describing ambiguous grammar and pushdown automata
Reference No:- TGS011532

Expected delivery within 24 Hours