Two Families of Languages Related to ALGOL

  title={Two Families of Languages Related to ALGOL},
  author={Seymour Ginsburg and H. Gordon Rice},
  journal={J. ACM},
A serious drawback in the application of modern data processing systems is the cost and time consumed in programming these complexes. The user's problems and their solutions are described in a natural language such as English. To utilize the services of a data processor, it is necessary to convert this language description into machine language, to wit, program steps. Recently, attempts have arisen to bridge the gap between these two languages. The method has been to construct languages (called… 
An extension of ALGOL-like languages
The notion of definability provides a mathematicM framework for analyzing the syntax of problemoriented languages and because the family of definable languages coincides with Chomsky 's family of context-free languages, there is now additional incentive to use context- free grammars for the same kind of analysis.
A compiler—compiler system
To the author's knowledge three other operational compiler-compiler systems, whose strategy is similar to the scheme documented here, have been developed. The Feldman system [6, 7, 8] is a bounded
The Interface Between Language Theory and Database Theory
  • J. Ullman
  • Computer Science
    Theoretical Studies in Computer Science
  • 1992
The relationship between languages and logical rules is summarized and there is a natural reduction from context-free grammars to a special case of logical rules called “chain rules” that is able to answer difficult questions about logical queries through language-theoretic notations and results.
Some remarks on the syntax of symbolic programming languages
The main aim is to point out certain peculiar features of SPL's which yield a deeper insight into their linguistic nature from a formal point of view, in order to take further steps in the direction of finding a proper way to define them.
On the relative efficiencies of context-free grammar
This paper describes a number of diverse recognition procedures that have been proposed for parsing sentences with respect to a context-free grammar and investigates the effieieneies of different recognition procedures for this class of grammars.
Xvii. Linguistics*
rule of G. A Tr-derivation of 0 is a sequence of strings l, .... ' n such that Tr = l , 6 = n , and ai+1 follows from O., for each i < n. The language L(G) generated by G is the set of strings x in
The Algebraic Theory of Context-Free Languages*
Publisher Summary This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial
The chapter discusses the different ways to describe the families of languages that are of interest to computer scientists, and the Intersection theorem is an indication towards determining appropriate families of language to study.
Operations Which Preserve Definability in Languages
A large number of specific operations-many occurring in data processing--arc shown to preserve definability and, depending on the operation, sequential definability.
Describing the syntax of programming languages using conjunctive and Boolean grammars
Grammars extended with conjunction and negation operators, known as conjunctive grammars and Boolean Grammars, are used to describe the set of well-formed programs in a simple typeless procedural programming language.


Report on the algorithmic language ALGOL 60
It was decided to hold an international meeting in January 1960 for improving the ALGOL language and preparing a final report, and seven representatives were selected to attend the January 1960 international conference.
Three models for the description of language
  • Noam Chomsky
  • Mathematics, Computer Science
    IRE Trans. Inf. Theory
  • 1956
It is found that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar, and the particular subclass of such processes that produce n -order statistical approximations to English do not come closer, with increasing n, to matching the output of anEnglish grammar.
Note on the Boolean Properties of Context Free Languages
This note answers the question for another family of languages, called "type 2" or "context free" by Chomsky (1959), and considers a context free grammar to be a finite set G of "rewriting rules" a --~ ~, where a is a single symbol and ~ is a finite string of symbols from a finite alphabet (vocabulary) V.
On Certain Formal Properties of Grammars
A sequence of restrictions that limit grammars first to Turing machines, then to two types of system from which a phrase structure description of the generated language can be drawn, and finally to finite state Markov sources are shown to be increasingly heavy.
Finite State Languages
A simple structural characterization theorem for finite state languages is established, based on the cyclical structure of the grammar, which shows that the complement of any finite state language formed on a given vocabulary of symbols is also a finite statelanguage.
Finite Automata and Their Decision Problems
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
1. A lattice-theoretical fixpoint theorem. In this section we formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices. In the following sections we give various
On formal properties of simple phrase structure grammars
  • On formal properties of simple phrase structure grammars
  • 1960
Regular canonical stems and finite automata. Department of Philosophy
  • Regular canonical stems and finite automata. Department of Philosophy
  • 1959
CHOMSKY, N Finite state languages. Information and Control
  • CHOMSKY, N Finite state languages. Information and Control
  • 1958