Abstract
Restriction Grammar is described in Hirschman (1986) as a “grammar-writing framework in Prolog.” The Restriction Grammar framework (Sager, 1967, 1981; Sager and Grishman 1975), following its origins in Sager’s String Grammars, consists of BNF (context-free) definitions for syntax, coupled with constraints or restrictions on the structure of the parse tree. The RG formalism automatically constructs the parse tree: thus it differs from the Metamorphosis Grammar and Definite Clause Grammar formalisms which do not, but not from later logic grammar formalisms such as Modifier Structure Grammar and Definite Clause Translation Grammars which do. The portion of the Restriction Grammar that is not context-free is specified by “restrictions” on the structure of the parse tree, rather than by augmentation of the nonterminal symbols with extra arguments as in Definite Clause Grammars.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Abramson, H., Dahl, V. (1989). Other Formalisms. In: Logic Grammars. Symbolic Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3640-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-3640-5_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8188-7
Online ISBN: 978-1-4612-3640-5
eBook Packages: Springer Book Archive