Abstract
We describe a retargetable compiler code generation system that has two distinguishing features. First, the system produces code generators from equational specifications. The equational notation directly supports the conceptually attractive view of code generation as term rewriting. Second, the system produces code generators that are very efficient. We discuss experimental evidence that indicates that code generators produced by our system run extremely fast. This experimental evidence includes direct comparisons to Davidson-Fraser code generators. Graham-Glanville code generators, and the Portable C compiler's code generator.
Published Version
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 callDisclaimer: 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.
