Thesis (M.S.)--University of Delaware, 2009. / Principal faculty advisor: Guang R. Gao, Dept. of Electrical & Computer Engineering. Includes bibliographical references.

Thesis (Ph. D.)--University of Pennsylvania, 1982. / Cover title. Includes bibliographical references.

No description available.

In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple Pascal-like language called SPASCAL into target programs in the VAX assembly language. This thesis clearly describes the main aspects of a compiler: lexical analysis and syntactic analysis, including the symbol-table routines and the error-handling routines. This thesis uses regular expressions to define the lexical structure and a context-free grammar to define the syntactic structure of SPASCAL. The compiler is constructed using syntax-directed translation, context-free grammars and a set of semantic rules. SPASCAL Compiler is written with standard C in UNIX. / Department of Computer Science

No description available.

Thesis (Ph. D.)--University of Washington, 1999. / Vita. Includes bibliographical references (p. 169-184).

A compiler which achieves automatic implementation of network protocols by transforming specifications written in FDT into C programs is presented. A brief introduction to the the fundamentals of FDT, a standard language developed by ISO/TC97/SC 16/WG 1 Subgroup B for specifying network protocols, is given. We then present an overview of the compiler and discuss the problem of PASCAL to C translation. Transformation of a FDT specification into code is explained and illustrated by two implementation examples. The first example illustrates the implementation strategy by tracing the processing of a simple protocol. The second example demonstrates the validity of using automatically generated implementations by showing how a communication path was established between two hosts using code generated for the alternating bit protocol. / Science, Faculty of / Computer Science, Department of / Graduate

Much work has been done in the many aspects of compiler generation. He examine the problems associated with the generation of a full compiler and present a method of modular construction which would solve many of the problems which occur in previous generation systems. As an example of this modular construction, a lexical scanner generator is designed to produce lexical scanners which are easily interfaceable with the other components of a compiler. / Science, Faculty of / Computer Science, Department of / Graduate

Cloud computing is a significant step forward in computer science. It enables customers to use applications on devices such as telephones, tablets, and computers over the internet. However, in the case of some applications, moving to the cloud can be challenging. Enterprise Resource Planning (ERP) is one example of such an application. ERPs need to be configurable since each company is different and has unique use cases. These configurations could be done by manipulating the logic and execution of programs by extending or modifying existing classes, basically writing customized plugins. The customer or the vendor could easily configure traditional offline single-tenant ERPs. Today, however, having this level of customization in a cloud-based multi-tenant ERP system is not an easy task. Since every customer shares the same application, though isolated from each other, changes made for one customer are made for every customer. Therefore, in this paper, we aim to find one or several answers to the question: how can you enable deep customization in multi-tenant SaaS systems in a secure way? A structured literature study is performed to analyze and investigate different solutions. The results gathered from the literature study showed that three solutions could be adapted: microservices, extensible programming, and static analysis tools. However, based on some requirements, extensible programming was found most suitable for the investigated ERP. / configurable, multitenant, SaaS, code,

No description available.