{"id":"https://openalex.org/W1970760500","doi":"https://doi.org/10.1145/2500365.2500576","title":"Efficient divide-and-conquer parsing of practical context-free languages","display_name":"Efficient divide-and-conquer parsing of practical context-free languages","publication_year":2013,"publication_date":"2013-09-25","ids":{"openalex":"https://openalex.org/W1970760500","doi":"https://doi.org/10.1145/2500365.2500576","mag":"1970760500"},"language":"en","primary_location":{"id":"doi:10.1145/2500365.2500576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"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 and University of Gothenburg, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology and University of Gothenburg, 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/I881427289","display_name":"University of Gothenburg","ror":"https://ror.org/01tm6cn81","country_code":"SE","type":"education","lineage":["https://openalex.org/I881427289"]},{"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"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Koen Claessen","raw_affiliation_strings":["Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden"],"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology and University of Gothenburg, 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":3.4607,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.92452092,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"122"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9839000105857849,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.9769924879074097},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.811044454574585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7933657169342041},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6111866235733032},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43251579999923706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35515591502189636},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3195202350616455}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.9769924879074097},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.811044454574585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7933657169342041},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6111866235733032},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43251579999923706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35515591502189636},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3195202350616455},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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.1145/2500365.2500576","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2500365.2500576","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:187201","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/187201","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1502293651","https://openalex.org/W1590978730","https://openalex.org/W1605351056","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/W2084738937","https://openalex.org/W2093700795","https://openalex.org/W2128580729","https://openalex.org/W2139106437","https://openalex.org/W2143566245","https://openalex.org/W2152907450","https://openalex.org/W2154973422","https://openalex.org/W2184914104","https://openalex.org/W2752885492","https://openalex.org/W2946046356","https://openalex.org/W3004540582"],"related_works":["https://openalex.org/W4247094814","https://openalex.org/W2352794675","https://openalex.org/W2111712077","https://openalex.org/W2051228988","https://openalex.org/W108531593","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2162911572","https://openalex.org/W2019464130","https://openalex.org/W1497662183"],"abstract_inverted_index":{"We":[0,27],"present":[1],"a":[2],"divide-and-conquer":[3,85],"algorithm":[4,11],"for":[5,57],"parsing":[6,23],"context-free":[7],"languages":[8],"efficiently.":[9],"Our":[10],"is":[12,36,80],"an":[13,72],"instance":[14],"of":[15,22,34,75],"Valiant's":[16,35],"(1975),":[17],"who":[18],"reduced":[19],"the":[20,31,39,69],"problem":[21],"to":[24,44,82],"matrix":[25],"multiplications.":[26],"show":[28],"that,":[29],"while":[30],"conquer":[32],"step":[33],"O(n3)":[37],"in":[38,59],"worst":[40],"case,":[41],"it":[42],"improves":[43],"O(logn3),":[45],"under":[46],"certain":[47],"conditions":[48,55],"satisfied":[49],"by":[50,63],"many":[51],"useful":[52],"inputs.":[53],"These":[54],"occur":[56],"example":[58],"program":[60],"texts":[61],"written":[62],"humans.":[64],"The":[65],"improvement":[66],"happens":[67],"because":[68],"multiplications":[70],"involve":[71],"overwhelming":[73],"majority":[74],"empty":[76],"matrices.":[77],"This":[78],"result":[79],"relevant":[81],"modern":[83],"computing:":[84],"algorithms":[86],"can":[87],"be":[88],"parallelized":[89],"relatively":[90],"easily.":[91]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}