The two grammars given below generate a language over the alphabet {x, y, z}…
GATE · 2007 · IT
The two grammars given below generate a language over the alphabet {x, y, z}
Which one of the following choices describes the properties satisfied by the strings in these languages?
- A.
G1 : No y appears before any x
G2 : Every x is followed by at least one y - B.
G1 : No y appears before any x
G2 : No x appears before any y - C.
G1 : No y appears after any x
G2 : Every x is followed by at least one y - D.
G1 : No y appears after any x
G2 : Every y is followed by at least one x
Attempted by 76 students.
Sign up free to check your answer
Sign up freeLoading lesson…