{"id":"https://openalex.org/W1993575201","doi":"https://doi.org/10.1007/bf00264364","title":"SLR(1) and LALR(1) parsing for unrestricted grammars","display_name":"SLR(1) and LALR(1) parsing for unrestricted grammars","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W1993575201","doi":"https://doi.org/10.1007/bf00264364","mag":"1993575201"},"language":"en","primary_location":{"id":"doi:10.1007/bf00264364","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00264364","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5012594399","display_name":"Lawrence A. Harris","orcid":"https://orcid.org/0000-0003-1051-1755"},"institutions":[{"id":"https://openalex.org/I143302722","display_name":"University of Kentucky","ror":"https://ror.org/02k3smh20","country_code":"US","type":"education","lineage":["https://openalex.org/I143302722"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"LawrenceA. Harris","raw_affiliation_strings":["Department of Mathematics, University of Kentucky, College of Arts and Sciences, Patterson Office Tower, 40506-0027, Lexington, Ky, USA","Department of Mathematics, University of Kentucky, College of Arts and Sciences, Lexington, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kentucky, College of Arts and Sciences, Patterson Office Tower, 40506-0027, Lexington, Ky, USA","institution_ids":["https://openalex.org/I143302722"]},{"raw_affiliation_string":"Department of Mathematics, University of Kentucky, College of Arts and Sciences, Lexington, USA","institution_ids":["https://openalex.org/I143302722"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012594399"],"corresponding_institution_ids":["https://openalex.org/I143302722"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.11258923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9986000061035156,"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.9986000061035156,"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/T10142","display_name":"Formal Methods in Verification","score":0.9921000003814697,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9883000254631042,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7074540257453918},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6657313108444214},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6513247489929199},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5880962610244751},{"id":"https://openalex.org/keywords/parsing-expression-grammar","display_name":"Parsing expression grammar","score":0.5612869262695312},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.5570578575134277},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.5486302971839905},{"id":"https://openalex.org/keywords/lr-parser","display_name":"LR parser","score":0.5429033041000366},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.528801441192627},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.461164653301239},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.44237276911735535},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4397830665111542},{"id":"https://openalex.org/keywords/phrase-structure-grammar","display_name":"Phrase structure grammar","score":0.4385416805744171},{"id":"https://openalex.org/keywords/context-sensitive-grammar","display_name":"Context-sensitive grammar","score":0.43053990602493286},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.3778948485851288},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3312365412712097},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.27115464210510254},{"id":"https://openalex.org/keywords/top-down-parsing","display_name":"Top-down parsing","score":0.19149360060691833},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.16370651125907898},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.14183607697486877}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7074540257453918},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6657313108444214},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6513247489929199},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5880962610244751},{"id":"https://openalex.org/C146810361","wikidata":"https://www.wikidata.org/wiki/Q32271","display_name":"Parsing expression grammar","level":5,"score":0.5612869262695312},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.5570578575134277},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.5486302971839905},{"id":"https://openalex.org/C35164859","wikidata":"https://www.wikidata.org/wiki/Q1756442","display_name":"LR parser","level":4,"score":0.5429033041000366},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.528801441192627},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.461164653301239},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.44237276911735535},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4397830665111542},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.4385416805744171},{"id":"https://openalex.org/C125950753","wikidata":"https://www.wikidata.org/wiki/Q908674","display_name":"Context-sensitive grammar","level":4,"score":0.43053990602493286},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3778948485851288},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3312365412712097},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.27115464210510254},{"id":"https://openalex.org/C42560504","wikidata":"https://www.wikidata.org/wiki/Q15419395","display_name":"Top-down parsing","level":3,"score":0.19149360060691833},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.16370651125907898},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.14183607697486877}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf00264364","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00264364","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.7122","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.7122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ms.uky.edu/~larry/paper.dir/slr1.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.95.2181","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ms.uky.edu/~larry/paper.dir/slr1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W61444162","https://openalex.org/W1495776297","https://openalex.org/W1513250879","https://openalex.org/W1549337876","https://openalex.org/W1974294860","https://openalex.org/W1981168075","https://openalex.org/W1987460227","https://openalex.org/W1997130137","https://openalex.org/W2008351513","https://openalex.org/W2008528898","https://openalex.org/W2031437793","https://openalex.org/W2031951733","https://openalex.org/W2053350018","https://openalex.org/W2057847529","https://openalex.org/W2064490449","https://openalex.org/W2074697089","https://openalex.org/W2081085738","https://openalex.org/W2081953040","https://openalex.org/W2134495021"],"related_works":["https://openalex.org/W2012479020","https://openalex.org/W1991406344","https://openalex.org/W88241985","https://openalex.org/W4244447443","https://openalex.org/W1979054319","https://openalex.org/W3088684418","https://openalex.org/W2153803459","https://openalex.org/W1609763579","https://openalex.org/W2144764039","https://openalex.org/W1993575201"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}