{"id":"https://openalex.org/W7131096781","doi":"https://doi.org/10.48550/arxiv.2602.18166","title":"Grammar Repair with Examples and Tree Automata: Extended Version","display_name":"Grammar Repair with Examples and Tree Automata: Extended Version","publication_year":2026,"publication_date":"2026-02-20","ids":{"openalex":"https://openalex.org/W7131096781","doi":"https://doi.org/10.48550/arxiv.2602.18166"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.18166","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126655267","display_name":"Yunjeong Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lee, Yunjeong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093312334","display_name":"Gokul Rajiv","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajiv, Gokul","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009639508","display_name":"Ilya Sergey","orcid":"https://orcid.org/0000-0003-4250-5392"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sergey, Ilya","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5126655267"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.2955999970436096,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2955999970436096,"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.23510000109672546,"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.1501999944448471,"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/parsing","display_name":"Parsing","score":0.6690000295639038},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5623000264167786},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.545199990272522},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5340999960899353},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.5299000144004822},{"id":"https://openalex.org/keywords/abstract-syntax-tree","display_name":"Abstract syntax tree","score":0.5282999873161316},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.5047000050544739},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4357999861240387},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.4203999936580658},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4050000011920929}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7638000249862671},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6690000295639038},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6431999802589417},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5623000264167786},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.545199990272522},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5340999960899353},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.5299000144004822},{"id":"https://openalex.org/C58646249","wikidata":"https://www.wikidata.org/wiki/Q127380","display_name":"Abstract syntax tree","level":3,"score":0.5282999873161316},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.5047000050544739},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4357999861240387},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4352000057697296},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.4016000032424927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39640000462532043},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.3898000121116638},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.3880999982357025},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.36469998955726624},{"id":"https://openalex.org/C35164859","wikidata":"https://www.wikidata.org/wiki/Q1756442","display_name":"LR parser","level":4,"score":0.3508000075817108},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.3402999937534332},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.3285999894142151},{"id":"https://openalex.org/C114408938","wikidata":"https://www.wikidata.org/wiki/Q333373","display_name":"Abstract syntax","level":3,"score":0.31790000200271606},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.29010000824928284},{"id":"https://openalex.org/C199624470","wikidata":"https://www.wikidata.org/wiki/Q2377216","display_name":"Stochastic context-free grammar","level":5,"score":0.288100004196167},{"id":"https://openalex.org/C164041254","wikidata":"https://www.wikidata.org/wiki/Q597455","display_name":"Attribute grammar","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.26019999384880066},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C29184939","wikidata":"https://www.wikidata.org/wiki/Q1134367","display_name":"Phrase structure grammar","level":4,"score":0.25}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.18166","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.18166","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.18166","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.18166","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.4208388328552246,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Context-free":[0],"grammars":[1,88],"(CFGs)":[2],"are":[3,142],"the":[4,20,35,71,74,95,107,113,117,125,155,162,191,194,209,212],"de-facto":[5],"formalism":[6],"for":[7,12,51,58,179],"declaratively":[8],"describing":[9],"concrete":[10],"syntax":[11,27],"programming":[13,96],"languages":[14],"and":[15,47,120,130,158,174,186,214],"generating":[16],"parsers.":[17],"One":[18],"of":[19,73,100,109,115,139,166,193,211,229],"major":[21],"challenges":[22],"in":[23,34,65,102,128,170,199,218],"defining":[24],"a":[25,66,82,144,171,219,227],"desired":[26,126],"is":[28,92,112],"ruling":[29],"out":[30],"all":[31,169],"possible":[32],"ambiguities":[33,168],"CFG":[36,119],"productions":[37],"that":[38,69,123,149,160,182,188],"determine":[39],"scoping":[40],"rules":[41],"as":[42,44,132],"well":[43],"operator":[45],"precedence":[46,129],"associativity.":[48],"Practical":[49],"tools":[50],"parser":[52,204],"generation":[53],"typically":[54],"apply":[55],"ad-hoc":[56],"approaches":[57],"resolving":[59,167],"such":[60],"ambiguities,":[61,90],"which":[62,91,197],"might":[63],"result":[64],"parser's":[67],"behavior":[68],"contradicts":[70],"intents":[72],"language":[75],"designer.":[76],"In":[77],"this":[78],"work,":[79],"we":[80],"present":[81],"user-friendly":[83],"approach":[84,111,141,217],"to":[85,203],"soundly":[86],"repair":[87],"with":[89],"inspired":[93],"by":[94,97],"example":[98],"line":[99],"research":[101],"automated":[103],"program":[104],"synthesis.":[105],"At":[106],"heart":[108],"our":[110,140,216],"interpretation":[114],"both":[116],"initial":[118],"additional":[121],"examples":[122,159],"define":[124],"restrictions":[127],"associativity,":[131],"tree":[133],"automata":[134],"(TAs).":[135],"The":[136],"technical":[137],"novelties":[138],"(1)":[143],"new":[145],"TA":[146,180],"learning":[147],"algorithm":[148,178],"constructs":[150],"an":[151,176],"automaton":[152],"based":[153],"on":[154,226],"original":[156],"grammar":[157],"encode":[161],"user's":[163],"preferred":[164],"ways":[165],"single":[172],"TA,":[173],"(2)":[175],"efficient":[177],"intersection":[181],"utilises":[183],"reachability":[184],"analysis":[185],"optimizations":[187],"significantly":[189],"reduce":[190],"size":[192],"resulting":[195],"automaton,":[196],"results":[198],"idiomatic":[200],"CFGs":[201],"amenable":[202],"generators.":[205],"We":[206],"have":[207],"proven":[208],"soundness":[210],"algorithms,":[213],"implemented":[215],"tool":[220],"called":[221],"Greta,":[222],"demonstrating":[223],"its":[224],"effectiveness":[225],"series":[228],"case":[230],"studies.":[231]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-02-24T00:00:00"}