“Structural connections” in formal languages

Authors:
E. T. Irons
Affiliations:
Institute for Defense Analyses, Princeton, NJ
Venue:
Communications of the ACM
Year:
1964

Citing 2
Cited 7

A syntax directed compiler for ALGOL 60

Communications of the ACM
Report on the algorithmic language ALGOL 60

Communications of the ACM

The Cellar Principle of State Transition and Storage Allocation

IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
General Problems of Formal Grammars

Journal of the ACM (JACM)
An algorithm for the construction of bounded-context parsers

Communications of the ACM
Translator writing systems

Communications of the ACM
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
An undergraduate program in computer science—preliminary recommendations

Communications of the ACM

Quantified Score

Hi-index	48.30

Visualization

Abstract

This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages. Languages discussed vary in complexity from those with essentially no structure at all to languages which are self-defining. The relationship between some existing recognition techniques for several language classes is examined, as well as implications of language structure on the complexity of automatic recognizers.