{"push_id":798088772,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3ddd9eed6f765dbddbb2cac82d5d43ed071ef027","before":"3df6c6b3318ff5bb9e097003d332d06c8004ad8d","commits":[{"sha":"3ddd9eed6f765dbddbb2cac82d5d43ed071ef027","author":{"email":"9ac2907b163c1922684cadd0b600a8d457468863@nicta.com.au","name":"Ramana Kumar"},"message":"finish ptree_sexp\n\nOf course (as I realised later) the PEG does not produce a parse tree\nanyway, but if one were to write a PEG that produces a parse tree, these\nconversions functions should be useful.","distinct":true,"url":"https://api.github.com/repos/HOL-Theorem-Prover/HOL/commits/3ddd9eed6f765dbddbb2cac82d5d43ed071ef027"}]}