[{
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 5,
  "totalFalseCases": 2,
  "containLetters": ["(", ")"],
  "randomStringLength": [0, 15],
  "description": "Write a grammar for the following alphabet and language: $\\Sigma = \\{a, b\\}, \\quad L =$ strings that are palendromes (they read the same forward or backwards)",
  "testCases": [
    {
      "": true
    },
    {
      "a": true,
      "ShowTestCase":true
    },
    {
      "aba": true,
      "ShowTestCase":true
    },
    {
      "abba": true
    },
    {
      "baba": false,
      "ShowTestCase":true
    },
    {
      "babaab": false,
      "ShowTestCase":true
    },
    {
      "baaab": true,
      "ShowTestCase":true
    }
  ],
  "solution":
  [{
    "S": "a"
  },
   {
    "S": "b"
  },
   {
     "S": "aSa"
   },
   {
     "S": "bSb"
   },
   {
     "S": ""
   }
  ]
}]