<div class="csl-bib-body">
<div class="csl-entry">Pammer, S. O. (2023). <i>Fast machine-code generation for stack-based languages</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.108224</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2023.108224
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/177270
-
dc.description.abstract
This work investigates implementation techniques for fast instruction selection in the context of stack-based languages. Using tree-parsing and the iburg implementation thereof as a starting point, this work is looking into solving the bottle-necks of iburg's tree-parsing approach: The need to construct expression trees and the need for a two-pass algorithm. This work implements a generator that produces a finite-state machine from tree-parsing rules and associated actions, which only requires a single pass and no tree-construction. The performance of a manually written code generator, iburg's tree parsing and an automaton-based approach is measured and compared. The generated automaton produces results of similar quality as a hand-written code generator.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
compilers
en
dc.subject
code generation
en
dc.subject
stack-based
en
dc.subject
instruction selection
en
dc.subject
automata
en
dc.subject
tree-covering
en
dc.subject
tree-parsing
en
dc.subject
languages
en
dc.title
Fast machine-code generation for stack-based languages
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2023.108224
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Siegfried Oleg Pammer
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.publication.orgunit
E194 - Institut für Information Systems Engineering