Abstract

We show how restructuring a denotational definition leads to a more efficient compiling algorithm. Two semantics-preserving transformations ( static replacement and factoring) are used to convert a continuation semantics into a formal description of a semantic analyzer and translator. The translation algorithm derived below performs type checking before code generation so that type-checking instructions may be omitted from the target code. The translation is proved correct with respect to the original definition of the source language. The proof consists of showing that both transformations preserve the semantics of the source language.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.