Quote: used Ackermann's function to compare code generators; Bliss/11 did as well as assembly code

Note

shows code comparisons on a variety of machines, the best language processor is optimized Bliss/11 taking 32 bytes and 7.5 instr/call--this is the same as the assembler version ... [p.318] Ackermann function: integer procedure ackermann (m,n); value m,n; integer m,n: Ackermann := if m=0 then n+1 else if n=0 then ackermann (m-1,1) else ackermann (m-1.ackermann (m.n-1)):

Related Topics

Topic: code optimization (54 items)