{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T00:52:37Z","timestamp":1672966357790},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,5,1]],"date-time":"1984-05-01T00:00:00Z","timestamp":452217600000},"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":[[1984,5]]},"DOI":"10.1007\/bf00289138","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T21:07:11Z","timestamp":1096924031000},"page":"29-45","source":"Crossref","is-referenced-by-count":9,"title":["LALR(1, 1) parser generation for regular right part grammars"],"prefix":"10.1007","volume":"21","author":[{"given":"N. P.","family":"Chapman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Principles of Compiler Design","author":"A.V. Aho","year":"1977","unstructured":"Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Reading, MA.: Addison-Wesley 1977"},{"issue":"7","key":"CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/362619.362625","volume":"14","author":"F.L. DeRemer","year":"1971","unstructured":"DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14(7), 453?460 (1971)","journal-title":"Comm. ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/872732.806968","volume":"8","author":"F.L. DeRemer","year":"1979","unstructured":"DeRemer, F.L., Pennello, T.J.: Efficient computation of LALR(1) lookahead sets. Proceedings of the ACM Sigplan conference on compiler construction, Sigplan Notices 8, 176?187 (1979)","journal-title":"Sigplan Notices"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/69622.357187","volume":"4","author":"F.L. DeRemer","year":"1982","unstructured":"DeRemer, F.L., Pennello, T.J.: Efficient computation of LALR(1) lookahead sets, ACM Toplas 4, 615?649 (1982)","journal-title":"ACM Toplas"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","volume":"8","author":"J. Eve","year":"1977","unstructured":"Eve, J., Kurki-Suono, R.: On computing the transitive closure of a relation. Acta Informatica 8, 303?314 (1977)","journal-title":"Acta Informatica"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00264023","volume":"11","author":"S. Heilbrunner","year":"1979","unstructured":"Heilbrunner, S.: On the definition of ELR(k) and ELL(k) grammars. Acta Informatica 11, 169?176 (1979)","journal-title":"Acta Informatica"},{"key":"CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1977","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Reading, MA.: Addison-Wesley 1977"},{"key":"CR8","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":"CR9","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1145\/359842.359853","volume":"20","author":"W.R. LaLonde","year":"1977","unstructured":"LaLonde, W.R.: Regular right part grammars and their parsers. Comm. ACM 20, 731?741 (1977)","journal-title":"Comm. ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00264024","volume":"11","author":"W.R. LaLonde","year":"1979","unstructured":"LaLonde, W.R.: Constructing LR parsers for regular right part grammars. Acta Informatica 11, 177?193 (1979)","journal-title":"Acta Informatica"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00288959","volume":"15","author":"P.W. Purdom","year":"1981","unstructured":"Purdom, P.W., Brown, C.A.: Parsing extended LR(k) grammars. Acta Informatica 15, 115?127 (1981)","journal-title":"Acta Informatica"},{"key":"CR12","unstructured":"Turner, D.A.: Sasl Language Manual, CS\/82\/4, St. Andrews University, revised edition 1982"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1145\/359863.359883","volume":"20","author":"N. Wirth","year":"1977","unstructured":"Wirth, N.: What can we do about the unnecessary diversity of notation for syntactic definitions? Comm. ACM 20, 822?823 (1977)","journal-title":"Comm. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289138.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289138\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289138","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:41Z","timestamp":1554758081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,5]]}},"alternative-id":["BF00289138"],"URL":"https:\/\/doi.org\/10.1007\/bf00289138","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,5]]}}}