Higher-order Rewriting for Executable Compiler Specifications

Kristoffer H. Rose

doi:10.4204/EPTCS.49.3

Higher-order Rewriting for Executable Compiler Specifications

Logic in Computer Science 2011-02-21 v1 Programming Languages

Authors: Kristoffer H. Rose

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

In this paper we outline how a simple compiler can be completely specified using higher order rewriting in all stages: parsing, analysis/optimization, and code emission, specifically using the crsx.sf.net system for a small declarative language called "X" inspired by XQuery (for which we are building a production quality compiler in the same way).

Keywords

programming languages program analysis compiler optimization

Cite

@article{arxiv.1102.3732,
  title  = {Higher-order Rewriting for Executable Compiler Specifications},
  author = {Kristoffer H. Rose},
  journal= {arXiv preprint arXiv:1102.3732},
  year   = {2011}
}

Comments

In Proceedings HOR 2010, arXiv:1102.3465

Related papers

View all related →