1
|
BlockStmt([CommentStmt('Approximates the value of Pi using the Monte-Carlo algorithm'), AssignStmt(IdentifierNode('sum'), NumberNode(0)), AssignStmt(IdentifierNode('steps'), NumberNode(10000)), ForStmt('i', NumberNode(1), IdentifierNode('steps'), [AssignStmt(IdentifierNode('x'), CallNode(IdentifierNode('random'), [])), AssignStmt(IdentifierNode('y'), CallNode(IdentifierNode('random'), [])), IfStmt(BinOpNode(BinOpNode(BinOpNode(IdentifierNode('x'), IdentifierNode('x'), '*'), BinOpNode(IdentifierNode('y'), IdentifierNode('y'), '*'), '+'), NumberNode(1), '<'), [AssignStmt(IdentifierNode('sum'), BinOpNode(IdentifierNode('sum'), NumberNode(1), '+'))])], None), AssignStmt(IdentifierNode('approx_pi'), BinOpNode(BinOpNode(NumberNode(4), IdentifierNode('sum'), '*'), IdentifierNode('steps'), '/')), DisplayStmt(BinOpNode(StringNode('Pi ~= '), IdentifierNode('approx_pi'), '+'))])
|