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 41 for “"Attribute grammars"”.
-
Reversible Attribute Grammars
Abstract not supplied.
-
Defining semantics with attribute grammars
… of a programming language by a form of attribute grammar for ease of understanding. The attributes are expressed in a simple macro language and when evaluated produce code for an abstract machine. Part of an actual definition is looked at and found to be too obscure to be useful. The …
-
Debugging framework for attribute grammars
Attribute grammars provide a formal means to specify the semantics of context free grammars. In this work, we propose a method to debug attribute grammars by applying algorithmic debugging to the paradigm of attribute grammars. The technique of algorithmic debugging uses the data flow of a program …
-
The efficient evaluation of attribute grammars
Knuth's attribute grammars are a powerful, natural way of specifying translations such as those involved in compiling programming languages, but until now efficient implementation has been possible only for restricted classes of attribute grammars. We present a method of constructing, for any …
-
Strategic attribute grammars: techniques, tools and applications
A travessia e transformação de estruturas de dados são preocupações constantes no desenvolvimento de software. É trivial escrever código para estas tarefas sem preocupações de legibilidade e reutilização, mas alguns problemas exigem algoritmos complexos e recursivos que são difíceis de compreender …
-
Composable semantics using higher-order attribute grammars
… nodes of functions written in the higher-order attribute grammar formalism. There are challenges to designing language semantics (such as types, environment and error-reporting) for a non-trivial host language to allow extension writers to write useful extensions that compose with other …
-
Hierarchical attribute grammars: Dialects, applications and evaluation algorithms
Although attribute grammars have been applied successfully to the specification of many different phases of analysis and transformation of complex language processing systems, including type checking, data flow analysis, constant propagation and dead code elimination, little success has been …
-
Embedding attribute grammars and their extensions using functional Zippers
Attribute grammars are a suitable formalism to express complex software language analysis and manipulation algorithms, which rely on multiple traversals of the underlying syntax tree. Attribute Grammars have been extended with mechanisms such as references, higher order and circular attributes. …
-
Modular Specification of Self-Adaptive Systems with Models at Runtime using Relational Reference Attribute Grammars
… way of specifying SAS concisely using reference attribute grammars (RAGs) providing efficient systems. RAGs originate from the research field of compiler construction and enable the concise description of parts of the internal knowledge mentioned above as well as of the computation of the actions …
-
Regular Right Part Grammars and Maintained and Constructor Attributes in Language Based Editors
… based on ambiguous regular right part grammars into an incremental LALR(1,1) parser. Strongly non-circular attribute grammars are adapted to regular right part grammars for static semantic processing. Finally, attribute grammars are extended with external data structures which improve …
-
AGCG - an attribute grammar compiler generator
The AGCG (Attribute Grammar Compiler Generator) described in this thesis is a compiler generator for programming languages defined by attribute grammars. AGCG can produce a complete compiler for an input attribute grammar automatically. Most compilers of programming languages defined by attribute …
-
ComPOS - a Domain-Specific Language for Composing Internet-of-Things Systems
… runtime model based on relational reference attribute grammars. We demonstrate the approach by formulating and implementing a Device Dependency Analysis (DDA). The DDA finds sets of devices needed for given parts of the system to work. The ComPOS editor supports live programming to allow …
-
Mapping Genotype to Phenotype using Attribute Grammar
… phenotype using formal language theory. We use attribute grammars (AGs) to extract context-dependent information from genetic constructs and compile them into mathematical models, possibly giving clues about their phenotypes. They may be used as a backbone for biological Domain-Specific …
-
Mktypecheck - an interactive type checker generator
… checking rules, a new notation, different from attribute grammars is developed in this thesis. This notation is called the signature language. Using the signature language, a user can easily specify type checking rules for most programming languages. A specification written by the signature …
-
Ευφυή ενσωματωμένα συστήματα
… and through the evaluation of the corresponding attributes for sentences belonging to an attribute grammar (AG). A grammar is defined as a system of production rules that produce strings. The grammar categories, as defined by Chomsky, vary but in the specific thesis only CFG and an extension of …
-
Design and implementation of a concrete interface generation system
… part of an Ada implementation as output. Attribute grammars and fourth-generation language tools have been used in the implementation of this system. Spec, a formal language for writing black-box specifications for large software systems, was used as the input for the concrete interface …
-
Semantic specification using tree manipulation languages
… commonly used for semantic specification is an attribute grammar.;This thesis examines an alternative method of semantic specification. TreeSem is defined as a Tree Manipulation Language applicable to semantic specification. A TreeSem program is easier to read and to write than a corresponding …
-
Type inference in SQL
… rules to G SQL , following Knuth's method of "attribute grammars", to capture the set of schemas for which a query q ✹ L ( G SQL ) is well-defined. We show that G SQL is unambiguous and that our attribute grammar is non-circular. The set of schemas of a query is usually infinite. To finitely …
Page 1 of 3