{"id":"https://openalex.org/W64196332","doi":"https://doi.org/10.1007/978-1-4612-2710-6_6","title":"Recursive Descent Parsing","display_name":"Recursive Descent Parsing","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W64196332","doi":"https://doi.org/10.1007/978-1-4612-2710-6_6","mag":"64196332"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4612-2710-6_6","doi":"https://doi.org/10.1007/978-1-4612-2710-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-2710-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"What Computing Is All About","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4235089220","display_name":"What Computing Is All About"},"type":"book-chapter","is_traditional":true,"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/A5074005248","display_name":"Jan L. A. Snepscheut","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jan L. A. Snepscheut","raw_affiliation_strings":["California Institute of Technology, Computer Science 256-80, Pasadena, CA, 91125, USA","California Institute of Technology, Computer Science 256-80, Pasadena, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Computer Science 256-80, Pasadena, CA, 91125, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"California Institute of Technology, Computer Science 256-80, Pasadena, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074005248"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.03806735,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursive-descent-parsing","display_name":"recursive descent parsing","score":0.9829999804496765},{"id":"https://openalex.org/keywords/context-free-grammars","display_name":"context-free grammars","score":0.9309999942779541},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"top-down parsing","score":0.9950000047683716},{"id":"https://openalex.org/keywords/ll-1-grammars","display_name":"LL(1) grammars","score":0.9760000109672546},{"id":"https://openalex.org/keywords/parsing-algorithms","display_name":"parsing algorithms","score":0.7889999747276306},{"id":"https://openalex.org/keywords/domino-game","display_name":"domino game","score":0.6539999842643738},{"id":"https://openalex.org/keywords/recursive-procedures","display_name":"recursive procedures","score":0.5690000057220459},{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.4659999907016754}],"concepts":[{"id":"https://openalex.org/C9432014","wikidata":"https://www.wikidata.org/wiki/Q954063","display_name":"Terminal and nonterminal symbols","level":3,"score":0.8111695051193237},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.7556726932525635},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.6634447574615479},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.6069083213806152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6000418663024902},{"id":"https://openalex.org/C79243999","wikidata":"https://www.wikidata.org/wiki/Q6590011","display_name":"Indexed grammar","level":5,"score":0.5871385931968689},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.5609996914863586},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.5606259703636169},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5582152605056763},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5549121499061584},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.5541467666625977},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.522731602191925},{"id":"https://openalex.org/C147547768","wikidata":"https://www.wikidata.org/wiki/Q3113342","display_name":"S-attributed grammar","level":3,"score":0.43073770403862},{"id":"https://openalex.org/C79516417","wikidata":"https://www.wikidata.org/wiki/Q1376168","display_name":"Memoization","level":4,"score":0.4268079996109009},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4137711524963379},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.3044145405292511},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2874075174331665}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-1-4612-2710-6_6","doi":"https://doi.org/10.1007/978-1-4612-2710-6_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-2710-6_6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"What Computing Is All About","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1504169987","https://openalex.org/W2003550651","https://openalex.org/W1509002130","https://openalex.org/W1984577612","https://openalex.org/W2351114890","https://openalex.org/W4245883387","https://openalex.org/W2267946107","https://openalex.org/W4239133562","https://openalex.org/W2915015694","https://openalex.org/W1847655440"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}