Changeset 35392 in project


Ignore:
Timestamp:
04/16/18 02:32:56 (5 months ago)
Author:
svnwiki
Message:

Anonymous wiki edit for IP [120.151.231.140]: Minor edits to grammar.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • wiki/chicken-compilation-process

    r24219 r35392  
    2828proportional to the amount of live data on the stack.
    2929
    30 Allocation can be extremely fast in the scheme, as we basically can
     30Allocation can be extremely fast as we basically can
    3131use the machine's stack-pointer as a dedicated allocation pointer
    3232register. Another advantage is that through the CPS conversion
     
    279279
    280280Optimization is now performed, iteratively until the program is stable:
    281 Two occurrences of {{not}} have been removed by exchanging the branches
     281two occurrences of {{not}} have been removed by exchanging the branches
    282282of the conditional operator ({{if}}).
    283283
     
    414414
    415415Next round. This time {{k141}}, {{k147}} and {{dec-to1}} have been
    416 ''contracted'', which means inlining of procedures called only once
     416''contracted'', which means inlining procedures that are called only once
    417417(an optimization that guarantees the program will not grow). Some
    418418variables and bindings have been removed as they are unnecessary:
     
    760760=== Closure conversion
    761761
    762 Now procedures are transformed into explicit creation- and
     762Now procedures are transformed into explicit creation and
    763763access code for closures:
    764764
     
    988988</enscript>
    989989
    990 Here the ''trampolines'' are declared and defined: For every
     990Here the ''trampolines'' are declared and defined. For every
    991991generated C function from the CPS representation, we need a
    992992trampoline function that has a fixed calling convention and
Note: See TracChangeset for help on using the changeset viewer.