{"id":"https://openalex.org/W4236103971","doi":"https://doi.org/10.1145/1133981.1133988","title":"Fast and flexible instruction selection with on-demand tree-parsing automata","display_name":"Fast and flexible instruction selection with on-demand tree-parsing automata","publication_year":2006,"publication_date":"2006-06-11","ids":{"openalex":"https://openalex.org/W4236103971","doi":"https://doi.org/10.1145/1133981.1133988"},"language":"en","primary_location":{"id":"doi:10.1145/1133981.1133988","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1133988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5088009807","display_name":"M. Anton Ertl","orcid":"https://orcid.org/0000-0002-1290-9444"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. Anton Ertl","raw_affiliation_strings":["Technische Universit\u00e4t Wien"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031719253","display_name":"Kevin Casey","orcid":"https://orcid.org/0000-0001-7245-9572"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Kevin Casey","raw_affiliation_strings":["Trinity College, Dublin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trinity College, Dublin","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003800161","display_name":"David Gregg","orcid":"https://orcid.org/0000-0003-3782-4612"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"David Gregg","raw_affiliation_strings":["Trinity College, Dublin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trinity College, Dublin","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4584,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85214008,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"52","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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.9972000122070312,"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.8718441128730774},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.8064525127410889},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7028805017471313},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6226083636283875},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6197502017021179},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.575262725353241},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5296537280082703},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48471832275390625},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.4654112160205841},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4306441843509674},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.4236755073070526},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4209766089916229},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36974766850471497},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24898096919059753}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8718441128730774},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.8064525127410889},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7028805017471313},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6226083636283875},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6197502017021179},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.575262725353241},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5296537280082703},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48471832275390625},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.4654112160205841},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4306441843509674},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.4236755073070526},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4209766089916229},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36974766850471497},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24898096919059753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1133981.1133988","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1133988","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1541457918","https://openalex.org/W1974459626","https://openalex.org/W1999102544","https://openalex.org/W2000951709","https://openalex.org/W2025840053","https://openalex.org/W2056609175","https://openalex.org/W2062944884","https://openalex.org/W2073882597","https://openalex.org/W2117723375","https://openalex.org/W2136285318","https://openalex.org/W2162310026","https://openalex.org/W2168315159","https://openalex.org/W4231971748"],"related_works":["https://openalex.org/W2467097043","https://openalex.org/W1512248002","https://openalex.org/W2049360920","https://openalex.org/W2139865158","https://openalex.org/W4229505676","https://openalex.org/W1971657783","https://openalex.org/W2257183258","https://openalex.org/W1582302366","https://openalex.org/W1758011472","https://openalex.org/W4236103971"],"abstract_inverted_index":{"Tree":[0],"parsing":[1],"as":[2],"supported":[3],"by":[4,121],"code":[5,107],"generator":[6],"generators":[7],"like":[8],"BEG,":[9],"burg,":[10],"iburg,":[11],"lburg":[12],"and":[13,32,40,114],"ml-burg":[14],"is":[15,78,88],"a":[16,44,71,74,83,95,124],"popular":[17],"instruction":[18,92],"selection":[19],"method.":[20],"There":[21],"are":[22],"two":[23],"existing":[24,54],"approaches":[25],"for":[26,73],"implementing":[27],"tree":[28,84],"parsing:":[29],"dynamic":[30,60],"programming,":[31],"tree-parsing":[33,75,97],"automata;":[34],"each":[35],"approach":[36,47,103],"has":[37],"its":[38],"advantages":[39,51],"disadvantages.":[41],"We":[42,99],"propose":[43],"new":[45],"implementation":[46,110],"that":[48],"combines":[49],"the":[50,80,86,91,105,116],"of":[52,119,126],"both":[53],"approaches:":[55],"we":[56,69],"start":[57],"out":[58],"with":[59],"programming":[61],"at":[62,66],"compile":[63],"time,":[64],"but":[65],"every":[67],"step":[68],"generate":[70],"state":[72,87],"automaton,":[76],"which":[77],"used":[79],"next":[81],"time":[82,118],"matching":[85],"found,":[89],"turning":[90],"selector":[93],"into":[94],"fast":[96],"automaton.":[98],"have":[100],"implemented":[101],"this":[102],"in":[104],"Gforth":[106,120],"generator.":[108],"The":[109],"required":[111],"little":[112],"effort":[113],"reduced":[115],"startup":[117],"up":[122],"to":[123],"factor":[125],"2.5.":[127]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}