Context free lang47

0. 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

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *