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