TL;DR: In this article, the authors propose extensions to the Warren Abstract Machine (WAM) that permit the analysis of types to be done with reasonable efficiency, and illustrate their ideas in the context of a typed version of Prolog.

TL;DR: The minimum-distance error recovery method provides a form of minimum distance repair, has linear time complexity, and is completely automatic and achieves a theoretically best performance on 80% of Pascal programs in the weighted Ripley-Druseikis collection.

TL;DR: It is believed that a refinement of the monolithic approach towards constructing arrays may be a good alternative to using the incremental approach with destructive updates.

TL;DR: A scheme of automatic data partitioning and dynamic data distribution of sequential programs for multicomputer architecture is proposed and tiling transformation for iteration space partitioning is resort to.

TL;DR: This paper presents an O(log n) time parallel algorithm for arithmetic expression evaluation, on an n × n processor array with reconfigurable bus system, where n is the sum of the number of operators and constants in the expression.

TL;DR: Quicksort outperforms both Shellsort and mergesort for all values of N > 1000 and the fits show better performance for Shellsort than the previous studies and are mostly accurate to within 2% for 1000 < N < 2 × 106.

TL;DR: The algorithm is based on the well-known Cocke-Younger-Kasami (CYK) algorithm for the recognition and parsing of context-free languages, and is faster than two recent algorithms available in the literature.

TL;DR: The investigation reveals that the language features provided by RT-CDL are indeed suitable for a spectrum of real-time applications.

TL;DR: An efficient way of assembling the final parse tree from the individual parses is given, and an estimate for speedup by the parallel parsing and parallel incremental parsing methods is given.

TL;DR: This paper describes the design of a language and debugging environment that supports these two capabilities, with particular attention given to the implications of having them both in the same language.

TL;DR: This paper describes a related algorithm for type-sensitive parsing of expressions which is much more efficient—its incremental cost is linear in the length of the expression, even when types must be deduced.

TL;DR: A trace-based denotational interleaving semantics where processes describe synchronous computations is presented where processes are created or deleted dynamically and run asynchronously.

TL;DR: An effort to provide a means of classifying exception handling models which may be encountered, a taxonomy is presented in this paper and some of the concepts of exception handling are introduced and discussed.

TL;DR: Two grammar transformations which can decrease the search space of generated top-down backtrack parsers are presented, which uses the calculation of the sets FIRST and FOLLOW, and a grammar property, called rrelative unambiguity.

TL;DR: A mechanism in Ada to gain the access control of private declarations is presented, similar to the friend mechanism in C++, and needs no extension to current Ada.

TL;DR: This paper examines in this paper only processing tools that collect syntactic information over the language space and discusses tools involved in semantics processing such as translators and interpreters.