Accession Number:

ADA164897

Title:

Semi-Applicative Programming. Examples of Context Free Recognizers.

Descriptive Note:

Technical rept.,

Corporate Author:

BBN LABS INC CAMBRIDGE MA

Personal Author(s):

Report Date:

1986-01-01

Pagination or Media Count:

47.0

Abstract:

Most current parallel programming languages are designed with a sequential programming language as the base language and have added constructs that allow parallel execution. We are experimenting with an applicative base language that has implicit parallelism everywhere, and then we introduce constructs that inhibit parallelism. The base language uses pure LISP as a foundation and blends in interesting features of Prolog and FP. Proper utilization of available machine resources is a crucial concern of programmers. We advocate several techniques of controlling the behavior of functional programs without changing their meaning or functionality program annotation with constructs that have benign side-effects, program transformation and adaptive scheduling. This combination yields us a semi-applicative programming language and an interesting programming methodology. This paper deals with context-free parsing as an illustration of semi-applicative programming. Starting with the specification of a context-free recognizer, we have been successful in deriving variants of the recognition algorithm of Cocke-Kasami-Younger.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE