diff --git a/thesis/chapters/relwork.tex b/thesis/chapters/relwork.tex index 264bd74..fc3dbfb 100644 --- a/thesis/chapters/relwork.tex +++ b/thesis/chapters/relwork.tex @@ -163,12 +163,18 @@ Done: \end{program} \section{Compilers} -Maybe even move this entire section to "Concept and Design"? +Compilers are a necessary tool for many developers. If a developer wants to run their program it is very likely they need one. As best described by \textcite{aho_compilers_2006} in their dragon book, a compiler takes code written by a human in some source language and translates it into a destination language readable by a computer. This section briefly explores what compilers are and research done in this old field of computer science. Furthermore, the topics of transpilers and interpreters are explored, as their use-cases are very similar. % TODO: Maybe not a subsection for transpilers? Would be very short and could fit here very well? -brief overview about compilers (just setting the stage for the subsections basically). Talk about register management and these things. +%brief overview about compilers (just setting the stage for the subsections basically). Talk about register management and these things. +\textcite{aho_compilers_2006} and \textcite{cooper_engineering_2022} describe how a compiler can be developed, with the latter focusing on more modern approaches. They describe how a compiler consists of two parts, the analyser, also called frontend, and the synthesiser also called backend. While the front end is responsible for ensuring syntactic and semantic correctness and converts the source code into an intermediate representation for the backend. The backend is then responsible to generate target code from the intermediate representation. This target code can be assembly or anything else that is needed for a specific use-case. This intermediate representation also makes it simple to swap out frontends or backends. The Gnu Compiler Collection \textcite{gcc_gcc_2025} takes advantage of using different frontends to provide support for many languages including C, C++, Ada and more. Instead of compiling source code for specific machines directly, many languages compile for virtual machines instead. Notable examples are the Java Virtual Machine (JVM) \parencite{lindholm_java_2025} and the low level virtual machine (LLVM) \parencite{lattner_llvm_2004}. Such virtual machines provide a bytecode which can be used as a target language for compilers. A huge benefit of such virtual machines is the ability for one program to be run on all physical machines the virtual machine exists for, without the developer needing to change that program \parencite{lindholm_java_2025}. + +Continue with Grammer, parser generators like antlr; then byte cod; then a bit about transpilers and I think thats it for this section + +% find reference for JIT compilers -\subsection{Interpreters} -What are interpreters; how they work; should mostly contain/reference gpu interpreters \subsection{Transpilers} talk about what transpilers are and how to implement them. If possible also gpu specific transpilation. + +\subsection{Interpreters} +What are interpreters; how they work; should mostly contain/reference gpu interpreters diff --git a/thesis/main.pdf b/thesis/main.pdf index 8de1902..57b9215 100644 Binary files a/thesis/main.pdf and b/thesis/main.pdf differ diff --git a/thesis/references.bib b/thesis/references.bib index 4340d9e..86bda63 100644 --- a/thesis/references.bib +++ b/thesis/references.bib @@ -844,3 +844,57 @@ Publisher: Multidisciplinary Digital Publishing Institute}, urldate = {2025-03-16}, date = {2025-03}, } + +@book{aho_compilers_2006, + location = {{USA}}, + title = {Compilers: Principles, Techniques, and Tools (2nd Edition)}, + isbn = {0-321-48681-1}, + publisher = {Addison-Wesley Longman Publishing Co., Inc.}, + author = {Aho, Alfred V. and Lam, Monica S. and Sethi, Ravi and Ullman, Jeffrey D.}, + date = {2006}, + file = {PDF:C\:\\Users\\danwi\\Zotero\\storage\\ISZAKRX9\\Aho et al. - 2006 - Compilers Principles, Techniques, and Tools (2nd Edition).pdf:application/pdf}, +} + +@online{lindholm_java_2025, + title = {The Java® Virtual Machine Specification}, + url = {https://docs.oracle.com/javase/specs/jvms/se24/html/}, + author = {Lindholm, Tim and Yellin, Frank and Bracha, Gilad and Buckley, Alex and Smith, Daniel}, + urldate = {2025-03-18}, + date = {2025-02}, +} + +@online{gcc_gcc_2025, + title = {{GCC} online documentation}, + url = {https://gcc.gnu.org/onlinedocs/}, + author = {{GCC}}, + urldate = {2025-03-18}, + date = {2025-01}, +} + +@book{cooper_engineering_2022, + edition = {3}, + title = {Engineering a Compiler}, + isbn = {978-0-12-815412-0}, + url = {http://dx.doi.org/10.1016/C2014-0-01395-0}, + publisher = {Elsevier}, + author = {Cooper, Keith D. and Torczon, Linda}, + urldate = {2025-03-18}, + date = {2022}, + langid = {english}, +} + +@inproceedings{lattner_llvm_2004, + title = {{LLVM}: a compilation framework for lifelong program analysis \& transformation}, + url = {https://ieeexplore.ieee.org/abstract/document/1281665}, + doi = {10.1109/CGO.2004.1281665}, + shorttitle = {{LLVM}}, + abstract = {We describe {LLVM} (low level virtual machine), a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. {LLVM} defines a common, low-level code representation in static single assignment ({SSA}) form, with several novel features: a simple, language-independent type-system that exposes the primitives commonly used to implement high-level language features; an instruction for typed address arithmetic; and a simple mechanism that can be used to implement the exception handling features of high-level languages (and setjmp/longjmp in C) uniformly and efficiently. The {LLVM} compiler framework and code representation together provide a combination of key capabilities that are important for practical, lifelong analysis and transformation of programs. To our knowledge, no existing compilation approach provides all these capabilities. We describe the design of the {LLVM} representation and compiler framework, and evaluate the design in three ways: (a) the size and effectiveness of the representation, including the type information it provides; (b) compiler performance for several interprocedural problems; and (c) illustrative examples of the benefits {LLVM} provides for several challenging compiler problems.}, + eventtitle = {International Symposium on Code Generation and Optimization, 2004. {CGO} 2004.}, + pages = {75--86}, + booktitle = {International Symposium on Code Generation and Optimization, 2004. {CGO} 2004.}, + author = {Lattner, C. and Adve, V.}, + urldate = {2025-03-18}, + date = {2004-03}, + keywords = {Algorithm design and analysis, Application software, Arithmetic, High level languages, Information analysis, Performance analysis, Program processors, Runtime, Software safety, Virtual machining}, + file = {Full Text PDF:C\:\\Users\\danwi\\Zotero\\storage\\P2U5LRF2\\Lattner and Adve - 2004 - LLVM a compilation framework for lifelong program analysis & transformation.pdf:application/pdf;IEEE Xplore Abstract Record:C\:\\Users\\danwi\\Zotero\\storage\\U58QV47G\\1281665.html:text/html}, +}