[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 3,
  "totalFalseCases": 3,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Write a grammar for the alphabet $\\Sigma = \\{a, b\\}$ and language $L = \\{a^nb^m \\mid n > 0, m \\geq n\\}$.",
  "testCases":
  [{
    "ab": true,
    "ShowTestCase":true
  },
   {
     "aaabbb": true,
     "ShowTestCase":true
   },
   {
     "bbbb": false,
     "ShowTestCase":true
   },
   {
     "abbbbbb": true,
     "ShowTestCase":true
   },
   {
     "aaaaaaab": false,
     "ShowTestCase":true
   },
   {
     "bab": false,
     "ShowTestCase":true
   }
  ],
  "solution":
  [{
    "S": "aAb"
  },
   {
     "A": "aAb"
   },
   {
     "A": ""
   },
   {
     "A": "Ab"
   }
  ]
}]