Recursive Adaptable Grammars (1998)
| Venue: | Master’s Thesis, Worchester Polytechnic Institute |
| Citations: | 8 - 2 self |
BibTeX
@TECHREPORT{Shutt98recursiveadaptable,
author = {John N. Shutt and John N. Shutt and Dr. Roy and S. Rubinstein and Major Advisor and Dr. Robert and E. Kinicki and Head Of Department},
title = {Recursive Adaptable Grammars},
institution = {Master’s Thesis, Worchester Polytechnic Institute},
year = {1998}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Context-Free Grammars (CFGs) are a simple and intuitively appealing formalism for the description of programming languages, but lack the computational power to describe many common language features. Over the past three decades, numerous extensions of the CFG model have been developed. Most of these extensions retain a CFG kernel, and augment it with a distinct facility with greater computational power. However, in all the most powerful CFG extensions, the clarity of the CFG kernel is undermined by the opacity of the more powerful extending facility. An intuitively appealing strategy for CFG extension is grammar adaptability, the principle that declarations in a program effectively modify the context-free grammar of the programming language. An adaptable grammar is equipped with some formal means for modifying its own CFG kernel. Most previous adaptable grammar formalisms have, unfortunately, failed to realize the potential clarity of this concept. In this thesis, a representative samp...
