{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:28:55Z","timestamp":1761596935443,"version":"3.41.0"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGPLAN Not."],"published-print":{"date-parts":[[2005,4]]},"abstract":"<jats:p>The paper discusses context-free grammar (CFG) inference using genetic-programming with application to inducing grammars from programs written in simple domain-specific languages. Grammar-specific heuristic operators and non-random construction of the initial population are proposed to achieve this task. Suitability of the approach is shown by small examples where the underlying CFG's are successfully inferred.<\/jats:p>","DOI":"10.1145\/1064165.1064172","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T18:08:27Z","timestamp":1131991707000},"page":"39-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Extracting grammar from programs"],"prefix":"10.1145","volume":"40","author":[{"given":"Matej","family":"\u010crepin\u0161ek","sequence":"first","affiliation":[{"name":"University of Maribor, Maribor, Slovenia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marjan","family":"Mernik","sequence":"additional","affiliation":[{"name":"University of Maribor, Maribor, Slovenia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faizan","family":"Javed","sequence":"additional","affiliation":[{"name":"The University of Alabama at Birmingham, Birmingham, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barrett R.","family":"Bryant","sequence":"additional","affiliation":[{"name":"The University of Alabama at Birmingham, Birmingham, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Sprague","sequence":"additional","affiliation":[{"name":"The University of Alabama at Birmingham, Birmingham, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"236","article-title":"Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: The GIG method. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications, ICGI'94","volume":"862","author":"Dupont P.","year":"1994","unstructured":"P. Dupont . Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: The GIG method. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications, ICGI'94 , LNAI , Vol. 862 , pp. 236 -- 245 , 1994 . P. Dupont. Regular Grammatical Inference from Positive and Negative Samples by Genetic Search: The GIG method. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications, ICGI'94, LNAI, Vol. 862, pp. 236--245, 1994.","journal-title":"LNAI"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"e_1_2_1_3_1","volume-title":"Genetic Programming: On the Programming of Computers by Natural Selection","author":"Koza J. R.","year":"1992","unstructured":"J. R. Koza . Genetic Programming: On the Programming of Computers by Natural Selection . MIT Press , 1992 . J. R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, 1992."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5731-9","volume-title":"Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Kluwer Academic Publishers","author":"Langdon W. B.","year":"1998","unstructured":"W. B. Langdon . Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Kluwer Academic Publishers , 1998 . W. B. Langdon. Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! Kluwer Academic Publishers, 1998."},{"key":"e_1_2_1_5_1","first-page":"130","volume-title":"Structuring Chromosomes for Context-Free Grammar Evolution. 1st International Conference on Evolutionary Computing","author":"Lukas S.","year":"1994","unstructured":"S. Lukas . Structuring Chromosomes for Context-Free Grammar Evolution. 1st International Conference on Evolutionary Computing , pp. 130 -- 135 , 1994 . S. Lukas. Structuring Chromosomes for Context-Free Grammar Evolution. 1st International Conference on Evolutionary Computing, pp. 130--135, 1994."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/952532.952740"},{"key":"e_1_2_1_7_1","first-page":"1","volume-title":"LISA: An Interactive Environment for Programming Language Development. 11th International Conference on Compiler Construction, LNCS","volume":"2304","author":"Mernik M.","year":"2002","unstructured":"M. Mernik , M. Leni\u010d , E. Avdi\u010dau\u0161evi\u0107 , V. \u017dumer . LISA: An Interactive Environment for Programming Language Development. 11th International Conference on Compiler Construction, LNCS , Vol. 2304 , pp. 1 -- 4 , 2002 . M. Mernik, M. Leni\u010d, E. Avdi\u010dau\u0161evi\u0107, V. \u017dumer. LISA: An Interactive Environment for Programming Language Development. 11th International Conference on Compiler Construction, LNCS, Vol. 2304, pp. 1--4, 2002."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/210376.197409"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90003-X"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645518.655809"},{"issue":"4","key":"e_1_2_1_12_1","first-page":"1","article-title":"Domain-Specific Language Design Requires Feature Descriptions. Journal for Computing and Information Technology, Special issue on Domain-Specific Languages, Eds","volume":"9","author":"van Deursen A.","year":"2002","unstructured":"A. van Deursen , P. Klint . Domain-Specific Language Design Requires Feature Descriptions. Journal for Computing and Information Technology, Special issue on Domain-Specific Languages, Eds : R. L\u00e4mmel and M. Mernik , Vol. 9 , No. 4 , pp. 1 -- 17 , 2002 . A. van Deursen, P. Klint. Domain-Specific Language Design Requires Feature Descriptions. Journal for Computing and Information Technology, Special issue on Domain-Specific Languages, Eds: R. L\u00e4mmel and M. Mernik, Vol. 9, No. 4, pp. 1--17, 2002.","journal-title":"R. L\u00e4mmel and M. Mernik"},{"key":"e_1_2_1_14_1","first-page":"222","article-title":"Representational Issues for Context Free Grammar Induction Using Genetic Algorithm. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications","volume":"862","author":"Wyard P.","year":"1994","unstructured":"P. Wyard . Representational Issues for Context Free Grammar Induction Using Genetic Algorithm. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications , LNAI , Vol. 862 , pp. 222 -- 235 , 1994 . P. Wyard. Representational Issues for Context Free Grammar Induction Using Genetic Algorithm. Proceedings of the 2nd International Colloquium on Grammatical Inference and Applications, LNAI, Vol. 862, pp. 222--235, 1994.","journal-title":"LNAI"},{"key":"e_1_2_1_15_1","volume-title":"Extracting Grammar from Programs: Brute Force Approach. Submitted to ACM Sigplan Notices","author":"\u010crepin\u0161ek M.","year":"2004","unstructured":"M. \u010crepin\u0161ek , M. Mernik , V. \u017dumer . Extracting Grammar from Programs: Brute Force Approach. Submitted to ACM Sigplan Notices , 2004 . M. \u010crepin\u0161ek, M. Mernik, V. \u017dumer. Extracting Grammar from Programs: Brute Force Approach. Submitted to ACM Sigplan Notices, 2004."},{"key":"e_1_2_1_16_1","volume-title":"Handbook of Evolutionary Computation","author":"B\u00e4ck T.","year":"1996","unstructured":"T. B\u00e4ck , D. Fogel , Z. Michalewicz . Handbook of Evolutionary Computation . University of Oxford Press , 1996 . T. B\u00e4ck, D. Fogel, Z. Michalewicz. Handbook of Evolutionary Computation. University of Oxford Press, 1996."},{"key":"e_1_2_1_17_1","volume-title":"Foundations of Genetic Algorithms IV","author":"Kammeyer T.","year":"1996","unstructured":"T. Kammeyer , R. K. Belew . Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search . Foundations of Genetic Algorithms IV , 1996 . T. Kammeyer, R. K. Belew. Stochastic Context-Free Grammar Induction with a Genetic Algorithm Using Local Search. Foundations of Genetic Algorithms IV, 1996."}],"container-title":["ACM SIGPLAN Notices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064165.1064172","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064165.1064172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064165.1064172"}},"subtitle":["evolutionary approach"],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["10.1145\/1064165.1064172"],"URL":"https:\/\/doi.org\/10.1145\/1064165.1064172","relation":{},"ISSN":["0362-1340","1558-1160"],"issn-type":[{"type":"print","value":"0362-1340"},{"type":"electronic","value":"1558-1160"}],"subject":[],"published":{"date-parts":[[2005,4]]},"assertion":[{"value":"2005-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}