Computer Science Fundamentals
Algorithms
Objective
Mar 05, 2013
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
Detailed Explanation
Option d is right answer.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts