The use of grammatical inference for designing programming languages

Authors:
S. Crespi-Reghizzi;M. A. Melkanoff;L. Lichten
Affiliations:
Univ. of California at Los Angeles, Los Angeles;Univ. of California at Los Angeles, Los Angeles;Univ. of California at Los Angeles, Los Angeles
Venue:
Communications of the ACM
Year:
1973

Citing 7
Cited 13

Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Experience with an extensible language

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

Communications of the ACM
A syntax directed compiler for ALGOL 60

Communications of the ACM
Revised report on the algorithm language ALGOL 60

Communications of the ACM
A study of grammatical inference

A study of grammatical inference
The mechanical acquisition of precedence grammars

The mechanical acquisition of precedence grammars

Semantics-Based Inference Algorithms for Adaptive Visual Environments

IEEE Transactions on Software Engineering
Noncounting Context-Free Languages

Journal of the ACM (JACM)
Inductive Inference: Theory and Methods

ACM Computing Surveys (CSUR)
MPACT: microprocessor application to control-firmware translator

ACM SIGDA Newsletter
Learning Tree Languages from Text

COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Editing by example

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
When and how to develop domain-specific languages

ACM Computing Surveys (CSUR)
Speeding up the Synthesis of Programs from Traces

IEEE Transactions on Computers
Efficient Incremental Model for Learning Context-Free Grammars from Positive Structural Examples

SETN '08 Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications
Grammatical inference algorithms for the generation of visual languages

Journal of Visual Languages and Computing
A memetic grammar inference algorithm for language learning

Applied Soft Computing
Inference for transition network grammars

Computer Languages
Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences

Quantified Score

Hi-index	48.22

Visualization

Abstract

Both in designing a new programming language and in extending an existing language, the designer is faced with the problem of deriving a “natural” grammar for the language. We are proposing an interactive approach to the grammar design problem wherein the designer presents a sample of sentences and structures as input to a grammatical inference algorithm. The algorithm then constructs a grammar which is a reasonable generalization of the examples submitted by the designer. The implemention is presently restricted to a subclass of operator precedence grammars, but a second algorithm is outlined which applies to a larger class of context-free grammars.