Thumbnail
Access Restriction
Subscribed

Author Crespi-Reghizzi, S. ♦ Melkanoff, M. A. ♦ Lichten, L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Extensible languages ♦ Grammar design ♦ Inference ♦ Identification in the limit ♦ Language definition
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.
Description Affiliation: Univ. of California at Los Angeles, Los Angeles (Crespi-Reghizzi, S.; Melkanoff, M. A.; Lichten, L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 2
Page Count 8
Starting Page 83
Ending Page 90


Open content in new tab

   Open content in new tab
Source: ACM Digital Library