[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR,PDA,TM.",
    "exerciseType": "GRAMMAR",
    "totalTrueCases": 10,
    "totalFalseCases": 4,
    "containLetters": ["a", "b"],
    "randomStringLength": [0, 10],
    "description": "Construct a CFG over {a,b} whose language is the strings with the same number of a’s and b’s.",
    "testCases": [{
            "": true,
            "ShowTestCase":true
        },
        {
            "ab": true,
            "ShowTestCase":true
        },
        {
            "ba": true,
            "ShowTestCase":true
        },
        {
            "aabb": true,
            "ShowTestCase":true
        },
        {
            "bbaa": true,
            "ShowTestCase":true
        },
        {
            "abba": true,
            "ShowTestCase":true
        },
        {
            "abab": true,
            "ShowTestCase":true
        },
        {
            "baab": true,
            "ShowTestCase":true
        },
        {
            "ababa": false,
            "ShowTestCase":true
        },
        {
            "bbbbbaaa": false,
            "ShowTestCase":true
        },
        {
            "baababa": false,
            "ShowTestCase":true
        },
        {
            "abbaaabb": true,
            "ShowTestCase":true
        },
        {
            "abbab": false,
            "ShowTestCase":true
        },
        {
            "aaabbbab": true,
            "ShowTestCase":true
        }
    ],
    "graph": {
        "nodes": [],
        "edges": []
    },
    "solution": ""
}]