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 782 for “"Grammars"”.

  1. Embedded Grammars

    This work explores the use of grammars as integral parts of computer programs and presents a number of tools and methods which facilitate such integration. An embeddable interpreter for the Grammatical Framework (GF) grammar formalism, a compiler from GF grammars to speech recognition grammars, and …

    chalmers Repository record for Embedded Grammars (opens in a new tab)

  2. Probabilistic grammars and languages

    … of three areas in the theory of probabilistic grammars and languages. First, the relationship of branching processes to probabilistic context-free grammars is investigated. Second, a method is given for finding probabilities of certain strings in context-free languages given "regular-like" …

    ut-knoxville Repository record for Probabilistic grammars and languages (opens in a new tab)

  3. Regular Rooted Graph Grammars

    In dieser Arbeit wir ein pragmatischer Ansatz zur Typisierung, statischen Analyse und Optimierung von Web-Anfragespachen, speziell Xcerpt, untersucht. Pragmatisch ist der Ansatz in dem Sinne, dass dem Benutzer keinerlei Einschränkungen aus Entscheidbarkeits- oder Effizienzgründen auf modellierbare …

    lmu-germany Repository record for Regular Rooted Graph Grammars (opens in a new tab)

  4. Object-oriented graph grammars

    Esta tese apresenta um modelo conceitual para modelagem e vericação de espe- cificações de sistemas orientados a objeto. Mais especificiamente, uma extensão da abordagem algébrica baseada em single-pushouts para gramáticas de grafos tipadas é desenvolvida, onde os morfismos de tipagem são …

    brazil-ufrgs Repository record for Object-oriented graph grammars (opens in a new tab)

  5. TRANSFORMERS ON CONTEXT FREE GRAMMARS

    … to obtain. As an alternative, context-free grammars (CFGs) offer a structured, rule-based approach to synthetically generate language data, enabling research on language models without the need for vast amounts of human-authored text. This Master’s thesis explores the capabilities and …

    nus Repository record for TRANSFORMERS ON CONTEXT FREE GRAMMARS (opens in a new tab) Download file for TRANSFORMERS ON CONTEXT FREE GRAMMARS (opens in a new tab)

  6. Defining semantics with attribute grammars

    This thesis examines the semantic definition 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 …

    ubc Repository record for Defining semantics with attribute grammars (opens in a new tab) Download PDF for Defining semantics with attribute grammars (opens in a new tab)

  7. Epsilon Precedence Grammars and Languages

    The classes of simple and weak precedence grammars are generalized to include ε-rules (productions with the empty right parts). The descriptive power of epsilon simple precedence (ESP) grammars increases directly with the number of ε-rules permitted; the class of ESP grammars with no ε-rules, ESP0, …

    ucf Repository record for Epsilon Precedence Grammars and Languages (opens in a new tab)

  8. Source Transformation with Boolean Grammars

    … by leveraging the expressive power of Boolean grammars, a generalization of context-free grammars that adds conjunction and negation operators. In addition to naturally expressing a larger class of languages, Boolean grammars capture multiple parse trees of the same document simultaneously, …

    queens Repository record for Source Transformation with Boolean Grammars (opens in a new tab)

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

    umn Repository record for Debugging framework for attribute grammars (opens in a new tab)

  10. Unsupervised learning of probabilistic grammars

    <p>Probabilistic grammars define joint probability distributions over sentences and their grammatical structures. They have been used in many areas, such as natural language processing, bioinformatics and pattern recognition, mainly for the purpose of deriving grammatical structures from data …

    iastate Repository record for Unsupervised learning of probabilistic grammars (opens in a new tab)

  11. Relational approach of graph grammars

    Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes tipos de relações entre eles) e cujo comportamento é essencialmente orientado pelos dados, isto é, eventos são disparados por …

    brazil-ufrgs Repository record for Relational approach of graph grammars (opens in a new tab)

  12. Restricted Parallelism and Regular Grammars

    <p>This thesis studies the properties of k-parallel right-linear languages. An infinite hierarchy of language families is found and closure properties of these families are studied. The language families are characterised in terms of simple languages and non-deterministic generalised sequential …

    mcmaster Repository record for Restricted Parallelism and Regular Grammars (opens in a new tab)

Page 1 of 40