[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR,PDA,TM.",
    "exerciseType": "GRAMMAR",
    "totalTrueCases": 5,
    "totalFalseCases": 6,
    "containLetters": ["a", "b"],
    "randomStringLength": [0, 15],
    "description": "Construct a CFG over $\\{a, b\\}$ whose language is $\\{a^nb^m: m \\geq n, m - n \\mbox{ is odd}\\}$.",
    "testCases": [{
            "": false,
            "ShowTestCase":true
        },
        {
            "b": true,
            "ShowTestCase":true
        },
        {
            "bb": false,
            "ShowTestCase":true
        },
        {
            "bbb": true,
            "ShowTestCase":true
        },
        {
            "bbbbb": true,
            "ShowTestCase":true
        },
        {
            "aaaa": false,
            "ShowTestCase":true
        },
        {
            "aaab": false,
            "ShowTestCase":true
        },
        {
            "aaabbb": false,
            "ShowTestCase":true
        },
        {
            "aaabbbb": true,
            "ShowTestCase":true
        },
        {
            "aaabbbbbb": true,
            "ShowTestCase":true
        },
        {
            "aaabbbbb": false,
            "ShowTestCase":true
        }
    ],

    "graph": {
        "nodes": [],
        "edges": []
    },
    "solution": ""
}]