root/dfa-for-co-slr
1
0
Fork 0
Code Actions

Fixed last slide
All checks were successful
/ Build pdf (push) Successful in 43s
Details

Browse Source
This commit is contained in:
Matthias Veigel 2025-07-22 22:09:47 +02:00
parent 59b93df7b0
commit 1baec06c18
Signed by: root
GPG Key ID: 2437494E09F13876
1 changed files with 19 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
presentation.typ
View File

@ -1,5 +1,5 @@
// cSpell:ignore fancyuulm uulm
#import "fancyuulm.typ": fancyuulm, slide, centered-slide, title-slide, config-info, pause
#import "fancyuulm.typ": fancyuulm, slide, centered-slide, title-slide, config-info, pause, utils
#import "@preview/codly:1.3.0": codly-init, codly
#show: codly-init.with()
@ -174,29 +174,21 @@
= Conclusion
#slide[
- RQ1 -- What are the advantages and disadvantages of using dataflow analysis for compiler optimization?
]
#slide[
- RQ1 -- What are the advantages and disadvantages of using dataflow analysis for compiler optimization?
- Trades compilation performance for runtime performance
- Allows complex optimization across branch and function boundaries
- Allows writing generic code, which will then be optimized based on the usage in an application
]
#slide[
- RQ1 -- What are the advantages and disadvantages of using dataflow analysis for compiler optimization?
- Trades compilation performance for runtime performance
- Allows complex optimization across branch and function boundaries
- Allows writing generic code, which will then be optimized based on the usage in an application
- RQ2 -- How is dataflow analysis used in current compilers?
]
#slide[
- RQ1 -- What are the advantages and disadvantages of using dataflow analysis for compiler optimization?
- Trades compilation performance for runtime performance
- Allows complex optimization across branch and function boundaries
- Allows writing generic code, which will then be optimized based on the usage in an application
- RQ2 -- How is dataflow analysis used in current compilers?
- Already extensively used by popular compilers
- Many different optimizations implemented, some listed previously
- Still working on improving speed and optimization possibilities
]
#slide(repeat: 4, self => [
#let (uncover, only, alternatives) = utils.methods(self)
#list(
[ RQ1 -- What are the advantages and disadvantages of using dataflow analysis for compiler optimization? ] + only("2-", list(
[Trades compilation performance for runtime performance],
[Allows complex optimization across branch and function boundaries],
[Allows writing generic code, which will then be optimized based on the usage in an application]
))
)
#only("3-", list(
[ RQ2 -- How is dataflow analysis used in current compilers? ] + only("4-", list(
[Already extensively used by popular compilers],
[Many different optimizations implemented, some listed previously],
[Still working on improving speed and optimization possibilities]
))
))
])