[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 6,
  "totalFalseCases": 3,
  "containLetters": ["a", "b", "c"],
  "randomStringLength": [0, 15],
  "description": "Find a regular grammar for the language L $= \\{a^nb^m\\ \\mbox{where}\\ n + m\\ \\mbox{is odd\\}$.",
  "testCases": [
    {
      "regular-grammar": true,
      "ShowTestCase":true
    },
    {
      "": false,
      "ShowTestCase":true
    },
    {
      "a": true,
      "ShowTestCase":true
    },
    {
      "b": true,
      "ShowTestCase":true
    },
    {
      "aab": true,
      "ShowTestCase":true
    },
    {
      "abb": true,
      "ShowTestCase":true
    },
    {
      "aabb": false,
      "ShowTestCase":true
    },
    {
      "aaaaaabbbbb": true,
      "ShowTestCase":true
    },
    {
      "ba": false,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]