Abstract
Since this course is not solely concerned with syntax analysis, a choice has had to be made amongst a large number of possible methods. We have chosen to present the two methods which seem to be the most fundamental in theoretical terms. The choice was, of course, much easier amongst top-down methods, of which there are few. The LL(1) techniques described in this chapter were discovered by Foster [Foster 68] and received a theoretical treatment in [Knuth 71]. The method is topdown, deterministic with one character of look-ahead.
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.
Similar content being viewed by others
References
K. ALBER - P. OLIVA - G. URSCHLER: Concrete Syntax of PL/1, IBM Vienna Laboratory, TR 25. 084, 1968
J.W. BACKUS et al: Report on the Algorithmic Language ALGOL 60 CACM, Vol.3, N° 5, May 1960
M. BERTHAUD - M. GRIFFITHS: Incremental Compilation and Conversational Interpretation Ann. Rev. in Aut. Prog., 7, 1973
J. BORDIER: Methodes pour la mise au point de grammaires LL(1) Thesis, University of Grenoble, 1971
M.E. CONWAY: Design of a Separable Transition Diagram Compiler CACM, Vol.6, N°7, July 1963
I.F. CURRIE, M. GRIFFITHS: A Self-Transferring Compiler R.R.E. Malvern, Memo 2358, 1957
J.M. FOSTER: A Syntax Improving Device Computer Journal, May 1968
S.A. GREIBACH: Formal Parsing Systems, CACM, Vo1.7, N°8, Aug. 1964
S.A. GREIBACH: A New Normal Form Theorem for Context-Free Phrase Structure Grammars JACM, 12, pps. 42–52, 1965
M. GRIFFITHS: Analyse Déterministe et Compilateurs Thesis, University of Grenoble, Oct. 1969
M. GRIFFITHS - G. TERRINE Submitted for publication, 1974
D.E. KNUTH: Top-Down Syntax Analysis, Acta Informatica, Vol. 1, pp. 79–110, 1971
R. KURKI-SUONIO: Notes on Top-Down Languages BIT 9, N° 3, 1969
P. LUCAS: Die Struckturanalyse vom Formelübersetzen Elektron. Rechenanl. 3, 1961
D.J. ROSENKRANTZ, R.E. STEARNS: Properties of Deterministic Top-Down Grammars ACM Symposium, Marina del Rey, 1969
A. SALOMAA: Theory of Automata Pergamon, 1969
S. WARSHALL: A Theorem on Boolean Matrices JACM, Vol.9, N°1, Jan. 1962
P.M. WOODWARD - P.R. WETHERALL - B. GORMAN Official Definition of CORAL 66,H.M.S.O. London, 1970
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
Griffiths, M. (1974). LL(1) Grammars and Analysers. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-21549-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06958-4
Online ISBN: 978-3-662-21549-4
eBook Packages: Springer Book Archive