{"id":"https://openalex.org/W2037633950","doi":"https://doi.org/10.1145/321850.321851","title":"On the Parsing of Deterministic Languages","display_name":"On the Parsing of Deterministic Languages","publication_year":1974,"publication_date":"1974-10-01","ids":{"openalex":"https://openalex.org/W2037633950","doi":"https://doi.org/10.1145/321850.321851","mag":"2037633950"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/321850.321851","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/321850.321851","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/321850.321851","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013596090","display_name":"Ivan M. Havel","orcid":"https://orcid.org/0000-0001-5005-0696"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ivan M. Havel","raw_affiliation_strings":["Department of Computer Science, University of California, Berkeley, California"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048854124","display_name":"Michael A. Harrison","orcid":"https://orcid.org/0000-0002-7826-7472"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael A. Harrison","raw_affiliation_strings":["Department of Computer Science, University of California, Berkeley, California"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.632,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":66,"citation_normalized_percentile":{"value":0.897086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"21","issue":"4","first_page":"525","last_page":"548"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computational Complexity and Algorithmic Information Theory","score":0.9999,"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/T12002","display_name":"Computational Complexity and Algorithmic Information Theory","score":0.9999,"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/T11567","display_name":"Automata Theory and Formal Languages","score":0.9999,"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-based Computing and Data Storage","score":0.9994,"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/regular-tree-grammar","display_name":"Regular tree grammar","score":0.5165838},{"id":"https://openalex.org/keywords/combinatorics-on-words","display_name":"Combinatorics on Words","score":0.51627},{"id":"https://openalex.org/keywords/formal-languages","display_name":"Formal Languages","score":0.507946},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4650909}],"concepts":[{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6894635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63887703},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.59185386},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5751947},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5369795},{"id":"https://openalex.org/C57097763","wikidata":"https://www.wikidata.org/wiki/Q7309622","display_name":"Regular tree grammar","level":5,"score":0.5165838},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47619048},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.46561813},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4650909},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3842436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38237047},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.3772664},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.37051964},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36953706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35971642},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.2300492},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21701324},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.13648617},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.09432247},{"id":"https://openalex.org/C80877019","wikidata":"https://www.wikidata.org/wiki/Q7188074","display_name":"Phrase structure rules","level":3,"score":0.09431639},{"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/321850.321851","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/321850.321851","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1145/321850.321851","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/321850.321851","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"score":0.69,"id":"https://metadata.un.org/sdg/4","display_name":"Quality education"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":28,"referenced_works":["https://openalex.org/W1493792056","https://openalex.org/W1553605284","https://openalex.org/W1554673092","https://openalex.org/W1817451992","https://openalex.org/W1968127341","https://openalex.org/W1971656648","https://openalex.org/W1972123888","https://openalex.org/W1984742153","https://openalex.org/W1989518537","https://openalex.org/W2000188280","https://openalex.org/W2020570874","https://openalex.org/W2047505657","https://openalex.org/W2052475580","https://openalex.org/W2056634043","https://openalex.org/W2064471409","https://openalex.org/W2064490449","https://openalex.org/W2067580807","https://openalex.org/W2085609073","https://openalex.org/W2093478393","https://openalex.org/W2122472280","https://openalex.org/W2134495021","https://openalex.org/W2148224873","https://openalex.org/W2592184324","https://openalex.org/W2752853835","https://openalex.org/W2752908210","https://openalex.org/W2914032487","https://openalex.org/W299519334","https://openalex.org/W3003374142"],"related_works":["https://openalex.org/W4248104553","https://openalex.org/W3147354785","https://openalex.org/W3013856176","https://openalex.org/W2336577598","https://openalex.org/W2141137168","https://openalex.org/W2099269319","https://openalex.org/W2057847529","https://openalex.org/W2037633950","https://openalex.org/W1963896666","https://openalex.org/W131152816"],"abstract_inverted_index":{"A":[0],"parsing":[1],"method":[2],"for":[3,12,41,106],"strict":[4,29,64,72],"deterministic":[5,18,30,43,65,73],"grammars":[6,31],"is":[7,20,32,35,60,67,75],"presented":[8,105],"and":[9,45,69,97],"a":[10,78],"technique":[11],"using":[13],"it":[14],"to":[15,37,77],"parse":[16],"any":[17,71],"language":[19],"indicated.":[21],"An":[22],"important":[23],"characterization":[24],"of":[25,28,91],"the":[26,89,107],"trees":[27],"established.":[33],"This":[34],"used":[36],"prove":[38],"iteration":[39],"theorems":[40],"(strict)":[42],"languages,":[44],"hence":[46],"proving":[47],"that":[48,62,70,88],"certain":[49],"sets":[50],"are":[51,102,104],"not":[52],"in":[53],"these":[54],"families":[55,90],"becomes":[56],"comparatively":[57],"straightforward.":[58],"It":[59],"shown":[61],"every":[63],"grammar":[66,74],"LR(0)":[68],"equivalent":[76],"bounded":[79,98],"right":[80,99],"context":[81,100],"(1,":[82],"0)":[83],"grammar.":[84],"Thus":[85],"rigorous":[86],"proofs":[87],"deterministic,":[92],"LR":[93],"(":[94],"k":[95],"),":[96],"languages":[101],"coextensive":[103],"first":[108],"time.":[109]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2037633950","counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2024-09-26T16:49:55.124619","created_date":"2016-06-24"}
