Sökning: "compiler generator"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden compiler generator.
1. NoGAP: Novel Generator of Accelerators and Processors
Sammanfattning : ASIPs are needed to handle the future demand of flexible yet highperformance embedded computing. The flexibility of ASIPs makes them preferable over fixed function ASICs. Also, a well designed ASIP, has a power consumption comparable to ASICs. However the cost associated with ASIP design is a limiting factor for a more wide spread adoption. LÄS MER
2. The Treatment of Polymorphism and Modules in a Partial Evaluator
Sammanfattning : In this thesis we study aspects of specialisation by partial evaluation and compiler generation. After significant research during the last two decades, there are now powerful specialisers for several programming languages, such as LISP, Scheme, ML, and C. But some features of programming languages are still not handled by specialisers. LÄS MER
3. Testing an Optimising Compiler by Generating Random Lambda Terms
Sammanfattning : This thesis tries to improve on the relatively uncommon practice of random testing of compilers.Random testing of compilers is difficult and not widespread for two reasons. First, it is hard to come up with a generator of valid test data for compilers, that is a generator of programs. LÄS MER
4. Compiler Generation for Data-Parallel Programming Languages from Two-Level Semantics Specifications
Sammanfattning : This thesis is an empirical study of compiler generation for data-parallel languages from denotational-semantics-based formal specifications. We investigate whether compiler generation from such specifications is practical, not only with respect to generation of practical compilers, but also with respect to compilation of programs into efficient code and execution of the compiled programs on massively parallel SIMD (Single Instruction Multiple Data) architectures. LÄS MER
5. Random Structured Test Data Generation for Black-Box Testing
Sammanfattning : We show how automated random testing can be used to effectively find bugs in complex software, such as an optimising compiler. To test the GHC Haskell compiler we created a generator of simple random programs, used GHC to compile them with different optimisation levels, and thencompared the results of running them. LÄS MER