{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:22:06Z","timestamp":1751660526302,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-68195-1_16","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"213-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Context-Free Grammars with Lookahead"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0380-1247","authenticated-orcid":false,"given":"Takayuki","family":"Miyazaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8647-6816","authenticated-orcid":false,"given":"Yasuhiko","family":"Minamide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"AV Aho","year":"1968","unstructured":"Aho, A.V.: Indexed grammars\u2014an extension of context-free grammars. J. ACM 15(4), 647\u2013671 (1968)","journal-title":"J. ACM"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J-M Autebert","year":"1997","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111\u2013174. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_3"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.ic.2014.03.003","volume":"237","author":"M Barash","year":"2014","unstructured":"Barash, M., Okhotin, A.: An extension of context-free grammars with one-sided context specifications. Inf. Comput. 237, 268\u2013293 (2014)","journal-title":"Inf. Comput."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1051\/ita\/2015004","volume":"49","author":"M Barash","year":"2015","unstructured":"Barash, M., Okhotin, A.: Linear grammars with one-sided contexts and their automaton representation. RAIRO Theor. Inf. Appl. 49(2), 153\u2013178 (2015)","journal-title":"RAIRO Theor. Inf. Appl."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"16_CR6","first-page":"975","volume":"25","author":"N Chida","year":"2017","unstructured":"Chida, N., Kuramitsu, K.: Parsing expression grammars with unordered choices. J. Inf. Process. 25, 975\u2013982 (2017)","journal-title":"J. Inf. Process."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, vol. 35, pp. 118\u2013161. Elsevier (1963)","DOI":"10.1016\/S0049-237X(08)72023-8"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10(1), 289\u2013303 (1977)","journal-title":"Math. Syst. Theory"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 111\u2013122. ACM (2004)","DOI":"10.1145\/982962.964011"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"AK Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. J. Comput. Syst. Sci. 10(1), 136\u2013163 (1975)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427\u2013443 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.scico.2014.01.012","volume":"89","author":"F Mascarenhas","year":"2014","unstructured":"Mascarenhas, F., Medeiros, S., Ierusalimschy, R.: On the relation between context-free grammars and parsing expression grammars. Sci. Comput. Program. 89, 235\u2013250 (2014)","journal-title":"Sci. Comput. Program."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Might, M., Darais, D., Spiewak, D.: Parsing with derivatives: a functional pearl. In: Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming, pp. 189\u2013195. ACM (2011)","DOI":"10.1145\/2034574.2034801"},{"key":"16_CR14","first-page":"422","volume":"27","author":"T Miyazaki","year":"2019","unstructured":"Miyazaki, T., Minamide, Y.: Derivatives of regular expressions with lookahead. J. Inf. Process. 27, 422\u2013430 (2019)","journal-title":"J. Inf. Process."},{"issue":"1","key":"16_CR15","first-page":"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), 147\u2013158 (2012)","journal-title":"Comput. Softw."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Inf. Comput. 194(1), 19\u201348 (2004)","journal-title":"Inf. Comput."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Parr, T., Fisher, K.: LL(*) the foundation of the ANTLR parser generator. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 425\u2013436 (2011)","DOI":"10.1145\/1993316.1993548"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jal.2011.11.003","volume":"10","author":"Y Sakuma","year":"2012","unstructured":"Sakuma, Y., Minamide, Y., Voronkov, A.: Translating regular expression matching into transducers. J. Appl. Logic 10(1), 32\u201351 (2012)","journal-title":"J. Appl. Logic"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the 5th Annual ACM Symposium on Theory of Computing, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-41148-3_11","volume-title":"GI Gesellschaft f\u00fcr Informatik e. V.","author":"D Wotschke","year":"1973","unstructured":"Wotschke, D.: The Boolean closures of the deterministic and nondeterministic context-free languages. In: Brauer, W. (ed.) GI Gesellschaft f\u00fcr Informatik e. V. LNCS, pp. 113\u2013121. Springer, Heidelberg (1973). https:\/\/doi.org\/10.1007\/978-3-662-41148-3_11"}],"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-030-68195-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T09:08:17Z","timestamp":1615367297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 February 2021","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}