File: adv_babylonian.tr

package info (click to toggle)
turing 0.11-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 10,340 kB
  • sloc: python: 106,582; xml: 101; makefile: 53; sh: 29
file content (1 line) | stat: -rw-r--r-- 1,035 bytes parent folder | download | duplicates (4) 
1
 
BlockStmt([CommentStmt('Finds the square root of a number using the Babylonian algorithm'), InputStmt(IdentifierNode('a'), None), AssignStmt(IdentifierNode('x'), NumberNode(1)), AssignStmt(IdentifierNode('y'), IdentifierNode('a')), AssignStmt(IdentifierNode('prec'), NumberNode(1e-08)), WhileStmt(BinOpNode(CallNode(IdentifierNode('abs'), [BinOpNode(IdentifierNode('y'), IdentifierNode('x'), '-')]), IdentifierNode('prec'), '>'), [AssignStmt(IdentifierNode('x'), BinOpNode(BinOpNode(IdentifierNode('x'), IdentifierNode('y'), '+'), NumberNode(2), '/')), AssignStmt(IdentifierNode('y'), BinOpNode(IdentifierNode('a'), IdentifierNode('x'), '/'))]), DisplayStmt(CallNode(IdentifierNode('round'), [CallNode(IdentifierNode('min'), [ListNode([IdentifierNode('x'), IdentifierNode('y')])]), IdentifierNode('prec')]), False), DisplayStmt(StringNode(' ≤ √a ≤ '), False), DisplayStmt(CallNode(IdentifierNode('round'), [CallNode(IdentifierNode('max'), [ListNode([IdentifierNode('x'), IdentifierNode('y')])]), IdentifierNode('prec')]), True)])