John McHugh

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER.

Victor Basili

A description of the computer programming language SIMPL-R is given. SIMPL-R is the member of the SIMPL family of structured programming languages intended for use with numerical computations such as those which arise in connection with the solution of scientific and engineering problems. An example is given showing an implementation in SIMPL-R of an algorithm for the solution of sparse matrix problems using an arc-graph data structure. Comparisons with the same algorithm coded in FORTRAN show that the nonoptimizing SIMPL-R compiler produces code which is ten to twenty percent faster than that produced by the optimizing FORTRAN compiler. (Author).

SIMPL-R and Its Application to Large, Sparse Matrix Problems

Victor R. Basili

The SIMPL family is a set of structured programming languages and compilers under development at the University of Maryland. The term 'family' implies that the languages contain some basic common features, such as a common subset of data types and control structures. Each of the languages in the SIMPL family is built as an extension to a base language. The compiler for the base language is written in the base language itself, and the compiler for each new language is an extension to the base compiler. (Author).

The SIMPL Family of Programming Languages and Compilers

Akira Nakamura

In this paper it is proved that the emptiness problem for deterministic bottom-up triangle acceptors (BTA's) is recursively unsolvable. From this result, it is also shown that certain decision problems involving BTA's and BPA's (deterministic bottom-up pyramid acceptors) are unsolvable. (Author).

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER.

About

Books

Join the club