Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 17 of 17 for “"abstract syntax tree"”.
-
An Empirical study of the JaMoPP project using code coverage based system tests.
… to look at how much of the project‟s grammar and abstract syntax tree are being used during the process of transforming Java source code into Java models. A look will then be taken at the coverage results to see if a correlation exists between the grammar and the abstract syntax tree results. …
-
Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas
Tree-like data structures are very commonly used data types found in the wild in a wide array of projects JavaScript projects. A specific example of one of these structures is an abstract syntax tree (AST). However, the lack of good libraries to handle trees has led to many developers and …
-
Source to source compiler for the automatic parallelization of JavaScript code
… compiler transforms the input code to an AST (Abstract syntax tree). Afterward, we applied a dependence analysis, followed by fusion and fission techniques. As a later part, new portions of code are inserted to parallelize specific sections of the original program. From the modified AST …
-
The Design and Implementation of a Prolog Parser Using Javacc
… is provided. The output of the parser is an “Abstract Syntax Tree” that reflects the correct precedence and associativity rules among the various operators (static and dynamic) of the language. Empirical results are provided that show that a Prolog parser that is generated by the parser …
-
A Code Structure Visualization Tool for Groovy
… code structure of a program is represented by an Abstract Syntax Tree (AST). A language like Groovy provides easy way to tap into that structure. Furthermore, features like metaprogramming can help to easily decipher the structural information. That makes Groovy a natural choice for creating such …
-
μJUNITER: Automated Unification of Microservices into Modular Monoliths for Versatile Software Architecture Migration
… equivalent monolith. Our refactoring relies on abstract syntax tree merging and control flow bridging to unite distributed components into a centralized system. We have implemented our approach as μJUNITER, an automated refactoring tool that operates on Java source files of Spring Boot …
-
Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction
… for the subsequent cycles without traversing the abstract syntax tree of the entire design. To reduce the approximation on the induction step, an addition of signal domain constraints is proposed. Moreover, we present the technique for splitting up the property in question to get a better model of …
-
A compiler optimization framework for Concordia parallel C
… algorithm that can build CFG from the CPC Abstract Syntax Tree (CPC-AST). Based on CFG representation, we implemented an optimization framework that can solve dataflow equations in either forward and backward manner. As a demonstration example, we showed how to solve the Common …
-
The development of a new compiler-compiler front-end
… to perform lexical symbol valuation and abstract syntax tree construction must be explicitly coded by the user. This thesis presents a new CWT called CORGI (COmpiler-compiler from Reference Grammar Input) which deals with the entire `front-end' component of a compiler; this includes the …
-
Compiling Java for Real-Time Systems
… transformations as a set of transforms on an abstract syntax tree. To our knowledge, this is the first implementation of natively compiled real-time Java, which handles hard real-time requirements. The new transparent garbage collector interface makes it possible to generate, or write, C code …
-
A toolkit for constructing refactoring engines
… on the syntactic components: the lexer/parser, abstract syntax tree (AST), and source code manipulation infrastructure. Compiler writers have been generating lexers and parsers from grammars for years. However, this dissertation shows that it is possible to generate all of these components, …
-
Técnicas de prueba avanzadas para la generación de casos de prueba
… for generating test harnesses based on the Abstract Syntax Tree (AST) and a study examining the ability of the Dynamic Symbolic Execution (DSE) testing technique to generate test data capable of detecting potential faults in software. This study leads to the creation of a novel family of …
-
Techniques for enabling GPU code generation of low-level optimizations and dynamic parallelism from high-level abstractions
… GPUs for computations. From low-level C style syntax that provides for full control and most performance at the cost of slow code-development times to High-level DSLs that can abstracts the complexities of GPU programming, speeding up code-development at the cost of performance. Between these …
-
Towards a change-oriented programming environment
… changes as operations on the corresponding Abstract Syntax Tree (AST) nodes. These AST node operations are the lowest level of program transformations that serve as building blocks for higher level transformations. Also, CodingTracker implements a replayer that enables a developer to browse …
-
Recommending TEE-based Functions Using a Deep Learning Model
Trusted execution environments (TEEs) are an emerging technology that provides a protected hardware environment for processing and storing sensitive information. By using TEEs, developers can bolster the security of software systems. However, incorporating TEE into existing software systems can be …
-
A wide spectrum type system for transformation theory
… or semi-automatically restructure and abstract legacy code within a special intermediate language called WSL (Wide Spectrum Language). Unfortunately, the current transformation process only supports the migration of assembler as WSL lacks the ability to handle data types properly. The …
-
Optimalizace překladu agentních jazyků různé úrovně abstrakce
Cílem této práce je optimalizace překladu agentního jazyka AHLL. Jsou představeny různé používané interní formy reprezentace kódu pro překladač jako i optimalizace kódu v těchto reprezentacích. Hlavní část práce je zaměřená implementaci zvolených optimalizací a způsobu generování cílového kódu v …