Abstract
A “grammar” is a formal device for specifying a potentially infinite “language” (set of strings) in a finite way. Strings in the lanaguage are generated by starting with a string consisting of one particular “start symbol” and successively rewriting the string according to a finite set of rewriting rules or “productions”. Grammars of interest here impose a structure, called a “derivation tree”, on the string generated. Formally, grammars are defined as follows.
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.
References
Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Englewood Cliffs (N.J.): Prentice-Hall 1972
DeRemer, F.L.: Practical translators for LR(k) langauges. Ph.D. Thesis, M.I.T. Cambridge (Mass.) 1969
Earley, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94–102 (1970)
Eickel, J., Paul, M., Bauer, F.L., Samelson, K.: A syntax controlled generator of formal language processors. Comm. ACM 6, 451–455 (1963)
Feldman, J.A., Gries, D.: Translator writing systems. Comm. ACM 11, 77–113 (1968)
Floyd, R.W.: On ambiguity in phrase-structure languages. Comm. ACM 5, 526 (1962)
Floyd, R.W.: Syntactic analysis and operator precedence. J. ACM 10, 316–333 (1963)
Floyd, R.W.: The syntax of programming languages–a survey. IEEE Trans. Electronic Computers 13, 346–353 (1964)
Hoperoft, J., Ullman, J.: Formal languages and their relation to automata. Reading (Mass.): Addison-Wesley 1969
Ichbiah, J., Morse, S.: A technique for generating almost optimal Floyd-Evans productions of precedence grammars. Comm. ACM 13, 501–508 (1970)
Knuth, D.E.: On the translation of languages from left to right. Information and Control 8, 607–639 (1965)
Lewis, P.M., Stearns, R.E.: Syntax-directed transductions. J. ACM 15, 465–488 (1968)
McKeeman, W.M.: An approach to computer language. design. Ph.D. Thesis, Stanford University 1966
Wirth, N., Weber, H.: EULER–A generalization of ALGOL and its definition. Comm. ACM 9, 13–25, 89–99 (1966)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
DeRemer, F.L. (1974). Review of Formalisms and Notations. In: Bauer, F.L., Eickel, J. (eds) Compiler Construction. Lecture Notes in Computer Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21549-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-21549-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06958-4
Online ISBN: 978-3-662-21549-4
eBook Packages: Springer Book Archive