Homework answers / question archive / 1) (a) Let a context-free grammar is: A→A*A | A+A | m | (A) Using

1) (a) Let a context-free grammar is: A→A*A | A+A | m | (A) Using

Computer Science

Share With

---

1) (a) Let a context-free grammar is: A→A*A | A+A | m | (A) Using...

 

1. (a) Let a context-free grammar is:

A→A*A | A+A | m | (A)

Using the above grammar show that, (m+m*m) can be derived ambiguously.

(b) Design context free grammar for the following language:

L = {w|w contains set of all strings having at least four b's } where Σ={a,b}