{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:12:15Z","timestamp":1742929935035,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_20","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T05:39:21Z","timestamp":1487137161000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Linear Parsing Expression Grammars"],"prefix":"10.1007","author":[{"given":"Nariyoshi","family":"Chida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kuramitsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"20_CR1","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Prentice-Hall Inc., Upper Saddle River (1972)"},{"key":"20_CR2","unstructured":"Birman, A.: The TMG recognition schema. Ph.D. thesis aAI7101582, Princeton, NJ, USA (1970)"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(73)90851-6","volume":"23","author":"A Birman","year":"1973","unstructured":"Birman, A., Ullman, J.D.: Parsing algorithms with backtrack. Inf. Control 23(1), 1\u201334 (1973). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0019995873908516","journal-title":"Inf. Control"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J Brzozowski","year":"1980","unstructured":"Brzozowski, J., Leiss, E.: On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci. 10(1), 19\u201335 (1980). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397580900699","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981). \n                      http:\/\/doi.acm.org\/10.1145\/322234.322243","journal-title":"J. ACM"},{"issue":"1\u20134","key":"20_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/00207169008803893","volume":"35","author":"A Fellah","year":"1990","unstructured":"Fellah, A., J\u00fcrgensen, H., Yu, S.: Constructions for alternating finite automata. Int. J. Comput. Math. 35(1\u20134), 117\u2013132 (1990). \n                      http:\/\/dx.doi.org\/10.1080\/00207169008803893","journal-title":"Int. J. Comput. Math."},{"key":"20_CR7","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: Proceedings of 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 111\u2013122. ACM, New York (2004). \n                      http:\/\/doi.acm.org\/10.1145\/964001.964011"},{"key":"20_CR8","unstructured":"Google: Re2. \n                      https:\/\/github.com\/google\/re2"},{"key":"20_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"3"},{"key":"20_CR10","unstructured":"Kuramitsu, K.: Nez: practical open grammar language. In: Proceedings of 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, Onward! 2016, pp. 29\u201342. ACM, New York (2016). \n                      http:\/\/doi.acm.org\/10.1145\/2986012.2986019"},{"key":"20_CR11","volume-title":"An Introduction to Formal Language and Automata","author":"P Linz","year":"2006","unstructured":"Linz, P.: An Introduction to Formal Language and Automata. Jones and Bartlett Publishers Inc., USA (2006)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2012.11.006","volume":"93","author":"S Medeiros","year":"2014","unstructured":"Medeiros, S., Mascarenhas, F., Ierusalimschy, R.: From regexes to parsing expression grammars. Sci. Comput. Program. Part A 93, 3\u201318 (2014). \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167642312002171","journal-title":"Sci. Comput. Program. Part A"},{"issue":"1","key":"20_CR13","first-page":"1_147","volume":"29","author":"A Morihata","year":"2012","unstructured":"Morihata, A.: Translation of regular expression with lookahead into finite state automaton. Comput. Softw. 29(1), 1_147\u20131_158 (2012)","journal-title":"Comput. Softw."},{"key":"20_CR14","unstructured":"Oikawa, M., Ierusalimschy, R., Moura, A.L.D.: Converting regexes to parsing expression grammars"},{"key":"20_CR15","unstructured":"Parr, T., Fisher, K.: Ll(*): the foundation of the ANTLR parser generator. In: Proceedings of 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2011, pp. 425\u2013436. ACM, New York (2011). \n                      http:\/\/doi.acm.org\/10.1145\/1993498.1993548"},{"issue":"10","key":"20_CR16","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1145\/2714064.2660202","volume":"49","author":"T Parr","year":"2014","unstructured":"Parr, T., Harwell, S., Fisher, K.: Adaptive ll(*) parsing: the power of dynamic analysis. SIGPLAN Not. 49(10), 579\u2013598 (2014). \n                      http:\/\/doi.acm.org\/10.1145\/2714064.2660202","journal-title":"SIGPLAN Not."},{"issue":"6","key":"20_CR17","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Programming techniques: regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968). \n                      http:\/\/doi.acm.org\/10.1145\/363347.363387","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:45:15Z","timestamp":1558316715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}