Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel
{"title":"检测和解释无上下文语法的(不)等价性","authors":"Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel","doi":"arxiv-2407.18220","DOIUrl":null,"url":null,"abstract":"We propose a scalable framework for deciding, proving, and explaining\n(in)equivalence of context-free grammars. We present an implementation of the\nframework and evaluate it on large data sets collected within educational\nsupport systems. Even though the equivalence problem for context-free languages\nis undecidable in general, the framework is able to handle a large portion of\nthese datasets. It introduces and combines techniques from several areas, such\nas an abstract grammar transformation language to identify equivalent grammars\nas well as sufficiently similar inequivalent grammars, theory-based comparison\nalgorithms for a large class of context-free languages, and a\ngraph-theory-inspired grammar canonization that allows to efficiently identify\nisomorphic grammars.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Detecting and explaining (in)equivalence of context-free grammars\",\"authors\":\"Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel\",\"doi\":\"arxiv-2407.18220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a scalable framework for deciding, proving, and explaining\\n(in)equivalence of context-free grammars. We present an implementation of the\\nframework and evaluate it on large data sets collected within educational\\nsupport systems. Even though the equivalence problem for context-free languages\\nis undecidable in general, the framework is able to handle a large portion of\\nthese datasets. It introduces and combines techniques from several areas, such\\nas an abstract grammar transformation language to identify equivalent grammars\\nas well as sufficiently similar inequivalent grammars, theory-based comparison\\nalgorithms for a large class of context-free languages, and a\\ngraph-theory-inspired grammar canonization that allows to efficiently identify\\nisomorphic grammars.\",\"PeriodicalId\":501197,\"journal\":{\"name\":\"arXiv - CS - Programming Languages\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Programming Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.18220\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.18220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Detecting and explaining (in)equivalence of context-free grammars
We propose a scalable framework for deciding, proving, and explaining
(in)equivalence of context-free grammars. We present an implementation of the
framework and evaluate it on large data sets collected within educational
support systems. Even though the equivalence problem for context-free languages
is undecidable in general, the framework is able to handle a large portion of
these datasets. It introduces and combines techniques from several areas, such
as an abstract grammar transformation language to identify equivalent grammars
as well as sufficiently similar inequivalent grammars, theory-based comparison
algorithms for a large class of context-free languages, and a
graph-theory-inspired grammar canonization that allows to efficiently identify
isomorphic grammars.