Journal Article10.1080/00207167508803100
AEPL: An extensible programming language†
Jacob Katzenelson,Elie Milgrom +1 more
1
TL;DR: An extensible programming language (AEPL) which has been designed as a tool for the implementation of a large class of languages for specific applications and was extended to produce a language for the manipulation of linear graphs.
read more
Abstract: This paper presents an extensible programming language (AEPL) which has been designed as a tool for the implementation of a large class of languages for specific applications. AEPL includes a powerful data definition facility which enables one to define data structures and new types of data elements as well as new operators to manipulate both new and old data elements. A syntax driven parsing scheme derived from the Markov Algorithm makes it possible to control the syntax of the language dynamically, thus allowing one to define new language structures such as expressions and statements. As a result of the method used for syntactic definition, languages obtained by extension of AEPL belong to the general class of phrase structure languages, i.e. they are not restricted to the class of context-free languages. AEPL was extended to produce a language for the manipulation of linear graphs. Our experience indicates that such extensions are fairly simple and, in many cases, straight-forward.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A graded bibliography on macro systems and extensible languages
TL;DR: The segment treated, by no means exhaustively, deals with the spectrum of user-specializable programming systems from macro systems to extensible languages, and literature on the very general processor building and compiler compiler systems is omitted.
References
•Book
Programming Languages: History and Fundamentals
Jean E. Sammet
- 01 Jan 1969
TL;DR: The authors may not be able to make you love reading, but programming languages history and fundamentals will lead you to love reading starting from now.
311
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
TL;DR: The functional approach to data structures and the use of references insure that any process which accepts some data structure will accept any logically equivalent structure, regardless of its internal representation.
Toward an understanding of data structures
TL;DR: A notation and formalism is presented which could be part of a programming language, which allows a programmer who has expressed the semantics of an algorithm in terms of the graphs to then specify the implementation of some of his data structures in order to gain efficiency.
113
A proposal for definitions in ALGOL
Bernard A. Galler,Alan J. Perlis +1 more
TL;DR: In this article, an extension to ALGOL is proposed for adding new data types and operators to the language, where definitions may occur in any block heading and terminate with the block.
Dataless programming
R. M. Balzer
- 14 Nov 1967
TL;DR: A programmer using existing programming languages typically codes a problem by defining it, then analyzing the processing requirements, and on the basis of these requirements, choosing a data representation, and finally, coding the problem.
47