Abstract
The paper describes a top-down syntactical analysis, where the goals are not nonterminals but syntactical vectors, delivering after completion an integer value. This value is used to select the subsequent vector. Some grammar transforming algorithms are presented which, at the cost of increasing the size of the grammar, make the parsing more efficient.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Strobel, R. (1977). Some automatic transformations of CF-grammars. In: Ershov, A., Koster, C.H.A. (eds) Methods of Algorithmic Language Implementation. Lecture Notes in Computer Science, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08065-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-08065-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08065-7
Online ISBN: 978-3-540-37510-4
eBook Packages: Springer Book Archive