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 97 for “"Abstract syntax tree"”.

  1. Parsing and abstract syntax tree generation in the GIPSY system

    … of the system. The objective of the thesis is syntax trees for the programs of both languages. We chose JavaCC/JJTree from tens of compiler construction tools. By modifying the original Lucid lexical and syntactical specifications, and customizing the JavaCC/JJTree generated files, we …

    concordia Download PDF for Parsing and abstract syntax tree generation in the GIPSY system (opens in a new tab)

  2. Exploring the Implementation Space of Abstract Syntax Tree and Bytecode Interpreters

    … This often overlooks other designs, such as abstract syntax tree (AST) interpreters, and the variety of hybrid designs that are neither clearly AST nor BC. Interpreter design is influenced by several constraints and opportunities, such as the mechanisms provided by the host language (in which …

    kent Download PDF for Exploring the Implementation Space of Abstract Syntax Tree and Bytecode Interpreters (opens in a new tab)

  3. Accurate Abstract Syntax Tree Differencing: Language-Aware Design, Benchmarking, and Empirical Assessment

    … understanding and reviewing code changes. Abstract Syntax Tree (AST) diff tools were developed to overcome the limitations of line-based diff tools, which are still the default for most developers. Despite their advantages in capturing structural changes, existing AST diff tools suffer from …

    concordia Download PDF for Accurate Abstract Syntax Tree Differencing: Language-Aware Design, Benchmarking, and Empirical Assessment (opens in a new tab)

  4. Formalus Elixir standartinės bibliotekos verifikavimas TLA+ kalba /

    … to create a connection between Elixir language abstract syntax tree and TLA+ formal specification, which would describe the execution of the given Elixir function, including recursive algorithms. This is achieved by creating a template for TLA+ to specify recursive functions using stack memory, …

    vilnius Repository record for Formalus Elixir standartinės bibliotekos verifikavimas TLA+ kalba / (opens in a new tab)

  5. Trees that Grow in the Paragon Compiler - A Step Towards Modularity

    … We identify the representation of Paragon’s abstract syntax tree as an essential design aspect and emphasize extensibility to conform to the phases’ varying requirements. Based on a programming idiom, Trees that Grow, by Najd and Jones, we implement an extensible abstract syntax tree in …

    chalmers Repository record for Trees that Grow in the Paragon Compiler - A Step Towards Modularity (opens in a new tab)

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

    maynooth Download PDF for An Empirical study of the JaMoPP project using code coverage based system tests. (opens in a new tab)

  7. Applying Information Theory to Software Evolution: What can we Learn From Surprising Changes?

    … on natural language tokens and another based in Abstract Syntax Tree nodes, and apply them to the commit history of 95 open-source projects. Our analysis reveals a strong correlation between the two entropy measures and highlights their mostly weak correlations with established metrics of …

    adelaide Repository record for Applying Information Theory to Software Evolution: What can we Learn From Surprising Changes? (opens in a new tab)

  8. Construction of a Generic Program Representation for Automated Metric Computation

    … existing parser tools to produce a generalized abstract syntax tree that captures the important syntactic categories required for metric computation. To demonstrate the utility of our approach, we exploit front-end parser tools for the Python and C++ programming languages to produce a …

    clemson Repository record for Construction of a Generic Program Representation for Automated Metric Computation (opens in a new tab)

  9. Automatizuotas architektūrinių taisyklių pažeidimų aptikimas TypeScript sistemose /

    … rules, but these methods are overlapping, that abstract syntax tree construction is an essential task when performing static code analysis and that ACC is not a computationally challenging problem.

    vilnius Repository record for Automatizuotas architektūrinių taisyklių pažeidimų aptikimas TypeScript sistemose / (opens in a new tab)

  10. An Agda scope checker implemented in Agda

    … Scope checking is the process of analyzing the Abstract Syntax Tree (AST) of a program and resolving all references to symbols by connecting them to the corresponding declarations of said symbols. The Agda scope checker – as well as the rest of the compiler – is written in Haskell, and does not …

    chalmers Repository record for An Agda scope checker implemented in Agda (opens in a new tab)

  11. Simplifying the Analysis of C++ Programs

    … and non-intrusive means of dealing with abstract syntax trees of a program, which together render the visitor design pattern obsolete. We further extend C++ with open multi-methods to deal with the broader expression problem. Finally, we offer two techniques, one based on refining the …

    tamu Repository record for Simplifying the Analysis of C++ Programs (opens in a new tab)

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

    houston Repository record for A Code Structure Visualization Tool for Groovy (opens in a new tab)

  13. An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database

    … adopted a modular approach that begins with an abstract syntax tree (AST) for parsing Boolean expressions. On top of this, we developed two evaluation methods designed to handle constraints efficiently. These extensions improve both the flexibility and performance of read operations, while …

    washington Repository record for An Enhancement of Distributed Graph Queries in an Agent-Based Graph Database (opens in a new tab)

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

    unt Repository record for The Design and Implementation of a Prolog Parser Using Javacc (opens in a new tab)

  15. Typed, Algebraic Parser in Idris2

    … into an intermediate representation like a Parse Tree or an Abstract Syntax Tree. Parser combinators are a popular way of building parsers, which use the tools in the host programming language to build small parsers and compose them into more complex parsers. Parser combinators are usually built …

    buffalo Repository record for Typed, Algebraic Parser in Idris2 (opens in a new tab)

  16. The spec is out there, Extracting contracts from code

    … by first parsing target source code into an abstract syntax tree, which was then analyzed to find defined code patterns which signaled the presence of some implicit contract. The information found within these patterns was then extracted and written as an explicit contract. In experiments …

    chalmers Repository record for The spec is out there, Extracting contracts from code (opens in a new tab)

  17. A study of static warning cascading tool

    … used the textual-based diff tool, namely SCALe, abstract syntax tree (AST) based diff tool, namely GumTree, and control flow graph (CFG) based diff tool, namely Hydrogen. We reported our experience of applying these tools, and hopefully, our findings can help developers understand of pros and …

    iastate Repository record for A study of static warning cascading tool (opens in a new tab)

Page 1 of 5