{"id":"https://openalex.org/W2164260211","doi":"https://doi.org/10.1016/0304-3975(92)90127-2","title":"Recursive ascent parsing: from Earley to Marcus","display_name":"Recursive ascent parsing: from Earley to Marcus","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2164260211","doi":"https://doi.org/10.1016/0304-3975(92)90127-2","mag":"2164260211"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(92)90127-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90127-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-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/A5045737903","display_name":"Ren\u00e9 Leermakers","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ren\u00e9 Leermakers","raw_affiliation_strings":["Institute for Perception Research, P.O. Box 513, 5600 MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Perception Research, P.O. Box 513, 5600 MB Eindhoven, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5045737903"],"corresponding_institution_ids":[],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":1.1115,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.83743177,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"104","issue":"2","first_page":"299","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9937000274658203,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9937000274658203,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9638000130653381,"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/T10820","display_name":"Fuzzy Logic and Control Systems","score":0.9351999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/memoization","display_name":"Memoization","score":0.9650677442550659},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.8708443641662598},{"id":"https://openalex.org/keywords/parser-combinator","display_name":"Parser combinator","score":0.844801664352417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8331155776977539},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.8291963934898376},{"id":"https://openalex.org/keywords/top-down-parsing-language","display_name":"Top-down parsing language","score":0.8195840120315552},{"id":"https://openalex.org/keywords/bottom-up-parsing","display_name":"Bottom-up parsing","score":0.7917349338531494},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.7558602094650269},{"id":"https://openalex.org/keywords/s-attributed-grammar","display_name":"S-attributed grammar","score":0.6600390672683716},{"id":"https://openalex.org/keywords/lr-parser","display_name":"LR parser","score":0.5967239141464233},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5670279264450073},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.54203200340271},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5082444548606873},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.44672760367393494},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.44315019249916077},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4275638461112976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33943620324134827},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.20521312952041626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12892699241638184}],"concepts":[{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.9650677442550659},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.8708443641662598},{"id":"https://openalex.org/C118364021","wikidata":"https://www.wikidata.org/wiki/Q7139956","display_name":"Parser combinator","level":3,"score":0.844801664352417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8331155776977539},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.8291963934898376},{"id":"https://openalex.org/C166651950","wikidata":"https://www.wikidata.org/wiki/Q7824365","display_name":"Top-down parsing language","level":5,"score":0.8195840120315552},{"id":"https://openalex.org/C60690694","wikidata":"https://www.wikidata.org/wiki/Q894902","display_name":"Bottom-up parsing","level":4,"score":0.7917349338531494},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.7558602094650269},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.6600390672683716},{"id":"https://openalex.org/C35164859","wikidata":"https://www.wikidata.org/wiki/Q1756442","display_name":"LR parser","level":4,"score":0.5967239141464233},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5670279264450073},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.54203200340271},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5082444548606873},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.44672760367393494},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.44315019249916077},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4275638461112976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33943620324134827},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.20521312952041626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12892699241638184},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":3,"locations":[{"id":"doi:10.1016/0304-3975(92)90127-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(92)90127-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/4b538ff2-1360-4be6-8c77-77d7003514f5","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/4b538ff2-1360-4be6-8c77-77d7003514f5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Leermakers, M C J 1992, 'Recursive ascent parsing : from Earley to Marcus', Theoretical Computer Science, vol. 104, no. 2, pp. 299-312. https://doi.org/10.1016/0304-3975(92)90127-2","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/4b538ff2-1360-4be6-8c77-77d7003514f5","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/4b538ff2-1360-4be6-8c77-77d7003514f5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 104(2), 299 - 312. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1968594561","https://openalex.org/W1968998060","https://openalex.org/W1971428651","https://openalex.org/W1972321190","https://openalex.org/W1981724541","https://openalex.org/W1997571264","https://openalex.org/W2022402786","https://openalex.org/W2039657633","https://openalex.org/W2059000558","https://openalex.org/W2062583003","https://openalex.org/W2122472280","https://openalex.org/W2134495021","https://openalex.org/W2148421751","https://openalex.org/W2149066449","https://openalex.org/W2180016737","https://openalex.org/W2693408037","https://openalex.org/W3003374142","https://openalex.org/W4243899571","https://openalex.org/W6643519268","https://openalex.org/W6665106730","https://openalex.org/W6685984242"],"related_works":["https://openalex.org/W2164260211","https://openalex.org/W2044735303","https://openalex.org/W2389755172","https://openalex.org/W1929722976","https://openalex.org/W1975821179","https://openalex.org/W2105710547","https://openalex.org/W2529664582","https://openalex.org/W2055851776","https://openalex.org/W3105233674","https://openalex.org/W2066607816"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2016-06-24T00:00:00"}