Abstract
In preceding chapters the notion of M-grammar has been introduced informally and step by step. Chapter 2 introduced compositional grammars with rules operating on symbol strings. In Chapter 3, linguistic considerations led to the introduction of M-grammars with rules operating on S-trees. The relation between lexical S-trees and strings is provided by a separate morphological component, which was discussed in Chapter 6. In order to solve problems associated with writing large grammars, in Chapter 8 the original notion of an M-grammar as a free production system has been refined with notions like subgrammars, rule classes, transformations and control expressions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Rosetta, M.T. (1994). The formal definition of M-grammars. In: Compositional Translation. The Springer International Series in Engineering and Computer Science, vol 273. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8306-0_17
Download citation
DOI: https://doi.org/10.1007/978-94-015-8306-0_17
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5797-6
Online ISBN: 978-94-015-8306-0
eBook Packages: Springer Book Archive