Poplawski, David A. On LL-regular grammars. (English) Zbl 0411.68060 J. Comput. Syst. Sci. 18, 218-227 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 7 Documents MSC: 68Q45 Formal languages and automata 68N20 Theory of compilers and interpreters Keywords:regular context-free grammars; parsing; top-down algorithm PDF BibTeX XML Cite \textit{D. A. Poplawski}, J. Comput. Syst. Sci. 18, 218--227 (1979; Zbl 0411.68060) Full Text: DOI OpenURL References: [1] Aho, A.V.; Ullman, J.D., () [2] Culik, K., Contribution to deterministic top-down analysis of context-free languages, Kybernetika (Prague), 4, 5, 422-431, (1968) · Zbl 0169.31401 [3] Culik, K.; Comm, R., LR-regular grammars-an extension of LR(k) grammars, J. comput. system sci., 7, 66-96, (1973) · Zbl 0253.68014 [4] Jaxzaeek, S.; Krawczyx, T., LL-regular grammars, Information processing lett., 4, 2, 31-37, (1975) [5] Knuth, D.E., Top down syntax analysis, Acta informatioa, 1, 2, 79-110, (1971) · Zbl 0233.68022 [6] Lewis, P.M.; Rosenkrantz, P.J.; Stearns, R.E., Attributed translations, J. comput. system sci., 9, 279-307, (1974) · Zbl 0308.68073 [7] Nijholt, A., On the parsing of LL-regular grammars, (), 446-452 [8] {\scA. Nijholt}, private communication. [9] {\scW. Ogden}, private communication to K. Culik. 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.