Zusammenfassung
Der Parser realisiert die syntaktische Analyse von Programmen. Er erhält die Programme in Form einer vom Scanner/Sieber hergestellten Folge von Symbolen. Seine Aufgabe ist es, in diesen Folgen von Symbolen die syntaktische Struktur der Programme zu finden, d.h. Teilfolgen zu immer größeren syntaktischen Einheiten zusammenzufassen
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.
Literaturhinweise
J. Hoperoft, J.D. Ullman. Introduction to Automata Theory, Lan- guages and Computation. Addison—Wesley, 1979.
M.A. Harrison. Introduction to Formal Language Theory. Addison Wesley, 1983.
O. Mayr. Syntaxanalyse. BI, 1978.
U. Möncke, R. Wilhelm. Iterative Algorithms on Grammar Graphs.In Proc. 8th Conference on Graphtheoretic Concepts in Computer Science, pp. 177–194. Hauser, 1982.
U. Möncke. Generierung von Systemen zur Transformation attribu- tierter Operatorbäume; Komponenten des Systems und Mechanis- men der Generierung. Diss. Univ. des Saarlandes, 1985.
U. Möncke, R. Wilhelm. Grammar Flow Analysis. In H. Alblas, B. Melichar (Hrsg.), Attribute Grammars, Applications and Systems, LNCS 545. Springer, 1991.
B. Courcelle. Equivalences and Transformations of Regular Systems Applications to Program Schemes and Grammars. In Theor. Comp. Sci. 42, pp. 1–122, 1986
P.M. Lewis II, R.E. Stearns. Syntax Directed Transduction. In IEEE 7. Annual Symposium on Switching and Automata Theory, pp. 21–35 ,1966
P.M. Lewis II, R.E. Stearns. Syntax Directed Transduction. In Jour-nal of the ACM 15, pp. 464–488, 1968
R. Heckmann. An Efficient ELL (1)-Parser Generator. In Acta Informatica 23, pp. 127–148, 1986.
N. Wirth. Algorithms + Data Structures = Programs, Chapter 5. Prentice Hall, 1978.
J. Lewi, K. DeVlaminck, J. Huens, E. Steegmans. A Programming Methodology in Compiler Construction, part 2. North Holland, 1982.
D.E. Knuth. On the Translation of Languages from Left to Right. In Information and Control 8, pp. 607–639, 1965.
F.L. DeRemer. Practical Translators for LR(k) Languages. Ph.D. Thesis, MIT, 1969.
F.L. DeRemer. Simple LR(k) Grammars. In Communications of the ACM 14, pp. 453–460, 1971.
F.L. DeRemer, T. Penello. E f ficient Computation of LALR(1) Look—Ahead Sets. In ACM Transactions on Programming Languages and Systems 4(4), pp. 615–649, 1982.
T.J. Penello, F.L. DeRemer. A Forward Move for LR Error Re- covery. In Proc. 5th ACM Symp. on Principles of Programming Languages, pp. 241–254, 1978
A. Nijholt. Deterministic Top-Down and Bottom-Up Parsing, His-torical Notes and Bibliographies. Mathematical Centre Amsterdam, 1983.
J. Cohen, T.J. Hickey. Parsing and Compiling Using Prolog. In ACM Transactions on Programming Languages and Systems 9(2), 1987.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wilhelm, R., Maurer, D. (1992). Syntaktische Analyse. In: Übersetzerbau. Springer-Lehrbuch. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-00077-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-00077-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-00078-6
Online ISBN: 978-3-662-00077-9
eBook Packages: Springer Book Archive