[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 5,
  "totalFalseCases": 4,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a left-linear grammar for the language L($bbb^*aaaa^*$).",
  "testCases": [
    {
      "left-linear": true,
      "ShowTestCase":true
    },
    {
      "": false,
      "ShowTestCase":true
    },
    {
      "bbbbb": false,
      "ShowTestCase":true
    },
    {
      "aaaa": false,
      "ShowTestCase":true
    },
    {
      "bbaa": false,
      "ShowTestCase":true
    },
    {
      "bbbbbaaa": true,
      "ShowTestCase":true
    },
    {
      "bbaaa": true,
      "ShowTestCase":true
    },
    {
      "bbbbbbbbbbbaaa": true,
      "ShowTestCase":true
    },
    {
      "bbaaaaaa": true,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "bbb*aaaa*"
}]