LLVM back-end for the Timber compiler

Examensarbete för masterexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/124065
Download file(s):
File Description SizeFormat 
124065.pdfFulltext526.58 kBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLundell, Mattias
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T12:22:41Z-
dc.date.available2019-07-03T12:22:41Z-
dc.date.issued2010
dc.identifier.urihttps://hdl.handle.net/20.500.12380/124065-
dc.description.abstractThis master's thesis describes the design and implementation of a new backend for the Timber compiler, based on Low Level Virtual Machine (LLVM) compiler infrastructure. The thesis describes the implementation and gives detailed information about how a Timber program is translated into a LLVM program and how it is represented. Furthermore the thesis compares the existing C based back-end with the new LLVM based back-end in terms of implementation complexity and the performance of programs that were compiled with the respective back-ends. When compared to each other, the LLVM based back-end was found to have a performance that was equal or better than the C based back-end, with the cost of increased complexity of the compiler in the form of an abstract syntax to represent LLVM assembly code and an interface to the abstract syntax. The overall conclusion is that LLVM offers a suitable back-end for the Timber programming language compiler.
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectProgramvaruteknik
dc.subjectSoftware Engineering
dc.titleLLVM back-end for the Timber compiler
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
Collection:Examensarbeten för masterexamen // Master Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.