Prolog based retargetable code generation

DOI10.1016/0096-0551(89)90005-2MaRDI QIDQ3833602zbMATH OpenOpenAlexFDO

Authors Mahadevan Ganapathi

Publication date 1989

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(89)90005-2

zbMATH Keywords

attribute grammarattributed parsingautomaton-driven tree-matchingcode generationcode generator generatorscode optimizationcompiler back-endpeephole optimizationtree-pattern-matching

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Theory of software (68N99) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4178747
• scientific article; zbMATH DE number 4178748
• A simple code improvement scheme for prolog
• Using rewriting techniques to produce code generators and proving them correct
• scientific article; zbMATH DE number 3926277

Cited in

(4)

• Integrating code generation and peephole optimization
• scientific article; zbMATH DE number 4178747 (Why is no real title available?)
• scientific article; zbMATH DE number 4178748 (Why is no real title available?)
• scientific article; zbMATH DE number 2084355 (Why is no real title available?)

This page was built for publication: Prolog based retargetable code generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833602)