Complex systems are naturally understood as combinations of their distinguishing characteristics or \definit{features}. Distinct features differentiate between variations of configurable systems and also identify the novelties of extensions. The implementation of a conceptual feature is often scattered throughout an artifact, forcing designers to understand the entire artifact in order to reason about the behavior of a single feature. It is particularly challenging to independently develop novel extensions to complex systems as a result. This dissertation shows how to modularly reason about the implementation of conceptual features in both the formalizations of programming languages and object-oriented software product lines. In both domains, modular verification of features can be leveraged to reason about the behavior of artifacts in which they are included: fully mechanized metatheory proofs for programming languages can be synthesized from independently developed proofs, and programs built from well-formed feature modules are guaranteed to be well-formed without needing to be typechecked. Modular reasoning about individual features can furthermore be used to efficiently reason about families of languages and programs which share a common set of features. / text

Currently, many machine vision, signal and image processing problems are solved on personal computers due to the low cost involved in these computers and the many excellent software tools that exist, such as MATLAB. However, computationally expensive tasks require the use of multi-processor computers that are expensive and difficult to use efficiently due to communications between the processors. In these cases, FPGAs (Field Programmable Gate Arrays) are the best choice but they are not as widely used because of lack of experience in using these devices, difficulties with algorithmic translation and immaturity of the design and implementation tools for FPGAs. Programming languages are always evolving and the programming languages for microprocessors have evolved significantly, from functional and procedural languages to object-oriented languages. Nowadays, a new paradigm called aspect-oriented software development (AOSD) is becoming more widespread. However, hardware programming languages have not evolved to the same extent as the software programming languages for microprocessors. They are still dominated by the technologies developed in 1980s, which have significant deficiencies described in this thesis. Recent advances in HDLs (Hardware Description Languages) have taken a conservative approach based on well-proven software techniques.

The problems of software development for microcomputers are studied through the design and implementation of a simple systems language, called E. E is a descendant of the BCPL family of systems programming languages. Differences between E and its predecessors arise from the design of E as a minimal language, and from the objective of enabling interactive tracing of E programs. A development system for E has been constructed which may operate in a microcomputer with 16K bytes of memory. As well, E programs may be developed using a cross compiler which runs on a large computer system. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Unknown

<p> This project is about the design and implementation of a new programming language, Mytran. Two new control statements are implemented in Mytran. Data abstraction is supported through parameterized types or "type constructors".</p> / Thesis / Master of Science (MSc)

Visual scripting languages are used as alternatives to text programming to make coding easier. Visual programming languages provide a structure and a guidance that does not exist in text programming, which should make them easier to code with. Some users do however find that the structure in visual scripting languages makes it cumbersome to code. To find a design of visual scripting that subvert this and has a better user experience than contemporary designs, a prototype of a visual scripting interface was developed using an iterative design and testing cycle. When a final prototype had been developed, it was tested to see how it compared to text programming. From the tests performed, a few teachings were discovered. If-statements that grow perpendicularly to the rest of the code fit more information on the screen at the same time and can feel more natural and easier to parse for some users. Having a help menu with syntax-help makes it so that users do not have to leave the program, which increases programming speed. The visual coding elements in a visual scripting language need to be coloured such that the most important parts are the most visible; otherwise users have a hard time parsing the code. Showing existing variables that are in scope gives the user a good overview of what variables they can use. Having help menus where elements can be clicked to insert them at the user's text cursor reduces the chance of misspelling variables and gives the user confidence in the correctness of the code. Having visual coding elements that can change depending on context or by using toggles can make coding more intuitive and faster. / <p>Examensarbetet är utfört vid Institutionen för teknik och naturvetenskap (ITN) vid Tekniska fakulteten, Linköpings universitet</p>

No description available.

No description available.

The goal of this thesis is to develop a procedural terrain height map generator programmable using a Turing complete scripting language. The generator must allow rendering of partial maps by generating arbitrary rectangular region of the map described by any script. The thesis explains why this means the traditional script execution model won't work in this case and proposes a novel two stage model, which executes the scripts in two stages - a simulation stage and a rendering stage. Powered by TCPDF (www.tcpdf.org)

<p>Portable stream programming language (PSPL) is a language for baseband application</p><p>programming on reconfigurable architectures. The first step in its development has been</p><p>completed. A parser has been provided for the front end of the PSPL compiler. The syntax</p><p>of the language has been fixed to allow for easy parses. The scanner and the parser</p><p>where generated using automatic tools (scanner and parser generators) which rely on</p><p>complex mathematical algorithms for their generation. Abstract syntax (data structures</p><p>that preserve the source program so that program structure is evident) was implemented</p><p>for the parser using a syntax separate from interpretation style of programming. Tests were</p><p>carried out to ensure that the correct data structures were generated. The final outcome</p><p>is a parser that other phases of the compiler can depend on for onward transmission of</p><p>the source program in an unambiguous manner. The development of subsequent phases</p><p>of the compiler will form the next logical step in the processes of transforming PSPL to</p><p>a stand alone language.</p>

Portable stream programming language (PSPL) is a language for baseband application programming on reconfigurable architectures. The first step in its development has been completed. A parser has been provided for the front end of the PSPL compiler. The syntax of the language has been fixed to allow for easy parses. The scanner and the parser where generated using automatic tools (scanner and parser generators) which rely on complex mathematical algorithms for their generation. Abstract syntax (data structures that preserve the source program so that program structure is evident) was implemented for the parser using a syntax separate from interpretation style of programming. Tests were carried out to ensure that the correct data structures were generated. The final outcome is a parser that other phases of the compiler can depend on for onward transmission of the source program in an unambiguous manner. The development of subsequent phases of the compiler will form the next logical step in the processes of transforming PSPL to a stand alone language.