{"push_id":1455691514,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"85df0a8700009d34b233a17c3ad81889fd18e02d","before":"6c68c8c2f87b06da6586db77a216845caf3c17bd","commits":[{"sha":"85df0a8700009d34b233a17c3ad81889fd18e02d","author":{"name":"maaron","email":"e9d8f3755e73f5dd4bc1bac2efe44dc8d24dbb23@yahoo.com"},"message":"This problem is kicking my butt, but the next attempt is to factor out an algorithm to start with all empty AST types and \"mark\" the non-empty ones recursively (and avoiding cycles).  I think the algorithm to generate a parser combinator and AST type definition doesn't have to deal with cycles.","distinct":true,"url":"https://api.github.com/repos/maaron/asn1parser/commits/85df0a8700009d34b233a17c3ad81889fd18e02d"}]}
{"actor":{"display_login":"maaron"}}