Zusammenfassung
Eine Sprache L durch eine Grammatik G. Diese Grammatik legt fest, wie aus den Symbolen der Sprache korrekte Sätze gebildet werden.
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. Hopcroft, J.D. Ullman; “Formal Languages and their Relation to Automata” Addison-Wesley, Reading, Mass., 1969
W.L. Johnson et al.; “Automatic Generation of Efficient Lexical Processors using Finite State Techniques” CACM 11/12, 1968
R. Morris; “Scatter Storage Techniques” CACM 11/1, 1968
H. Maurer; “Theoretische Grundlagen der Programmiersprachen” BI-Hochschultaschenbücher, 404/404a, Mannheim, 1969
D.E. Knuth; “Top-Down syntax analysis” Acta Informatica 1/2, 1971
A.V. Aho, S.C. Johnson; “LR Parsing” Computing Surveys 6/2, 1974
F.L. DeRemer; “Simple LR(k) Grammars” CACM 14/7, 1971
W.R. LaLonde, E.S. Lee, J.J. Horning; “An LALR(k) Parser Generator” Proc. of IFIP Congress 1971, North-Holland, Amsterdam, 1972
J. Feldman, D. Gries; “Translator writing systems” CACM 11/2, 1968
H.L. Morgan; “Spelling Corrections in Systems Programs” CACM 13/2, 1970
S.L. Graham, S.P. Rhodes; “Practical Syntactic Error Recovery” CACM 18/11, 1975
R.P. Leinius; “Error Detection and Recovery for Syntax directed Compiler Systems” Ph.D. Thesis, University of Wisconsin, Madison, 1970
L. Meertens, J. van Vliet; “Repairing the Parenthesis Skeleton of ALG0L68 Programs” Math. Centrum, IW 2/73, Amsterdam, 1973
Rights and permissions
Copyright information
© 1978 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Jähnichen, S., Oeters, C., Willis, B. (1978). Analyse. In: Übersetzerbau. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-13897-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-663-13897-6_2
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-528-03331-6
Online ISBN: 978-3-663-13897-6
eBook Packages: Springer Book Archive