Scribd Logo
Upload

Welcome to Scribd!

  • MGP 00051

    Uploaded by

    mrpoo
    11 views1 page
    The back end is probably the easiest part to understand, since we've already developed a keen understanding of quasiquotation. Produces a C function for each rule Trades space for speed not that much space either: 30 insns / rule at -O2 Pre-calculates a lot Only needs stat(), system(), and write() Many other tradeoffs possible Topological sort done at compile time Missing build rules directly fail when called Dead build rules not compiled into executable.

    Original Description:

    Original Title

    Mgp 00051

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The back end is probably the easiest part to understand, since we've already developed a keen understanding of quasiquotation. Produces a C function for each rule Trades space for speed not that much space either: 30 insns / rule at -O2 Pre-calculates a lot Only needs stat(), system(), and write() Many other tradeoffs possible Topological sort done at compile time Missing build rules directly fail when called Dead build rules not compiled into executable.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    11 views1 page

    MGP 00051

    Uploaded by

    mrpoo
    The back end is probably the easiest part to understand, since we've already developed a keen understanding of quasiquotation. Produces a C function for each rule Trades space for speed not that much space either: 30 insns / rule at -O2 Pre-calculates a lot Only needs stat(), system(), and write() Many other tradeoffs possible Topological sort done at compile time Missing build rules directly fail when called Dead build rules not compiled into executable.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    Back end (summary)

    The back end is probably the easiest part to understand,


    since we've already developed a keen understanding of
    quasiquotation.

    Produces a C function for each rule


    Trades space for speed
    Not that much space either: ~ 30 insns / rule at -O2
    Pre-calculates a lot
    Only needs stat(), system(), and write()
    Many other tradeoffs possible

    Can perform domain-specific optimizations


    Topological sort done at compile time
    Missing build rules directly fail when called
    Dead build rules not compiled into executable
    Common dependency DAG nodes refer to same function
    All messages pre-formatted
    All string lengths known, for write()

    You might also like