Describe (in simple English) the set of strings that this grammar describes:

Here is the grammar:

S→XY

X→x

Y→Y y

Y→y

Here is the answer I've come up with:

The language that accepts anything withxand more than oneyAnd here is the example I put in as well:

1. TheSis replaced withXY(by rule 1). So then we’re left withXY.

2. TheXinXYturns intoxby rule 2. This leavesxY.

3. TheYinXYbecomesYyby rule 3. This leaves us withxYy.

4. TheYinYyis replaced withyby rule 4 which leaves us withyy. So now we havexyy