{"push_id":976492310,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"63df252d9654bd9965da8c653e1867af4e3b3a90","before":"3c904acb06d918d5a9387152dca3ec4cfc2fa743","commits":[{"sha":"63df252d9654bd9965da8c653e1867af4e3b3a90","author":{"email":"852b2c360fb4a2ddda67e04f9d2dde9dce311b46@gmail.com","name":"trizen"},"message":"- Added the Julia backend, which outputs Julia code from the AST of a Sidef program.\n\nCurrently, the Julia deparser is highly experimental and knows very few translations, one of which is the recursive Fibonacci function:\n\n\tfunc fib(n) {\n\t    n <= 1 ? n : fib(n-1)+fib(n-2)\n\t}\n\n\tsay fib(12)\n\nUsage:\n\tsidef -Rjulia script.sf","distinct":true,"url":"https://api.github.com/repos/trizen/sidef/commits/63df252d9654bd9965da8c653e1867af4e3b3a90"}]}