Known L (G)={^ ^ m * b * c L ^ m * a * b ^ ^ n n | l>=1, n>=2, m>=0}
the grammar1. See an answer analysis is such (figure 1)
Want to know this language string ABC index can be together again analysis 2. In addition their answer in figure 2 want to consult this answer correct?