{"push_id":734142542,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"68a0fae6fd1983285f6bee54d1ac1b44e4e74043","before":"70d6c1de0b0a63e42bb1116b7caceff8ad9d82bd","commits":[{"sha":"68a0fae6fd1983285f6bee54d1ac1b44e4e74043","author":{"email":"76d2562e400030e7705667e2b52574b4d60f75b5@cisco.com","name":"kstraver"},"message":"Work on the basic ast.\n\nRecursive functions will have to be defined for the\noperations that are to be performed on the ast.\n\nFirst and foremost, the grammar ought to stabilize.\nWithout a stable grammar, we have a shaky semantic\nanalyzer. By that I mean that the grammar must be\ncomplete and no more changes ought to be brought to\nthe grammar.","distinct":true,"url":"https://api.github.com/repos/BourgondAries/Unnamed-Language/commits/68a0fae6fd1983285f6bee54d1ac1b44e4e74043"}]}