[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "GRAMMAR",
  "totalTrueCases": 5,
  "totalFalseCases": 2,
  "containLetters": ["(", ")"],
  "randomStringLength": [0, 15],
  "description": "Write a grammar for the alphabet $\\Sigma = \\{(, )\\}$ and language $L =$ strings of parentheses that are properly nested and balanced.",
  "testCases": [
    {
      "": true
    },
    {
      "()": true,
      "ShowTestCase":true
    },
    {
      "()()": true,
      "ShowTestCase":true
    },
    {
      "(()())": true
    },
    {
      "(((((": false,
      "ShowTestCase":true
    },
    {
      "((())": false,
      "ShowTestCase":true
    },
    {
      "((()))": true,
      "ShowTestCase":true
    }
  ],
  "solution":
  [{
    "S": "(S)"
  },
   {
     "S": "SS"
   },
   {
     "S": ""
   }
  ]
}]