Semi-applicative programming. Examples of context-free recognizers. Technical report
Technical Report
·
OSTI ID:5673484
Most current parallel programming languages are designed with a sequential programming language as the base language and added constructs that allow parallel execution. The author is experimenting with an applicative base language that has implicit parallelism everywhere, then introduces 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. The author advocate several techniques of controlling the behavior of functional programs without changing their meaning or functionality: program annotation with constructs that have benign sideeffects, program transformation, and adaptive scheduling. This combination yields 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, the author has successfully derived variants of the recognition algorithm of Cocke-Kasami-Younger.
- Research Organization:
- BBN Labs., Inc., Cambridge, MA (USA)
- OSTI ID:
- 5673484
- Report Number(s):
- AD-A-164897/1/XAB; BBN-6135
- Country of Publication:
- United States
- Language:
- English
Similar Records
VLSI architectures for syntactic pattern recognition algorithms
Parallel execution of LISP programs
Parallel execution of Lisp programs. Doctoral thesis
Conference
·
Fri Dec 31 23:00:00 EST 1982
·
OSTI ID:5107022
Parallel execution of LISP programs
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6089151
Parallel execution of Lisp programs. Doctoral thesis
Technical Report
·
Thu Jun 01 00:00:00 EDT 1989
·
OSTI ID:6764432