Consider a grammar :
G = ( { x , y ) , { s , x , y } , p , s)
where elements of parse :
S--> x y
S -->y x
x--> x z
x--> x
y--> y
z--> z
The language L generated by G most accurately is called
| A. | Chomsky type 0 |
| B. | Chomsky type 1 |
| C. | Chomsky type 2 |
| D. | Chomsky type 3 |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
