[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR,PDA,TM.",
    "exerciseType": "GRAMMAR",
    "totalTrueCases": 6,
    "totalFalseCases": 5,
    "containLetters": ["a", "b", "c"],
    "randomStringLength": [0, 15],
    "expression": "",
    "description": "Construct a CFG over {a, b, c} whose language is {$a^mb^ic^n \\mid m > n, 0 \\leq i < 3,  n \\geq 0$}",
    "testCases": [{
            "": false,
            "ShowTestCase":true
        },
        {
            "bb": false,
            "ShowTestCase":true
        },
        {
            "a": true,
            "ShowTestCase":true
        },
        {
            "ab": true,
            "ShowTestCase":true
        },
        {
            "abb": true,
            "ShowTestCase":true
        },
        {
            "abbb": false,
            "ShowTestCase":true
        },
        {
            "abbc": false,
            "ShowTestCase":true
        },
        {
            "aabbc": true,
            "ShowTestCase":true
        },
        {
            "aaaaccc": true,
            "ShowTestCase":true
        },
        {
            "aaaaa": true,
            "ShowTestCase":true
        },
        {
            "aaabbccc": false,
            "ShowTestCase":true
        }
    ],
    "graph": {
        "nodes": [],
        "edges": []
    },
    "solution": ""
}]