{"id":"https://openalex.org/W2149979723","doi":"https://doi.org/10.1017/s0956796815000131","title":"Efficient parallel and incremental parsing of practical context-free languages","display_name":"Efficient parallel and incremental parsing of practical context-free languages","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2149979723","doi":"https://doi.org/10.1017/s0956796815000131","mag":"2149979723"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796815000131","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000131","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/4D620F0BFADE2B588F854AAAEA252F5C/S0956796815000131a.pdf/div-class-title-efficient-parallel-and-incremental-parsing-of-practical-context-free-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/4D620F0BFADE2B588F854AAAEA252F5C/S0956796815000131a.pdf/div-class-title-efficient-parallel-and-incremental-parsing-of-practical-context-free-languages-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070681215","display_name":"Jean-Philippe Bernardy","orcid":"https://orcid.org/0000-0002-8469-5617"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]},{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"JEAN-PHILIPPE BERNARDY","raw_affiliation_strings":["Chalmers University of Technology & University of Gothenburg, Sweden (e-mail:","Chalmers University of Technology & University of Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology & University of Gothenburg, Sweden (e-mail:","institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"]},{"raw_affiliation_string":"Chalmers University of Technology & University of Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058771102","display_name":"Koen Claessen","orcid":"https://orcid.org/0000-0002-8113-4478"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]},{"id":"https://openalex.org/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"KOEN CLAESSEN","raw_affiliation_strings":["Chalmers University of Technology & University of Gothenburg, Sweden (e-mail:","Chalmers University of Technology & University of Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology & University of Gothenburg, Sweden (e-mail:","institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"]},{"raw_affiliation_string":"Chalmers University of Technology & University of Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070681215"],"corresponding_institution_ids":["https://openalex.org/I66862912","https://openalex.org/I881427289"],"apc_list":null,"apc_paid":null,"fwci":0.4451,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.7723633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9514740705490112},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8701175451278687},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.798653244972229},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6498466730117798},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5350972414016724},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41111159324645996},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3966342806816101},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3767203092575073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29186469316482544}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9514740705490112},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8701175451278687},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.798653244972229},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6498466730117798},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5350972414016724},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41111159324645996},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3966342806816101},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3767203092575073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29186469316482544},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0956796815000131","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000131","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/4D620F0BFADE2B588F854AAAEA252F5C/S0956796815000131a.pdf/div-class-title-efficient-parallel-and-incremental-parsing-of-practical-context-free-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:231831","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/231831","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.1017/s0956796815000131","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796815000131","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/4D620F0BFADE2B588F854AAAEA252F5C/S0956796815000131a.pdf/div-class-title-efficient-parallel-and-incremental-parsing-of-practical-context-free-languages-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G6811507113","display_name":null,"funder_award_id":"RAWFP","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2149979723.pdf","grobid_xml":"https://content.openalex.org/works/W2149979723.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1502293651","https://openalex.org/W1528303475","https://openalex.org/W1558180172","https://openalex.org/W1590978730","https://openalex.org/W1970760500","https://openalex.org/W1970961429","https://openalex.org/W1975185331","https://openalex.org/W1978012878","https://openalex.org/W2020749411","https://openalex.org/W2035476608","https://openalex.org/W2040713190","https://openalex.org/W2047505657","https://openalex.org/W2059000558","https://openalex.org/W2084738937","https://openalex.org/W2093700795","https://openalex.org/W2098037505","https://openalex.org/W2126693002","https://openalex.org/W2128580729","https://openalex.org/W2139106437","https://openalex.org/W2152907450","https://openalex.org/W2153458296","https://openalex.org/W2154973422","https://openalex.org/W2156495052","https://openalex.org/W2175212756","https://openalex.org/W2184914104","https://openalex.org/W3007981259","https://openalex.org/W3111526966","https://openalex.org/W3145128584","https://openalex.org/W3149756008","https://openalex.org/W6686533138"],"related_works":["https://openalex.org/W4247094814","https://openalex.org/W2352794675","https://openalex.org/W1526989670","https://openalex.org/W108531593","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2111712077","https://openalex.org/W2051228988","https://openalex.org/W2162911572","https://openalex.org/W1497662183"],"abstract_inverted_index":{"Abstract":[0],"We":[1,43],"present":[2],"a":[3,82,110],"divide-and-conquer":[4,107],"algorithm":[5,12],"for":[6],"parsing":[7,39],"context-free":[8,20],"languages":[9],"efficiently.":[10],"Our":[11],"is":[13,52,102],"an":[14,94],"instance":[15],"of":[16,38,50,85,97],"Valiant's":[17,51],"(1975;":[18],"General":[19],"recognition":[21],"in":[22,76],"less":[23],"than":[24],"cubic":[25],"time.":[26],"J.":[27],"Comput.":[28],"Syst.":[29],"Sci.":[30],"10":[31],"(2),":[32],"308\u2013314),":[33],"who":[34],"reduced":[35],"the":[36,47,91],"problem":[37],"to":[40,60,104],"matrix":[41],"multiplications.":[42],"show":[44],"that,":[45],"while":[46],"conquer":[48,112],"step":[49,113],"O":[53,61],"(":[54],"n":[55,64],"3":[56],"),":[57],"it":[58],"improves":[59],"(log":[62],"2":[63],")":[65],"under":[66],"certain":[67],"conditions":[68],"satisfied":[69],"by":[70],"many":[71],"useful":[72],"inputs":[73],"that":[74],"occur":[75],"practice,":[77],"and":[78],"if":[79],"one":[80],"uses":[81],"sparse":[83],"representation":[84],"matrices.":[86,99],"The":[87],"improvement":[88],"happens":[89],"because":[90],"multiplications":[92],"involve":[93],"overwhelming":[95],"majority":[96],"empty":[98],"This":[100],"result":[101],"relevant":[103],"modern":[105],"computing:":[106],"algorithms":[108],"with":[109],"polylogarithmic":[111],"can":[114],"be":[115],"parallelized":[116],"relatively":[117],"easily.":[118]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
