LL-regular grammars. (English) Zbl 0452.68083


68Q45 Formal languages and automata
68N20 Theory of compilers and interpreters
Full Text: DOI


[1] Aho A.V., The Theory of Parsing, Translation and Compiling 1 (1972)
[2] Anisimov, A.V. 1973. Top-down analysis of programming languages without backtracking. Proc. 2nd Symp. on Mathematical Foundations of Computer Science. 1973. pp.175–180. Czechoslovakia: High Tatras. in Russian
[3] Beatty J.C., Iteration theorems for the LL(k) languages (1977) · Zbl 0452.68084
[4] Culik K., Kybernetika 4 pp 422– (1968)
[5] Culik K., J. Comput. System Sci 7 pp 66– (1973) · Zbl 0253.68014
[6] Friede, D. Transition diagrams and strict deterministic grammars. 4th GI Conf. on Theoretical Computer Science. Edited by: Weihrauch, K. Vol. 67, pp.113–123. Berlin: Springer. Aachen, Lecture Notes in Computer Science
[7] Geller M.M., Theor. Compute Sci 4 pp 245– (1977) · Zbl 0357.68083
[8] Jarzabek S., Prace Instytutu Màszyn Matematycznych 16 pp 95– (1974)
[9] Jarzabek S., Information Processing Letters 4 pp 31– (1975) · Zbl 0314.68026
[10] Nijholt, A. On the parsing of LL-regular grammars. Proc. 5th Symp. on Mathematical Foundations of Computer Science. Edited by: Mazurkiewicz, A. Vol. 45, pp.446–452. Berlin: Springer. Gdansk, Lecture Notes in Computer Science · Zbl 0335.68053
[11] Nijholt, A. and Soisalon-Soininen, E.Ch(k) grammars: A ckaracterization ofLL(k) languages. Proc. 8th Symp. on Mathematical Foundations of Computer Science. Edited by: Becvar, J. Vol. 74, pp.390–397. Berlin: Springer. Olomouc, Lecture Notes in Computer Science · Zbl 0409.68047
[12] Poplawski D.A., J. Comput System Sci 18 pp 218– (1979) · Zbl 0411.68060
[13] Rosenkrantz, D.J. and Lewis, P.M. II. Deterministic left corner parsing. Proc. 11th Annual IEEE Symp. pp.139–152. Springer. on Switching and Automata Theory
[14] Rosenkrantz D.J., Info, and Control 17 pp 226– (1970) · Zbl 0209.02703
[15] Soisalon-Soininen E., Characterization of LL(k) languages by restricted LR(k) grammars (1977) · Zbl 0409.68047
[16] Wood D., Lecture Notes on Top-down Syntax Analysis
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.