iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/BF00268320
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T19:17:20Z","timestamp":1672255040436},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1979,11,1]],"date-time":"1979-11-01T00:00:00Z","timestamp":310262400000},"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":[[1979,11]]},"DOI":"10.1007\/bf00268320","type":"journal-article","created":{"date-parts":[[2004,9,30]],"date-time":"2004-09-30T03:48:17Z","timestamp":1096516097000},"page":"339-369","source":"Crossref","is-referenced-by-count":11,"title":["A method for transforming grammars into LL(k) form"],"prefix":"10.1007","volume":"12","author":[{"given":"Eljas","family":"Soisalon-Soininen","sequence":"first","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing. Englewood Cliffs, N.J.: Prentice-Hall 1972"},{"key":"CR2","volume-title":"The Theory of Parsing, Translation, and Compiling, Vol. II: Compiling","author":"A.V. Aho","year":"1973","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, Vol. II: Compiling. Englewood Cliffs, N.J.: Prentice-Hall 1973"},{"key":"CR3","volume-title":"Ph.D. Thesis","author":"B.M. Brosgol","year":"1974","unstructured":"Brosgol, B.M.: Deterministic translation grammars. Harvard University, Cambridge, Mass., Ph.D. Thesis, 1974"},{"key":"CR4","volume-title":"Recursive Programming Techniques","author":"W.H. Burge","year":"1975","unstructured":"Burge, W.H.: Recursive Programming Techniques. Reading, Mass.: Addison-Wesley 1975"},{"key":"CR5","volume-title":"The Theory and Construction of Compilers","author":"T.E. Cheatham Jr.","year":"1967","unstructured":"Cheatham, T.E., Jr.: The Theory and Construction of Compilers. Wakefield, Mass.: Computer Associates 1967"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Demers, A.: Generalized left corner parsing. Conf. Record of the Fourth ACM Symposium on Principles of Programming Languages, pp. 170?182 (1977)","DOI":"10.1145\/512950.512966"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1093\/comjnl\/11.1.31","volume":"11","author":"J.M. Foster","year":"1968","unstructured":"Foster, J.M.: A syntax improving program. Comput. J. 11, 31?34 (1968)","journal-title":"Comput. J."},{"issue":"1","key":"CR8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. J. Assoc. Comput. Mach. 12:1, 42?52 (1965)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-662-21549-4_3","volume-title":"Compiler Construction: An Advanced Course, Lecture Notes in Computer Science, Vol. 21","author":"M. Griffiths","year":"1974","unstructured":"Griffiths, M.: LL(1) grammars and analysers. In: Compiler Construction: An Advanced Course, Lecture Notes in Computer Science, Vol. 21 (F.L. Bauer, J. Eickel, eds.), pp. 57?84. Berlin-Heidelberg-New York: Springer 1974"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/364914.364943","volume":"8","author":"T.V. Griffiths","year":"1965","unstructured":"Griffiths, T.V., Petrick, S.R.: On the relative efficiencies of context-free grammar recognizers. Comm. ACM. 8, 289?300 (1965)","journal-title":"Comm. ACM."},{"key":"CR11","first-page":"80","volume-title":"Proc. of the IFIP congress 68, Vol. 1","author":"T.V. Griffiths","year":"1969","unstructured":"Griffiths, T.V., Petrick, S.R.: Top-down versus bottom-up analysis. In: Proc. of the IFIP congress 68, Vol. 1 (A.J.H. Morrell, ed.), pp. 80?85. Amsterdam: North-Holland 1969"},{"key":"CR12","series-title":"Project MAC Technical Report TR-119","volume-title":"A new grammatical transformation into deterministic top-down form","author":"M. Hammer","year":"1974","unstructured":"Hammer, M.: A new grammatical transformation into deterministic top-down form. MIT, Mass., Project MAC Technical Report TR-119, 1974"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Hammer, M.: A new grammatical transformation into LL(k) form. Proc. of Sixth Annual ACM Symposium on Theory of Computing, pp. 266?275 (1974)","DOI":"10.1145\/800119.803904"},{"key":"CR14","volume-title":"Compiling Techniques","author":"F.R.A. Hopgood","year":"1969","unstructured":"Hopgood, F.R.A.: Compiling Techniques. New York, N.Y.: American Elsevier 1969"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/366062.366083","volume":"4","author":"E.T. Irons","year":"1961","unstructured":"Irons, E.T.: A syntax directed compiler for ALGOL 60. Comm. ACM. 4, 51?55 (1961)","journal-title":"Comm. ACM."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D.E. Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Information and Control 8, 607?639 (1965)","journal-title":"Information and Control"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth, D.E.: Top-down syntax analysis. Acta Informat. 1, 79?110 (1971)","journal-title":"Acta Informat."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1093\/comjnl\/17.3.242","volume":"17","author":"T. Komor","year":"1974","unstructured":"Komor, T.: A note on left factored languages. Comput. J. 17, 242?244 (1974)","journal-title":"Comput. J."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/365719.365984","volume":"9","author":"R. Kurki-Suonio","year":"1966","unstructured":"Kurki-Suonio, R.: On top-to-bottom recognition and left recursion. Comm. ACM. 9, 527?528 (1966)","journal-title":"Comm. ACM."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01946814","volume":"9","author":"R. Kurki-Suonio","year":"1969","unstructured":"Kurki-Suonio, R.: Notes on top-down languages. BIT 9, 225?238 (1969)","journal-title":"BIT"},{"key":"CR21","volume-title":"Compiler Design Theory","author":"P.M. Lewis II","year":"1976","unstructured":"Lewis, P.M., II, Rosenkrantz, D.J., Stearns, R.E.: Compiler Design Theory. Reading, Mass.: Addison-Wesley 1976"},{"key":"CR22","first-page":"464","volume":"15","author":"P.M. Lewis II","year":"1968","unstructured":"Lewis, P.M., II, Stearns, R.E.: Syntax directed transduction. J. Assoc. Comput. Mach. 15, 464?488 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Nijholt, A.: On the covering of left-recursive grammars. Conf. Record of the Fourth ACM Symposium on Principles of Programming Languages, pp. 86?96 (1977)","DOI":"10.1145\/512950.512959"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"D.J. Rosenkrantz","year":"1967","unstructured":"Rosenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. J. Assoc. Comput. Mach. 14, 501?507 (1967)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Rosenkrantz, D.J., Lewis, P.M., II: Deterministic left corner parsing. IEEE Conf. Record of 11th Annual Symposium on Switching and Automata Theory, pp. 139?152 (1970)","DOI":"10.1109\/SWAT.1970.5"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D.J. Rosenkrantz","year":"1970","unstructured":"Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Information and Control 17, 226?256 (1970)","journal-title":"Information and Control"},{"key":"CR27","series-title":"Report A-1977-3","volume-title":"Characterization of LL(k) languages by restricted LR(k) grammars","author":"E. Soisalon-Soininen","year":"1977","unstructured":"Soisalon-Soininen, E.: Characterization of LL(k) languages by restricted LR(k) grammars. Department of Computer Science, University of Helsinki, Helsinki, Report A-1977-3, 1977"},{"key":"CR28","first-page":"20","volume-title":"Automata, Languages and Programming, Third Colloquium","author":"E. Soisalon-Soininen","year":"1976","unstructured":"Soisalon-Soininen, E., Ukkonen, E.: A characterization of LL(k) languages. In: Automata, Languages and Programming, Third Colloquium (S. Michaelson, R. Milner, eds.), pp. 20?30. Edinburgh: Edinburgh University Press 1976"},{"key":"CR29","unstructured":"Stearns, R.E.: Deterministic top-down parsing. Proc. Fifth Annual Princeton Conf. on Information Sciences and Systems, pp. 182?188 (1971)"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1093\/comjnl\/12.2.139","volume":"12","author":"D. Wood","year":"1969","unstructured":"Wood, D.: The normal form theorem ? another proof. Comput. J. 12, 139?147 (1969)","journal-title":"Comput. J."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00268320\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00268320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T15:21:11Z","timestamp":1554304871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00268320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,11]]}},"alternative-id":["BF00268320"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf00268320","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,11]]}}}