{"id":"https://openalex.org/W2074832286","doi":"https://doi.org/10.1145/1988783.1988790","title":"Yield grammar analysis in the Bellman's GAP compiler","display_name":"Yield grammar analysis in the Bellman's GAP compiler","publication_year":2011,"publication_date":"2011-03-26","ids":{"openalex":"https://openalex.org/W2074832286","doi":"https://doi.org/10.1145/1988783.1988790","mag":"2074832286"},"language":"en","primary_location":{"id":"doi:10.1145/1988783.1988790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1988783.1988790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications","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/A5086259996","display_name":"Robert Giegerich","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Robert Giegerich","raw_affiliation_strings":["Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029593703","display_name":"Georg Sauthoff","orcid":null},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georg Sauthoff","raw_affiliation_strings":["Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Bielefeld, Technische Fakult\u00e4t, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086259996"],"corresponding_institution_ids":["https://openalex.org/I20121455"],"apc_list":null,"apc_paid":null,"fwci":1.0671,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.76057339,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.991599977016449,"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"}},"topics":[{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.991599977016449,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9860000014305115,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9799000024795532,"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/computer-science","display_name":"Computer science","score":0.8281278610229492},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7050679922103882},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.6900877356529236},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6361675262451172},{"id":"https://openalex.org/keywords/interprocedural-optimization","display_name":"Interprocedural optimization","score":0.5718922019004822},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5413345098495483},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5230249762535095},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4672415554523468},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.46232274174690247},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.375122606754303},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.3739169239997864},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33221837878227234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26253876090049744},{"id":"https://openalex.org/keywords/loop-optimization","display_name":"Loop optimization","score":0.07125905156135559}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8281278610229492},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7050679922103882},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.6900877356529236},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6361675262451172},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.5718922019004822},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5413345098495483},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5230249762535095},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4672415554523468},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.46232274174690247},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.375122606754303},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.3739169239997864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33221837878227234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26253876090049744},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.07125905156135559},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1988783.1988790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1988783.1988790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications","raw_type":"proceedings-article"},{"id":"pmh:oai:pub.librecat.org:2383357","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2383357","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Giegerich R, Sauthoff G. Yield grammar analysis in the Bellman's GAP compiler. In:  <em>Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications (ACM)</em>. 2011.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W108132717","https://openalex.org/W115096458","https://openalex.org/W121324548","https://openalex.org/W1543796220","https://openalex.org/W1571615440","https://openalex.org/W1658694352","https://openalex.org/W1976312746","https://openalex.org/W1985162296","https://openalex.org/W1987010534","https://openalex.org/W2040998144","https://openalex.org/W2073241627","https://openalex.org/W2103074382","https://openalex.org/W2119766618","https://openalex.org/W2143566245","https://openalex.org/W2171697943","https://openalex.org/W2341171179","https://openalex.org/W2752885492","https://openalex.org/W2988158430","https://openalex.org/W4285719527","https://openalex.org/W6600324439","https://openalex.org/W6635926797","https://openalex.org/W6662296979","https://openalex.org/W6704298589"],"related_works":["https://openalex.org/W4246454774","https://openalex.org/W2083681681","https://openalex.org/W2121223013","https://openalex.org/W2053033210","https://openalex.org/W2091689272","https://openalex.org/W4220800565","https://openalex.org/W1488300410","https://openalex.org/W1597127505","https://openalex.org/W2002505081","https://openalex.org/W2535844943"],"abstract_inverted_index":{"Dynamic":[0],"programming":[1,25],"algorithms":[2,26],"are":[3],"traditionally":[4],"expressed":[5],"by":[6],"a":[7,13],"set":[8],"of":[9,16,22],"table":[10],"recurrences":[11],"--":[12],"low":[14],"level":[15],"abstraction":[17],"which":[18],"renders":[19],"the":[20],"design":[21],"novel":[23],"dynamic":[24],"difficult":[27],"and":[28],"makes":[29],"debugging":[30],"cumbersome.":[31]},"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}