Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: The theory of parsing, translating, and compiling. Prentice Hall 1972
Backhouse, R.C.: An alternative approach to the improvements of LR(k) parsers. Acta Informatica 6, 277–296 (1976)
Culik II, K., Cohen, R.: LR-regular grammars — an extension of LR(k)-grammars. Journal Comp. Syst. Sc. 7, 66–96 (1973)
Deussen, P.: A unified approach to the generation and acception of formal languages. Acta Informatica 9, 377–390 (1978)
DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14, 453–460 (1971)
Eickel, J., Loeckx, J.: The relation between derivations and syntactical structures in phrase-structure grammars. Journ. Comp. Syst. Sc. 6, 267–282 (1972)
Harrison, M.A., Havel, I.M.: On the parsing of deterministic languages. Journ. ACM 21, 525–548 (1974)
Geller, M.M., Harrison, M.A.: On LR(k) grammars and languages. Theor. Comp. Sc. 4, 245–276 (1977)
Hotz, G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron. Informationsverarb. Kybernetik 2, 235–246 (1966)
Langmaack, H.: Application of regular canonical systems to grammars translatable from left to right. Acta Informatica 1, 111–114 (1971)
Langmaack, H.: Zur Äquivalenz der Hotz'schen und Paul'schen Definition der Mehrdeutigkeit von Chomsky-Sprachen. in: 4. Kolloquium über Automatentheorie, Erlangen 1967
Loeckx, J.: An algorithm for the construction of bounded-context parsers. Comm. ACM 13, 297–307 (1970)
Loeckx, J.: The parsing for general phrase-structure grammars. Inform. Contr. 16, 443–464 (1970)
Mayer, O.: Syntaxanalyse. B.I. 1978
Nelson, R.J.: Introduction to automata. Wiley, New York 1968
Salomaa, A.: Formal languages. Academic Press, New York 1973
Szabő, P.: Der allgemeine LL-Akzeptor. Interner Bericht 3/78, Fakultät für Informatik, Universität Karlsruhe
Walters, D.A.: Deterministic context-sensitive languages. Inform. Contr. 17, 14–61 (1976)
Sattler, M.: Current diploma thesis
Drossopoulou, S.: Current diploma thesis
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deussen, P. (1979). One abstract accepting algorithm for all kinds of parsers. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive