{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T20:03:14Z","timestamp":1698091394943},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1980,9]]},"DOI":"10.1007\/bf00264257","type":"journal-article","created":{"date-parts":[[2006,2,19]],"date-time":"2006-02-19T05:11:41Z","timestamp":1140325901000},"page":"271-294","source":"Crossref","is-referenced-by-count":1,"title":["A survey of normal form covers for context free grammars"],"prefix":"10.1007","volume":"14","author":[{"given":"Anton","family":"Nijholt","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF00264257_CR1","volume-title":"The theory of parsing, translation and compiling, Vol. I and II","author":"AV Aho","year":"1972\/1973","unstructured":"Aho AV, Ullman JD (1972\/1973) The theory of parsing, translation and compiling, Vol. I and II, Prentice Hall, Englewood Cliffs, NJ"},{"key":"BF00264257_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0206027","volume":"6","author":"DB Benson","year":"1977","unstructured":"Benson DB (1977) Some preservation properties of normal form grammars. SIAM J Comput 6:381\u2013402","journal-title":"SIAM J Comput"},{"key":"BF00264257_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0022-0000(75)80051-1","volume":"11","author":"AB Cremers","year":"1975","unstructured":"Cremers AB, Ginsburg S (1975) Context-free grammar forms. J. Comput. System Sci. 11:86\u2013117","journal-title":"J. Comput. System Sci."},{"key":"BF00264257_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/comjnl\/11.1.31","volume":"11","author":"JM Foster","year":"1968","unstructured":"Foster JM (1968) A syntax improving program. Comput J. 11:31\u201334","journal-title":"Comput J."},{"key":"BF00264257_CR5","volume-title":"Automatic syntactic analysis","author":"JM Foster","year":"1970","unstructured":"Foster JM (1970) Automatic syntactic analysis. MacDonald, London"},{"key":"BF00264257_CR6","unstructured":"Gray JN, Harrison MA (1969) Single pass precedence analysis, IEEE Conf. Record of the 10th Annual Symposium on Switching and Automata Theory, 106\u2013117"},{"key":"BF00264257_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/321707.321708","volume":"19","author":"JN Gray","year":"1972","unstructured":"Gray JN, Harrison MA (1972) On the covering and reduction problems for context-free grammars. J. Assoc. Comput. Mach. 19:385\u2013395","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00264257_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/364914.364943","volume":"8","author":"TV Griffiths","year":"1965","unstructured":"Griffiths TV, Petrick SR (1965) On the relative efficiencies of context-free grammar recognizers. Comm. ACM 8, 289\u2013300","journal-title":"Comm. ACM"},{"key":"BF00264257_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0022-0000(73)80008-X","volume":"7","author":"MA Harrison","year":"1973","unstructured":"Harrison MA, Havel IM (1973) Strict deterministic grammars. J. Comput. System Sci. 7, 237\u2013277","journal-title":"J. Comput. System Sci."},{"key":"BF00264257_CR10","first-page":"185","volume":"1","author":"G Hotz","year":"1965","unstructured":"Hotz G (1965) Eine Algebraisierung des Syntheseproblems von Schaltkreisen, I und II. Elektron Informationsverarbeit Kybernetik 1:185\u2013231","journal-title":"Elektron Informationsverarbeit Kybernetik"},{"key":"BF00264257_CR11","first-page":"235","volume":"2","author":"G Hotz","year":"1966","unstructured":"Hotz G (1966) Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron Informationsverarbeit Kybernetik 2:235\u2013246","journal-title":"Elektron Informationsverarbeit Kybernetik"},{"key":"BF00264257_CR12","first-page":"65","volume":"4","author":"G Hotz","year":"1978","unstructured":"Hotz G (1978) Normal-form transformations of context-free grammars. Acta Cybernet. 4:65\u201384","journal-title":"Acta Cybernet."},{"key":"BF00264257_CR13","first-page":"73","volume":"15","author":"G Hotz","year":"1979","unstructured":"Hotz G, Ross RJ (1979) LL(k)-und LR(k)-Invarianz von kontextfreien Grammatiken unter einer Transformation auf Greibach Normalform. Elektron Informationsverarbeit Kybernetik 15:73\u201386","journal-title":"Elektron Informationsverarbeit Kybernetik"},{"key":"BF00264257_CR14","unstructured":"Hunt HB, Rosenkrantz DJ (1977) Complexity of grammatical similarity relations. Proc. of the Conf. on Theoretical Computer Science, Waterloo 139\u2013145"},{"key":"BF00264257_CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0304-3975(76)90088-8","volume":"2","author":"HB Hunt","year":"1976","unstructured":"Hunt HB, Rosenkrantz DJ, Szymanski TG (1976) The covering problem for linear context-free grammars. Theor. Comput. Sci. 2:361\u2013382","journal-title":"Theor. Comput. Sci."},{"key":"BF00264257_CR16","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0022-0000(76)80038-4","volume":"12","author":"HB Hunt","year":"1976","unstructured":"Hunt HB, Rosenkrantz DJ, Szymanski TG (1976) On the equivalence, containment and covering problems for regular and context-free languages. J. Comput. System Sci. 12:222\u2013268","journal-title":"J. Comput. System Sci."},{"key":"BF00264257_CR17","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1145\/365876.365915","volume":"9","author":"S Kuno","year":"1966","unstructured":"Kuno S (1966) The augmented predictive analyzer for context-free languages \u2014 Its relative efficiency. Comm. ACM 9:810\u2013823","journal-title":"Comm. ACM"},{"key":"BF00264257_CR18","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/365719.365984","volume":"9","author":"R Kurki-Suonio","year":"1966","unstructured":"Kurki-Suonio R (1966) On top-to-bottom recognition and left recursion. Comm. ACM 9:527\u2013528","journal-title":"Comm. ACM"},{"key":"BF00264257_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/321921.321924","volume":"23","author":"MD Mickunas","year":"1976","unstructured":"Mickunas MD (1976) On the complete covering problem for LR(k) grammars. J. Assoc. Comput. Mach. 23:17\u201330","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00264257_CR20","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1145\/321958.321972","volume":"23","author":"MD Mickunas","year":"1976","unstructured":"Mickunas MD, Lancaster RL, Schneider VB (1976) Transforming LR(k) grammars to LR(1), SLR(1) and (1,1) bounded right context grammars. J. Assoc. Comput. Mach. 23:511\u2013533","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00264257_CR21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01931223","volume":"19","author":"A Nijholt","year":"1979","unstructured":"Nijholt A (1979) Grammar functors and covers: From non-left-recursive to Greibach normal form grammars. BIT 19:73\u201378","journal-title":"BIT"},{"key":"BF00264257_CR22","doi-asserted-by":"crossref","unstructured":"Nijholt A (1977) On the covering of left-recursive grammars. Conf. Record of the 4th ACM Symposium on Principles of Programming Languages 86\u201396","DOI":"10.1145\/512950.512959"},{"key":"BF00264257_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(79)90109-1","volume":"9","author":"A Nijholt","year":"1979","unstructured":"Nijholt A (1979) From left regular to Greibach normal form grammars. Information Processing Lett. 9:51\u201355","journal-title":"Information Processing Lett."},{"key":"BF00264257_CR24","series-title":"Lecture Notes in Computer Science Vol. 71","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/3-540-09510-1_35","volume-title":"Proc. 6th Int. Coll. on Automata, Languages and Programming","author":"A Nijholt","year":"1979","unstructured":"Nijholt A (1979) Structure preserving transformations on non-left-recursive grammars. Proc. 6th Int. Coll. on Automata, Languages and Programming. Maurer HA (ed) Springer, Berlin Heidelberg New York (Lecture Notes in Computer Science Vol. 71 p 446)"},{"key":"BF00264257_CR25","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0022-0000(77)80027-5","volume":"15","author":"A Nijholt","year":"1977","unstructured":"Nijholt A (1977) On the covering of parsable grammars. J. Comput. System Sci. 15:99\u2013110","journal-title":"J. Comput. System Sci."},{"key":"BF00264257_CR26","series-title":"Informatica report 52","volume-title":"A survey of normal form covers for regular grammars","author":"A Nijholt","year":"1979","unstructured":"Nijholt A (1979) A survey of normal form covers for regular grammars. Informatica report 52, Vrije Universiteit, Amsterdam"},{"key":"BF00264257_CR27","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0022-0000(68)80037-6","volume":"2","author":"MC Paull","year":"1968","unstructured":"Paull MC, Unger SH (1968) Structural equivalence of context-free grammars. J. Comput. System Sci. 2:427\u2013463","journal-title":"J. Comput. System Sci."},{"key":"BF00264257_CR28","series-title":"CS-78-048","volume-title":"A general Greibach normal form transformation","author":"RJ Ross","year":"1978","unstructured":"Ross RJ, Hotz G, Benson DB (1978) A general Greibach normal form transformation. CS-78-048, Washington State University, Pullman"},{"key":"BF00264257_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(79)90052-5","volume":"8","author":"E Soisalon-Soininen","year":"1979","unstructured":"Soisalon-Soininen E (1979) On the covering problem for left-recursive grammars. Theor. Comput. Sci. 8:1\u201312","journal-title":"Theor. Comput. Sci."},{"key":"BF00264257_CR30","unstructured":"Stearns RE (1971) Deterministic top-down parsing. Proc. 5th Princeton Conf. on Information Sciences and Systems 182\u2013188"},{"key":"BF00264257_CR31","series-title":"Lecture Notes in Computer Science Vol. 84","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-08921-7_100","volume-title":"Proc. 7th Int. Sympos. on Mathematical Foundations of Computer Science","author":"E Ukkonen","year":"1978","unstructured":"Ukkonen E (1978) Transformations to produce certain covering grammars. Proc. 7th Int. Sympos. on Mathematical Foundations of Computer Science. Winkowski J (ed) Springer, Berlin Heidelberg New York (Lecture Notes in Computer Science Vol. 84 p 516)"},{"key":"BF00264257_CR32","series-title":"Lecture Notes in Computer Science Vol. 67","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-09118-1_31","volume-title":"Proc. 4th GI Conference on Theoretical Computer Science","author":"E Ukkonen","year":"1979","unstructured":"Ukkonen E (1979) Remarks on the non-existence of some covering grammars. Proc. 4th GI Conference on Theoretical Computer Science. Weihrauch K (ed) Springer, Berlin Heidelberg New York (Lecture Notes in Computer Science Vol. 67 p 298)"},{"key":"BF00264257_CR33","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0020-0190(79)90020-6","volume":"8","author":"E Ukkonen","year":"1978","unstructured":"Ukkonen E (1978) The non-existence of some covering context-free grammars. Information Processing Lett. 8:187\u2013192","journal-title":"Information Processing Lett."},{"key":"BF00264257_CR34","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1093\/comjnl\/12.2.139","volume":"12","author":"D Wood","year":"1969","unstructured":"Wood D (1969) The normal form theorem \u2014 another proof. Comput. J. 12:139\u2013147","journal-title":"Comput. J."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264257.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264257\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T17:14:45Z","timestamp":1554311685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["BF00264257"],"URL":"https:\/\/doi.org\/10.1007\/bf00264257","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}