[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 6,
  "totalFalseCases": 3,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a left-linear grammar for the language L($(aaab^*ba)^*$).",
  "testCases": [
    {
      "left-linear": true,
      "ShowTestCase":true
    },
    {
      "": true,
      "ShowTestCase":true
    },
    {
      "aaaba": true,
      "ShowTestCase":true
    },
    {
      "aaabbbbba": true,
      "ShowTestCase":true
    },
    {
      "aaabaaaabaaaabaaaaba": true,
      "ShowTestCase":true
    },
    {
      "aaabbbbbaaaabbbbba": true,
      "ShowTestCase":true
    },
    {
      "ba": false,
      "ShowTestCase":true
    },
    {
      "aaabaaabba": false,
      "ShowTestCase":true
    },
    {
      "aaaaaa": false,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]