LL-regular grammars. (English) Zbl 0314.68026


68Q45 Formal languages and automata
Full Text: DOI


[1] Culik, K., Syntactical analysis, (1971), Department of Applied Analysis and Computer Science, University of Waterloo
[2] Culik, K.; Cohen, R., LR-regular grammars – an extension of LR(/:) grammars, J. computer and system sciences, 7, 66-96, (1973) · Zbl 0253.68014
[3] Ginsburg, S., The mathematical theory of context free languages, (1966), Mc Graw-Hill Book Company · Zbl 0184.28401
[4] Grics, D., Compiler construction for digital computers, (1971), John Wiley and Sons, Inc
[5] Knuth, D.E., Top-down syntax analysis, Acta informatica, 17, 226-256, (1970)
[6] Kurki-Suonia, R., Notes on top-down languages, Bit, 9, 225-238, (1969) · Zbl 0187.27905
[7] Lewis, P.M.; Stearns, R.E., Syntax-directed transductions, Jacm, 15, 465-488, (1969) · Zbl 0164.32102
[8] Maluszyński, J., Substring languages, (), 274-284, Mathematical Foundations of Computer Science · Zbl 0323.68050
[9] Rosenkrantz, D.J.; Stearns, R.E., Properties of deterministic top-down grammars, Information and control, 17, 226-236, (1970) · Zbl 0209.02703
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.