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 7 of 7 for “"extensible languages"”.

  1. Modular metatheory for extensible languages

    … write programs for different purposes using it. Extensible languages allow specifications of language features to be developed independently of one another, then composed to form a new language containing all the features from all the specifications included. This lets programmers choose language …

    umn Repository record for Modular metatheory for extensible languages (opens in a new tab)

  2. Secure extensible languages, design of

    The basic premise of this thesis is that extensible languages afford the user considerable power and flexibility. We argue that this flexibility can, and should, be provided in a secure and error-resistant manner, but that this objective is not realised in existing extensible languages. This thesis …

    glasgow Download PDF for Secure extensible languages, design of (opens in a new tab)

  3. Development of PHP to UPML transformer

    … thesis developed a new markup language based on eXtensible Markup Language (XML), named as the Unified Programming Markup Language (UPML), which represents an abstraction of programming techniques of popular programming languages, and is used to store the programming semantic information of …

    ballstate-thes Repository record for Development of PHP to UPML transformer (opens in a new tab)

  4. PSLR(1): Pseudo-Scannerless Minimal LR(1) for the Deterministic Parsing of Composite Languages

    Composite languages are composed of multiple sub-languages. Examples include the parser specification languages read by parser generators like Yacc, modern extensible languages with complex layers of domain-specific sub-languages, and even traditional programming languages like C and C++. In this …

    clemson Repository record for PSLR(1): Pseudo-Scannerless Minimal LR(1) for the Deterministic Parsing of Composite Languages (opens in a new tab)

  5. ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages

    … In this work, we present ClaferMPS, a set of extensible languages and IDE for modeling E/E architectures using Clafer. First, we present an E/E architecture domain-specific language (DSL) built on top of Clafer, which embodies the reference model and which guides the architects in correctly …

    waterloo Repository record for ClaferMPS: Modeling and Optimizing Automotive Electric/Electronic Architectures Using Domain-Specific Languages (opens in a new tab)

  6. Composable semantics using higher-order attribute grammars

    … new functionality could be added to existing languages incrementally, so that programmers could choose features appropriate to their problem domains, retrieve their specifications, and compose them automatically with an existing host language to generate a compiler for an extended version of …

    umn Repository record for Composable semantics using higher-order attribute grammars (opens in a new tab)

  7. Context-aware scanning and determinism-preserving grammar composition, in theory and practice

    … apparatus for syntactic analysis of programming languages consists of a scanner based on deterministic finite automata, built from a set of regular expressions called the lexical syntax, and a separate parser, operating on the output of this scanner, built from a context-free grammar and …

    umn Repository record for Context-aware scanning and determinism-preserving grammar composition, in theory and practice (opens in a new tab)