NDLTD logo NDLTD Union Catalog and Global ETD Search

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 20 of 25 for “"syntax tree"”.

  1. An Empirical study of the JaMoPP project using code coverage based system tests.

    Bell, ColinNational University of Ireland Maynooth2010

    … 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. Finally …

    maynooth Repository record

  2. A system for classifying and clarifying Python syntax errors for educational purposes

    Kelley, Anne K., M. Eng. Massachusetts Institute of TechnologyMassachusetts Institute of Technology2018

    … students learning Python frequently encounter syntax errors but have difficulty understanding the error messages and correcting their code. In this thesis, we designed, implemented, and performed preliminary testing of a system for classification of syntax errors commonly made by beginning …

    mit Repository record

  3. Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas

    Janicki, AdamMassachusetts Institute of Technology2024

    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 …

    mit Repository record

  4. Source to source compiler for the automatic parallelization of JavaScript code

    Diaz Baskakov, Serguei Ramiro RamirovichUniversidad de Lima2021

    … 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 obtained, we …

    lima Repository record

  5. The Design and Implementation of a Prolog Parser Using Javacc

    Gupta, PankajUniversity of North Texas2002

    … 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 generator like …

    unt Repository record

  6. A Code Structure Visualization Tool for Groovy

    Saha, Manas K. 1966-University of Houston2013

    … 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 a tool on …

    houston Repository record

  7. Relation extraction: exploring syntax parsing and constructing it as attention-like structure

    Huang, RuiUniversity of Illinois at Urbana-Champaign2022

    … have conducted experiments on the combination of syntax parsing, attention mechanism and transformers and they had obtained outstanding improvement in their tasks. Motivated by application of syntax parsing and recent state of arts of syntax-aware BERT [1] related models, we construct a syntax …

    uiuc Repository record

  8. An interface between single assignment C and vector Pascal

    Bin, LiUniversity of Glasgow2008

    … is generally developed based on traversal over Syntax Tree and involves works of vectorization and loop unrolling. Meanwhile, a benchmark testing system to validate my hypothesis is created and introduced in this dissertation too, which is accompanied with the testing results and analysis.

    glasgow Repository record

  9. μJUNITER: Automated Unification of Microservices into Modular Monoliths for Versatile Software Architecture Migration

    Martin, Joshua ScottVirginia Tech2024

    … 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 microservices, …

    vt Repository record

  10. Reachability Analysis of RTL Circuits Using k-Induction Bounded Model Checking and Test Vector Compaction

    Roy, TonmoyVirginia Tech2017

    … 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 the …

    vt Repository record

  11. Utilizing the notion of removable blocks to enhance program slicing algorithms

    Karanth, Bhaskar Airody2001

    … slicing algorithm. The thesis introduced new syntax tree representation using removable blocks and theorized a new navigation technique for the same. The new static slicing algorithm combined with the enhanced dynamic slicing algorithm is used to derive the criterion based hybrid slicing …

    concordia Repository record

  12. A compiler optimization framework for Concordia parallel C

    Liang, Wen1998

    … 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 Subexpression …

    concordia Repository record

  13. The development of a new compiler-compiler front-end

    Bendjeddou, NadiaAston University1989

    … 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 provision …

    aston Repository record

  14. Compiling Java for Real-Time Systems

    Nilsson, AndersDepartment of Computer Science, Lund University2004

    … 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 …

    lund Repository record

  15. Machine learning methods for vector-based compositional semantics

    Maillard, JeanUniversity of Cambridge2020

    … structures. Rather than using the standard syntax trees of linguistics to drive the compositional process, these models treat the compositional structure as a latent variable. I contribute two models that automatically induce trees for a downstream task, without ever being shown a `real' …

    cambridge Repository record

  16. A toolkit for constructing refactoring engines

    Overbey, JeffreyUniversity of Illinois at Urbana-Champaign2012

    … 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, including an …

    uiuc Repository record

  17. Técnicas de prueba avanzadas para la generación de casos de prueba

    Valle Gómez, Kevin Jesús2023

    … 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 testing …

    cadiz Repository record

  18. Techniques for enabling GPU code generation of low-level optimizations and dynamic parallelism from high-level abstractions

    Garcia de Gonzalo, Simon PUniversity of Illinois at Urbana-Champaign2020

    … 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 …

    uiuc Repository record

  19. Towards a change-oriented programming environment

    Negara, StanislavUniversity of Illinois at Urbana-Champaign2013

    … 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 and …

    uiuc Repository record

  20. A corpus-trained parser for systemic-functional syntax

    Souter, C.University of Leeds1996

    … will use a probabilistic systemic functional syntax (Fawcett 1981, Souter 1990), which was originally employed to hand-parse the Polytechnic of Wales corpus (Fawcett and Perkins 1980, Souter 1989), a 65,000 word transcribed corpus of children's spoken English. Although SFG contains mechanisms …

    whiterose Repository record

Page 1 of 2